/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_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:48:36,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:48:36,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:48:36,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:48:36,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:48:36,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:48:36,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:48:36,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:48:36,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:48:36,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:48:36,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:48:36,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:48:36,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:48:36,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:48:36,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:48:36,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:48:36,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:48:36,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:48:36,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:48:36,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:48:36,325 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:48:36,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:48:36,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:48:36,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:48:36,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:48:36,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:48:36,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:48:36,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:48:36,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:48:36,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:48:36,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:48:36,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:48:36,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:48:36,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:48:36,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:48:36,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:48:36,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:48:36,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:48:36,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:48:36,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:48:36,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:48:36,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:48:36,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:48:36,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:48:36,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:48:36,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:48:36,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:48:36,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:48:36,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:48:36,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:48:36,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:48:36,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:48:36,357 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:48:36,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:48:36,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:48:36,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:48:36,358 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:48:36,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:48:36,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:48:36,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:48:36,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:48:36,358 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:48:36,358 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:48:36,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:48:36,358 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:48:36,359 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-28 14:48:36,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:48:36,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:48:36,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:48:36,555 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:48:36,555 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:48:36,556 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-04-28 14:48:36,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbcddcf6/6a24798a730d48c1b7e4f201b09a6d47/FLAG8ece04a8c [2022-04-28 14:48:36,988 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:48:36,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-04-28 14:48:36,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbcddcf6/6a24798a730d48c1b7e4f201b09a6d47/FLAG8ece04a8c [2022-04-28 14:48:37,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbcddcf6/6a24798a730d48c1b7e4f201b09a6d47 [2022-04-28 14:48:37,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:48:37,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:48:37,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:48:37,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:48:37,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:48:37,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:48:37" (1/1) ... [2022-04-28 14:48:37,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563c8acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:48:37, skipping insertion in model container [2022-04-28 14:48:37,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:48:37" (1/1) ... [2022-04-28 14:48:37,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:48:37,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:48:37,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-04-28 14:48:37,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:48:37,283 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:48:37,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-04-28 14:48:37,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:48:37,352 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:48:37,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:48:37 WrapperNode [2022-04-28 14:48:37,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:48:37,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:48:37,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:48:37,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:48:37,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:48:37" (1/1) ... [2022-04-28 14:48:37,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:48:37" (1/1) ... [2022-04-28 14:48:37,380 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:48:37" (1/1) ... [2022-04-28 14:48:37,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:48:37" (1/1) ... [2022-04-28 14:48:37,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:48:37" (1/1) ... [2022-04-28 14:48:37,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:48:37" (1/1) ... [2022-04-28 14:48:37,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:48:37" (1/1) ... [2022-04-28 14:48:37,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:48:37,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:48:37,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:48:37,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:48:37,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:48:37" (1/1) ... [2022-04-28 14:48:37,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:48:37,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:48:37,431 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-28 14:48:37,446 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-28 14:48:37,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:48:37,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:48:37,455 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:48:37,456 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-28 14:48:37,456 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-28 14:48:37,456 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-04-28 14:48:37,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:48:37,456 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-28 14:48:37,456 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-28 14:48:37,457 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-28 14:48:37,457 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-28 14:48:37,457 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-28 14:48:37,457 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-04-28 14:48:37,457 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-28 14:48:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:48:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:48:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:48:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:48:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 14:48:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:48:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-28 14:48:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:48:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:48:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:48:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:48:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:48:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:48:37,523 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:48:37,524 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:48:37,610 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 14:48:37,700 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-04-28 14:48:37,700 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-04-28 14:48:37,701 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 14:48:37,732 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2022-04-28 14:48:37,732 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2022-04-28 14:48:37,749 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 14:48:37,776 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-28 14:48:37,776 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-28 14:48:37,782 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 14:48:37,884 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-04-28 14:48:37,885 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-04-28 14:48:37,888 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:48:37,893 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:48:37,893 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-28 14:48:37,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:48:37 BoogieIcfgContainer [2022-04-28 14:48:37,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:48:37,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:48:37,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:48:37,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:48:37,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:48:37" (1/3) ... [2022-04-28 14:48:37,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd6c8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:48:37, skipping insertion in model container [2022-04-28 14:48:37,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:48:37" (2/3) ... [2022-04-28 14:48:37,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd6c8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:48:37, skipping insertion in model container [2022-04-28 14:48:37,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:48:37" (3/3) ... [2022-04-28 14:48:37,903 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2022-04-28 14:48:37,912 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:48:37,912 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:48:37,950 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:48:37,955 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ff94241, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62389229 [2022-04-28 14:48:37,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:48:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 14:48:37,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 14:48:37,971 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:37,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:37,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:37,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash -657298671, now seen corresponding path program 1 times [2022-04-28 14:48:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:37,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [699653937] [2022-04-28 14:48:37,990 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash -657298671, now seen corresponding path program 2 times [2022-04-28 14:48:37,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:37,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183311684] [2022-04-28 14:48:37,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:38,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {154#true} is VALID [2022-04-28 14:48:38,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 14:48:38,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #462#return; {154#true} is VALID [2022-04-28 14:48:38,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:38,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {164#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {154#true} is VALID [2022-04-28 14:48:38,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 14:48:38,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {159#(= main_~status~1 0)} #442#return; {159#(= main_~status~1 0)} is VALID [2022-04-28 14:48:38,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {163#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:38,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {154#true} is VALID [2022-04-28 14:48:38,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 14:48:38,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #462#return; {154#true} is VALID [2022-04-28 14:48:38,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret35 := main(); {154#true} is VALID [2022-04-28 14:48:38,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {159#(= main_~status~1 0)} is VALID [2022-04-28 14:48:38,338 INFO L272 TraceCheckUtils]: 6: Hoare triple {159#(= main_~status~1 0)} call _BLAST_init(); {164#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:38,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {154#true} is VALID [2022-04-28 14:48:38,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-28 14:48:38,339 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {154#true} {159#(= main_~status~1 0)} #442#return; {159#(= main_~status~1 0)} is VALID [2022-04-28 14:48:38,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#(= main_~status~1 0)} assume !(~status~1 >= 0); {155#false} is VALID [2022-04-28 14:48:38,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} assume !(1 == ~pended~0); {155#false} is VALID [2022-04-28 14:48:38,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#false} assume !(1 == ~pended~0); {155#false} is VALID [2022-04-28 14:48:38,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {155#false} assume ~s~0 != ~UNLOADED~0; {155#false} is VALID [2022-04-28 14:48:38,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {155#false} assume -1 != ~status~1; {155#false} is VALID [2022-04-28 14:48:38,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {155#false} assume !(~s~0 != ~SKIP2~0); {155#false} is VALID [2022-04-28 14:48:38,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {155#false} assume 1 == ~pended~0; {155#false} is VALID [2022-04-28 14:48:38,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {155#false} assume 259 != ~status~1; {155#false} is VALID [2022-04-28 14:48:38,342 INFO L272 TraceCheckUtils]: 18: Hoare triple {155#false} call errorFn(); {155#false} is VALID [2022-04-28 14:48:38,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-28 14:48:38,342 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-28 14:48:38,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:38,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183311684] [2022-04-28 14:48:38,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183311684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:38,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:38,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:48:38,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:38,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [699653937] [2022-04-28 14:48:38,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [699653937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:38,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:38,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:48:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155904117] [2022-04-28 14:48:38,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:38,351 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-28 14:48:38,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:38,386 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-28 14:48:38,406 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-28 14:48:38,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:48:38,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:38,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:48:38,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:48:38,428 INFO L87 Difference]: Start difference. First operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:48:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:39,358 INFO L93 Difference]: Finished difference Result 302 states and 462 transitions. [2022-04-28 14:48:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:48:39,359 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-28 14:48:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:39,360 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-28 14:48:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2022-04-28 14:48:39,382 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-28 14:48:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2022-04-28 14:48:39,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 462 transitions. [2022-04-28 14:48:39,729 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-28 14:48:39,739 INFO L225 Difference]: With dead ends: 302 [2022-04-28 14:48:39,739 INFO L226 Difference]: Without dead ends: 157 [2022-04-28 14:48:39,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:48:39,754 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 180 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:39,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 286 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:48:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-28 14:48:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-04-28 14:48:39,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:39,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:48:39,809 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:48:39,810 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:48:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:39,824 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2022-04-28 14:48:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2022-04-28 14:48:39,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:39,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:39,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 157 states. [2022-04-28 14:48:39,832 INFO L87 Difference]: Start difference. First operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 157 states. [2022-04-28 14:48:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:39,842 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2022-04-28 14:48:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2022-04-28 14:48:39,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:39,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:39,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:39,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 14:48:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2022-04-28 14:48:39,853 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2022-04-28 14:48:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:39,853 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2022-04-28 14:48:39,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:48:39,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 190 transitions. [2022-04-28 14:48:40,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2022-04-28 14:48:40,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 14:48:40,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:40,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:40,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:48:40,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:40,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash 919351458, now seen corresponding path program 1 times [2022-04-28 14:48:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:40,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2079431511] [2022-04-28 14:48:40,011 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:40,011 INFO L85 PathProgramCache]: Analyzing trace with hash 919351458, now seen corresponding path program 2 times [2022-04-28 14:48:40,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:40,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871090093] [2022-04-28 14:48:40,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:40,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:40,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:40,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {1377#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {1365#true} is VALID [2022-04-28 14:48:40,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-28 14:48:40,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1365#true} {1365#true} #462#return; {1365#true} is VALID [2022-04-28 14:48:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:40,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {1378#(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; {1365#true} is VALID [2022-04-28 14:48:40,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-28 14:48:40,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1365#true} {1365#true} #442#return; {1365#true} is VALID [2022-04-28 14:48:40,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:40,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {1379#(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; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#(= ~s~0 ~NP~0)} assume true; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1376#(= ~s~0 ~NP~0)} {1365#true} #444#return; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {1365#true} call ULTIMATE.init(); {1377#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:40,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {1377#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {1365#true} is VALID [2022-04-28 14:48:40,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-28 14:48:40,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #462#return; {1365#true} is VALID [2022-04-28 14:48:40,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {1365#true} call #t~ret35 := main(); {1365#true} is VALID [2022-04-28 14:48:40,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {1365#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {1365#true} is VALID [2022-04-28 14:48:40,177 INFO L272 TraceCheckUtils]: 6: Hoare triple {1365#true} call _BLAST_init(); {1378#(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-28 14:48:40,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {1378#(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; {1365#true} is VALID [2022-04-28 14:48:40,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {1365#true} assume true; {1365#true} is VALID [2022-04-28 14:48:40,177 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1365#true} {1365#true} #442#return; {1365#true} is VALID [2022-04-28 14:48:40,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {1365#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; {1365#true} is VALID [2022-04-28 14:48:40,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {1365#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {1365#true} is VALID [2022-04-28 14:48:40,179 INFO L272 TraceCheckUtils]: 12: Hoare triple {1365#true} call stub_driver_init(); {1379#(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-28 14:48:40,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {1379#(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; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {1376#(= ~s~0 ~NP~0)} assume true; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,182 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1376#(= ~s~0 ~NP~0)} {1365#true} #444#return; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {1376#(= ~s~0 ~NP~0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {1376#(= ~s~0 ~NP~0)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {1376#(= ~s~0 ~NP~0)} assume 3 == ~tmp_ndt_1~0; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,184 INFO L272 TraceCheckUtils]: 19: Hoare triple {1376#(= ~s~0 ~NP~0)} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {1376#(= ~s~0 ~NP~0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {1376#(= ~s~0 ~NP~0)} assume 0 == ~irpStack__MinorFunction~0; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {1376#(= ~s~0 ~NP~0)} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {1376#(= ~s~0 ~NP~0)} is VALID [2022-04-28 14:48:40,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {1376#(= ~s~0 ~NP~0)} assume ~s~0 != ~NP~0; {1366#false} is VALID [2022-04-28 14:48:40,187 INFO L272 TraceCheckUtils]: 24: Hoare triple {1366#false} call errorFn(); {1366#false} is VALID [2022-04-28 14:48:40,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {1366#false} assume !false; {1366#false} is VALID [2022-04-28 14:48:40,188 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-28 14:48:40,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:40,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871090093] [2022-04-28 14:48:40,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871090093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:40,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:40,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:48:40,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:40,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2079431511] [2022-04-28 14:48:40,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2079431511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:40,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:40,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:48:40,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194560060] [2022-04-28 14:48:40,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:40,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-28 14:48:40,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:40,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:40,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:40,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:48:40,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:40,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:48:40,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:48:40,209 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:41,165 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2022-04-28 14:48:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:48:41,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-28 14:48:41,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-04-28 14:48:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-04-28 14:48:41,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 370 transitions. [2022-04-28 14:48:41,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:41,505 INFO L225 Difference]: With dead ends: 275 [2022-04-28 14:48:41,506 INFO L226 Difference]: Without dead ends: 219 [2022-04-28 14:48:41,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:48:41,507 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 376 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:41,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 284 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:48:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-28 14:48:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2022-04-28 14:48:41,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:41,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-28 14:48:41,554 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-28 14:48:41,555 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-28 14:48:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:41,564 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2022-04-28 14:48:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2022-04-28 14:48:41,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:41,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:41,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) Second operand 219 states. [2022-04-28 14:48:41,567 INFO L87 Difference]: Start difference. First operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) Second operand 219 states. [2022-04-28 14:48:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:41,575 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2022-04-28 14:48:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2022-04-28 14:48:41,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:41,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:41,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:41,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-28 14:48:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2022-04-28 14:48:41,590 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2022-04-28 14:48:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:41,590 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2022-04-28 14:48:41,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:41,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 195 states and 259 transitions. [2022-04-28 14:48:41,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2022-04-28 14:48:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 14:48:41,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:41,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:41,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 14:48:41,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:41,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:41,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1564864640, now seen corresponding path program 1 times [2022-04-28 14:48:41,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:41,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [817600040] [2022-04-28 14:48:41,820 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1564864640, now seen corresponding path program 2 times [2022-04-28 14:48:41,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:41,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669524221] [2022-04-28 14:48:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:41,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:41,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:41,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {2763#true} is VALID [2022-04-28 14:48:41,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-28 14:48:41,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2763#true} {2763#true} #462#return; {2763#true} is VALID [2022-04-28 14:48:41,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:41,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {2776#(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; {2763#true} is VALID [2022-04-28 14:48:41,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-28 14:48:41,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2763#true} {2763#true} #442#return; {2763#true} is VALID [2022-04-28 14:48:41,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:41,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {2777#(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; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {2774#(= ~compRegistered~0 0)} assume true; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2774#(= ~compRegistered~0 0)} {2763#true} #444#return; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {2763#true} call ULTIMATE.init(); {2775#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:41,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {2763#true} is VALID [2022-04-28 14:48:41,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-28 14:48:41,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2763#true} {2763#true} #462#return; {2763#true} is VALID [2022-04-28 14:48:41,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {2763#true} call #t~ret35 := main(); {2763#true} is VALID [2022-04-28 14:48:41,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {2763#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {2763#true} is VALID [2022-04-28 14:48:41,961 INFO L272 TraceCheckUtils]: 6: Hoare triple {2763#true} call _BLAST_init(); {2776#(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-28 14:48:41,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {2776#(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; {2763#true} is VALID [2022-04-28 14:48:41,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {2763#true} assume true; {2763#true} is VALID [2022-04-28 14:48:41,961 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2763#true} {2763#true} #442#return; {2763#true} is VALID [2022-04-28 14:48:41,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {2763#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; {2763#true} is VALID [2022-04-28 14:48:41,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {2763#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {2763#true} is VALID [2022-04-28 14:48:41,962 INFO L272 TraceCheckUtils]: 12: Hoare triple {2763#true} call stub_driver_init(); {2777#(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-28 14:48:41,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {2777#(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; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {2774#(= ~compRegistered~0 0)} assume true; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,963 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2774#(= ~compRegistered~0 0)} {2763#true} #444#return; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {2774#(= ~compRegistered~0 0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {2774#(= ~compRegistered~0 0)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {2774#(= ~compRegistered~0 0)} assume 3 == ~tmp_ndt_1~0; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,964 INFO L272 TraceCheckUtils]: 19: Hoare triple {2774#(= ~compRegistered~0 0)} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {2774#(= ~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; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {2774#(= ~compRegistered~0 0)} assume 0 == ~irpStack__MinorFunction~0; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {2774#(= ~compRegistered~0 0)} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {2774#(= ~compRegistered~0 0)} assume !(~s~0 != ~NP~0); {2774#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:41,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {2774#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {2764#false} is VALID [2022-04-28 14:48:41,970 INFO L272 TraceCheckUtils]: 25: Hoare triple {2764#false} call errorFn(); {2764#false} is VALID [2022-04-28 14:48:41,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {2764#false} assume !false; {2764#false} is VALID [2022-04-28 14:48:41,971 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-28 14:48:41,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:41,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669524221] [2022-04-28 14:48:41,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669524221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:41,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:41,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:48:41,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:41,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [817600040] [2022-04-28 14:48:41,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [817600040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:41,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:41,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:48:41,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114936811] [2022-04-28 14:48:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:41,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-28 14:48:41,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:41,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:41,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:41,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:48:41,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:48:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:48:41,991 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:42,980 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2022-04-28 14:48:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:48:42,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-28 14:48:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 334 transitions. [2022-04-28 14:48:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 334 transitions. [2022-04-28 14:48:42,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 334 transitions. [2022-04-28 14:48:43,278 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-28 14:48:43,293 INFO L225 Difference]: With dead ends: 316 [2022-04-28 14:48:43,293 INFO L226 Difference]: Without dead ends: 254 [2022-04-28 14:48:43,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:48:43,298 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 325 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:43,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 251 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:48:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-28 14:48:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2022-04-28 14:48:43,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:43,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-28 14:48:43,328 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-28 14:48:43,328 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-28 14:48:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:43,334 INFO L93 Difference]: Finished difference Result 254 states and 335 transitions. [2022-04-28 14:48:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 335 transitions. [2022-04-28 14:48:43,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:43,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:43,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 254 states. [2022-04-28 14:48:43,335 INFO L87 Difference]: Start difference. First operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 254 states. [2022-04-28 14:48:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:43,341 INFO L93 Difference]: Finished difference Result 254 states and 335 transitions. [2022-04-28 14:48:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 335 transitions. [2022-04-28 14:48:43,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:43,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:43,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:43,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-28 14:48:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2022-04-28 14:48:43,347 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2022-04-28 14:48:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:43,347 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2022-04-28 14:48:43,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:43,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 217 states and 289 transitions. [2022-04-28 14:48:43,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2022-04-28 14:48:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 14:48:43,632 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:43,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:43,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 14:48:43,632 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1424448937, now seen corresponding path program 1 times [2022-04-28 14:48:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:43,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1378934594] [2022-04-28 14:48:43,633 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1424448937, now seen corresponding path program 2 times [2022-04-28 14:48:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:43,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105919965] [2022-04-28 14:48:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:43,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:43,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {4369#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {4357#true} is VALID [2022-04-28 14:48:43,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-28 14:48:43,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4357#true} {4357#true} #462#return; {4357#true} is VALID [2022-04-28 14:48:43,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:43,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {4370#(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; {4357#true} is VALID [2022-04-28 14:48:43,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-28 14:48:43,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4357#true} {4357#true} #442#return; {4357#true} is VALID [2022-04-28 14:48:43,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:43,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {4371#(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; {4357#true} is VALID [2022-04-28 14:48:43,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-28 14:48:43,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4357#true} {4357#true} #444#return; {4357#true} is VALID [2022-04-28 14:48:43,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {4357#true} call ULTIMATE.init(); {4369#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:43,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {4369#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {4357#true} is VALID [2022-04-28 14:48:43,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-28 14:48:43,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4357#true} {4357#true} #462#return; {4357#true} is VALID [2022-04-28 14:48:43,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {4357#true} call #t~ret35 := main(); {4357#true} is VALID [2022-04-28 14:48:43,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {4357#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {4357#true} is VALID [2022-04-28 14:48:43,788 INFO L272 TraceCheckUtils]: 6: Hoare triple {4357#true} call _BLAST_init(); {4370#(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-28 14:48:43,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {4370#(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; {4357#true} is VALID [2022-04-28 14:48:43,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-28 14:48:43,789 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4357#true} {4357#true} #442#return; {4357#true} is VALID [2022-04-28 14:48:43,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {4357#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; {4357#true} is VALID [2022-04-28 14:48:43,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {4357#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {4357#true} is VALID [2022-04-28 14:48:43,790 INFO L272 TraceCheckUtils]: 12: Hoare triple {4357#true} call stub_driver_init(); {4371#(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-28 14:48:43,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {4371#(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; {4357#true} is VALID [2022-04-28 14:48:43,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {4357#true} assume true; {4357#true} is VALID [2022-04-28 14:48:43,790 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4357#true} {4357#true} #444#return; {4357#true} is VALID [2022-04-28 14:48:43,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {4357#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {4357#true} is VALID [2022-04-28 14:48:43,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {4357#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {4357#true} is VALID [2022-04-28 14:48:43,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {4357#true} assume 3 == ~tmp_ndt_1~0; {4357#true} is VALID [2022-04-28 14:48:43,791 INFO L272 TraceCheckUtils]: 19: Hoare triple {4357#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {4357#true} is VALID [2022-04-28 14:48:43,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {4357#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; {4357#true} is VALID [2022-04-28 14:48:43,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {4357#true} assume !(0 == ~irpStack__MinorFunction~0); {4357#true} is VALID [2022-04-28 14:48:43,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {4357#true} assume 23 == ~irpStack__MinorFunction~0; {4357#true} is VALID [2022-04-28 14:48:43,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {4357#true} ~devExt__SurpriseRemoved~0 := 1; {4357#true} is VALID [2022-04-28 14:48:43,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {4357#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:43,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:43,793 INFO L272 TraceCheckUtils]: 26: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:43,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:43,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:43,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:43,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume 0 == ~tmp_ndt_2~0; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:43,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} ~returnVal2~0 := 0; {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:43,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:43,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {4368#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:43,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {4368#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {4358#false} is VALID [2022-04-28 14:48:43,796 INFO L272 TraceCheckUtils]: 35: Hoare triple {4358#false} call errorFn(); {4358#false} is VALID [2022-04-28 14:48:43,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {4358#false} assume !false; {4358#false} is VALID [2022-04-28 14:48:43,796 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-28 14:48:43,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:43,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105919965] [2022-04-28 14:48:43,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105919965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:43,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:43,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:48:43,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:43,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1378934594] [2022-04-28 14:48:43,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1378934594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:43,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:43,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 14:48:43,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115305066] [2022-04-28 14:48:43,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:43,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-28 14:48:43,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:43,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:43,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:43,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 14:48:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:43,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 14:48:43,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 14:48:43,822 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:44,641 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2022-04-28 14:48:44,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:48:44,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-28 14:48:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2022-04-28 14:48:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2022-04-28 14:48:44,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 214 transitions. [2022-04-28 14:48:44,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:44,843 INFO L225 Difference]: With dead ends: 220 [2022-04-28 14:48:44,843 INFO L226 Difference]: Without dead ends: 217 [2022-04-28 14:48:44,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:48:44,844 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 278 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:44,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 233 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:48:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-28 14:48:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-04-28 14:48:44,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:44,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-28 14:48:44,857 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-28 14:48:44,858 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-28 14:48:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:44,862 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-04-28 14:48:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-28 14:48:44,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:44,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:44,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 217 states. [2022-04-28 14:48:44,864 INFO L87 Difference]: Start difference. First operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 217 states. [2022-04-28 14:48:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:44,869 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-04-28 14:48:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-28 14:48:44,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:44,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:44,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:44,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-28 14:48:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2022-04-28 14:48:44,878 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2022-04-28 14:48:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:44,879 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2022-04-28 14:48:44,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 14:48:44,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 217 states and 288 transitions. [2022-04-28 14:48:45,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-28 14:48:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 14:48:45,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:45,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:45,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 14:48:45,156 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:45,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash -327288786, now seen corresponding path program 1 times [2022-04-28 14:48:45,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:45,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1710011725] [2022-04-28 14:48:45,157 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash -327288786, now seen corresponding path program 2 times [2022-04-28 14:48:45,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:45,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884547326] [2022-04-28 14:48:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:45,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:45,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {5707#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {5685#true} is VALID [2022-04-28 14:48:45,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-28 14:48:45,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5685#true} {5685#true} #462#return; {5685#true} is VALID [2022-04-28 14:48:45,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:45,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {5708#(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; {5685#true} is VALID [2022-04-28 14:48:45,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-28 14:48:45,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5685#true} {5685#true} #442#return; {5685#true} is VALID [2022-04-28 14:48:45,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:45,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {5709#(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; {5685#true} is VALID [2022-04-28 14:48:45,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-28 14:48:45,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5685#true} {5685#true} #444#return; {5685#true} is VALID [2022-04-28 14:48:45,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 14:48:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:45,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {5710#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {5685#true} is VALID [2022-04-28 14:48:45,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {5685#true} assume !(0 != ~compRegistered~0); {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {5711#(= ~compRegistered~0 0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {5711#(= ~compRegistered~0 0)} assume 0 == ~tmp_ndt_2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {5711#(= ~compRegistered~0 0)} ~returnVal2~0 := 0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {5711#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {5711#(= ~compRegistered~0 0)} #res := ~returnVal2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {5711#(= ~compRegistered~0 0)} assume true; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,327 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {5711#(= ~compRegistered~0 0)} {5697#(not (= ~compRegistered~0 0))} #470#return; {5686#false} is VALID [2022-04-28 14:48:45,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {5685#true} call ULTIMATE.init(); {5707#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:45,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {5707#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {5685#true} is VALID [2022-04-28 14:48:45,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-28 14:48:45,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5685#true} {5685#true} #462#return; {5685#true} is VALID [2022-04-28 14:48:45,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {5685#true} call #t~ret35 := main(); {5685#true} is VALID [2022-04-28 14:48:45,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {5685#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {5685#true} is VALID [2022-04-28 14:48:45,330 INFO L272 TraceCheckUtils]: 6: Hoare triple {5685#true} call _BLAST_init(); {5708#(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-28 14:48:45,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {5708#(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; {5685#true} is VALID [2022-04-28 14:48:45,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-28 14:48:45,330 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5685#true} {5685#true} #442#return; {5685#true} is VALID [2022-04-28 14:48:45,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {5685#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; {5685#true} is VALID [2022-04-28 14:48:45,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {5685#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {5685#true} is VALID [2022-04-28 14:48:45,331 INFO L272 TraceCheckUtils]: 12: Hoare triple {5685#true} call stub_driver_init(); {5709#(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-28 14:48:45,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {5709#(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; {5685#true} is VALID [2022-04-28 14:48:45,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {5685#true} assume true; {5685#true} is VALID [2022-04-28 14:48:45,332 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5685#true} {5685#true} #444#return; {5685#true} is VALID [2022-04-28 14:48:45,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {5685#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {5696#(= main_~__cil_tmp8~0 1)} is VALID [2022-04-28 14:48:45,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {5696#(= main_~__cil_tmp8~0 1)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {5685#true} is VALID [2022-04-28 14:48:45,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {5685#true} assume 3 == ~tmp_ndt_1~0; {5685#true} is VALID [2022-04-28 14:48:45,335 INFO L272 TraceCheckUtils]: 19: Hoare triple {5685#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {5685#true} is VALID [2022-04-28 14:48:45,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {5685#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; {5685#true} is VALID [2022-04-28 14:48:45,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {5685#true} assume 0 == ~irpStack__MinorFunction~0; {5685#true} is VALID [2022-04-28 14:48:45,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {5685#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {5685#true} is VALID [2022-04-28 14:48:45,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {5685#true} assume !(~s~0 != ~NP~0); {5685#true} is VALID [2022-04-28 14:48:45,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {5685#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {5697#(not (= ~compRegistered~0 0))} is VALID [2022-04-28 14:48:45,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {5697#(not (= ~compRegistered~0 0))} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {5697#(not (= ~compRegistered~0 0))} is VALID [2022-04-28 14:48:45,338 INFO L272 TraceCheckUtils]: 26: Hoare triple {5697#(not (= ~compRegistered~0 0))} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {5710#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:45,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {5710#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {5685#true} is VALID [2022-04-28 14:48:45,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {5685#true} assume !(0 != ~compRegistered~0); {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {5711#(= ~compRegistered~0 0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {5711#(= ~compRegistered~0 0)} assume 0 == ~tmp_ndt_2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {5711#(= ~compRegistered~0 0)} ~returnVal2~0 := 0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {5711#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {5711#(= ~compRegistered~0 0)} #res := ~returnVal2~0; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {5711#(= ~compRegistered~0 0)} assume true; {5711#(= ~compRegistered~0 0)} is VALID [2022-04-28 14:48:45,341 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5711#(= ~compRegistered~0 0)} {5697#(not (= ~compRegistered~0 0))} #470#return; {5686#false} is VALID [2022-04-28 14:48:45,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {5686#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {5686#false} is VALID [2022-04-28 14:48:45,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {5686#false} assume 259 == ~__cil_tmp23~0; {5686#false} is VALID [2022-04-28 14:48:45,345 INFO L272 TraceCheckUtils]: 38: Hoare triple {5686#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {5686#false} is VALID [2022-04-28 14:48:45,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {5686#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {5686#false} is VALID [2022-04-28 14:48:45,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {5686#false} assume !(~s~0 == ~MPR3~0); {5686#false} is VALID [2022-04-28 14:48:45,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {5686#false} assume !(1 == ~customIrp~0); {5686#false} is VALID [2022-04-28 14:48:45,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {5686#false} assume ~s~0 == ~MPR3~0; {5686#false} is VALID [2022-04-28 14:48:45,346 INFO L272 TraceCheckUtils]: 43: Hoare triple {5686#false} call errorFn(); {5686#false} is VALID [2022-04-28 14:48:45,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {5686#false} assume !false; {5686#false} is VALID [2022-04-28 14:48:45,346 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-28 14:48:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:45,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884547326] [2022-04-28 14:48:45,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884547326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:45,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:45,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:48:45,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:45,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1710011725] [2022-04-28 14:48:45,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1710011725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:45,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:45,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:48:45,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538832307] [2022-04-28 14:48:45,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:45,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-04-28 14:48:45,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:45,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:48:45,372 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-28 14:48:45,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:48:45,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:45,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:48:45,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:48:45,373 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:48:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:46,333 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2022-04-28 14:48:46,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:48:46,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-04-28 14:48:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:48:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 292 transitions. [2022-04-28 14:48:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:48:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 292 transitions. [2022-04-28 14:48:46,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 292 transitions. [2022-04-28 14:48:46,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:46,564 INFO L225 Difference]: With dead ends: 274 [2022-04-28 14:48:46,564 INFO L226 Difference]: Without dead ends: 208 [2022-04-28 14:48:46,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:48:46,565 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 379 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:46,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 435 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:48:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-28 14:48:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2022-04-28 14:48:46,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:46,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-28 14:48:46,576 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-28 14:48:46,577 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-28 14:48:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:46,581 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2022-04-28 14:48:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 271 transitions. [2022-04-28 14:48:46,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:46,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:46,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 208 states. [2022-04-28 14:48:46,582 INFO L87 Difference]: Start difference. First operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 208 states. [2022-04-28 14:48:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:46,586 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2022-04-28 14:48:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 271 transitions. [2022-04-28 14:48:46,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:46,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:46,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:46,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-28 14:48:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2022-04-28 14:48:46,590 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2022-04-28 14:48:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:46,591 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2022-04-28 14:48:46,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 14:48:46,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 250 transitions. [2022-04-28 14:48:46,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-04-28 14:48:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 14:48:46,817 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:46,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:46,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 14:48:46,818 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:46,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1063639731, now seen corresponding path program 1 times [2022-04-28 14:48:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:46,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [398960169] [2022-04-28 14:48:46,818 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1063639731, now seen corresponding path program 2 times [2022-04-28 14:48:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:46,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328305403] [2022-04-28 14:48:46,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:46,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:46,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:46,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {7094#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {7071#true} is VALID [2022-04-28 14:48:46,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-28 14:48:46,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #462#return; {7071#true} is VALID [2022-04-28 14:48:46,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:46,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {7095#(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; {7071#true} is VALID [2022-04-28 14:48:46,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-28 14:48:46,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #442#return; {7071#true} is VALID [2022-04-28 14:48:46,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:46,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {7096#(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; {7071#true} is VALID [2022-04-28 14:48:46,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-28 14:48:46,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #444#return; {7071#true} is VALID [2022-04-28 14:48:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 14:48:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:46,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 14:48:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:46,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {7071#true} is VALID [2022-04-28 14:48:46,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-28 14:48:46,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7071#true} {7071#true} #440#return; {7071#true} is VALID [2022-04-28 14:48:46,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {7071#true} is VALID [2022-04-28 14:48:46,955 INFO L272 TraceCheckUtils]: 1: Hoare triple {7071#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:46,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {7071#true} is VALID [2022-04-28 14:48:46,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-28 14:48:46,955 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7071#true} {7071#true} #440#return; {7071#true} is VALID [2022-04-28 14:48:46,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {7071#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {7071#true} is VALID [2022-04-28 14:48:46,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-28 14:48:46,955 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7071#true} {7071#true} #450#return; {7071#true} is VALID [2022-04-28 14:48:46,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-28 14:48:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:46,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {7101#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-28 14:48:46,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume true; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-28 14:48:46,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} {7071#true} #452#return; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-28 14:48:46,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {7071#true} call ULTIMATE.init(); {7094#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:46,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {7094#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {7071#true} is VALID [2022-04-28 14:48:46,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-28 14:48:46,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7071#true} {7071#true} #462#return; {7071#true} is VALID [2022-04-28 14:48:46,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {7071#true} call #t~ret35 := main(); {7071#true} is VALID [2022-04-28 14:48:46,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {7071#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {7071#true} is VALID [2022-04-28 14:48:46,969 INFO L272 TraceCheckUtils]: 6: Hoare triple {7071#true} call _BLAST_init(); {7095#(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-28 14:48:46,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {7095#(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; {7071#true} is VALID [2022-04-28 14:48:46,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-28 14:48:46,970 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7071#true} {7071#true} #442#return; {7071#true} is VALID [2022-04-28 14:48:46,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {7071#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; {7071#true} is VALID [2022-04-28 14:48:46,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {7071#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {7071#true} is VALID [2022-04-28 14:48:46,971 INFO L272 TraceCheckUtils]: 12: Hoare triple {7071#true} call stub_driver_init(); {7096#(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-28 14:48:46,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {7096#(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; {7071#true} is VALID [2022-04-28 14:48:46,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-28 14:48:46,971 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7071#true} {7071#true} #444#return; {7071#true} is VALID [2022-04-28 14:48:46,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {7071#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {7071#true} is VALID [2022-04-28 14:48:46,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {7071#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {7071#true} is VALID [2022-04-28 14:48:46,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {7071#true} assume 3 == ~tmp_ndt_1~0; {7071#true} is VALID [2022-04-28 14:48:46,971 INFO L272 TraceCheckUtils]: 19: Hoare triple {7071#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {7071#true} is VALID [2022-04-28 14:48:46,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {7071#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; {7071#true} is VALID [2022-04-28 14:48:46,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {7071#true} assume 0 == ~irpStack__MinorFunction~0; {7071#true} is VALID [2022-04-28 14:48:46,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {7071#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {7071#true} is VALID [2022-04-28 14:48:46,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {7071#true} assume !(~s~0 != ~NP~0); {7071#true} is VALID [2022-04-28 14:48:46,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {7071#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {7071#true} is VALID [2022-04-28 14:48:46,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {7071#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {7071#true} is VALID [2022-04-28 14:48:46,972 INFO L272 TraceCheckUtils]: 26: Hoare triple {7071#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {7071#true} is VALID [2022-04-28 14:48:46,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {7071#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {7071#true} is VALID [2022-04-28 14:48:46,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {7071#true} assume 0 != ~compRegistered~0; {7071#true} is VALID [2022-04-28 14:48:46,976 INFO L272 TraceCheckUtils]: 29: Hoare triple {7071#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:46,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {7071#true} is VALID [2022-04-28 14:48:46,976 INFO L272 TraceCheckUtils]: 31: Hoare triple {7071#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:46,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {7097#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {7071#true} is VALID [2022-04-28 14:48:46,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-28 14:48:46,977 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7071#true} {7071#true} #440#return; {7071#true} is VALID [2022-04-28 14:48:46,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {7071#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {7071#true} is VALID [2022-04-28 14:48:46,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {7071#true} assume true; {7071#true} is VALID [2022-04-28 14:48:46,977 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7071#true} {7071#true} #450#return; {7071#true} is VALID [2022-04-28 14:48:46,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {7071#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {7071#true} is VALID [2022-04-28 14:48:46,978 INFO L272 TraceCheckUtils]: 39: Hoare triple {7071#true} call stubMoreProcessingRequired(); {7101#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:46,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {7101#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-28 14:48:46,979 INFO L290 TraceCheckUtils]: 41: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume true; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-28 14:48:46,979 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} {7071#true} #452#return; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-28 14:48:46,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-28 14:48:46,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume 0 == ~tmp_ndt_2~0; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-28 14:48:46,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} ~returnVal2~0 := 0; {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-28 14:48:46,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume !(~s~0 == ~NP~0); {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-28 14:48:46,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {7093#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume !(~s~0 == ~MPR1~0); {7072#false} is VALID [2022-04-28 14:48:46,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {7072#false} assume !(~s~0 == ~SKIP1~0); {7072#false} is VALID [2022-04-28 14:48:46,981 INFO L272 TraceCheckUtils]: 49: Hoare triple {7072#false} call errorFn(); {7072#false} is VALID [2022-04-28 14:48:46,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {7072#false} assume !false; {7072#false} is VALID [2022-04-28 14:48:46,982 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-28 14:48:46,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:46,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328305403] [2022-04-28 14:48:46,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328305403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:46,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:46,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:48:46,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:46,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [398960169] [2022-04-28 14:48:46,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [398960169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:46,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:46,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:48:46,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440482023] [2022-04-28 14:48:46,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:46,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2022-04-28 14:48:46,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:46,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 14:48:47,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:47,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:48:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:47,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:48:47,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:48:47,019 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 14:48:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:47,730 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2022-04-28 14:48:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:48:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2022-04-28 14:48:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 14:48:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 270 transitions. [2022-04-28 14:48:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 14:48:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 270 transitions. [2022-04-28 14:48:47,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 270 transitions. [2022-04-28 14:48:47,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:47,948 INFO L225 Difference]: With dead ends: 258 [2022-04-28 14:48:47,948 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 14:48:47,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:48:47,951 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 263 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:47,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 326 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:48:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 14:48:47,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-04-28 14:48:47,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:47,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-28 14:48:47,971 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-28 14:48:47,971 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-28 14:48:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:47,975 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2022-04-28 14:48:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 257 transitions. [2022-04-28 14:48:47,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:47,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:47,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 197 states. [2022-04-28 14:48:47,977 INFO L87 Difference]: Start difference. First operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 197 states. [2022-04-28 14:48:47,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:47,980 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2022-04-28 14:48:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 257 transitions. [2022-04-28 14:48:47,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:47,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:47,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:47,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-28 14:48:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2022-04-28 14:48:47,986 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2022-04-28 14:48:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:47,986 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2022-04-28 14:48:47,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 14:48:47,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 246 transitions. [2022-04-28 14:48:48,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2022-04-28 14:48:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 14:48:48,199 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:48,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:48,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 14:48:48,199 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:48,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1356664997, now seen corresponding path program 1 times [2022-04-28 14:48:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:48,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [214151270] [2022-04-28 14:48:48,200 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1356664997, now seen corresponding path program 2 times [2022-04-28 14:48:48,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:48,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629652430] [2022-04-28 14:48:48,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:48,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:48,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:48,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {8429#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {8397#true} is VALID [2022-04-28 14:48:48,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-28 14:48:48,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8397#true} {8397#true} #462#return; {8397#true} is VALID [2022-04-28 14:48:48,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:48,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {8430#(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; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume true; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8405#(not (= ~SKIP1~0 ~NP~0))} {8397#true} #442#return; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:48,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {8431#(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; {8397#true} is VALID [2022-04-28 14:48:48,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-28 14:48:48,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8397#true} {8405#(not (= ~SKIP1~0 ~NP~0))} #444#return; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-28 14:48:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:48,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:48,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {8444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume 0 == ~tmp_ndt_2~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} ~returnVal2~0 := 0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} assume true; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,396 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8446#(= ~NP~0 |old(~s~0)|)} {8433#(= ~SKIP1~0 ~s~0)} #478#return; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 14:48:48,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {8432#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {8397#true} is VALID [2022-04-28 14:48:48,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {8397#true} assume !(0 == ~irpStack__MinorFunction~0); {8397#true} is VALID [2022-04-28 14:48:48,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {8397#true} assume 23 == ~irpStack__MinorFunction~0; {8397#true} is VALID [2022-04-28 14:48:48,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {8397#true} ~devExt__SurpriseRemoved~0 := 1; {8397#true} is VALID [2022-04-28 14:48:48,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {8397#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {8433#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:48,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {8433#(= ~SKIP1~0 ~s~0)} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {8433#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:48,399 INFO L272 TraceCheckUtils]: 6: Hoare triple {8433#(= ~SKIP1~0 ~s~0)} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {8444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:48,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {8444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume 0 == ~tmp_ndt_2~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} ~returnVal2~0 := 0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} assume true; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,402 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8446#(= ~NP~0 |old(~s~0)|)} {8433#(= ~SKIP1~0 ~s~0)} #478#return; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 14:48:48,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 14:48:48,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} #res := ~status~0; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 14:48:48,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} assume true; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 14:48:48,403 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8443#(= ~SKIP1~0 ~NP~0)} {8405#(not (= ~SKIP1~0 ~NP~0))} #446#return; {8398#false} is VALID [2022-04-28 14:48:48,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {8397#true} call ULTIMATE.init(); {8429#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:48,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {8429#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {8397#true} is VALID [2022-04-28 14:48:48,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-28 14:48:48,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8397#true} {8397#true} #462#return; {8397#true} is VALID [2022-04-28 14:48:48,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {8397#true} call #t~ret35 := main(); {8397#true} is VALID [2022-04-28 14:48:48,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {8397#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {8397#true} is VALID [2022-04-28 14:48:48,406 INFO L272 TraceCheckUtils]: 6: Hoare triple {8397#true} call _BLAST_init(); {8430#(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-28 14:48:48,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {8430#(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; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume true; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,407 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8405#(not (= ~SKIP1~0 ~NP~0))} {8397#true} #442#return; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,408 INFO L272 TraceCheckUtils]: 12: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {8431#(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-28 14:48:48,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {8431#(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; {8397#true} is VALID [2022-04-28 14:48:48,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {8397#true} assume true; {8397#true} is VALID [2022-04-28 14:48:48,409 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8397#true} {8405#(not (= ~SKIP1~0 ~NP~0))} #444#return; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} assume 3 == ~tmp_ndt_1~0; {8405#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-28 14:48:48,410 INFO L272 TraceCheckUtils]: 19: Hoare triple {8405#(not (= ~SKIP1~0 ~NP~0))} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {8432#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:48,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {8432#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {8397#true} is VALID [2022-04-28 14:48:48,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {8397#true} assume !(0 == ~irpStack__MinorFunction~0); {8397#true} is VALID [2022-04-28 14:48:48,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {8397#true} assume 23 == ~irpStack__MinorFunction~0; {8397#true} is VALID [2022-04-28 14:48:48,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {8397#true} ~devExt__SurpriseRemoved~0 := 1; {8397#true} is VALID [2022-04-28 14:48:48,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {8397#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {8433#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:48,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {8433#(= ~SKIP1~0 ~s~0)} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {8433#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-28 14:48:48,412 INFO L272 TraceCheckUtils]: 26: Hoare triple {8433#(= ~SKIP1~0 ~s~0)} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {8444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:48,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {8444#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume 0 == ~tmp_ndt_2~0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} ~returnVal2~0 := 0; {8445#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {8445#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal2~0; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {8446#(= ~NP~0 |old(~s~0)|)} assume true; {8446#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:48,415 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8446#(= ~NP~0 |old(~s~0)|)} {8433#(= ~SKIP1~0 ~s~0)} #478#return; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 14:48:48,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 14:48:48,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} #res := ~status~0; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 14:48:48,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {8443#(= ~SKIP1~0 ~NP~0)} assume true; {8443#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-28 14:48:48,416 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8443#(= ~SKIP1~0 ~NP~0)} {8405#(not (= ~SKIP1~0 ~NP~0))} #446#return; {8398#false} is VALID [2022-04-28 14:48:48,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {8398#false} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~status~1 := #t~ret27;havoc #t~ret27; {8398#false} is VALID [2022-04-28 14:48:48,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {8398#false} assume !(1 == ~pended~0); {8398#false} is VALID [2022-04-28 14:48:48,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {8398#false} assume !(1 == ~pended~0); {8398#false} is VALID [2022-04-28 14:48:48,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {8398#false} assume ~s~0 != ~UNLOADED~0; {8398#false} is VALID [2022-04-28 14:48:48,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {8398#false} assume -1 != ~status~1; {8398#false} is VALID [2022-04-28 14:48:48,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {8398#false} assume !(~s~0 != ~SKIP2~0); {8398#false} is VALID [2022-04-28 14:48:48,417 INFO L290 TraceCheckUtils]: 46: Hoare triple {8398#false} assume 1 == ~pended~0; {8398#false} is VALID [2022-04-28 14:48:48,417 INFO L290 TraceCheckUtils]: 47: Hoare triple {8398#false} assume 259 != ~status~1; {8398#false} is VALID [2022-04-28 14:48:48,417 INFO L272 TraceCheckUtils]: 48: Hoare triple {8398#false} call errorFn(); {8398#false} is VALID [2022-04-28 14:48:48,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {8398#false} assume !false; {8398#false} is VALID [2022-04-28 14:48:48,417 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-28 14:48:48,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:48,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629652430] [2022-04-28 14:48:48,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629652430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:48,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:48,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:48:48,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:48,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [214151270] [2022-04-28 14:48:48,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [214151270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:48,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:48,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:48:48,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993099571] [2022-04-28 14:48:48,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:48,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-04-28 14:48:48,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:48,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:48:48,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:48,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:48:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:48,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:48:48,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:48:48,451 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:48:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:50,540 INFO L93 Difference]: Finished difference Result 234 states and 300 transitions. [2022-04-28 14:48:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 14:48:50,541 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-04-28 14:48:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:48:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 277 transitions. [2022-04-28 14:48:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:48:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 277 transitions. [2022-04-28 14:48:50,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 277 transitions. [2022-04-28 14:48:50,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:50,790 INFO L225 Difference]: With dead ends: 234 [2022-04-28 14:48:50,791 INFO L226 Difference]: Without dead ends: 210 [2022-04-28 14:48:50,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-04-28 14:48:50,791 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 568 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:50,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 526 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 14:48:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-28 14:48:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2022-04-28 14:48:50,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:50,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-28 14:48:50,809 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-28 14:48:50,809 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-28 14:48:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:50,817 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-04-28 14:48:50,817 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2022-04-28 14:48:50,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:50,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:50,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) Second operand 210 states. [2022-04-28 14:48:50,819 INFO L87 Difference]: Start difference. First operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) Second operand 210 states. [2022-04-28 14:48:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:50,822 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-04-28 14:48:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2022-04-28 14:48:50,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:50,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:50,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:50,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-28 14:48:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2022-04-28 14:48:50,826 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 50 [2022-04-28 14:48:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:50,827 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2022-04-28 14:48:50,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 14:48:50,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 244 transitions. [2022-04-28 14:48:51,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2022-04-28 14:48:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 14:48:51,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:51,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:51,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 14:48:51,065 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash -957846954, now seen corresponding path program 1 times [2022-04-28 14:48:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:51,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [302664675] [2022-04-28 14:48:51,066 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash -957846954, now seen corresponding path program 2 times [2022-04-28 14:48:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:51,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928357679] [2022-04-28 14:48:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:51,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {9769#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {9733#true} is VALID [2022-04-28 14:48:51,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-28 14:48:51,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9733#true} {9733#true} #462#return; {9733#true} is VALID [2022-04-28 14:48:51,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:51,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {9770#(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; {9733#true} is VALID [2022-04-28 14:48:51,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-28 14:48:51,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9733#true} {9733#true} #442#return; {9733#true} is VALID [2022-04-28 14:48:51,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:51,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {9771#(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; {9744#(= ~pended~0 0)} is VALID [2022-04-28 14:48:51,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {9744#(= ~pended~0 0)} assume true; {9744#(= ~pended~0 0)} is VALID [2022-04-28 14:48:51,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9744#(= ~pended~0 0)} {9733#true} #444#return; {9744#(= ~pended~0 0)} is VALID [2022-04-28 14:48:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-28 14:48:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:51,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:51,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {9784#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {9733#true} is VALID [2022-04-28 14:48:51,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume !(0 != ~compRegistered~0); {9733#true} is VALID [2022-04-28 14:48:51,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {9733#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {9733#true} is VALID [2022-04-28 14:48:51,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {9733#true} assume 0 == ~tmp_ndt_2~0; {9733#true} is VALID [2022-04-28 14:48:51,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {9733#true} ~returnVal2~0 := 0; {9733#true} is VALID [2022-04-28 14:48:51,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {9733#true} assume !(~s~0 == ~NP~0); {9733#true} is VALID [2022-04-28 14:48:51,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {9733#true} assume !(~s~0 == ~MPR1~0); {9733#true} is VALID [2022-04-28 14:48:51,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {9733#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {9733#true} is VALID [2022-04-28 14:48:51,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {9733#true} #res := ~returnVal2~0; {9733#true} is VALID [2022-04-28 14:48:51,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-28 14:48:51,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9733#true} {9733#true} #478#return; {9733#true} is VALID [2022-04-28 14:48:51,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {9772#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {9733#true} is VALID [2022-04-28 14:48:51,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {9733#true} assume !(0 == ~irpStack__MinorFunction~0); {9733#true} is VALID [2022-04-28 14:48:51,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {9733#true} assume 23 == ~irpStack__MinorFunction~0; {9733#true} is VALID [2022-04-28 14:48:51,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {9733#true} ~devExt__SurpriseRemoved~0 := 1; {9733#true} is VALID [2022-04-28 14:48:51,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {9733#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {9733#true} is VALID [2022-04-28 14:48:51,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {9733#true} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {9733#true} is VALID [2022-04-28 14:48:51,281 INFO L272 TraceCheckUtils]: 6: Hoare triple {9733#true} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {9784#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:51,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {9784#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {9733#true} is VALID [2022-04-28 14:48:51,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {9733#true} assume !(0 != ~compRegistered~0); {9733#true} is VALID [2022-04-28 14:48:51,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {9733#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {9733#true} is VALID [2022-04-28 14:48:51,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {9733#true} assume 0 == ~tmp_ndt_2~0; {9733#true} is VALID [2022-04-28 14:48:51,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {9733#true} ~returnVal2~0 := 0; {9733#true} is VALID [2022-04-28 14:48:51,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {9733#true} assume !(~s~0 == ~NP~0); {9733#true} is VALID [2022-04-28 14:48:51,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {9733#true} assume !(~s~0 == ~MPR1~0); {9733#true} is VALID [2022-04-28 14:48:51,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {9733#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {9733#true} is VALID [2022-04-28 14:48:51,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {9733#true} #res := ~returnVal2~0; {9733#true} is VALID [2022-04-28 14:48:51,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-28 14:48:51,282 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9733#true} {9733#true} #478#return; {9733#true} is VALID [2022-04-28 14:48:51,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {9733#true} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {9733#true} is VALID [2022-04-28 14:48:51,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {9733#true} #res := ~status~0; {9733#true} is VALID [2022-04-28 14:48:51,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-28 14:48:51,282 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9733#true} {9746#(not (= ~pended~0 1))} #446#return; {9746#(not (= ~pended~0 1))} is VALID [2022-04-28 14:48:51,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {9733#true} call ULTIMATE.init(); {9769#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:51,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {9769#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {9733#true} is VALID [2022-04-28 14:48:51,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-28 14:48:51,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9733#true} {9733#true} #462#return; {9733#true} is VALID [2022-04-28 14:48:51,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {9733#true} call #t~ret35 := main(); {9733#true} is VALID [2022-04-28 14:48:51,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {9733#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {9733#true} is VALID [2022-04-28 14:48:51,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {9733#true} call _BLAST_init(); {9770#(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-28 14:48:51,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {9770#(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; {9733#true} is VALID [2022-04-28 14:48:51,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-28 14:48:51,285 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {9733#true} {9733#true} #442#return; {9733#true} is VALID [2022-04-28 14:48:51,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {9733#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; {9733#true} is VALID [2022-04-28 14:48:51,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {9733#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {9733#true} is VALID [2022-04-28 14:48:51,285 INFO L272 TraceCheckUtils]: 12: Hoare triple {9733#true} call stub_driver_init(); {9771#(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-28 14:48:51,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {9771#(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; {9744#(= ~pended~0 0)} is VALID [2022-04-28 14:48:51,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {9744#(= ~pended~0 0)} assume true; {9744#(= ~pended~0 0)} is VALID [2022-04-28 14:48:51,286 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9744#(= ~pended~0 0)} {9733#true} #444#return; {9744#(= ~pended~0 0)} is VALID [2022-04-28 14:48:51,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {9744#(= ~pended~0 0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {9745#(and (= main_~__cil_tmp8~0 1) (= ~pended~0 0))} is VALID [2022-04-28 14:48:51,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {9745#(and (= main_~__cil_tmp8~0 1) (= ~pended~0 0))} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {9746#(not (= ~pended~0 1))} is VALID [2022-04-28 14:48:51,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {9746#(not (= ~pended~0 1))} assume 3 == ~tmp_ndt_1~0; {9746#(not (= ~pended~0 1))} is VALID [2022-04-28 14:48:51,288 INFO L272 TraceCheckUtils]: 19: Hoare triple {9746#(not (= ~pended~0 1))} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {9772#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:51,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {9772#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {9733#true} is VALID [2022-04-28 14:48:51,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {9733#true} assume !(0 == ~irpStack__MinorFunction~0); {9733#true} is VALID [2022-04-28 14:48:51,288 INFO L290 TraceCheckUtils]: 22: Hoare triple {9733#true} assume 23 == ~irpStack__MinorFunction~0; {9733#true} is VALID [2022-04-28 14:48:51,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {9733#true} ~devExt__SurpriseRemoved~0 := 1; {9733#true} is VALID [2022-04-28 14:48:51,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {9733#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {9733#true} is VALID [2022-04-28 14:48:51,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {9733#true} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {9733#true} is VALID [2022-04-28 14:48:51,289 INFO L272 TraceCheckUtils]: 26: Hoare triple {9733#true} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {9784#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:51,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {9784#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {9733#true} is VALID [2022-04-28 14:48:51,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {9733#true} assume !(0 != ~compRegistered~0); {9733#true} is VALID [2022-04-28 14:48:51,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {9733#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {9733#true} is VALID [2022-04-28 14:48:51,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {9733#true} assume 0 == ~tmp_ndt_2~0; {9733#true} is VALID [2022-04-28 14:48:51,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {9733#true} ~returnVal2~0 := 0; {9733#true} is VALID [2022-04-28 14:48:51,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {9733#true} assume !(~s~0 == ~NP~0); {9733#true} is VALID [2022-04-28 14:48:51,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {9733#true} assume !(~s~0 == ~MPR1~0); {9733#true} is VALID [2022-04-28 14:48:51,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {9733#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {9733#true} is VALID [2022-04-28 14:48:51,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {9733#true} #res := ~returnVal2~0; {9733#true} is VALID [2022-04-28 14:48:51,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-28 14:48:51,290 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9733#true} {9733#true} #478#return; {9733#true} is VALID [2022-04-28 14:48:51,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {9733#true} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {9733#true} is VALID [2022-04-28 14:48:51,290 INFO L290 TraceCheckUtils]: 39: Hoare triple {9733#true} #res := ~status~0; {9733#true} is VALID [2022-04-28 14:48:51,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {9733#true} assume true; {9733#true} is VALID [2022-04-28 14:48:51,290 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9733#true} {9746#(not (= ~pended~0 1))} #446#return; {9746#(not (= ~pended~0 1))} is VALID [2022-04-28 14:48:51,291 INFO L290 TraceCheckUtils]: 42: Hoare triple {9746#(not (= ~pended~0 1))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~status~1 := #t~ret27;havoc #t~ret27; {9746#(not (= ~pended~0 1))} is VALID [2022-04-28 14:48:51,291 INFO L290 TraceCheckUtils]: 43: Hoare triple {9746#(not (= ~pended~0 1))} assume !(1 == ~pended~0); {9746#(not (= ~pended~0 1))} is VALID [2022-04-28 14:48:51,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {9746#(not (= ~pended~0 1))} assume !(1 == ~pended~0); {9746#(not (= ~pended~0 1))} is VALID [2022-04-28 14:48:51,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {9746#(not (= ~pended~0 1))} assume ~s~0 != ~UNLOADED~0; {9746#(not (= ~pended~0 1))} is VALID [2022-04-28 14:48:51,292 INFO L290 TraceCheckUtils]: 46: Hoare triple {9746#(not (= ~pended~0 1))} assume -1 != ~status~1; {9746#(not (= ~pended~0 1))} is VALID [2022-04-28 14:48:51,292 INFO L290 TraceCheckUtils]: 47: Hoare triple {9746#(not (= ~pended~0 1))} assume !(~s~0 != ~SKIP2~0); {9746#(not (= ~pended~0 1))} is VALID [2022-04-28 14:48:51,292 INFO L290 TraceCheckUtils]: 48: Hoare triple {9746#(not (= ~pended~0 1))} assume 1 == ~pended~0; {9734#false} is VALID [2022-04-28 14:48:51,292 INFO L290 TraceCheckUtils]: 49: Hoare triple {9734#false} assume 259 != ~status~1; {9734#false} is VALID [2022-04-28 14:48:51,292 INFO L272 TraceCheckUtils]: 50: Hoare triple {9734#false} call errorFn(); {9734#false} is VALID [2022-04-28 14:48:51,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {9734#false} assume !false; {9734#false} is VALID [2022-04-28 14:48:51,292 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-28 14:48:51,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:51,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928357679] [2022-04-28 14:48:51,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928357679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:51,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:51,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:48:51,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:51,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [302664675] [2022-04-28 14:48:51,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [302664675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:51,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:51,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:48:51,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360384902] [2022-04-28 14:48:51,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:51,294 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-04-28 14:48:51,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:51,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:48:51,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:51,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:48:51,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:51,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:48:51,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:48:51,323 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:48:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:52,345 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2022-04-28 14:48:52,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:48:52,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-04-28 14:48:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:48:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-04-28 14:48:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:48:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-04-28 14:48:52,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 206 transitions. [2022-04-28 14:48:52,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:52,554 INFO L225 Difference]: With dead ends: 203 [2022-04-28 14:48:52,554 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 14:48:52,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:48:52,555 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 358 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:52,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 240 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 14:48:52,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 14:48:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 14:48:52,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:52,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:52,563 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:52,563 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:52,564 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-04-28 14:48:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-28 14:48:52,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:52,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:52,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-28 14:48:52,565 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-28 14:48:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:52,566 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-04-28 14:48:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-28 14:48:52,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:52,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:52,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:52,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-04-28 14:48:52,568 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2022-04-28 14:48:52,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:52,569 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-04-28 14:48:52,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 14:48:52,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 102 transitions. [2022-04-28 14:48:52,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-28 14:48:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 14:48:52,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:52,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:52,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 14:48:52,667 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:52,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1066997237, now seen corresponding path program 1 times [2022-04-28 14:48:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:52,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [225489347] [2022-04-28 14:48:52,668 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:52,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1066997237, now seen corresponding path program 2 times [2022-04-28 14:48:52,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:52,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125251784] [2022-04-28 14:48:52,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:52,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:52,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:52,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {10597#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {10562#true} is VALID [2022-04-28 14:48:52,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-28 14:48:52,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10562#true} {10562#true} #462#return; {10562#true} is VALID [2022-04-28 14:48:52,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:52,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {10598#(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; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume true; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} {10562#true} #442#return; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:52,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {10599#(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; {10562#true} is VALID [2022-04-28 14:48:52,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-28 14:48:52,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10562#true} {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #444#return; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 14:48:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 14:48:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:52,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 14:48:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:52,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10562#true} is VALID [2022-04-28 14:48:52,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-28 14:48:52,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-28 14:48:52,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10562#true} is VALID [2022-04-28 14:48:52,876 INFO L272 TraceCheckUtils]: 1: Hoare triple {10562#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:52,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10562#true} is VALID [2022-04-28 14:48:52,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-28 14:48:52,876 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-28 14:48:52,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {10562#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10562#true} is VALID [2022-04-28 14:48:52,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-28 14:48:52,876 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10562#true} {10562#true} #450#return; {10562#true} is VALID [2022-04-28 14:48:52,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:52,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {10618#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-28 14:48:52,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {10619#(= ~MPR1~0 ~s~0)} assume true; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-28 14:48:52,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10619#(= ~MPR1~0 ~s~0)} {10562#true} #452#return; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-28 14:48:52,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {10600#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {10562#true} is VALID [2022-04-28 14:48:52,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {10562#true} assume 0 != ~compRegistered~0; {10562#true} is VALID [2022-04-28 14:48:52,893 INFO L272 TraceCheckUtils]: 2: Hoare triple {10562#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:52,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10562#true} is VALID [2022-04-28 14:48:52,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {10562#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:52,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10562#true} is VALID [2022-04-28 14:48:52,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-28 14:48:52,893 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-28 14:48:52,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {10562#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10562#true} is VALID [2022-04-28 14:48:52,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-28 14:48:52,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10562#true} {10562#true} #450#return; {10562#true} is VALID [2022-04-28 14:48:52,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {10562#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {10562#true} is VALID [2022-04-28 14:48:52,894 INFO L272 TraceCheckUtils]: 12: Hoare triple {10562#true} call stubMoreProcessingRequired(); {10618#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:52,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {10618#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-28 14:48:52,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {10619#(= ~MPR1~0 ~s~0)} assume true; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-28 14:48:52,896 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10619#(= ~MPR1~0 ~s~0)} {10562#true} #452#return; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-28 14:48:52,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-28 14:48:52,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume 0 == ~tmp_ndt_2~0; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-28 14:48:52,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} ~returnVal2~0 := 0; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-28 14:48:52,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-28 14:48:52,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} #res := ~returnVal2~0; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-28 14:48:52,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} assume true; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-28 14:48:52,900 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #470#return; {10563#false} is VALID [2022-04-28 14:48:52,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {10562#true} call ULTIMATE.init(); {10597#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:52,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {10597#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {10562#true} is VALID [2022-04-28 14:48:52,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-28 14:48:52,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10562#true} {10562#true} #462#return; {10562#true} is VALID [2022-04-28 14:48:52,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {10562#true} call #t~ret35 := main(); {10562#true} is VALID [2022-04-28 14:48:52,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {10562#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {10562#true} is VALID [2022-04-28 14:48:52,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {10562#true} call _BLAST_init(); {10598#(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-28 14:48:52,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {10598#(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; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume true; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,904 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} {10562#true} #442#return; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {10570#(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; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,905 INFO L272 TraceCheckUtils]: 12: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call stub_driver_init(); {10599#(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-28 14:48:52,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {10599#(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; {10562#true} is VALID [2022-04-28 14:48:52,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-28 14:48:52,906 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10562#true} {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #444#return; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 3 == ~tmp_ndt_1~0; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,907 INFO L272 TraceCheckUtils]: 19: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {10570#(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; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 0 == ~irpStack__MinorFunction~0; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {10570#(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; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(~s~0 != ~NP~0); {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-28 14:48:52,910 INFO L272 TraceCheckUtils]: 26: Hoare triple {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {10600#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:52,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {10600#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {10562#true} is VALID [2022-04-28 14:48:52,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {10562#true} assume 0 != ~compRegistered~0; {10562#true} is VALID [2022-04-28 14:48:52,911 INFO L272 TraceCheckUtils]: 29: Hoare triple {10562#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:52,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10562#true} is VALID [2022-04-28 14:48:52,911 INFO L272 TraceCheckUtils]: 31: Hoare triple {10562#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:52,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {10614#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10562#true} is VALID [2022-04-28 14:48:52,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-28 14:48:52,911 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10562#true} {10562#true} #440#return; {10562#true} is VALID [2022-04-28 14:48:52,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {10562#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10562#true} is VALID [2022-04-28 14:48:52,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {10562#true} assume true; {10562#true} is VALID [2022-04-28 14:48:52,912 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10562#true} {10562#true} #450#return; {10562#true} is VALID [2022-04-28 14:48:52,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {10562#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {10562#true} is VALID [2022-04-28 14:48:52,912 INFO L272 TraceCheckUtils]: 39: Hoare triple {10562#true} call stubMoreProcessingRequired(); {10618#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:52,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {10618#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-28 14:48:52,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {10619#(= ~MPR1~0 ~s~0)} assume true; {10619#(= ~MPR1~0 ~s~0)} is VALID [2022-04-28 14:48:52,913 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10619#(= ~MPR1~0 ~s~0)} {10562#true} #452#return; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-28 14:48:52,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-28 14:48:52,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume 0 == ~tmp_ndt_2~0; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-28 14:48:52,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} ~returnVal2~0 := 0; {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-28 14:48:52,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {10612#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-28 14:48:52,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} #res := ~returnVal2~0; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-28 14:48:52,915 INFO L290 TraceCheckUtils]: 48: Hoare triple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} assume true; {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-28 14:48:52,916 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10613#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} {10570#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #470#return; {10563#false} is VALID [2022-04-28 14:48:52,916 INFO L290 TraceCheckUtils]: 50: Hoare triple {10563#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {10563#false} is VALID [2022-04-28 14:48:52,916 INFO L290 TraceCheckUtils]: 51: Hoare triple {10563#false} assume 259 == ~__cil_tmp23~0; {10563#false} is VALID [2022-04-28 14:48:52,916 INFO L272 TraceCheckUtils]: 52: Hoare triple {10563#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {10563#false} is VALID [2022-04-28 14:48:52,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {10563#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {10563#false} is VALID [2022-04-28 14:48:52,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {10563#false} assume !(~s~0 == ~MPR3~0); {10563#false} is VALID [2022-04-28 14:48:52,916 INFO L290 TraceCheckUtils]: 55: Hoare triple {10563#false} assume !(1 == ~customIrp~0); {10563#false} is VALID [2022-04-28 14:48:52,916 INFO L290 TraceCheckUtils]: 56: Hoare triple {10563#false} assume ~s~0 == ~MPR3~0; {10563#false} is VALID [2022-04-28 14:48:52,916 INFO L272 TraceCheckUtils]: 57: Hoare triple {10563#false} call errorFn(); {10563#false} is VALID [2022-04-28 14:48:52,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {10563#false} assume !false; {10563#false} is VALID [2022-04-28 14:48:52,917 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-28 14:48:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:52,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125251784] [2022-04-28 14:48:52,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125251784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:52,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:52,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:48:52,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:52,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [225489347] [2022-04-28 14:48:52,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [225489347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:52,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:52,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:48:52,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348374567] [2022-04-28 14:48:52,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:52,918 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-04-28 14:48:52,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:52,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:52,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:52,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:48:52,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:52,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:48:52,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:48:52,958 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:53,813 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-04-28 14:48:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:48:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-04-28 14:48:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-04-28 14:48:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-04-28 14:48:53,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 123 transitions. [2022-04-28 14:48:53,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:53,927 INFO L225 Difference]: With dead ends: 119 [2022-04-28 14:48:53,927 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 14:48:53,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:48:53,927 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 119 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:53,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 240 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:48:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 14:48:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 14:48:53,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:53,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:53,999 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:53,999 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:54,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:54,000 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-04-28 14:48:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-28 14:48:54,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:54,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:54,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-28 14:48:54,001 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-28 14:48:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:54,002 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-04-28 14:48:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-28 14:48:54,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:54,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:54,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:54,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-04-28 14:48:54,003 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2022-04-28 14:48:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:54,004 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-04-28 14:48:54,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:54,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 101 transitions. [2022-04-28 14:48:54,102 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-28 14:48:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-28 14:48:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 14:48:54,103 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:54,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:54,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 14:48:54,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:54,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:54,103 INFO L85 PathProgramCache]: Analyzing trace with hash 438062746, now seen corresponding path program 1 times [2022-04-28 14:48:54,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:54,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1131268309] [2022-04-28 14:48:54,104 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:54,104 INFO L85 PathProgramCache]: Analyzing trace with hash 438062746, now seen corresponding path program 2 times [2022-04-28 14:48:54,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:54,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256472109] [2022-04-28 14:48:54,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:54,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:54,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:54,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {11276#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {11240#true} is VALID [2022-04-28 14:48:54,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #462#return; {11240#true} is VALID [2022-04-28 14:48:54,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:54,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {11277#(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; {11240#true} is VALID [2022-04-28 14:48:54,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #442#return; {11240#true} is VALID [2022-04-28 14:48:54,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:54,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {11278#(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; {11240#true} is VALID [2022-04-28 14:48:54,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #444#return; {11240#true} is VALID [2022-04-28 14:48:54,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 14:48:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:54,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 14:48:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:54,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 14:48:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:54,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11240#true} is VALID [2022-04-28 14:48:54,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-28 14:48:54,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11240#true} is VALID [2022-04-28 14:48:54,240 INFO L272 TraceCheckUtils]: 1: Hoare triple {11240#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:54,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11240#true} is VALID [2022-04-28 14:48:54,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,240 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-28 14:48:54,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {11240#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11240#true} is VALID [2022-04-28 14:48:54,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,240 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11240#true} {11240#true} #450#return; {11240#true} is VALID [2022-04-28 14:48:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:54,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {11296#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11240#true} is VALID [2022-04-28 14:48:54,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11240#true} {11240#true} #452#return; {11240#true} is VALID [2022-04-28 14:48:54,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {11279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {11240#true} is VALID [2022-04-28 14:48:54,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {11240#true} assume 0 != ~compRegistered~0; {11240#true} is VALID [2022-04-28 14:48:54,250 INFO L272 TraceCheckUtils]: 2: Hoare triple {11240#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:54,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11240#true} is VALID [2022-04-28 14:48:54,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {11240#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:54,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11240#true} is VALID [2022-04-28 14:48:54,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,250 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-28 14:48:54,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {11240#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11240#true} is VALID [2022-04-28 14:48:54,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11240#true} {11240#true} #450#return; {11240#true} is VALID [2022-04-28 14:48:54,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {11240#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {11240#true} is VALID [2022-04-28 14:48:54,251 INFO L272 TraceCheckUtils]: 12: Hoare triple {11240#true} call stubMoreProcessingRequired(); {11296#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:54,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {11296#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11240#true} is VALID [2022-04-28 14:48:54,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,251 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11240#true} {11240#true} #452#return; {11240#true} is VALID [2022-04-28 14:48:54,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {11240#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {11240#true} is VALID [2022-04-28 14:48:54,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {11240#true} assume 0 == ~tmp_ndt_2~0; {11240#true} is VALID [2022-04-28 14:48:54,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {11240#true} ~returnVal2~0 := 0; {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:54,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:54,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:54,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {11241#false} is VALID [2022-04-28 14:48:54,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {11241#false} #res := ~returnVal2~0; {11241#false} is VALID [2022-04-28 14:48:54,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {11241#false} assume true; {11241#false} is VALID [2022-04-28 14:48:54,253 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11241#false} {11240#true} #470#return; {11241#false} is VALID [2022-04-28 14:48:54,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {11240#true} call ULTIMATE.init(); {11276#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:54,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {11276#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {11240#true} is VALID [2022-04-28 14:48:54,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11240#true} {11240#true} #462#return; {11240#true} is VALID [2022-04-28 14:48:54,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {11240#true} call #t~ret35 := main(); {11240#true} is VALID [2022-04-28 14:48:54,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {11240#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {11240#true} is VALID [2022-04-28 14:48:54,255 INFO L272 TraceCheckUtils]: 6: Hoare triple {11240#true} call _BLAST_init(); {11277#(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-28 14:48:54,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {11277#(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; {11240#true} is VALID [2022-04-28 14:48:54,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,255 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {11240#true} {11240#true} #442#return; {11240#true} is VALID [2022-04-28 14:48:54,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {11240#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; {11240#true} is VALID [2022-04-28 14:48:54,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {11240#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {11240#true} is VALID [2022-04-28 14:48:54,255 INFO L272 TraceCheckUtils]: 12: Hoare triple {11240#true} call stub_driver_init(); {11278#(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-28 14:48:54,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {11278#(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; {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11240#true} {11240#true} #444#return; {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {11240#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {11240#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {11240#true} assume 3 == ~tmp_ndt_1~0; {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L272 TraceCheckUtils]: 19: Hoare triple {11240#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {11240#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; {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {11240#true} assume 0 == ~irpStack__MinorFunction~0; {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {11240#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {11240#true} assume !(~s~0 != ~NP~0); {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {11240#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {11240#true} is VALID [2022-04-28 14:48:54,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {11240#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {11240#true} is VALID [2022-04-28 14:48:54,257 INFO L272 TraceCheckUtils]: 26: Hoare triple {11240#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {11279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:54,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {11279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {11240#true} is VALID [2022-04-28 14:48:54,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {11240#true} assume 0 != ~compRegistered~0; {11240#true} is VALID [2022-04-28 14:48:54,257 INFO L272 TraceCheckUtils]: 29: Hoare triple {11240#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:54,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11240#true} is VALID [2022-04-28 14:48:54,258 INFO L272 TraceCheckUtils]: 31: Hoare triple {11240#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:54,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {11292#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11240#true} is VALID [2022-04-28 14:48:54,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,258 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11240#true} {11240#true} #440#return; {11240#true} is VALID [2022-04-28 14:48:54,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {11240#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11240#true} is VALID [2022-04-28 14:48:54,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,258 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11240#true} {11240#true} #450#return; {11240#true} is VALID [2022-04-28 14:48:54,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {11240#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {11240#true} is VALID [2022-04-28 14:48:54,259 INFO L272 TraceCheckUtils]: 39: Hoare triple {11240#true} call stubMoreProcessingRequired(); {11296#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:54,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {11296#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11240#true} is VALID [2022-04-28 14:48:54,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {11240#true} assume true; {11240#true} is VALID [2022-04-28 14:48:54,259 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11240#true} {11240#true} #452#return; {11240#true} is VALID [2022-04-28 14:48:54,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {11240#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {11240#true} is VALID [2022-04-28 14:48:54,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {11240#true} assume 0 == ~tmp_ndt_2~0; {11240#true} is VALID [2022-04-28 14:48:54,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {11240#true} ~returnVal2~0 := 0; {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:54,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:54,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {11291#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:54,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {11291#(<= IofCallDriver_~returnVal2~0 0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {11241#false} is VALID [2022-04-28 14:48:54,260 INFO L290 TraceCheckUtils]: 49: Hoare triple {11241#false} #res := ~returnVal2~0; {11241#false} is VALID [2022-04-28 14:48:54,260 INFO L290 TraceCheckUtils]: 50: Hoare triple {11241#false} assume true; {11241#false} is VALID [2022-04-28 14:48:54,260 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11241#false} {11240#true} #470#return; {11241#false} is VALID [2022-04-28 14:48:54,260 INFO L290 TraceCheckUtils]: 52: Hoare triple {11241#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {11241#false} is VALID [2022-04-28 14:48:54,261 INFO L290 TraceCheckUtils]: 53: Hoare triple {11241#false} assume 259 == ~__cil_tmp23~0; {11241#false} is VALID [2022-04-28 14:48:54,261 INFO L272 TraceCheckUtils]: 54: Hoare triple {11241#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {11241#false} is VALID [2022-04-28 14:48:54,261 INFO L290 TraceCheckUtils]: 55: Hoare triple {11241#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {11241#false} is VALID [2022-04-28 14:48:54,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {11241#false} assume !(~s~0 == ~MPR3~0); {11241#false} is VALID [2022-04-28 14:48:54,261 INFO L290 TraceCheckUtils]: 57: Hoare triple {11241#false} assume !(1 == ~customIrp~0); {11241#false} is VALID [2022-04-28 14:48:54,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {11241#false} assume ~s~0 == ~MPR3~0; {11241#false} is VALID [2022-04-28 14:48:54,261 INFO L272 TraceCheckUtils]: 59: Hoare triple {11241#false} call errorFn(); {11241#false} is VALID [2022-04-28 14:48:54,261 INFO L290 TraceCheckUtils]: 60: Hoare triple {11241#false} assume !false; {11241#false} is VALID [2022-04-28 14:48:54,261 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-28 14:48:54,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:54,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256472109] [2022-04-28 14:48:54,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256472109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:54,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:54,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:48:54,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:54,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1131268309] [2022-04-28 14:48:54,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1131268309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:54,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:54,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:48:54,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325182013] [2022-04-28 14:48:54,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:54,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-28 14:48:54,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:54,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:54,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:54,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:48:54,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:54,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:48:54,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:48:54,293 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:54,687 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-28 14:48:54,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 14:48:54,688 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-28 14:48:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-04-28 14:48:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-04-28 14:48:54,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2022-04-28 14:48:54,784 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-28 14:48:54,785 INFO L225 Difference]: With dead ends: 125 [2022-04-28 14:48:54,786 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 14:48:54,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:48:54,786 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 104 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:54,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 177 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:48:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 14:48:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-04-28 14:48:54,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:54,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:54,844 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:54,845 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:54,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:54,846 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-04-28 14:48:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-04-28 14:48:54,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:54,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:54,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 97 states. [2022-04-28 14:48:54,847 INFO L87 Difference]: Start difference. First operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 97 states. [2022-04-28 14:48:54,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:54,848 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-04-28 14:48:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-04-28 14:48:54,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:54,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:54,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:54,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-04-28 14:48:54,849 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2022-04-28 14:48:54,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:54,850 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-04-28 14:48:54,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:54,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 104 transitions. [2022-04-28 14:48:54,989 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-28 14:48:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-04-28 14:48:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 14:48:54,989 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:54,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:54,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 14:48:54,990 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash -148743268, now seen corresponding path program 1 times [2022-04-28 14:48:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:54,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008339166] [2022-04-28 14:48:54,991 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:54,991 INFO L85 PathProgramCache]: Analyzing trace with hash -148743268, now seen corresponding path program 2 times [2022-04-28 14:48:54,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:54,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257764334] [2022-04-28 14:48:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:54,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:55,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:55,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {11969#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {11931#true} is VALID [2022-04-28 14:48:55,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #462#return; {11931#true} is VALID [2022-04-28 14:48:55,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:55,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {11970#(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; {11931#true} is VALID [2022-04-28 14:48:55,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #442#return; {11931#true} is VALID [2022-04-28 14:48:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:55,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {11971#(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; {11931#true} is VALID [2022-04-28 14:48:55,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #444#return; {11931#true} is VALID [2022-04-28 14:48:55,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 14:48:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 14:48:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 14:48:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:55,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11931#true} is VALID [2022-04-28 14:48:55,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-28 14:48:55,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11931#true} is VALID [2022-04-28 14:48:55,146 INFO L272 TraceCheckUtils]: 1: Hoare triple {11931#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:55,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11931#true} is VALID [2022-04-28 14:48:55,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,147 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-28 14:48:55,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {11931#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11931#true} is VALID [2022-04-28 14:48:55,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,147 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11931#true} {11931#true} #450#return; {11931#true} is VALID [2022-04-28 14:48:55,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:55,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {11990#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11931#true} is VALID [2022-04-28 14:48:55,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11931#true} {11931#true} #452#return; {11931#true} is VALID [2022-04-28 14:48:55,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {11972#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {11931#true} is VALID [2022-04-28 14:48:55,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {11931#true} assume 0 != ~compRegistered~0; {11931#true} is VALID [2022-04-28 14:48:55,156 INFO L272 TraceCheckUtils]: 2: Hoare triple {11931#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:55,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11931#true} is VALID [2022-04-28 14:48:55,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {11931#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:55,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11931#true} is VALID [2022-04-28 14:48:55,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,156 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-28 14:48:55,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {11931#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11931#true} is VALID [2022-04-28 14:48:55,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11931#true} {11931#true} #450#return; {11931#true} is VALID [2022-04-28 14:48:55,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {11931#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {11931#true} is VALID [2022-04-28 14:48:55,157 INFO L272 TraceCheckUtils]: 12: Hoare triple {11931#true} call stubMoreProcessingRequired(); {11990#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:55,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {11990#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11931#true} is VALID [2022-04-28 14:48:55,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,157 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11931#true} {11931#true} #452#return; {11931#true} is VALID [2022-04-28 14:48:55,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {11931#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {11931#true} is VALID [2022-04-28 14:48:55,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {11931#true} assume 0 == ~tmp_ndt_2~0; {11931#true} is VALID [2022-04-28 14:48:55,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {11931#true} ~returnVal2~0 := 0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:55,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:55,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:55,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:55,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} #res := ~returnVal2~0; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-28 14:48:55,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {11985#(<= |IofCallDriver_#res| 0)} assume true; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-28 14:48:55,160 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11985#(<= |IofCallDriver_#res| 0)} {11931#true} #470#return; {11967#(not (= |KbFilter_PnP_#t~ret12| 259))} is VALID [2022-04-28 14:48:55,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {11931#true} call ULTIMATE.init(); {11969#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:55,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {11969#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {11931#true} is VALID [2022-04-28 14:48:55,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11931#true} {11931#true} #462#return; {11931#true} is VALID [2022-04-28 14:48:55,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {11931#true} call #t~ret35 := main(); {11931#true} is VALID [2022-04-28 14:48:55,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {11931#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {11931#true} is VALID [2022-04-28 14:48:55,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {11931#true} call _BLAST_init(); {11970#(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-28 14:48:55,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {11970#(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; {11931#true} is VALID [2022-04-28 14:48:55,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,163 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {11931#true} {11931#true} #442#return; {11931#true} is VALID [2022-04-28 14:48:55,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {11931#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; {11931#true} is VALID [2022-04-28 14:48:55,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {11931#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {11931#true} is VALID [2022-04-28 14:48:55,163 INFO L272 TraceCheckUtils]: 12: Hoare triple {11931#true} call stub_driver_init(); {11971#(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-28 14:48:55,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {11971#(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; {11931#true} is VALID [2022-04-28 14:48:55,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,163 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11931#true} {11931#true} #444#return; {11931#true} is VALID [2022-04-28 14:48:55,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {11931#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {11931#true} is VALID [2022-04-28 14:48:55,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {11931#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {11931#true} is VALID [2022-04-28 14:48:55,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {11931#true} assume 3 == ~tmp_ndt_1~0; {11931#true} is VALID [2022-04-28 14:48:55,164 INFO L272 TraceCheckUtils]: 19: Hoare triple {11931#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {11931#true} is VALID [2022-04-28 14:48:55,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {11931#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; {11931#true} is VALID [2022-04-28 14:48:55,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {11931#true} assume 0 == ~irpStack__MinorFunction~0; {11931#true} is VALID [2022-04-28 14:48:55,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {11931#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {11931#true} is VALID [2022-04-28 14:48:55,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {11931#true} assume !(~s~0 != ~NP~0); {11931#true} is VALID [2022-04-28 14:48:55,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {11931#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {11931#true} is VALID [2022-04-28 14:48:55,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {11931#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {11931#true} is VALID [2022-04-28 14:48:55,165 INFO L272 TraceCheckUtils]: 26: Hoare triple {11931#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {11972#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:55,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {11972#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {11931#true} is VALID [2022-04-28 14:48:55,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {11931#true} assume 0 != ~compRegistered~0; {11931#true} is VALID [2022-04-28 14:48:55,165 INFO L272 TraceCheckUtils]: 29: Hoare triple {11931#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:55,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11931#true} is VALID [2022-04-28 14:48:55,166 INFO L272 TraceCheckUtils]: 31: Hoare triple {11931#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:55,166 INFO L290 TraceCheckUtils]: 32: Hoare triple {11986#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11931#true} is VALID [2022-04-28 14:48:55,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,166 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11931#true} {11931#true} #440#return; {11931#true} is VALID [2022-04-28 14:48:55,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {11931#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11931#true} is VALID [2022-04-28 14:48:55,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,166 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11931#true} {11931#true} #450#return; {11931#true} is VALID [2022-04-28 14:48:55,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {11931#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {11931#true} is VALID [2022-04-28 14:48:55,167 INFO L272 TraceCheckUtils]: 39: Hoare triple {11931#true} call stubMoreProcessingRequired(); {11990#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:55,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {11990#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11931#true} is VALID [2022-04-28 14:48:55,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {11931#true} assume true; {11931#true} is VALID [2022-04-28 14:48:55,167 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11931#true} {11931#true} #452#return; {11931#true} is VALID [2022-04-28 14:48:55,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {11931#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {11931#true} is VALID [2022-04-28 14:48:55,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {11931#true} assume 0 == ~tmp_ndt_2~0; {11931#true} is VALID [2022-04-28 14:48:55,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {11931#true} ~returnVal2~0 := 0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:55,168 INFO L290 TraceCheckUtils]: 46: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:55,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:55,168 INFO L290 TraceCheckUtils]: 48: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {11984#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-28 14:48:55,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {11984#(<= IofCallDriver_~returnVal2~0 0)} #res := ~returnVal2~0; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-28 14:48:55,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {11985#(<= |IofCallDriver_#res| 0)} assume true; {11985#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-28 14:48:55,169 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11985#(<= |IofCallDriver_#res| 0)} {11931#true} #470#return; {11967#(not (= |KbFilter_PnP_#t~ret12| 259))} is VALID [2022-04-28 14:48:55,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {11967#(not (= |KbFilter_PnP_#t~ret12| 259))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {11968#(not (= KbFilter_PnP_~__cil_tmp23~0 259))} is VALID [2022-04-28 14:48:55,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {11968#(not (= KbFilter_PnP_~__cil_tmp23~0 259))} assume 259 == ~__cil_tmp23~0; {11932#false} is VALID [2022-04-28 14:48:55,170 INFO L272 TraceCheckUtils]: 54: Hoare triple {11932#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {11932#false} is VALID [2022-04-28 14:48:55,170 INFO L290 TraceCheckUtils]: 55: Hoare triple {11932#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {11932#false} is VALID [2022-04-28 14:48:55,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {11932#false} assume !(~s~0 == ~MPR3~0); {11932#false} is VALID [2022-04-28 14:48:55,170 INFO L290 TraceCheckUtils]: 57: Hoare triple {11932#false} assume !(1 == ~customIrp~0); {11932#false} is VALID [2022-04-28 14:48:55,170 INFO L290 TraceCheckUtils]: 58: Hoare triple {11932#false} assume ~s~0 == ~MPR3~0; {11932#false} is VALID [2022-04-28 14:48:55,170 INFO L272 TraceCheckUtils]: 59: Hoare triple {11932#false} call errorFn(); {11932#false} is VALID [2022-04-28 14:48:55,170 INFO L290 TraceCheckUtils]: 60: Hoare triple {11932#false} assume !false; {11932#false} is VALID [2022-04-28 14:48:55,171 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-28 14:48:55,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:55,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257764334] [2022-04-28 14:48:55,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257764334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:55,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:55,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:48:55,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:55,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008339166] [2022-04-28 14:48:55,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008339166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:55,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:55,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:48:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544815713] [2022-04-28 14:48:55,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:55,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-28 14:48:55,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:55,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:55,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:55,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:48:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:55,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:48:55,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:48:55,206 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:55,874 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-04-28 14:48:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:48:55,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-28 14:48:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-28 14:48:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-28 14:48:55,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 112 transitions. [2022-04-28 14:48:55,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:55,969 INFO L225 Difference]: With dead ends: 112 [2022-04-28 14:48:55,969 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 14:48:55,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:48:55,970 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 60 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:55,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 334 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:48:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 14:48:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-04-28 14:48:56,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:56,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:56,013 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:56,013 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:56,015 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-04-28 14:48:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-04-28 14:48:56,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:56,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:56,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 93 states. [2022-04-28 14:48:56,015 INFO L87 Difference]: Start difference. First operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 93 states. [2022-04-28 14:48:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:56,016 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-04-28 14:48:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-04-28 14:48:56,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:56,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:56,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:56,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-04-28 14:48:56,020 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2022-04-28 14:48:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:56,020 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-04-28 14:48:56,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:56,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 97 transitions. [2022-04-28 14:48:56,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-28 14:48:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 14:48:56,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:56,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:56,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 14:48:56,118 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:56,119 INFO L85 PathProgramCache]: Analyzing trace with hash 457949083, now seen corresponding path program 1 times [2022-04-28 14:48:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:56,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [930659925] [2022-04-28 14:48:56,120 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash 457949083, now seen corresponding path program 2 times [2022-04-28 14:48:56,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:56,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621274502] [2022-04-28 14:48:56,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:56,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:56,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:56,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {12621#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {12583#true} is VALID [2022-04-28 14:48:56,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #462#return; {12583#true} is VALID [2022-04-28 14:48:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:56,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {12622#(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; {12583#true} is VALID [2022-04-28 14:48:56,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #442#return; {12583#true} is VALID [2022-04-28 14:48:56,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:56,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {12623#(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; {12583#true} is VALID [2022-04-28 14:48:56,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #444#return; {12583#true} is VALID [2022-04-28 14:48:56,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 14:48:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:56,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 14:48:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 14:48:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:56,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12583#true} is VALID [2022-04-28 14:48:56,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-28 14:48:56,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12583#true} is VALID [2022-04-28 14:48:56,231 INFO L272 TraceCheckUtils]: 1: Hoare triple {12583#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:56,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12583#true} is VALID [2022-04-28 14:48:56,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,231 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-28 14:48:56,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {12583#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12583#true} is VALID [2022-04-28 14:48:56,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,231 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12583#true} {12583#true} #450#return; {12583#true} is VALID [2022-04-28 14:48:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:56,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {12640#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12583#true} is VALID [2022-04-28 14:48:56,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12583#true} {12583#true} #452#return; {12583#true} is VALID [2022-04-28 14:48:56,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {12624#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {12583#true} is VALID [2022-04-28 14:48:56,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {12583#true} assume 0 != ~compRegistered~0; {12583#true} is VALID [2022-04-28 14:48:56,239 INFO L272 TraceCheckUtils]: 2: Hoare triple {12583#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:56,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12583#true} is VALID [2022-04-28 14:48:56,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {12583#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:56,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12583#true} is VALID [2022-04-28 14:48:56,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,240 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-28 14:48:56,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {12583#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12583#true} is VALID [2022-04-28 14:48:56,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12583#true} {12583#true} #450#return; {12583#true} is VALID [2022-04-28 14:48:56,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {12583#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {12583#true} is VALID [2022-04-28 14:48:56,241 INFO L272 TraceCheckUtils]: 12: Hoare triple {12583#true} call stubMoreProcessingRequired(); {12640#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:56,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {12640#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12583#true} is VALID [2022-04-28 14:48:56,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,241 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12583#true} {12583#true} #452#return; {12583#true} is VALID [2022-04-28 14:48:56,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {12583#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {12583#true} is VALID [2022-04-28 14:48:56,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {12583#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {12583#true} is VALID [2022-04-28 14:48:56,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {12583#true} assume !(1 == ~tmp_ndt_3~0); {12583#true} is VALID [2022-04-28 14:48:56,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {12583#true} ~returnVal2~0 := 259; {12583#true} is VALID [2022-04-28 14:48:56,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {12583#true} assume !(~s~0 == ~NP~0); {12583#true} is VALID [2022-04-28 14:48:56,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {12583#true} assume ~s~0 == ~MPR1~0; {12583#true} is VALID [2022-04-28 14:48:56,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {12583#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {12583#true} is VALID [2022-04-28 14:48:56,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {12583#true} #res := ~returnVal2~0; {12583#true} is VALID [2022-04-28 14:48:56,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,242 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12583#true} {12583#true} #470#return; {12583#true} is VALID [2022-04-28 14:48:56,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {12583#true} call ULTIMATE.init(); {12621#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:56,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {12621#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {12583#true} is VALID [2022-04-28 14:48:56,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12583#true} {12583#true} #462#return; {12583#true} is VALID [2022-04-28 14:48:56,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {12583#true} call #t~ret35 := main(); {12583#true} is VALID [2022-04-28 14:48:56,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {12583#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {12583#true} is VALID [2022-04-28 14:48:56,244 INFO L272 TraceCheckUtils]: 6: Hoare triple {12583#true} call _BLAST_init(); {12622#(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-28 14:48:56,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {12622#(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; {12583#true} is VALID [2022-04-28 14:48:56,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,244 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {12583#true} {12583#true} #442#return; {12583#true} is VALID [2022-04-28 14:48:56,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {12583#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; {12583#true} is VALID [2022-04-28 14:48:56,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {12583#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {12583#true} is VALID [2022-04-28 14:48:56,245 INFO L272 TraceCheckUtils]: 12: Hoare triple {12583#true} call stub_driver_init(); {12623#(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-28 14:48:56,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {12623#(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; {12583#true} is VALID [2022-04-28 14:48:56,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,245 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12583#true} {12583#true} #444#return; {12583#true} is VALID [2022-04-28 14:48:56,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {12583#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {12583#true} is VALID [2022-04-28 14:48:56,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {12583#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {12583#true} is VALID [2022-04-28 14:48:56,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {12583#true} assume 3 == ~tmp_ndt_1~0; {12583#true} is VALID [2022-04-28 14:48:56,245 INFO L272 TraceCheckUtils]: 19: Hoare triple {12583#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {12583#true} is VALID [2022-04-28 14:48:56,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {12583#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; {12583#true} is VALID [2022-04-28 14:48:56,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {12583#true} assume 0 == ~irpStack__MinorFunction~0; {12583#true} is VALID [2022-04-28 14:48:56,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {12583#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {12583#true} is VALID [2022-04-28 14:48:56,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {12583#true} assume !(~s~0 != ~NP~0); {12583#true} is VALID [2022-04-28 14:48:56,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {12583#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {12583#true} is VALID [2022-04-28 14:48:56,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {12583#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {12583#true} is VALID [2022-04-28 14:48:56,246 INFO L272 TraceCheckUtils]: 26: Hoare triple {12583#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {12624#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:56,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {12624#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {12583#true} is VALID [2022-04-28 14:48:56,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {12583#true} assume 0 != ~compRegistered~0; {12583#true} is VALID [2022-04-28 14:48:56,247 INFO L272 TraceCheckUtils]: 29: Hoare triple {12583#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:56,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12583#true} is VALID [2022-04-28 14:48:56,247 INFO L272 TraceCheckUtils]: 31: Hoare triple {12583#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:56,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {12636#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12583#true} is VALID [2022-04-28 14:48:56,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,247 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12583#true} {12583#true} #440#return; {12583#true} is VALID [2022-04-28 14:48:56,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {12583#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12583#true} is VALID [2022-04-28 14:48:56,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,248 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12583#true} {12583#true} #450#return; {12583#true} is VALID [2022-04-28 14:48:56,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {12583#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {12583#true} is VALID [2022-04-28 14:48:56,248 INFO L272 TraceCheckUtils]: 39: Hoare triple {12583#true} call stubMoreProcessingRequired(); {12640#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:56,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {12640#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12583#true} is VALID [2022-04-28 14:48:56,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,248 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12583#true} {12583#true} #452#return; {12583#true} is VALID [2022-04-28 14:48:56,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {12583#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {12583#true} is VALID [2022-04-28 14:48:56,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {12583#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {12583#true} is VALID [2022-04-28 14:48:56,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {12583#true} assume !(1 == ~tmp_ndt_3~0); {12583#true} is VALID [2022-04-28 14:48:56,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {12583#true} ~returnVal2~0 := 259; {12583#true} is VALID [2022-04-28 14:48:56,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {12583#true} assume !(~s~0 == ~NP~0); {12583#true} is VALID [2022-04-28 14:48:56,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {12583#true} assume ~s~0 == ~MPR1~0; {12583#true} is VALID [2022-04-28 14:48:56,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {12583#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {12583#true} is VALID [2022-04-28 14:48:56,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {12583#true} #res := ~returnVal2~0; {12583#true} is VALID [2022-04-28 14:48:56,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {12583#true} assume true; {12583#true} is VALID [2022-04-28 14:48:56,249 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12583#true} {12583#true} #470#return; {12583#true} is VALID [2022-04-28 14:48:56,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {12583#true} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {12583#true} is VALID [2022-04-28 14:48:56,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {12583#true} assume 259 == ~__cil_tmp23~0; {12583#true} is VALID [2022-04-28 14:48:56,249 INFO L272 TraceCheckUtils]: 55: Hoare triple {12583#true} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {12583#true} is VALID [2022-04-28 14:48:56,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {12583#true} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {12583#true} is VALID [2022-04-28 14:48:56,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {12583#true} assume !(~s~0 == ~MPR3~0); {12620#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 14:48:56,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {12620#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {12620#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-28 14:48:56,250 INFO L290 TraceCheckUtils]: 59: Hoare triple {12620#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {12584#false} is VALID [2022-04-28 14:48:56,250 INFO L272 TraceCheckUtils]: 60: Hoare triple {12584#false} call errorFn(); {12584#false} is VALID [2022-04-28 14:48:56,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {12584#false} assume !false; {12584#false} is VALID [2022-04-28 14:48:56,250 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-28 14:48:56,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:56,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621274502] [2022-04-28 14:48:56,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621274502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:56,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:56,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:48:56,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:56,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [930659925] [2022-04-28 14:48:56,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [930659925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:56,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:56,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:48:56,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146885372] [2022-04-28 14:48:56,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:56,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-28 14:48:56,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:56,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:56,284 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-28 14:48:56,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:48:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:48:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:48:56,285 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:56,717 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-04-28 14:48:56,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:48:56,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-28 14:48:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-04-28 14:48:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-04-28 14:48:56,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 100 transitions. [2022-04-28 14:48:56,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:56,826 INFO L225 Difference]: With dead ends: 105 [2022-04-28 14:48:56,827 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 14:48:56,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:48:56,827 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 53 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:56,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 181 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:48:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 14:48:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2022-04-28 14:48:56,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:56,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:56,872 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:56,872 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:56,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:56,877 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-28 14:48:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-28 14:48:56,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:56,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:56,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 100 states. [2022-04-28 14:48:56,879 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 100 states. [2022-04-28 14:48:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:56,880 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-28 14:48:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-28 14:48:56,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:56,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:56,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:56,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-04-28 14:48:56,882 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2022-04-28 14:48:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:56,882 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-04-28 14:48:56,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:56,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 98 transitions. [2022-04-28 14:48:56,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-28 14:48:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 14:48:56,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:56,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:56,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 14:48:56,985 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1607349772, now seen corresponding path program 1 times [2022-04-28 14:48:56,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:56,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2016789889] [2022-04-28 14:48:56,985 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1607349772, now seen corresponding path program 2 times [2022-04-28 14:48:56,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:56,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281011913] [2022-04-28 14:48:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:56,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:57,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:57,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {13276#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {13237#true} is VALID [2022-04-28 14:48:57,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #462#return; {13237#true} is VALID [2022-04-28 14:48:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:57,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {13277#(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; {13237#true} is VALID [2022-04-28 14:48:57,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #442#return; {13237#true} is VALID [2022-04-28 14:48:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:57,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {13278#(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; {13237#true} is VALID [2022-04-28 14:48:57,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #444#return; {13237#true} is VALID [2022-04-28 14:48:57,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 14:48:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 14:48:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 14:48:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:57,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13237#true} is VALID [2022-04-28 14:48:57,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-28 14:48:57,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13237#true} is VALID [2022-04-28 14:48:57,147 INFO L272 TraceCheckUtils]: 1: Hoare triple {13237#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:57,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13237#true} is VALID [2022-04-28 14:48:57,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,147 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-28 14:48:57,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {13237#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13237#true} is VALID [2022-04-28 14:48:57,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,147 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13237#true} {13237#true} #450#return; {13237#true} is VALID [2022-04-28 14:48:57,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:57,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {13297#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13237#true} is VALID [2022-04-28 14:48:57,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13237#true} {13237#true} #452#return; {13237#true} is VALID [2022-04-28 14:48:57,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {13279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {13237#true} is VALID [2022-04-28 14:48:57,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {13237#true} assume 0 != ~compRegistered~0; {13237#true} is VALID [2022-04-28 14:48:57,165 INFO L272 TraceCheckUtils]: 2: Hoare triple {13237#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:57,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13237#true} is VALID [2022-04-28 14:48:57,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {13237#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:57,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13237#true} is VALID [2022-04-28 14:48:57,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,166 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-28 14:48:57,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {13237#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13237#true} is VALID [2022-04-28 14:48:57,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13237#true} {13237#true} #450#return; {13237#true} is VALID [2022-04-28 14:48:57,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {13237#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {13237#true} is VALID [2022-04-28 14:48:57,166 INFO L272 TraceCheckUtils]: 12: Hoare triple {13237#true} call stubMoreProcessingRequired(); {13297#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:57,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {13297#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13237#true} is VALID [2022-04-28 14:48:57,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,167 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13237#true} {13237#true} #452#return; {13237#true} is VALID [2022-04-28 14:48:57,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {13237#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {13237#true} is VALID [2022-04-28 14:48:57,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {13237#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {13237#true} is VALID [2022-04-28 14:48:57,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {13237#true} assume !(1 == ~tmp_ndt_3~0); {13237#true} is VALID [2022-04-28 14:48:57,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {13237#true} ~returnVal2~0 := 259; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-28 14:48:57,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume !(~s~0 == ~NP~0); {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-28 14:48:57,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume ~s~0 == ~MPR1~0; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-28 14:48:57,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-28 14:48:57,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-28 14:48:57,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {13292#(<= 259 |IofCallDriver_#res|)} assume true; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-28 14:48:57,169 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13292#(<= 259 |IofCallDriver_#res|)} {13237#true} #470#return; {13274#(<= 259 |KbFilter_PnP_#t~ret12|)} is VALID [2022-04-28 14:48:57,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {13237#true} call ULTIMATE.init(); {13276#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:57,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {13276#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {13237#true} is VALID [2022-04-28 14:48:57,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13237#true} {13237#true} #462#return; {13237#true} is VALID [2022-04-28 14:48:57,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {13237#true} call #t~ret35 := main(); {13237#true} is VALID [2022-04-28 14:48:57,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {13237#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {13237#true} is VALID [2022-04-28 14:48:57,171 INFO L272 TraceCheckUtils]: 6: Hoare triple {13237#true} call _BLAST_init(); {13277#(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-28 14:48:57,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {13277#(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; {13237#true} is VALID [2022-04-28 14:48:57,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,171 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {13237#true} {13237#true} #442#return; {13237#true} is VALID [2022-04-28 14:48:57,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {13237#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; {13237#true} is VALID [2022-04-28 14:48:57,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {13237#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {13237#true} is VALID [2022-04-28 14:48:57,172 INFO L272 TraceCheckUtils]: 12: Hoare triple {13237#true} call stub_driver_init(); {13278#(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-28 14:48:57,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {13278#(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; {13237#true} is VALID [2022-04-28 14:48:57,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,172 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13237#true} {13237#true} #444#return; {13237#true} is VALID [2022-04-28 14:48:57,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {13237#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {13237#true} is VALID [2022-04-28 14:48:57,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {13237#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {13237#true} is VALID [2022-04-28 14:48:57,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {13237#true} assume 3 == ~tmp_ndt_1~0; {13237#true} is VALID [2022-04-28 14:48:57,172 INFO L272 TraceCheckUtils]: 19: Hoare triple {13237#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {13237#true} is VALID [2022-04-28 14:48:57,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {13237#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; {13237#true} is VALID [2022-04-28 14:48:57,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {13237#true} assume 0 == ~irpStack__MinorFunction~0; {13237#true} is VALID [2022-04-28 14:48:57,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {13237#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {13237#true} is VALID [2022-04-28 14:48:57,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {13237#true} assume !(~s~0 != ~NP~0); {13237#true} is VALID [2022-04-28 14:48:57,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {13237#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {13237#true} is VALID [2022-04-28 14:48:57,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {13237#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {13237#true} is VALID [2022-04-28 14:48:57,173 INFO L272 TraceCheckUtils]: 26: Hoare triple {13237#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {13279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:57,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {13279#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {13237#true} is VALID [2022-04-28 14:48:57,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {13237#true} assume 0 != ~compRegistered~0; {13237#true} is VALID [2022-04-28 14:48:57,174 INFO L272 TraceCheckUtils]: 29: Hoare triple {13237#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:57,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13237#true} is VALID [2022-04-28 14:48:57,174 INFO L272 TraceCheckUtils]: 31: Hoare triple {13237#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:57,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {13293#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13237#true} is VALID [2022-04-28 14:48:57,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,175 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13237#true} {13237#true} #440#return; {13237#true} is VALID [2022-04-28 14:48:57,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {13237#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13237#true} is VALID [2022-04-28 14:48:57,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,175 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13237#true} {13237#true} #450#return; {13237#true} is VALID [2022-04-28 14:48:57,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {13237#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {13237#true} is VALID [2022-04-28 14:48:57,175 INFO L272 TraceCheckUtils]: 39: Hoare triple {13237#true} call stubMoreProcessingRequired(); {13297#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:57,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {13297#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13237#true} is VALID [2022-04-28 14:48:57,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {13237#true} assume true; {13237#true} is VALID [2022-04-28 14:48:57,175 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13237#true} {13237#true} #452#return; {13237#true} is VALID [2022-04-28 14:48:57,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {13237#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {13237#true} is VALID [2022-04-28 14:48:57,175 INFO L290 TraceCheckUtils]: 44: Hoare triple {13237#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {13237#true} is VALID [2022-04-28 14:48:57,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {13237#true} assume !(1 == ~tmp_ndt_3~0); {13237#true} is VALID [2022-04-28 14:48:57,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {13237#true} ~returnVal2~0 := 259; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-28 14:48:57,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume !(~s~0 == ~NP~0); {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-28 14:48:57,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume ~s~0 == ~MPR1~0; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-28 14:48:57,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {13291#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-28 14:48:57,177 INFO L290 TraceCheckUtils]: 50: Hoare triple {13291#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-28 14:48:57,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {13292#(<= 259 |IofCallDriver_#res|)} assume true; {13292#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-28 14:48:57,177 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13292#(<= 259 |IofCallDriver_#res|)} {13237#true} #470#return; {13274#(<= 259 |KbFilter_PnP_#t~ret12|)} is VALID [2022-04-28 14:48:57,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {13274#(<= 259 |KbFilter_PnP_#t~ret12|)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {13275#(<= 259 KbFilter_PnP_~status~0)} is VALID [2022-04-28 14:48:57,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {13275#(<= 259 KbFilter_PnP_~status~0)} assume !(259 == ~__cil_tmp23~0); {13275#(<= 259 KbFilter_PnP_~status~0)} is VALID [2022-04-28 14:48:57,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {13275#(<= 259 KbFilter_PnP_~status~0)} assume !(~status~0 >= 0); {13238#false} is VALID [2022-04-28 14:48:57,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {13238#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {13238#false} is VALID [2022-04-28 14:48:57,178 INFO L272 TraceCheckUtils]: 57: Hoare triple {13238#false} call IofCompleteRequest(~Irp, 0); {13238#false} is VALID [2022-04-28 14:48:57,179 INFO L290 TraceCheckUtils]: 58: Hoare triple {13238#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {13238#false} is VALID [2022-04-28 14:48:57,179 INFO L290 TraceCheckUtils]: 59: Hoare triple {13238#false} assume !(~s~0 == ~NP~0); {13238#false} is VALID [2022-04-28 14:48:57,179 INFO L272 TraceCheckUtils]: 60: Hoare triple {13238#false} call errorFn(); {13238#false} is VALID [2022-04-28 14:48:57,179 INFO L290 TraceCheckUtils]: 61: Hoare triple {13238#false} assume !false; {13238#false} is VALID [2022-04-28 14:48:57,179 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-28 14:48:57,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:57,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281011913] [2022-04-28 14:48:57,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281011913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:57,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:57,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:48:57,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:57,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2016789889] [2022-04-28 14:48:57,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2016789889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:57,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:57,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:48:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741777157] [2022-04-28 14:48:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:57,180 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-28 14:48:57,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:57,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:57,212 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-28 14:48:57,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:48:57,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:57,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:48:57,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:48:57,213 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:57,915 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-04-28 14:48:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:48:57,916 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-28 14:48:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-28 14:48:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-28 14:48:57,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-28 14:48:58,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:58,010 INFO L225 Difference]: With dead ends: 98 [2022-04-28 14:48:58,010 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 14:48:58,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:48:58,011 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 85 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:58,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 267 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 14:48:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 14:48:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 14:48:58,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:58,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:58,076 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:58,076 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:58,077 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-04-28 14:48:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-28 14:48:58,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:58,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:58,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-28 14:48:58,077 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-28 14:48:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:58,078 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-04-28 14:48:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-28 14:48:58,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:58,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:58,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:58,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 14:48:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-04-28 14:48:58,080 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2022-04-28 14:48:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:58,080 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-04-28 14:48:58,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:48:58,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 97 transitions. [2022-04-28 14:48:58,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-28 14:48:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 14:48:58,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:58,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:58,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 14:48:58,193 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:58,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1073874348, now seen corresponding path program 1 times [2022-04-28 14:48:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:58,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189436054] [2022-04-28 14:48:58,193 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1073874348, now seen corresponding path program 2 times [2022-04-28 14:48:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:58,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122077898] [2022-04-28 14:48:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:58,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:58,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:58,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {13900#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {13862#true} is VALID [2022-04-28 14:48:58,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-28 14:48:58,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13862#true} #462#return; {13862#true} is VALID [2022-04-28 14:48:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:58,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {13901#(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; {13862#true} is VALID [2022-04-28 14:48:58,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-28 14:48:58,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13862#true} #442#return; {13862#true} is VALID [2022-04-28 14:48:58,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:58,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {13902#(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; {13862#true} is VALID [2022-04-28 14:48:58,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-28 14:48:58,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13862#true} #444#return; {13862#true} is VALID [2022-04-28 14:48:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 14:48:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:58,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 14:48:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:58,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 14:48:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:58,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13862#true} is VALID [2022-04-28 14:48:58,336 INFO L272 TraceCheckUtils]: 1: Hoare triple {13862#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:58,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,337 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,338 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #450#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:58,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {13919#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13862#true} is VALID [2022-04-28 14:48:58,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-28 14:48:58,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13862#true} {13899#(= ~setEventCalled~0 1)} #452#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {13903#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {13862#true} is VALID [2022-04-28 14:48:58,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {13862#true} assume 0 != ~compRegistered~0; {13862#true} is VALID [2022-04-28 14:48:58,348 INFO L272 TraceCheckUtils]: 2: Hoare triple {13862#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:58,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13862#true} is VALID [2022-04-28 14:48:58,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {13862#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:58,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,350 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,351 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #450#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,351 INFO L272 TraceCheckUtils]: 12: Hoare triple {13899#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {13919#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:58,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {13919#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13862#true} is VALID [2022-04-28 14:48:58,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-28 14:48:58,352 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13862#true} {13899#(= ~setEventCalled~0 1)} #452#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {13899#(= ~setEventCalled~0 1)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(1 == ~tmp_ndt_3~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {13899#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {13899#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {13899#(= ~setEventCalled~0 1)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {13899#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,355 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #470#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {13862#true} call ULTIMATE.init(); {13900#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:58,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {13900#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {13862#true} is VALID [2022-04-28 14:48:58,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-28 14:48:58,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13862#true} {13862#true} #462#return; {13862#true} is VALID [2022-04-28 14:48:58,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {13862#true} call #t~ret35 := main(); {13862#true} is VALID [2022-04-28 14:48:58,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {13862#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {13862#true} is VALID [2022-04-28 14:48:58,358 INFO L272 TraceCheckUtils]: 6: Hoare triple {13862#true} call _BLAST_init(); {13901#(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-28 14:48:58,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {13901#(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; {13862#true} is VALID [2022-04-28 14:48:58,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-28 14:48:58,358 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {13862#true} {13862#true} #442#return; {13862#true} is VALID [2022-04-28 14:48:58,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {13862#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; {13862#true} is VALID [2022-04-28 14:48:58,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {13862#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {13862#true} is VALID [2022-04-28 14:48:58,359 INFO L272 TraceCheckUtils]: 12: Hoare triple {13862#true} call stub_driver_init(); {13902#(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-28 14:48:58,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {13902#(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; {13862#true} is VALID [2022-04-28 14:48:58,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-28 14:48:58,359 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13862#true} {13862#true} #444#return; {13862#true} is VALID [2022-04-28 14:48:58,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {13862#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {13862#true} is VALID [2022-04-28 14:48:58,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {13862#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {13862#true} is VALID [2022-04-28 14:48:58,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {13862#true} assume 3 == ~tmp_ndt_1~0; {13862#true} is VALID [2022-04-28 14:48:58,360 INFO L272 TraceCheckUtils]: 19: Hoare triple {13862#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {13862#true} is VALID [2022-04-28 14:48:58,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {13862#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; {13862#true} is VALID [2022-04-28 14:48:58,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {13862#true} assume 0 == ~irpStack__MinorFunction~0; {13862#true} is VALID [2022-04-28 14:48:58,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {13862#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {13862#true} is VALID [2022-04-28 14:48:58,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {13862#true} assume !(~s~0 != ~NP~0); {13862#true} is VALID [2022-04-28 14:48:58,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {13862#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {13862#true} is VALID [2022-04-28 14:48:58,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {13862#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {13862#true} is VALID [2022-04-28 14:48:58,361 INFO L272 TraceCheckUtils]: 26: Hoare triple {13862#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {13903#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:58,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {13903#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {13862#true} is VALID [2022-04-28 14:48:58,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {13862#true} assume 0 != ~compRegistered~0; {13862#true} is VALID [2022-04-28 14:48:58,362 INFO L272 TraceCheckUtils]: 29: Hoare triple {13862#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:58,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {13862#true} is VALID [2022-04-28 14:48:58,363 INFO L272 TraceCheckUtils]: 31: Hoare triple {13862#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:58,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {13915#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,364 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #440#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,365 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #450#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,366 INFO L272 TraceCheckUtils]: 39: Hoare triple {13899#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {13919#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:58,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {13919#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {13862#true} is VALID [2022-04-28 14:48:58,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {13862#true} assume true; {13862#true} is VALID [2022-04-28 14:48:58,366 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {13862#true} {13899#(= ~setEventCalled~0 1)} #452#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {13899#(= ~setEventCalled~0 1)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(1 == ~tmp_ndt_3~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,368 INFO L290 TraceCheckUtils]: 46: Hoare triple {13899#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,368 INFO L290 TraceCheckUtils]: 48: Hoare triple {13899#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {13899#(= ~setEventCalled~0 1)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {13899#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {13899#(= ~setEventCalled~0 1)} assume true; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,370 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13899#(= ~setEventCalled~0 1)} {13862#true} #470#return; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {13899#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,370 INFO L290 TraceCheckUtils]: 54: Hoare triple {13899#(= ~setEventCalled~0 1)} assume 259 == ~__cil_tmp23~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,371 INFO L272 TraceCheckUtils]: 55: Hoare triple {13899#(= ~setEventCalled~0 1)} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {13899#(= ~setEventCalled~0 1)} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {13899#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR3~0; {13899#(= ~setEventCalled~0 1)} is VALID [2022-04-28 14:48:58,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {13899#(= ~setEventCalled~0 1)} assume !(1 == ~setEventCalled~0); {13863#false} is VALID [2022-04-28 14:48:58,372 INFO L290 TraceCheckUtils]: 59: Hoare triple {13863#false} assume !(1 == ~customIrp~0); {13863#false} is VALID [2022-04-28 14:48:58,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {13863#false} assume ~s~0 == ~MPR3~0; {13863#false} is VALID [2022-04-28 14:48:58,372 INFO L272 TraceCheckUtils]: 61: Hoare triple {13863#false} call errorFn(); {13863#false} is VALID [2022-04-28 14:48:58,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {13863#false} assume !false; {13863#false} is VALID [2022-04-28 14:48:58,373 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-28 14:48:58,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:58,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122077898] [2022-04-28 14:48:58,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122077898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:58,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:58,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:48:58,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:58,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189436054] [2022-04-28 14:48:58,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189436054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:58,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:58,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:48:58,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343577365] [2022-04-28 14:48:58,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:58,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-28 14:48:58,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:58,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:58,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:58,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:48:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:48:58,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:48:58,412 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:58,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:58,744 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-04-28 14:48:58,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:48:58,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-28 14:48:58,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-28 14:48:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-28 14:48:58,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 103 transitions. [2022-04-28 14:48:58,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:58,829 INFO L225 Difference]: With dead ends: 107 [2022-04-28 14:48:58,829 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 14:48:58,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:48:58,830 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 72 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:58,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 139 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:48:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 14:48:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 14:48:58,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:48:58,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:48:58,891 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:48:58,891 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:48:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:58,892 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-28 14:48:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-28 14:48:58,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:58,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:58,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-28 14:48:58,893 INFO L87 Difference]: Start difference. First operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-28 14:48:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:58,894 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-28 14:48:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-28 14:48:58,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:48:58,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:48:58,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:48:58,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:48:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 14:48:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-28 14:48:58,895 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2022-04-28 14:48:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:48:58,895 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-28 14:48:58,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:58,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 79 transitions. [2022-04-28 14:48:58,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-28 14:48:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 14:48:58,980 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:48:58,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:48:58,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 14:48:58,980 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:48:58,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:48:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1942054886, now seen corresponding path program 1 times [2022-04-28 14:48:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:58,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152119154] [2022-04-28 14:48:58,981 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:48:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1942054886, now seen corresponding path program 2 times [2022-04-28 14:48:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:48:58,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237406772] [2022-04-28 14:48:58,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:48:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:48:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:48:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:59,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {14484#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {14446#true} is VALID [2022-04-28 14:48:59,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,055 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #462#return; {14446#true} is VALID [2022-04-28 14:48:59,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:48:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:59,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {14485#(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; {14446#true} is VALID [2022-04-28 14:48:59,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #442#return; {14446#true} is VALID [2022-04-28 14:48:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:59,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {14486#(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; {14446#true} is VALID [2022-04-28 14:48:59,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #444#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 14:48:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 14:48:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 14:48:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:59,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {14446#true} is VALID [2022-04-28 14:48:59,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-28 14:48:59,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {14446#true} is VALID [2022-04-28 14:48:59,118 INFO L272 TraceCheckUtils]: 1: Hoare triple {14446#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:59,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {14446#true} is VALID [2022-04-28 14:48:59,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,118 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-28 14:48:59,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {14446#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {14446#true} is VALID [2022-04-28 14:48:59,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,118 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14446#true} {14446#true} #450#return; {14446#true} is VALID [2022-04-28 14:48:59,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:48:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:48:59,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {14503#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {14446#true} is VALID [2022-04-28 14:48:59,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14446#true} {14446#true} #452#return; {14446#true} is VALID [2022-04-28 14:48:59,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {14487#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {14446#true} is VALID [2022-04-28 14:48:59,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {14446#true} assume 0 != ~compRegistered~0; {14446#true} is VALID [2022-04-28 14:48:59,126 INFO L272 TraceCheckUtils]: 2: Hoare triple {14446#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:59,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {14446#true} is VALID [2022-04-28 14:48:59,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {14446#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:59,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {14446#true} is VALID [2022-04-28 14:48:59,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,126 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-28 14:48:59,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {14446#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {14446#true} is VALID [2022-04-28 14:48:59,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14446#true} {14446#true} #450#return; {14446#true} is VALID [2022-04-28 14:48:59,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {14446#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {14446#true} is VALID [2022-04-28 14:48:59,127 INFO L272 TraceCheckUtils]: 12: Hoare triple {14446#true} call stubMoreProcessingRequired(); {14503#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:59,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {14503#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {14446#true} is VALID [2022-04-28 14:48:59,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,127 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14446#true} {14446#true} #452#return; {14446#true} is VALID [2022-04-28 14:48:59,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {14446#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {14446#true} is VALID [2022-04-28 14:48:59,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {14446#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {14446#true} is VALID [2022-04-28 14:48:59,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {14446#true} assume !(1 == ~tmp_ndt_3~0); {14446#true} is VALID [2022-04-28 14:48:59,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {14446#true} ~returnVal2~0 := 259; {14446#true} is VALID [2022-04-28 14:48:59,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {14446#true} assume !(~s~0 == ~NP~0); {14446#true} is VALID [2022-04-28 14:48:59,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {14446#true} assume ~s~0 == ~MPR1~0; {14446#true} is VALID [2022-04-28 14:48:59,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {14446#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {14446#true} is VALID [2022-04-28 14:48:59,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {14446#true} #res := ~returnVal2~0; {14446#true} is VALID [2022-04-28 14:48:59,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,128 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #470#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {14446#true} call ULTIMATE.init(); {14484#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:48:59,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {14484#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {14446#true} is VALID [2022-04-28 14:48:59,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14446#true} {14446#true} #462#return; {14446#true} is VALID [2022-04-28 14:48:59,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {14446#true} call #t~ret35 := main(); {14446#true} is VALID [2022-04-28 14:48:59,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {14446#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {14446#true} is VALID [2022-04-28 14:48:59,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {14446#true} call _BLAST_init(); {14485#(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-28 14:48:59,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {14485#(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; {14446#true} is VALID [2022-04-28 14:48:59,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,131 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {14446#true} {14446#true} #442#return; {14446#true} is VALID [2022-04-28 14:48:59,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {14446#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; {14446#true} is VALID [2022-04-28 14:48:59,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {14446#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,132 INFO L272 TraceCheckUtils]: 12: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} call stub_driver_init(); {14486#(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-28 14:48:59,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {14486#(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; {14446#true} is VALID [2022-04-28 14:48:59,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,132 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #444#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume 3 == ~tmp_ndt_1~0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,133 INFO L272 TraceCheckUtils]: 19: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume 0 == ~irpStack__MinorFunction~0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume !(~s~0 != ~NP~0); {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,136 INFO L272 TraceCheckUtils]: 26: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {14487#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:48:59,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {14487#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {14446#true} is VALID [2022-04-28 14:48:59,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {14446#true} assume 0 != ~compRegistered~0; {14446#true} is VALID [2022-04-28 14:48:59,136 INFO L272 TraceCheckUtils]: 29: Hoare triple {14446#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:59,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {14446#true} is VALID [2022-04-28 14:48:59,137 INFO L272 TraceCheckUtils]: 31: Hoare triple {14446#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:48:59,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {14499#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {14446#true} is VALID [2022-04-28 14:48:59,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,137 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14446#true} {14446#true} #440#return; {14446#true} is VALID [2022-04-28 14:48:59,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {14446#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {14446#true} is VALID [2022-04-28 14:48:59,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,137 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14446#true} {14446#true} #450#return; {14446#true} is VALID [2022-04-28 14:48:59,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {14446#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L272 TraceCheckUtils]: 39: Hoare triple {14446#true} call stubMoreProcessingRequired(); {14503#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:48:59,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {14503#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {14446#true} {14446#true} #452#return; {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {14446#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {14446#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {14446#true} assume !(1 == ~tmp_ndt_3~0); {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {14446#true} ~returnVal2~0 := 259; {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {14446#true} assume !(~s~0 == ~NP~0); {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {14446#true} assume ~s~0 == ~MPR1~0; {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {14446#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {14446#true} #res := ~returnVal2~0; {14446#true} is VALID [2022-04-28 14:48:59,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {14446#true} assume true; {14446#true} is VALID [2022-04-28 14:48:59,139 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14446#true} {14454#(<= (+ ~myStatus~0 1073741637) 0)} #470#return; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume !(259 == ~__cil_tmp23~0); {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,140 INFO L290 TraceCheckUtils]: 55: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume ~status~0 >= 0; {14454#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-28 14:48:59,140 INFO L290 TraceCheckUtils]: 56: Hoare triple {14454#(<= (+ ~myStatus~0 1073741637) 0)} assume ~myStatus~0 >= 0;~devExt__Started~0 := 1;~devExt__Removed~0 := 0;~devExt__SurpriseRemoved~0 := 0; {14447#false} is VALID [2022-04-28 14:48:59,140 INFO L290 TraceCheckUtils]: 57: Hoare triple {14447#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {14447#false} is VALID [2022-04-28 14:48:59,140 INFO L272 TraceCheckUtils]: 58: Hoare triple {14447#false} call IofCompleteRequest(~Irp, 0); {14447#false} is VALID [2022-04-28 14:48:59,140 INFO L290 TraceCheckUtils]: 59: Hoare triple {14447#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {14447#false} is VALID [2022-04-28 14:48:59,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {14447#false} assume !(~s~0 == ~NP~0); {14447#false} is VALID [2022-04-28 14:48:59,141 INFO L272 TraceCheckUtils]: 61: Hoare triple {14447#false} call errorFn(); {14447#false} is VALID [2022-04-28 14:48:59,141 INFO L290 TraceCheckUtils]: 62: Hoare triple {14447#false} assume !false; {14447#false} is VALID [2022-04-28 14:48:59,141 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-28 14:48:59,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:48:59,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237406772] [2022-04-28 14:48:59,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237406772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:59,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:59,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:48:59,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:48:59,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152119154] [2022-04-28 14:48:59,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152119154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:48:59,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:48:59,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:48:59,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413778641] [2022-04-28 14:48:59,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:48:59,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-28 14:48:59,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:48:59,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:59,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:59,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:48:59,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:48:59,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:48:59,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:48:59,176 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:48:59,804 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-04-28 14:48:59,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 14:48:59,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-28 14:48:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:48:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-04-28 14:48:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:48:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-04-28 14:48:59,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 146 transitions. [2022-04-28 14:48:59,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:48:59,938 INFO L225 Difference]: With dead ends: 141 [2022-04-28 14:48:59,938 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 14:48:59,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:48:59,939 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 89 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:48:59,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 160 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:48:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 14:49:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-04-28 14:49:00,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:49:00,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:49:00,046 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:49:00,046 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:49:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:49:00,055 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-28 14:49:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2022-04-28 14:49:00,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:49:00,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:49:00,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 134 states. [2022-04-28 14:49:00,055 INFO L87 Difference]: Start difference. First operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 134 states. [2022-04-28 14:49:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:49:00,057 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-28 14:49:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2022-04-28 14:49:00,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:49:00,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:49:00,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:49:00,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:49:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:49:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2022-04-28 14:49:00,059 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2022-04-28 14:49:00,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:49:00,059 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2022-04-28 14:49:00,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 14:49:00,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 138 transitions. [2022-04-28 14:49:00,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:49:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2022-04-28 14:49:00,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 14:49:00,219 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:49:00,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:49:00,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 14:49:00,219 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:49:00,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:49:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash -577905048, now seen corresponding path program 1 times [2022-04-28 14:49:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:49:00,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [595438424] [2022-04-28 14:49:00,219 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:49:00,220 INFO L85 PathProgramCache]: Analyzing trace with hash -577905048, now seen corresponding path program 2 times [2022-04-28 14:49:00,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:49:00,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531846123] [2022-04-28 14:49:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:49:00,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:49:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:00,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:49:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:00,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {15370#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {15331#true} is VALID [2022-04-28 14:49:00,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #462#return; {15331#true} is VALID [2022-04-28 14:49:00,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:49:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:00,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {15371#(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; {15331#true} is VALID [2022-04-28 14:49:00,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #442#return; {15331#true} is VALID [2022-04-28 14:49:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:49:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:00,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {15372#(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; {15331#true} is VALID [2022-04-28 14:49:00,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #444#return; {15331#true} is VALID [2022-04-28 14:49:00,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 14:49:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:00,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 14:49:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:00,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 14:49:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:00,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {15331#true} is VALID [2022-04-28 14:49:00,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-28 14:49:00,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {15331#true} is VALID [2022-04-28 14:49:00,420 INFO L272 TraceCheckUtils]: 1: Hoare triple {15331#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:49:00,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {15331#true} is VALID [2022-04-28 14:49:00,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,420 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-28 14:49:00,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {15331#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {15331#true} is VALID [2022-04-28 14:49:00,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,420 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15331#true} {15331#true} #450#return; {15331#true} is VALID [2022-04-28 14:49:00,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:49:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:00,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {15391#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {15331#true} is VALID [2022-04-28 14:49:00,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15331#true} {15331#true} #452#return; {15331#true} is VALID [2022-04-28 14:49:00,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {15373#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {15331#true} is VALID [2022-04-28 14:49:00,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {15331#true} assume 0 != ~compRegistered~0; {15331#true} is VALID [2022-04-28 14:49:00,430 INFO L272 TraceCheckUtils]: 2: Hoare triple {15331#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:49:00,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {15331#true} is VALID [2022-04-28 14:49:00,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {15331#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:49:00,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {15331#true} is VALID [2022-04-28 14:49:00,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,431 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-28 14:49:00,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {15331#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {15331#true} is VALID [2022-04-28 14:49:00,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15331#true} {15331#true} #450#return; {15331#true} is VALID [2022-04-28 14:49:00,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {15331#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {15331#true} is VALID [2022-04-28 14:49:00,432 INFO L272 TraceCheckUtils]: 12: Hoare triple {15331#true} call stubMoreProcessingRequired(); {15391#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:49:00,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {15391#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {15331#true} is VALID [2022-04-28 14:49:00,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,432 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15331#true} {15331#true} #452#return; {15331#true} is VALID [2022-04-28 14:49:00,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {15331#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {15331#true} is VALID [2022-04-28 14:49:00,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {15331#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {15331#true} is VALID [2022-04-28 14:49:00,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {15331#true} assume !(1 == ~tmp_ndt_3~0); {15331#true} is VALID [2022-04-28 14:49:00,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {15331#true} ~returnVal2~0 := 259; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-28 14:49:00,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-28 14:49:00,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-28 14:49:00,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-28 14:49:00,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-28 14:49:00,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} assume true; {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-28 14:49:00,435 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} {15331#true} #470#return; {15368#(and (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|))} is VALID [2022-04-28 14:49:00,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {15331#true} call ULTIMATE.init(); {15370#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:49:00,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {15370#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {15331#true} is VALID [2022-04-28 14:49:00,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15331#true} {15331#true} #462#return; {15331#true} is VALID [2022-04-28 14:49:00,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {15331#true} call #t~ret35 := main(); {15331#true} is VALID [2022-04-28 14:49:00,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {15331#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {15331#true} is VALID [2022-04-28 14:49:00,437 INFO L272 TraceCheckUtils]: 6: Hoare triple {15331#true} call _BLAST_init(); {15371#(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-28 14:49:00,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {15371#(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; {15331#true} is VALID [2022-04-28 14:49:00,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,437 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {15331#true} {15331#true} #442#return; {15331#true} is VALID [2022-04-28 14:49:00,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {15331#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; {15331#true} is VALID [2022-04-28 14:49:00,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {15331#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {15331#true} is VALID [2022-04-28 14:49:00,438 INFO L272 TraceCheckUtils]: 12: Hoare triple {15331#true} call stub_driver_init(); {15372#(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-28 14:49:00,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {15372#(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; {15331#true} is VALID [2022-04-28 14:49:00,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,438 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15331#true} {15331#true} #444#return; {15331#true} is VALID [2022-04-28 14:49:00,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {15331#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {15331#true} is VALID [2022-04-28 14:49:00,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {15331#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {15331#true} is VALID [2022-04-28 14:49:00,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {15331#true} assume 3 == ~tmp_ndt_1~0; {15331#true} is VALID [2022-04-28 14:49:00,439 INFO L272 TraceCheckUtils]: 19: Hoare triple {15331#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {15331#true} is VALID [2022-04-28 14:49:00,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {15331#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; {15331#true} is VALID [2022-04-28 14:49:00,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {15331#true} assume 0 == ~irpStack__MinorFunction~0; {15331#true} is VALID [2022-04-28 14:49:00,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {15331#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {15331#true} is VALID [2022-04-28 14:49:00,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {15331#true} assume !(~s~0 != ~NP~0); {15331#true} is VALID [2022-04-28 14:49:00,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {15331#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {15331#true} is VALID [2022-04-28 14:49:00,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {15331#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {15331#true} is VALID [2022-04-28 14:49:00,440 INFO L272 TraceCheckUtils]: 26: Hoare triple {15331#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {15373#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:00,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {15373#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {15331#true} is VALID [2022-04-28 14:49:00,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {15331#true} assume 0 != ~compRegistered~0; {15331#true} is VALID [2022-04-28 14:49:00,440 INFO L272 TraceCheckUtils]: 29: Hoare triple {15331#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:49:00,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {15331#true} is VALID [2022-04-28 14:49:00,441 INFO L272 TraceCheckUtils]: 31: Hoare triple {15331#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:49:00,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {15387#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {15331#true} is VALID [2022-04-28 14:49:00,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,441 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15331#true} {15331#true} #440#return; {15331#true} is VALID [2022-04-28 14:49:00,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {15331#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {15331#true} is VALID [2022-04-28 14:49:00,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,441 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {15331#true} {15331#true} #450#return; {15331#true} is VALID [2022-04-28 14:49:00,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {15331#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {15331#true} is VALID [2022-04-28 14:49:00,442 INFO L272 TraceCheckUtils]: 39: Hoare triple {15331#true} call stubMoreProcessingRequired(); {15391#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:49:00,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {15391#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {15331#true} is VALID [2022-04-28 14:49:00,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {15331#true} assume true; {15331#true} is VALID [2022-04-28 14:49:00,442 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15331#true} {15331#true} #452#return; {15331#true} is VALID [2022-04-28 14:49:00,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {15331#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {15331#true} is VALID [2022-04-28 14:49:00,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {15331#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {15331#true} is VALID [2022-04-28 14:49:00,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {15331#true} assume !(1 == ~tmp_ndt_3~0); {15331#true} is VALID [2022-04-28 14:49:00,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {15331#true} ~returnVal2~0 := 259; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-28 14:49:00,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-28 14:49:00,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-28 14:49:00,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-28 14:49:00,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {15385#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-28 14:49:00,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} assume true; {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-28 14:49:00,445 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15386#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} {15331#true} #470#return; {15368#(and (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|))} is VALID [2022-04-28 14:49:00,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {15368#(and (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {15369#(and (< 258 KbFilter_PnP_~__cil_tmp23~0) (<= KbFilter_PnP_~__cil_tmp23~0 259))} is VALID [2022-04-28 14:49:00,445 INFO L290 TraceCheckUtils]: 54: Hoare triple {15369#(and (< 258 KbFilter_PnP_~__cil_tmp23~0) (<= KbFilter_PnP_~__cil_tmp23~0 259))} assume !(259 == ~__cil_tmp23~0); {15332#false} is VALID [2022-04-28 14:49:00,445 INFO L290 TraceCheckUtils]: 55: Hoare triple {15332#false} assume ~status~0 >= 0; {15332#false} is VALID [2022-04-28 14:49:00,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {15332#false} assume !(~myStatus~0 >= 0); {15332#false} is VALID [2022-04-28 14:49:00,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {15332#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {15332#false} is VALID [2022-04-28 14:49:00,446 INFO L272 TraceCheckUtils]: 58: Hoare triple {15332#false} call IofCompleteRequest(~Irp, 0); {15332#false} is VALID [2022-04-28 14:49:00,446 INFO L290 TraceCheckUtils]: 59: Hoare triple {15332#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {15332#false} is VALID [2022-04-28 14:49:00,446 INFO L290 TraceCheckUtils]: 60: Hoare triple {15332#false} assume !(~s~0 == ~NP~0); {15332#false} is VALID [2022-04-28 14:49:00,446 INFO L272 TraceCheckUtils]: 61: Hoare triple {15332#false} call errorFn(); {15332#false} is VALID [2022-04-28 14:49:00,446 INFO L290 TraceCheckUtils]: 62: Hoare triple {15332#false} assume !false; {15332#false} is VALID [2022-04-28 14:49:00,446 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-28 14:49:00,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:49:00,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531846123] [2022-04-28 14:49:00,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531846123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:49:00,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:49:00,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:49:00,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:49:00,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [595438424] [2022-04-28 14:49:00,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [595438424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:49:00,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:49:00,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 14:49:00,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528812201] [2022-04-28 14:49:00,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:49:00,449 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-04-28 14:49:00,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:49:00,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:49:00,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:49:00,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 14:49:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:49:00,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 14:49:00,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:49:00,490 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:49:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:49:01,159 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-04-28 14:49:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:49:01,159 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-04-28 14:49:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:49:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:49:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-04-28 14:49:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:49:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-04-28 14:49:01,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2022-04-28 14:49:01,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:49:01,239 INFO L225 Difference]: With dead ends: 144 [2022-04-28 14:49:01,239 INFO L226 Difference]: Without dead ends: 133 [2022-04-28 14:49:01,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:49:01,241 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 97 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:49:01,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 244 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:49:01,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-28 14:49:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-04-28 14:49:01,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:49:01,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:49:01,354 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:49:01,355 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:49:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:49:01,357 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-28 14:49:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-28 14:49:01,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:49:01,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:49:01,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 133 states. [2022-04-28 14:49:01,359 INFO L87 Difference]: Start difference. First operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 133 states. [2022-04-28 14:49:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:49:01,361 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-28 14:49:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-28 14:49:01,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:49:01,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:49:01,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:49:01,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:49:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 14:49:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-04-28 14:49:01,363 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2022-04-28 14:49:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:49:01,363 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-04-28 14:49:01,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 14:49:01,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 136 transitions. [2022-04-28 14:49:01,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:49:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-28 14:49:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 14:49:01,511 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:49:01,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:49:01,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 14:49:01,512 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:49:01,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:49:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1364815011, now seen corresponding path program 1 times [2022-04-28 14:49:01,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:49:01,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837497803] [2022-04-28 14:49:01,512 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:49:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1364815011, now seen corresponding path program 2 times [2022-04-28 14:49:01,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:49:01,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147918305] [2022-04-28 14:49:01,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:49:01,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:49:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:01,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:49:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:01,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {16263#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {16216#true} is VALID [2022-04-28 14:49:01,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #462#return; {16216#true} is VALID [2022-04-28 14:49:01,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:49:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:01,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {16264#(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; {16216#true} is VALID [2022-04-28 14:49:01,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #442#return; {16216#true} is VALID [2022-04-28 14:49:01,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:49:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:01,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {16265#(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; {16216#true} is VALID [2022-04-28 14:49:01,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #444#return; {16216#true} is VALID [2022-04-28 14:49:01,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 14:49:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:01,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-28 14:49:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:01,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 14:49:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:01,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {16216#true} is VALID [2022-04-28 14:49:01,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-28 14:49:01,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {16216#true} is VALID [2022-04-28 14:49:01,628 INFO L272 TraceCheckUtils]: 1: Hoare triple {16216#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:49:01,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {16216#true} is VALID [2022-04-28 14:49:01,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,628 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-28 14:49:01,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {16216#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {16216#true} is VALID [2022-04-28 14:49:01,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,628 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16216#true} {16216#true} #450#return; {16216#true} is VALID [2022-04-28 14:49:01,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:49:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:01,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {16282#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {16216#true} is VALID [2022-04-28 14:49:01,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16216#true} {16216#true} #452#return; {16216#true} is VALID [2022-04-28 14:49:01,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {16266#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {16216#true} is VALID [2022-04-28 14:49:01,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#true} assume 0 != ~compRegistered~0; {16216#true} is VALID [2022-04-28 14:49:01,639 INFO L272 TraceCheckUtils]: 2: Hoare triple {16216#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:49:01,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {16216#true} is VALID [2022-04-28 14:49:01,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {16216#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:49:01,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {16216#true} is VALID [2022-04-28 14:49:01,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,640 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-28 14:49:01,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {16216#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {16216#true} is VALID [2022-04-28 14:49:01,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,641 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16216#true} {16216#true} #450#return; {16216#true} is VALID [2022-04-28 14:49:01,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {16216#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {16216#true} is VALID [2022-04-28 14:49:01,641 INFO L272 TraceCheckUtils]: 12: Hoare triple {16216#true} call stubMoreProcessingRequired(); {16282#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:49:01,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {16282#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {16216#true} is VALID [2022-04-28 14:49:01,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,641 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16216#true} {16216#true} #452#return; {16216#true} is VALID [2022-04-28 14:49:01,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {16216#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {16216#true} is VALID [2022-04-28 14:49:01,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {16216#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {16216#true} is VALID [2022-04-28 14:49:01,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {16216#true} assume !(1 == ~tmp_ndt_3~0); {16216#true} is VALID [2022-04-28 14:49:01,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {16216#true} ~returnVal2~0 := 259; {16216#true} is VALID [2022-04-28 14:49:01,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {16216#true} assume !(~s~0 == ~NP~0); {16216#true} is VALID [2022-04-28 14:49:01,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {16216#true} assume ~s~0 == ~MPR1~0; {16216#true} is VALID [2022-04-28 14:49:01,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {16216#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-28 14:49:01,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {16253#(= ~MPR3~0 ~s~0)} #res := ~returnVal2~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-28 14:49:01,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {16253#(= ~MPR3~0 ~s~0)} assume true; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-28 14:49:01,644 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16253#(= ~MPR3~0 ~s~0)} {16216#true} #470#return; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-28 14:49:01,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-28 14:49:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:49:01,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {16283#(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; {16282#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:49:01,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {16282#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~MPR3~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume !(1 == ~customIrp~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume !(~s~0 == ~MPR3~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} havoc ~tmp_ndt_4~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp_ndt_4~0 := #t~nondet33;havoc #t~nondet33; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume 0 == ~tmp_ndt_4~0; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} #res := 0; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume true; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,666 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16284#(not (= ~MPR3~0 |old(~s~0)|))} {16253#(= ~MPR3~0 ~s~0)} #472#return; {16217#false} is VALID [2022-04-28 14:49:01,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {16216#true} call ULTIMATE.init(); {16263#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:49:01,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {16263#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {16216#true} is VALID [2022-04-28 14:49:01,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16216#true} {16216#true} #462#return; {16216#true} is VALID [2022-04-28 14:49:01,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {16216#true} call #t~ret35 := main(); {16216#true} is VALID [2022-04-28 14:49:01,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {16216#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {16216#true} is VALID [2022-04-28 14:49:01,669 INFO L272 TraceCheckUtils]: 6: Hoare triple {16216#true} call _BLAST_init(); {16264#(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-28 14:49:01,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {16264#(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; {16216#true} is VALID [2022-04-28 14:49:01,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,669 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {16216#true} {16216#true} #442#return; {16216#true} is VALID [2022-04-28 14:49:01,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {16216#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; {16216#true} is VALID [2022-04-28 14:49:01,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {16216#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {16216#true} is VALID [2022-04-28 14:49:01,670 INFO L272 TraceCheckUtils]: 12: Hoare triple {16216#true} call stub_driver_init(); {16265#(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-28 14:49:01,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {16265#(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; {16216#true} is VALID [2022-04-28 14:49:01,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16216#true} {16216#true} #444#return; {16216#true} is VALID [2022-04-28 14:49:01,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {16216#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {16216#true} is VALID [2022-04-28 14:49:01,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {16216#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {16216#true} is VALID [2022-04-28 14:49:01,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {16216#true} assume 3 == ~tmp_ndt_1~0; {16216#true} is VALID [2022-04-28 14:49:01,670 INFO L272 TraceCheckUtils]: 19: Hoare triple {16216#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {16216#true} is VALID [2022-04-28 14:49:01,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {16216#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; {16216#true} is VALID [2022-04-28 14:49:01,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {16216#true} assume 0 == ~irpStack__MinorFunction~0; {16216#true} is VALID [2022-04-28 14:49:01,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {16216#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {16216#true} is VALID [2022-04-28 14:49:01,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {16216#true} assume !(~s~0 != ~NP~0); {16216#true} is VALID [2022-04-28 14:49:01,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {16216#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {16216#true} is VALID [2022-04-28 14:49:01,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {16216#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {16216#true} is VALID [2022-04-28 14:49:01,671 INFO L272 TraceCheckUtils]: 26: Hoare triple {16216#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {16266#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {16266#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {16216#true} is VALID [2022-04-28 14:49:01,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {16216#true} assume 0 != ~compRegistered~0; {16216#true} is VALID [2022-04-28 14:49:01,672 INFO L272 TraceCheckUtils]: 29: Hoare triple {16216#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:49:01,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {16216#true} is VALID [2022-04-28 14:49:01,672 INFO L272 TraceCheckUtils]: 31: Hoare triple {16216#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-28 14:49:01,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {16278#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {16216#true} is VALID [2022-04-28 14:49:01,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,673 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16216#true} {16216#true} #440#return; {16216#true} is VALID [2022-04-28 14:49:01,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {16216#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {16216#true} is VALID [2022-04-28 14:49:01,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,673 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16216#true} {16216#true} #450#return; {16216#true} is VALID [2022-04-28 14:49:01,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {16216#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {16216#true} is VALID [2022-04-28 14:49:01,673 INFO L272 TraceCheckUtils]: 39: Hoare triple {16216#true} call stubMoreProcessingRequired(); {16282#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:49:01,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {16282#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {16216#true} is VALID [2022-04-28 14:49:01,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {16216#true} assume true; {16216#true} is VALID [2022-04-28 14:49:01,673 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16216#true} {16216#true} #452#return; {16216#true} is VALID [2022-04-28 14:49:01,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {16216#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {16216#true} is VALID [2022-04-28 14:49:01,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {16216#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {16216#true} is VALID [2022-04-28 14:49:01,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {16216#true} assume !(1 == ~tmp_ndt_3~0); {16216#true} is VALID [2022-04-28 14:49:01,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {16216#true} ~returnVal2~0 := 259; {16216#true} is VALID [2022-04-28 14:49:01,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {16216#true} assume !(~s~0 == ~NP~0); {16216#true} is VALID [2022-04-28 14:49:01,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {16216#true} assume ~s~0 == ~MPR1~0; {16216#true} is VALID [2022-04-28 14:49:01,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {16216#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-28 14:49:01,674 INFO L290 TraceCheckUtils]: 50: Hoare triple {16253#(= ~MPR3~0 ~s~0)} #res := ~returnVal2~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-28 14:49:01,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {16253#(= ~MPR3~0 ~s~0)} assume true; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-28 14:49:01,675 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16253#(= ~MPR3~0 ~s~0)} {16216#true} #470#return; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-28 14:49:01,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {16253#(= ~MPR3~0 ~s~0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-28 14:49:01,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {16253#(= ~MPR3~0 ~s~0)} assume 259 == ~__cil_tmp23~0; {16253#(= ~MPR3~0 ~s~0)} is VALID [2022-04-28 14:49:01,677 INFO L272 TraceCheckUtils]: 55: Hoare triple {16253#(= ~MPR3~0 ~s~0)} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {16283#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {16283#(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; {16282#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-28 14:49:01,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {16282#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~MPR3~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume !(1 == ~customIrp~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,678 INFO L290 TraceCheckUtils]: 59: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume !(~s~0 == ~MPR3~0); {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,678 INFO L290 TraceCheckUtils]: 60: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} havoc ~tmp_ndt_4~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp_ndt_4~0 := #t~nondet33;havoc #t~nondet33; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,678 INFO L290 TraceCheckUtils]: 61: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume 0 == ~tmp_ndt_4~0; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,678 INFO L290 TraceCheckUtils]: 62: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} #res := 0; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,679 INFO L290 TraceCheckUtils]: 63: Hoare triple {16284#(not (= ~MPR3~0 |old(~s~0)|))} assume true; {16284#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-28 14:49:01,679 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16284#(not (= ~MPR3~0 |old(~s~0)|))} {16253#(= ~MPR3~0 ~s~0)} #472#return; {16217#false} is VALID [2022-04-28 14:49:01,679 INFO L290 TraceCheckUtils]: 65: Hoare triple {16217#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;havoc #t~ret13; {16217#false} is VALID [2022-04-28 14:49:01,679 INFO L290 TraceCheckUtils]: 66: Hoare triple {16217#false} assume ~status~0 >= 0; {16217#false} is VALID [2022-04-28 14:49:01,680 INFO L290 TraceCheckUtils]: 67: Hoare triple {16217#false} assume !(~myStatus~0 >= 0); {16217#false} is VALID [2022-04-28 14:49:01,680 INFO L290 TraceCheckUtils]: 68: Hoare triple {16217#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {16217#false} is VALID [2022-04-28 14:49:01,680 INFO L272 TraceCheckUtils]: 69: Hoare triple {16217#false} call IofCompleteRequest(~Irp, 0); {16217#false} is VALID [2022-04-28 14:49:01,680 INFO L290 TraceCheckUtils]: 70: Hoare triple {16217#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {16217#false} is VALID [2022-04-28 14:49:01,680 INFO L290 TraceCheckUtils]: 71: Hoare triple {16217#false} assume !(~s~0 == ~NP~0); {16217#false} is VALID [2022-04-28 14:49:01,680 INFO L272 TraceCheckUtils]: 72: Hoare triple {16217#false} call errorFn(); {16217#false} is VALID [2022-04-28 14:49:01,680 INFO L290 TraceCheckUtils]: 73: Hoare triple {16217#false} assume !false; {16217#false} is VALID [2022-04-28 14:49:01,680 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-28 14:49:01,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:49:01,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147918305] [2022-04-28 14:49:01,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147918305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:49:01,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:49:01,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:49:01,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:49:01,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837497803] [2022-04-28 14:49:01,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837497803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:49:01,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:49:01,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 14:49:01,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503884979] [2022-04-28 14:49:01,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:49:01,681 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2022-04-28 14:49:01,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:49:01,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 14:49:01,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:49:01,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 14:49:01,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:49:01,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 14:49:01,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:49:01,722 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 14:49:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:49:02,184 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-28 14:49:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:49:02,184 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2022-04-28 14:49:02,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:49:02,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 14:49:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-28 14:49:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 14:49:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-28 14:49:02,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2022-04-28 14:49:02,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:49:02,258 INFO L225 Difference]: With dead ends: 133 [2022-04-28 14:49:02,258 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:49:02,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:49:02,259 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 63 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:49:02,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 14:49:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:49:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:49:02,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:49:02,260 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-28 14:49:02,260 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-28 14:49:02,260 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-28 14:49:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:49:02,260 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:49:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:49:02,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:49:02,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:49:02,260 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-28 14:49:02,260 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-28 14:49:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:49:02,260 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:49:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:49:02,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:49:02,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:49:02,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:49:02,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:49:02,261 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-28 14:49:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:49:02,261 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-04-28 14:49:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:49:02,261 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:49:02,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 14:49:02,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:49:02,261 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-28 14:49:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:49:02,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:49:02,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:49:02,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 14:49:02,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:49:09,194 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 14:49:09,194 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 14:49:09,194 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 14:49:09,194 INFO L895 garLoopResultBuilder]: At program point KeSetEventENTRY(lines 515 522) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,195 INFO L895 garLoopResultBuilder]: At program point KeSetEventFINAL(lines 515 522) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,195 INFO L895 garLoopResultBuilder]: At program point KeSetEventEXIT(lines 515 522) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,195 INFO L895 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 565 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,196 INFO L895 garLoopResultBuilder]: At program point L571(line 571) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,196 INFO L895 garLoopResultBuilder]: At program point L571-1(line 571) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,196 INFO L895 garLoopResultBuilder]: At program point KbFilter_CompleteFINAL(lines 565 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,196 INFO L895 garLoopResultBuilder]: At program point KbFilter_CompleteEXIT(lines 565 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,196 INFO L895 garLoopResultBuilder]: At program point stub_driver_initEXIT(lines 37 50) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= |old(~pended~0)| 0)) (and (= ~s~0 ~NP~0) (= ~pended~0 0) (= ~compRegistered~0 0))) [2022-04-28 14:49:09,196 INFO L895 garLoopResultBuilder]: At program point stub_driver_initENTRY(lines 37 50) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= |old(~pended~0)| 0))) [2022-04-28 14:49:09,196 INFO L895 garLoopResultBuilder]: At program point stub_driver_initFINAL(lines 37 50) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= |old(~pended~0)| 0)) (and (= ~s~0 ~NP~0) (= ~pended~0 0) (= ~compRegistered~0 0))) [2022-04-28 14:49:09,197 INFO L895 garLoopResultBuilder]: At program point _BLAST_initFINAL(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,197 INFO L895 garLoopResultBuilder]: At program point _BLAST_initENTRY(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~DC~0 |old(~DC~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,197 INFO L895 garLoopResultBuilder]: At program point _BLAST_initEXIT(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,197 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2022-04-28 14:49:09,197 INFO L902 garLoopResultBuilder]: At program point errorFnFINAL(lines 577 584) the Hoare annotation is: true [2022-04-28 14:49:09,197 INFO L902 garLoopResultBuilder]: At program point errorFnEXIT(lines 577 584) the Hoare annotation is: true [2022-04-28 14:49:09,197 INFO L902 garLoopResultBuilder]: At program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) the Hoare annotation is: true [2022-04-28 14:49:09,197 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 288 422) the Hoare annotation is: true [2022-04-28 14:49:09,197 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,197 INFO L895 garLoopResultBuilder]: At program point L359(line 359) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,198 INFO L895 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,198 INFO L902 garLoopResultBuilder]: At program point L409(lines 409 411) the Hoare annotation is: true [2022-04-28 14:49:09,198 INFO L895 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,198 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 288 422) the Hoare annotation is: true [2022-04-28 14:49:09,198 INFO L902 garLoopResultBuilder]: At program point L385(lines 369 418) the Hoare annotation is: true [2022-04-28 14:49:09,198 INFO L895 garLoopResultBuilder]: At program point L352(lines 352 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,199 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 288 422) the Hoare annotation is: (or (and (= |old(~Executive~0)| ~Executive~0) (= ~DC~0 |old(~DC~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,199 INFO L895 garLoopResultBuilder]: At program point L386(lines 386 415) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,199 INFO L895 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,199 INFO L895 garLoopResultBuilder]: At program point L378(lines 378 382) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,199 INFO L895 garLoopResultBuilder]: At program point L370(lines 370 374) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (= ~s~0 ~NP~0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,199 INFO L895 garLoopResultBuilder]: At program point L337(lines 323 368) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,199 INFO L895 garLoopResultBuilder]: At program point L387(lines 387 414) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,199 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,199 INFO L895 garLoopResultBuilder]: At program point L321-1(lines 297 421) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,200 INFO L902 garLoopResultBuilder]: At program point L404(lines 404 412) the Hoare annotation is: true [2022-04-28 14:49:09,201 INFO L895 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,201 INFO L895 garLoopResultBuilder]: At program point L388(lines 388 394) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,201 INFO L895 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,201 INFO L902 garLoopResultBuilder]: At program point L405(lines 405 407) the Hoare annotation is: true [2022-04-28 14:49:09,201 INFO L895 garLoopResultBuilder]: At program point L389(lines 389 391) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,201 INFO L895 garLoopResultBuilder]: At program point L323(lines 297 421) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,201 INFO L895 garLoopResultBuilder]: At program point L340-1(lines 339 349) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,201 INFO L895 garLoopResultBuilder]: At program point L398(lines 398 402) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,201 INFO L895 garLoopResultBuilder]: At program point L332(lines 332 335) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,201 INFO L895 garLoopResultBuilder]: At program point L332-2(lines 332 335) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-28 14:49:09,201 INFO L895 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~MPR1~0 ~s~0) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-28 14:49:09,201 INFO L895 garLoopResultBuilder]: At program point L445(lines 445 448) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3) (or .cse0 .cse1 (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-28 14:49:09,202 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 445 448) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-28 14:49:09,202 INFO L895 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3) (or .cse0 .cse1 (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-28 14:49:09,202 INFO L895 garLoopResultBuilder]: At program point IofCallDriverFINAL(lines 437 500) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2) (let ((.cse3 (= ~setEventCalled~0 1)) (.cse5 (<= 259 |IofCallDriver_#res|)) (.cse8 (<= 259 IofCallDriver_~returnVal2~0)) (.cse4 (= ~NP~0 |old(~s~0)|)) (.cse6 (not .cse0)) (.cse7 (= ~NP~0 1)) (.cse9 (= ~s~0 |old(~s~0)|))) (or .cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not .cse7) (not .cse4) (not (<= 5 ~MPR1~0)) (and .cse3 (<= IofCallDriver_~returnVal2~0 259) .cse5 (<= |IofCallDriver_#res| 259) .cse8 (= ~MPR3~0 ~s~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse4 .cse6 .cse7 .cse9 (<= |IofCallDriver_#res| 0)) .cse1 .cse2)))) [2022-04-28 14:49:09,202 INFO L895 garLoopResultBuilder]: At program point L479(lines 479 496) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0))) (or .cse0 (and (<= IofCallDriver_~returnVal2~0 0) .cse1) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3)) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-28 14:49:09,202 INFO L895 garLoopResultBuilder]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-28 14:49:09,202 INFO L895 garLoopResultBuilder]: At program point L446-1(line 446) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-28 14:49:09,202 INFO L895 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0))) (or .cse0 (and (<= IofCallDriver_~returnVal2~0 0) .cse1) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3)) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-28 14:49:09,202 INFO L895 garLoopResultBuilder]: At program point IofCallDriverEXIT(lines 437 500) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2) (let ((.cse3 (= ~setEventCalled~0 1)) (.cse5 (<= 259 |IofCallDriver_#res|)) (.cse8 (<= 259 IofCallDriver_~returnVal2~0)) (.cse4 (= ~NP~0 |old(~s~0)|)) (.cse6 (not .cse0)) (.cse7 (= ~NP~0 1)) (.cse9 (= ~s~0 |old(~s~0)|))) (or .cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not .cse7) (not .cse4) (not (<= 5 ~MPR1~0)) (and .cse3 (<= IofCallDriver_~returnVal2~0 259) .cse5 (<= |IofCallDriver_#res| 259) .cse8 (= ~MPR3~0 ~s~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse4 .cse6 .cse7 .cse9 (<= |IofCallDriver_#res| 0)) .cse1 .cse2)))) [2022-04-28 14:49:09,202 INFO L895 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-28 14:49:09,202 INFO L895 garLoopResultBuilder]: At program point L488(lines 488 495) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-28 14:49:09,202 INFO L895 garLoopResultBuilder]: At program point L451(lines 451 474) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-28 14:49:09,203 INFO L895 garLoopResultBuilder]: At program point L480(lines 480 486) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~MPR1~0 ~s~0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) .cse1 (= ~s~0 |old(~s~0)|)) (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or .cse0 (and (<= IofCallDriver_~returnVal2~0 0) .cse1) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3))) [2022-04-28 14:49:09,203 INFO L895 garLoopResultBuilder]: At program point L447(line 447) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-28 14:49:09,203 INFO L895 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-28 14:49:09,203 INFO L895 garLoopResultBuilder]: At program point L493-1(lines 475 497) the Hoare annotation is: (let ((.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2) (let ((.cse6 (= ~setEventCalled~0 1)) (.cse7 (<= 259 IofCallDriver_~returnVal2~0)) (.cse5 (<= 5 ~MPR1~0)) (.cse4 (= ~NP~0 |old(~s~0)|)) (.cse8 (not .cse0)) (.cse3 (= ~NP~0 1)) (.cse9 (= ~s~0 |old(~s~0)|))) (or .cse0 (not .cse3) (not .cse4) (not .cse5) (and .cse6 (<= IofCallDriver_~returnVal2~0 259) .cse7 (= ~MPR3~0 ~s~0)) (and .cse6 .cse5 .cse4 .cse8 .cse3 .cse7 .cse9) (and .cse5 (<= IofCallDriver_~returnVal2~0 0) .cse4 .cse8 .cse3 .cse9) .cse1 .cse2)))) [2022-04-28 14:49:09,203 INFO L895 garLoopResultBuilder]: At program point L456(lines 456 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-28 14:49:09,203 INFO L895 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~MPR1~0 ~s~0) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-28 14:49:09,203 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,203 INFO L895 garLoopResultBuilder]: At program point L431-1(lines 423 436) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,204 INFO L895 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 423 436) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-04-28 14:49:09,204 INFO L895 garLoopResultBuilder]: At program point stubMoreProcessingRequiredEXIT(lines 423 436) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,204 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-04-28 14:49:09,204 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:49:09,204 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-04-28 14:49:09,204 INFO L895 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,204 INFO L895 garLoopResultBuilder]: At program point L541(lines 541 545) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,204 INFO L895 garLoopResultBuilder]: At program point L541-1(lines 528 547) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,204 INFO L895 garLoopResultBuilder]: At program point KeWaitForSingleObjectEXIT(lines 523 564) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point L529(lines 529 534) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (= ~compRegistered~0 0)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point L550(lines 550 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point KeWaitForSingleObjectFINAL(lines 523 564) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point L528(lines 528 547) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (= ~compRegistered~0 0)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 523 564) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (= ~compRegistered~0 0)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point L509(line 509) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-28 14:49:09,205 INFO L902 garLoopResultBuilder]: At program point L509-1(lines 501 514) the Hoare annotation is: true [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 501 514) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point L505(lines 505 511) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-04-28 14:49:09,205 INFO L902 garLoopResultBuilder]: At program point IofCompleteRequestEXIT(lines 501 514) the Hoare annotation is: true [2022-04-28 14:49:09,205 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:49:09,205 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-04-28 14:49:09,206 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:49:09,206 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:49:09,206 INFO L895 garLoopResultBuilder]: At program point L192(lines 192 198) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0))) (let ((.cse8 (= ~setEventCalled~0 1)) (.cse10 (<= 259 KbFilter_PnP_~status~0)) (.cse9 (not (= ~compRegistered~0 0))) (.cse13 (not .cse0)) (.cse15 (= ~s~0 |old(~s~0)|)) (.cse11 (<= 5 ~MPR1~0)) (.cse12 (= ~NP~0 |old(~s~0)|)) (.cse14 (= ~NP~0 1))) (let ((.cse1 (not .cse14)) (.cse2 (not .cse12)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not .cse11)) (.cse5 (and .cse11 .cse9 (not (= KbFilter_PnP_~__cil_tmp23~0 259)) .cse12 .cse13 .cse14 .cse15)) (.cse6 (and .cse8 .cse11 .cse9 .cse12 .cse13 .cse14 .cse10 .cse15)) (.cse7 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 (and .cse8 (< 258 KbFilter_PnP_~__cil_tmp23~0) .cse9 (<= KbFilter_PnP_~__cil_tmp23~0 259) .cse10 (= ~MPR3~0 ~s~0)) .cse4 .cse5 .cse6 .cse7))))) [2022-04-28 14:49:09,206 INFO L895 garLoopResultBuilder]: At program point L159(lines 159 265) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,206 INFO L895 garLoopResultBuilder]: At program point L126(lines 126 276) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,206 INFO L895 garLoopResultBuilder]: At program point L192-2(lines 166 261) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,206 INFO L895 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,206 INFO L895 garLoopResultBuilder]: At program point L242-1(line 242) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compRegistered~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,206 INFO L895 garLoopResultBuilder]: At program point L176(lines 176 182) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,207 INFO L895 garLoopResultBuilder]: At program point L176-1(lines 171 183) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= 5 ~MPR1~0))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~compRegistered~0 0)) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse5))) [2022-04-28 14:49:09,207 INFO L895 garLoopResultBuilder]: At program point L201(lines 201 205) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,207 INFO L895 garLoopResultBuilder]: At program point L135(lines 135 273) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,207 INFO L895 garLoopResultBuilder]: At program point L102(lines 102 284) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,207 INFO L895 garLoopResultBuilder]: At program point L226(lines 226 227) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,207 INFO L895 garLoopResultBuilder]: At program point L226-1(lines 226 227) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compRegistered~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,207 INFO L895 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L251-1(lines 247 253) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L144(lines 144 270) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L111(lines 111 281) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L194(lines 194 196) the Hoare annotation is: (let ((.cse4 (= ~setEventCalled~0 1)) (.cse5 (not (= ~compRegistered~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse6 (<= 259 KbFilter_PnP_~status~0)) (.cse10 (<= 5 ~MPR1~0)) (.cse11 (= ~NP~0 |old(~s~0)|)) (.cse12 (= ~NP~0 1))) (let ((.cse1 (not .cse12)) (.cse2 (not .cse11)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse7 (not .cse10)) (.cse8 (and .cse4 .cse10 .cse5 .cse11 (not .cse0) .cse12 .cse6 (= ~s~0 |old(~s~0)|))) (.cse9 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 (< 258 KbFilter_PnP_~__cil_tmp23~0) .cse5 (<= KbFilter_PnP_~__cil_tmp23~0 259) .cse6 (= ~MPR3~0 ~s~0)) .cse7 .cse8 .cse9) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse7 .cse8 .cse9)))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L194-1(lines 194 196) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L153(lines 153 267) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L120(lines 120 278) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L178(line 178) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L902 garLoopResultBuilder]: At program point KbFilter_PnPEXIT(lines 75 287) the Hoare annotation is: true [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L236-1(lines 232 238) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,208 INFO L895 garLoopResultBuilder]: At program point L162(lines 162 264) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,209 INFO L895 garLoopResultBuilder]: At program point L129(lines 129 275) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,209 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,209 INFO L895 garLoopResultBuilder]: At program point L187(lines 187 188) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= 5 ~MPR1~0))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~compRegistered~0 0)) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse5))) [2022-04-28 14:49:09,209 INFO L895 garLoopResultBuilder]: At program point L220-1(lines 216 222) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,209 INFO L895 garLoopResultBuilder]: At program point L187-1(lines 187 188) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0))) (let ((.cse2 (= ~setEventCalled~0 1)) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (<= 259 |KbFilter_PnP_#t~ret12|)) (.cse11 (not .cse0)) (.cse13 (= ~s~0 |old(~s~0)|)) (.cse14 (<= 5 ~MPR1~0)) (.cse15 (= ~NP~0 |old(~s~0)|)) (.cse12 (= ~NP~0 1))) (let ((.cse1 (not .cse12)) (.cse5 (not .cse15)) (.cse6 (not (= |old(~compRegistered~0)| 0))) (.cse7 (not .cse14)) (.cse8 (and .cse2 .cse14 .cse3 .cse4 .cse15 .cse11 .cse12 .cse13)) (.cse9 (and .cse3 (not (= |KbFilter_PnP_#t~ret12| 259)) .cse11 .cse12 .cse13)) (.cse10 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (and .cse2 (<= |KbFilter_PnP_#t~ret12| 259) .cse3 .cse4 (= ~MPR3~0 ~s~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))))) [2022-04-28 14:49:09,209 INFO L895 garLoopResultBuilder]: At program point KbFilter_PnPENTRY(lines 75 287) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,209 INFO L895 garLoopResultBuilder]: At program point L171(lines 171 183) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,209 INFO L895 garLoopResultBuilder]: At program point L138(lines 138 272) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,209 INFO L895 garLoopResultBuilder]: At program point L105(lines 105 283) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,209 INFO L902 garLoopResultBuilder]: At program point KbFilter_PnPFINAL(lines 75 287) the Hoare annotation is: true [2022-04-28 14:49:09,209 INFO L902 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: true [2022-04-28 14:49:09,209 INFO L895 garLoopResultBuilder]: At program point L147(lines 147 269) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L114(lines 114 280) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L156(lines 156 266) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L123(lines 123 277) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L132(lines 132 274) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L141(lines 141 271) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L108(lines 108 282) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L232(lines 232 238) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L257(lines 257 258) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L257-1(lines 257 258) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compRegistered~0 0)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L216(lines 216 222) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,210 INFO L895 garLoopResultBuilder]: At program point L150(lines 150 268) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,211 INFO L895 garLoopResultBuilder]: At program point L117(lines 117 279) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,211 INFO L895 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,211 INFO L895 garLoopResultBuilder]: At program point L200(lines 200 206) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-28 14:49:09,213 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 14:49:09,214 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:49:09,216 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:49:09,225 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:49:09,636 INFO L163 areAnnotationChecker]: CFG has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:49:09,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:49:09 BoogieIcfgContainer [2022-04-28 14:49:09,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:49:09,670 INFO L158 Benchmark]: Toolchain (without parser) took 32658.00ms. Allocated memory was 184.5MB in the beginning and 497.0MB in the end (delta: 312.5MB). Free memory was 135.5MB in the beginning and 181.8MB in the end (delta: -46.3MB). Peak memory consumption was 273.4MB. Max. memory is 8.0GB. [2022-04-28 14:49:09,670 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory was 152.1MB in the beginning and 152.0MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:49:09,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.50ms. Allocated memory is still 184.5MB. Free memory was 135.4MB in the beginning and 154.6MB in the end (delta: -19.2MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-04-28 14:49:09,670 INFO L158 Benchmark]: Boogie Preprocessor took 55.20ms. Allocated memory is still 184.5MB. Free memory was 154.6MB in the beginning and 152.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 14:49:09,670 INFO L158 Benchmark]: RCFGBuilder took 484.65ms. Allocated memory is still 184.5MB. Free memory was 152.5MB in the beginning and 124.7MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-04-28 14:49:09,670 INFO L158 Benchmark]: TraceAbstraction took 31773.36ms. Allocated memory was 184.5MB in the beginning and 497.0MB in the end (delta: 312.5MB). Free memory was 124.2MB in the beginning and 181.8MB in the end (delta: -57.6MB). Peak memory consumption was 262.3MB. Max. memory is 8.0GB. [2022-04-28 14:49:09,671 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.13ms. Allocated memory is still 184.5MB. Free memory was 152.1MB in the beginning and 152.0MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.50ms. Allocated memory is still 184.5MB. Free memory was 135.4MB in the beginning and 154.6MB in the end (delta: -19.2MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.20ms. Allocated memory is still 184.5MB. Free memory was 154.6MB in the beginning and 152.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 484.65ms. Allocated memory is still 184.5MB. Free memory was 152.5MB in the beginning and 124.7MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 31773.36ms. Allocated memory was 184.5MB in the beginning and 497.0MB in the end (delta: 312.5MB). Free memory was 124.2MB in the beginning and 181.8MB in the end (delta: -57.6MB). Peak memory consumption was 262.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 154 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3477 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3469 mSDsluCounter, 4456 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2445 mSDsCounter, 1020 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4231 IncrementalHoareTripleChecker+Invalid, 5251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1020 mSolverCounterUnsat, 2011 mSDtfsCounter, 4231 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 144 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 151 LocationsWithAnnotation, 805 PreInvPairs, 1062 NumberOfFragments, 6214 HoareAnnotationTreeSize, 805 FomulaSimplifications, 426 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 151 FomulaSimplificationsInter, 11576 FormulaSimplificationTreeSizeReductionInter, 6.1s 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: 352]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || (((((((status == 0 && 5 <= MPR1) && s == NP) && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || (returnVal2 <= 0 && MPR1 == s)) || (((setEventCalled == 1 && returnVal2 <= 259) && 259 <= returnVal2) && MPR1 == s)) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || status == 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || ((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && s == \old(s))) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) && ((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - ProcedureContractResult [Line: 515]: Procedure Contract for KeSetEvent Derived contract for procedure KeSetEvent: (((((SKIP1 == NP || !(NP == 1)) || setEventCalled == 1) || !(s == NP)) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0) - ProcedureContractResult [Line: 565]: Procedure Contract for KbFilter_Complete Derived contract for procedure KbFilter_Complete: (((((SKIP1 == NP || !(NP == 1)) || setEventCalled == 1) || !(s == NP)) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0) - ProcedureContractResult [Line: 37]: Procedure Contract for stub_driver_init Derived contract for procedure stub_driver_init: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(\old(pended) == 0)) || ((s == NP && pended == 0) && compRegistered == 0) - ProcedureContractResult [Line: 51]: Procedure Contract for _BLAST_init Derived contract for procedure _BLAST_init: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || (((((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && pended == 0) && compRegistered == 0) && !(MPR3 == s))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - ProcedureContractResult [Line: 577]: Procedure Contract for errorFn Derived contract for procedure errorFn: 1 - ProcedureContractResult [Line: 288]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 437]: Procedure Contract for IofCallDriver Derived contract for procedure IofCallDriver: ((((SKIP1 == NP || setEventCalled == \old(setEventCalled)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) && ((((((((SKIP1 == NP || ((((((setEventCalled == 1 && NP == \old(s)) && 259 <= \result) && !(SKIP1 == NP)) && NP == 1) && 259 <= returnVal2) && s == \old(s))) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= \result) && \result <= 259) && 259 <= returnVal2) && MPR3 == s)) || (((((returnVal2 <= 0 && NP == \old(s)) && !(SKIP1 == NP)) && NP == 1) && s == \old(s)) && \result <= 0)) || compRegistered == 0) || !(pended == 0)) - ProcedureContractResult [Line: 423]: Procedure Contract for stubMoreProcessingRequired Derived contract for procedure stubMoreProcessingRequired: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(setEventCalled == 1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0) - ProcedureContractResult [Line: 523]: Procedure Contract for KeWaitForSingleObject Derived contract for procedure KeWaitForSingleObject: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - ProcedureContractResult [Line: 501]: Procedure Contract for IofCompleteRequest Derived contract for procedure IofCompleteRequest: 1 - ProcedureContractResult [Line: 75]: Procedure Contract for KbFilter_PnP Derived contract for procedure KbFilter_PnP: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 14:49:09,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...