/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/cdaudio.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:59:40,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:59:40,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:59:40,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:59:40,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:59:40,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:59:40,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:59:40,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:59:40,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:59:40,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:59:40,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:59:40,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:59:40,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:59:40,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:59:40,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:59:40,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:59:40,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:59:40,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:59:40,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:59:40,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:59:40,240 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:59:40,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:59:40,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:59:40,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:59:40,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:59:40,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:59:40,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:59:40,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:59:40,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:59:40,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:59:40,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:59:40,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:59:40,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:59:40,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:59:40,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:59:40,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:59:40,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:59:40,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:59:40,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:59:40,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:59:40,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:59:40,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:59:40,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:59:40,269 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:59:40,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:59:40,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:59:40,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:59:40,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:59:40,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:59:40,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:59:40,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:59:40,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:59:40,272 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:59:40,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:59:40,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:59:40,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:59:40,272 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:59:40,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:59:40,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:59:40,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:59:40,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:59:40,273 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:59:40,273 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:59:40,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:59:40,273 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:59:40,274 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-08 14:59:40,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:59:40,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:59:40,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:59:40,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:59:40,524 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:59:40,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2022-04-08 14:59:40,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/401e83371/5770bb9f4be24e31af51fe44ff4be8bf/FLAG30d948385 [2022-04-08 14:59:41,293 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:59:41,294 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-2.c [2022-04-08 14:59:41,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/401e83371/5770bb9f4be24e31af51fe44ff4be8bf/FLAG30d948385 [2022-04-08 14:59:41,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/401e83371/5770bb9f4be24e31af51fe44ff4be8bf [2022-04-08 14:59:41,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:59:41,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:59:41,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:59:41,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:59:41,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:59:41,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:59:41" (1/1) ... [2022-04-08 14:59:41,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661f9b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:59:41, skipping insertion in model container [2022-04-08 14:59:41,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:59:41" (1/1) ... [2022-04-08 14:59:41,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:59:41,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:59:42,294 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/cdaudio.i.cil-2.c[90200,90213] [2022-04-08 14:59:43,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:59:43,054 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:59:43,135 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/cdaudio.i.cil-2.c[90200,90213] [2022-04-08 14:59:43,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:59:43,503 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:59:43,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:59:43 WrapperNode [2022-04-08 14:59:43,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:59:43,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:59:43,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:59:43,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:59:43,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:59:43" (1/1) ... [2022-04-08 14:59:43,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:59:43" (1/1) ... [2022-04-08 14:59:43,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:59:43" (1/1) ... [2022-04-08 14:59:43,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:59:43" (1/1) ... [2022-04-08 14:59:43,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:59:43" (1/1) ... [2022-04-08 14:59:43,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:59:43" (1/1) ... [2022-04-08 14:59:43,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:59:43" (1/1) ... [2022-04-08 14:59:43,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:59:43,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:59:43,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:59:43,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:59:43,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:59:43" (1/1) ... [2022-04-08 14:59:43,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:59:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:59:43,941 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-08 14:59:43,954 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-08 14:59:43,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:59:43,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:59:43,987 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:59:43,987 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2022-04-08 14:59:43,987 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-04-08 14:59:43,988 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-04-08 14:59:43,988 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-04-08 14:59:43,988 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-04-08 14:59:43,988 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-08 14:59:43,988 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-08 14:59:43,988 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-04-08 14:59:43,988 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2022-04-08 14:59:43,989 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-04-08 14:59:43,989 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-04-08 14:59:43,989 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-04-08 14:59:43,991 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-04-08 14:59:43,991 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2022-04-08 14:59:43,991 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2022-04-08 14:59:43,991 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-04-08 14:59:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-04-08 14:59:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-04-08 14:59:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2022-04-08 14:59:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2022-04-08 14:59:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2022-04-08 14:59:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2022-04-08 14:59:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2022-04-08 14:59:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-04-08 14:59:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-04-08 14:59:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-04-08 14:59:43,992 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-04-08 14:59:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-04-08 14:59:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-04-08 14:59:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-04-08 14:59:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-04-08 14:59:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-04-08 14:59:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-08 14:59:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:59:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-04-08 14:59:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-04-08 14:59:43,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-04-08 14:59:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-04-08 14:59:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-04-08 14:59:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-04-08 14:59:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-04-08 14:59:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-04-08 14:59:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-04-08 14:59:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-04-08 14:59:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-04-08 14:59:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-08 14:59:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-04-08 14:59:43,994 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-04-08 14:59:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-04-08 14:59:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-08 14:59:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-04-08 14:59:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-04-08 14:59:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-04-08 14:59:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-04-08 14:59:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-08 14:59:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-08 14:59:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-04-08 14:59:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-08 14:59:43,995 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-04-08 14:59:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-08 14:59:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-08 14:59:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-08 14:59:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-04-08 14:59:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-04-08 14:59:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-04-08 14:59:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-04-08 14:59:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-04-08 14:59:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-04-08 14:59:43,996 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-04-08 14:59:43,997 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-08 14:59:43,997 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-08 14:59:43,997 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-04-08 14:59:43,997 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-04-08 14:59:43,998 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-04-08 14:59:43,998 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-04-08 14:59:43,998 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-04-08 14:59:43,998 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-04-08 14:59:43,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-08 14:59:43,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-04-08 14:59:43,998 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-08 14:59:43,999 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-04-08 14:59:43,999 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-08 14:59:43,999 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-04-08 14:59:44,000 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-04-08 14:59:44,000 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-04-08 14:59:44,000 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-04-08 14:59:44,000 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-04-08 14:59:44,000 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-04-08 14:59:44,000 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-04-08 14:59:44,001 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-04-08 14:59:44,001 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-04-08 14:59:44,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-08 14:59:44,001 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-04-08 14:59:44,001 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-04-08 14:59:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:59:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:59:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:59:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:59:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 14:59:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:59:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 14:59:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 14:59:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 14:59:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 14:59:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2022-04-08 14:59:44,002 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-04-08 14:59:44,003 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-04-08 14:59:44,003 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-04-08 14:59:44,003 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2022-04-08 14:59:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-04-08 14:59:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-04-08 14:59:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-04-08 14:59:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-04-08 14:59:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-04-08 14:59:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-04-08 14:59:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-04-08 14:59:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-04-08 14:59:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:59:44,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:59:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-04-08 14:59:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-04-08 14:59:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-08 14:59:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-04-08 14:59:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-04-08 14:59:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-04-08 14:59:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-08 14:59:44,005 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-04-08 14:59:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-04-08 14:59:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-04-08 14:59:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-04-08 14:59:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-04-08 14:59:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-04-08 14:59:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-04-08 14:59:44,006 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-04-08 14:59:44,007 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-04-08 14:59:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-04-08 14:59:44,008 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-04-08 14:59:44,009 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-04-08 14:59:44,011 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-04-08 14:59:44,011 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-04-08 14:59:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-04-08 14:59:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-04-08 14:59:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-08 14:59:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-04-08 14:59:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-04-08 14:59:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-08 14:59:44,019 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2022-04-08 14:59:44,020 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:59:44,021 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-04-08 14:59:44,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:59:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:59:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:59:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 14:59:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 14:59:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 14:59:44,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 14:59:44,630 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:59:44,633 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:59:44,656 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:44,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:44,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:44,686 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:44,694 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:44,695 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:44,702 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:44,709 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:44,710 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:44,710 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:44,736 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:44,736 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:44,739 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:51,585 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-08 14:59:51,586 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-08 14:59:51,606 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:51,614 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:51,615 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:51,615 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:51,626 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:51,626 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:51,627 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:51,646 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:51,647 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:51,647 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:51,667 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:51,669 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:51,674 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:58,710 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-08 14:59:58,710 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-08 14:59:58,714 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:58,868 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2022-04-08 14:59:58,869 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2022-04-08 14:59:58,876 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:58,882 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:58,882 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:58,882 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:58,909 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-08 14:59:58,909 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-08 14:59:58,909 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:58,914 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:58,914 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:58,914 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:58,921 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:58,922 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:58,937 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:58,943 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:58,943 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:58,944 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 14:59:58,949 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 14:59:58,949 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 14:59:59,358 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:02,622 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-08 15:00:02,622 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-08 15:00:02,631 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:08,651 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-04-08 15:00:08,651 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-04-08 15:00:08,662 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:08,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-08 15:00:08,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-08 15:00:08,713 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:08,721 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 15:00:08,721 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 15:00:08,777 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:08,875 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-04-08 15:00:08,875 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-04-08 15:00:08,977 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:08,982 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 15:00:08,982 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 15:00:09,092 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:09,097 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 15:00:09,097 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 15:00:09,098 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:14,681 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-08 15:00:14,681 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-08 15:00:14,685 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:14,712 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-04-08 15:00:14,712 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-04-08 15:00:14,721 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:14,732 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-08 15:00:14,732 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-08 15:00:14,830 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:14,836 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 15:00:14,836 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 15:00:15,463 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:15,514 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-04-08 15:00:15,514 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-04-08 15:00:15,514 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: #res := 0; [2022-04-08 15:00:15,515 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:15,519 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-08 15:00:15,519 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-08 15:00:15,581 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:00:22,233 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-08 15:00:22,234 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-08 15:00:22,307 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 15:00:22,324 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 15:00:22,324 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-04-08 15:00:22,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:00:22 BoogieIcfgContainer [2022-04-08 15:00:22,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 15:00:22,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 15:00:22,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 15:00:22,334 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 15:00:22,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:59:41" (1/3) ... [2022-04-08 15:00:22,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d47792d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:00:22, skipping insertion in model container [2022-04-08 15:00:22,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:59:43" (2/3) ... [2022-04-08 15:00:22,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d47792d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:00:22, skipping insertion in model container [2022-04-08 15:00:22,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:00:22" (3/3) ... [2022-04-08 15:00:22,336 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-2.c [2022-04-08 15:00:22,340 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 15:00:22,340 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 15:00:22,391 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 15:00:22,397 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 15:00:22,397 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 15:00:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 1253 states, 952 states have (on average 1.5168067226890756) internal successors, (1444), 982 states have internal predecessors, (1444), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) [2022-04-08 15:00:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 15:00:22,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:00:22,463 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:00:22,464 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:00:22,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:00:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash -935854329, now seen corresponding path program 1 times [2022-04-08 15:00:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:00:22,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [252656705] [2022-04-08 15:00:22,486 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:00:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash -935854329, now seen corresponding path program 2 times [2022-04-08 15:00:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:00:22,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552768425] [2022-04-08 15:00:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:00:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:00:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:00:22,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:00:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:00:22,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1256#true} is VALID [2022-04-08 15:00:22,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {1256#true} assume true; {1256#true} is VALID [2022-04-08 15:00:22,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1256#true} {1256#true} #4272#return; {1256#true} is VALID [2022-04-08 15:00:23,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 15:00:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:00:23,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {1266#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 15:00:23,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume true; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 15:00:23,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#(= ~s~0 ~UNLOADED~0)} {1256#true} #4138#return; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 15:00:23,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {1256#true} call ULTIMATE.init(); {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:00:23,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {1265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {1256#true} is VALID [2022-04-08 15:00:23,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {1256#true} assume true; {1256#true} is VALID [2022-04-08 15:00:23,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1256#true} {1256#true} #4272#return; {1256#true} is VALID [2022-04-08 15:00:23,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {1256#true} call #t~ret1013 := main(); {1256#true} is VALID [2022-04-08 15:00:23,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {1256#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {1256#true} is VALID [2022-04-08 15:00:23,033 INFO L272 TraceCheckUtils]: 6: Hoare triple {1256#true} call _BLAST_init(); {1266#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:00:23,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {1266#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 15:00:23,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume true; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 15:00:23,035 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1264#(= ~s~0 ~UNLOADED~0)} {1256#true} #4138#return; {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 15:00:23,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(~status~15 >= 0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 15:00:23,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 15:00:23,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1264#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-08 15:00:23,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1264#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {1257#false} is VALID [2022-04-08 15:00:23,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {1257#false} assume !(-1 == ~status~15); {1257#false} is VALID [2022-04-08 15:00:23,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {1257#false} assume !(~s~0 != ~SKIP2~0); {1257#false} is VALID [2022-04-08 15:00:23,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {1257#false} assume 1 == ~pended~0; {1257#false} is VALID [2022-04-08 15:00:23,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#false} assume 259 != ~status~15; {1257#false} is VALID [2022-04-08 15:00:23,038 INFO L272 TraceCheckUtils]: 18: Hoare triple {1257#false} call errorFn(); {1257#false} is VALID [2022-04-08 15:00:23,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {1257#false} assume !false; {1257#false} is VALID [2022-04-08 15:00:23,038 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-08 15:00:23,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:00:23,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552768425] [2022-04-08 15:00:23,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552768425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:00:23,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:00:23,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:00:23,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:00:23,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [252656705] [2022-04-08 15:00:23,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [252656705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:00:23,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:00:23,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:00:23,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506925758] [2022-04-08 15:00:23,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:00:23,047 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), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-08 15:00:23,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:00:23,050 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), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 15:00:23,078 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-08 15:00:23,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:00:23,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:00:23,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:00:23,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:00:23,106 INFO L87 Difference]: Start difference. First operand has 1253 states, 952 states have (on average 1.5168067226890756) internal successors, (1444), 982 states have internal predecessors, (1444), 248 states have call successors, (248), 43 states have call predecessors, (248), 43 states have return successors, (248), 236 states have call predecessors, (248), 248 states have call successors, (248) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 15:00:35,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:00:41,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:00:46,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:00:49,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:00:51,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:01:00,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:01:02,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:01:08,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:01:10,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:01:15,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:01:22,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:01:26,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:01:27,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:01:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:01:28,633 INFO L93 Difference]: Finished difference Result 1365 states and 2147 transitions. [2022-04-08 15:01:28,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 15:01:28,633 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), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-08 15:01:28,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:01:28,634 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), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 15:01:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2147 transitions. [2022-04-08 15:01:28,703 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), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 15:01:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2147 transitions. [2022-04-08 15:01:28,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2147 transitions. [2022-04-08 15:01:31,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2147 edges. 2147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:01:31,372 INFO L225 Difference]: With dead ends: 1365 [2022-04-08 15:01:31,372 INFO L226 Difference]: Without dead ends: 834 [2022-04-08 15:01:31,378 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 15:01:31,381 INFO L913 BasicCegarLoop]: 920 mSDtfsCounter, 460 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 187 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:01:31,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 1300 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1974 Invalid, 8 Unknown, 0 Unchecked, 33.0s Time] [2022-04-08 15:01:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-04-08 15:01:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 671. [2022-04-08 15:01:31,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:01:31,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 15:01:31,501 INFO L74 IsIncluded]: Start isIncluded. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 15:01:31,507 INFO L87 Difference]: Start difference. First operand 834 states. Second operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 15:01:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:01:31,591 INFO L93 Difference]: Finished difference Result 834 states and 1261 transitions. [2022-04-08 15:01:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1261 transitions. [2022-04-08 15:01:31,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:01:31,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:01:31,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 834 states. [2022-04-08 15:01:31,610 INFO L87 Difference]: Start difference. First operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand 834 states. [2022-04-08 15:01:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:01:31,669 INFO L93 Difference]: Finished difference Result 834 states and 1261 transitions. [2022-04-08 15:01:31,669 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1261 transitions. [2022-04-08 15:01:31,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:01:31,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:01:31,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:01:31,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:01:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 519 states have internal predecessors, (733), 132 states have call successors, (132), 38 states have call predecessors, (132), 36 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-04-08 15:01:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 980 transitions. [2022-04-08 15:01:31,726 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 980 transitions. Word has length 20 [2022-04-08 15:01:31,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:01:31,726 INFO L478 AbstractCegarLoop]: Abstraction has 671 states and 980 transitions. [2022-04-08 15:01:31,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 15:01:31,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 671 states and 980 transitions. [2022-04-08 15:01:32,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 980 edges. 980 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:01:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 980 transitions. [2022-04-08 15:01:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 15:01:32,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:01:32,835 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:01:32,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 15:01:32,835 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:01:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:01:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash 3340125, now seen corresponding path program 1 times [2022-04-08 15:01:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:01:32,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2054370368] [2022-04-08 15:01:32,837 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:01:32,837 INFO L85 PathProgramCache]: Analyzing trace with hash 3340125, now seen corresponding path program 2 times [2022-04-08 15:01:32,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:01:32,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169947208] [2022-04-08 15:01:32,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:01:32,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:01:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:01:33,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:01:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:01:33,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7014#true} is VALID [2022-04-08 15:01:33,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-08 15:01:33,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7014#true} {7014#true} #4272#return; {7014#true} is VALID [2022-04-08 15:01:33,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 15:01:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:01:33,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {7027#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7014#true} is VALID [2022-04-08 15:01:33,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-08 15:01:33,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7014#true} {7014#true} #4138#return; {7014#true} is VALID [2022-04-08 15:01:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 15:01:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:01:33,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {7028#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {7025#(= ~s~0 ~NP~0)} assume true; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7025#(= ~s~0 ~NP~0)} {7014#true} #4140#return; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {7014#true} call ULTIMATE.init(); {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:01:33,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {7026#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {7014#true} is VALID [2022-04-08 15:01:33,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-08 15:01:33,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7014#true} {7014#true} #4272#return; {7014#true} is VALID [2022-04-08 15:01:33,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {7014#true} call #t~ret1013 := main(); {7014#true} is VALID [2022-04-08 15:01:33,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {7014#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {7014#true} is VALID [2022-04-08 15:01:33,106 INFO L272 TraceCheckUtils]: 6: Hoare triple {7014#true} call _BLAST_init(); {7027#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:01:33,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {7027#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7014#true} is VALID [2022-04-08 15:01:33,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {7014#true} assume true; {7014#true} is VALID [2022-04-08 15:01:33,106 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7014#true} {7014#true} #4138#return; {7014#true} is VALID [2022-04-08 15:01:33,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {7014#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {7014#true} is VALID [2022-04-08 15:01:33,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {7014#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {7014#true} is VALID [2022-04-08 15:01:33,108 INFO L272 TraceCheckUtils]: 12: Hoare triple {7014#true} call stub_driver_init(); {7028#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:01:33,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {7028#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {7025#(= ~s~0 ~NP~0)} assume true; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,112 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7025#(= ~s~0 ~NP~0)} {7014#true} #4140#return; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !!(~status~15 >= 0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(2 == ~__BLAST_NONDET___0~0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(3 == ~__BLAST_NONDET___0~0); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {7025#(= ~s~0 ~NP~0)} assume 4 == ~__BLAST_NONDET___0~0; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,116 INFO L272 TraceCheckUtils]: 20: Hoare triple {7025#(= ~s~0 ~NP~0)} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {7025#(= ~s~0 ~NP~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {7025#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:01:33,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {7025#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {7015#false} is VALID [2022-04-08 15:01:33,117 INFO L272 TraceCheckUtils]: 23: Hoare triple {7015#false} call errorFn(); {7015#false} is VALID [2022-04-08 15:01:33,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {7015#false} assume !false; {7015#false} is VALID [2022-04-08 15:01:33,118 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-08 15:01:33,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:01:33,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169947208] [2022-04-08 15:01:33,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169947208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:01:33,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:01:33,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:01:33,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:01:33,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2054370368] [2022-04-08 15:01:33,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2054370368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:01:33,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:01:33,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:01:33,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517111463] [2022-04-08 15:01:33,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:01:33,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 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 25 [2022-04-08 15:01:33,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:01:33,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 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-08 15:01:33,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:01:33,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 15:01:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:01:33,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 15:01:33,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:01:33,153 INFO L87 Difference]: Start difference. First operand 671 states and 980 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 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-08 15:01:49,508 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:01:51,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:01:59,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:02:03,534 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:02:08,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:02:12,746 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:02:16,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:02:17,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:02:21,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:02:24,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:02:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:02:24,951 INFO L93 Difference]: Finished difference Result 1451 states and 2142 transitions. [2022-04-08 15:02:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 15:02:24,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 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 25 [2022-04-08 15:02:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:02:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 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-08 15:02:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2142 transitions. [2022-04-08 15:02:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 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-08 15:02:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2142 transitions. [2022-04-08 15:02:25,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 2142 transitions. [2022-04-08 15:02:27,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2142 edges. 2142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:02:27,537 INFO L225 Difference]: With dead ends: 1451 [2022-04-08 15:02:27,538 INFO L226 Difference]: Without dead ends: 1173 [2022-04-08 15:02:27,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 15:02:27,540 INFO L913 BasicCegarLoop]: 1219 mSDtfsCounter, 1922 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 565 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:02:27,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1960 Valid, 1961 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 1797 Invalid, 8 Unknown, 0 Unchecked, 26.8s Time] [2022-04-08 15:02:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-04-08 15:02:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 983. [2022-04-08 15:02:27,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:02:27,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 15:02:27,635 INFO L74 IsIncluded]: Start isIncluded. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 15:02:27,637 INFO L87 Difference]: Start difference. First operand 1173 states. Second operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 15:02:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:02:27,710 INFO L93 Difference]: Finished difference Result 1173 states and 1740 transitions. [2022-04-08 15:02:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1740 transitions. [2022-04-08 15:02:27,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:02:27,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:02:27,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1173 states. [2022-04-08 15:02:27,724 INFO L87 Difference]: Start difference. First operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) Second operand 1173 states. [2022-04-08 15:02:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:02:27,805 INFO L93 Difference]: Finished difference Result 1173 states and 1740 transitions. [2022-04-08 15:02:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1740 transitions. [2022-04-08 15:02:27,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:02:27,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:02:27,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:02:27,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:02:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 748 states have (on average 1.4304812834224598) internal successors, (1070), 752 states have internal predecessors, (1070), 167 states have call successors, (167), 58 states have call predecessors, (167), 67 states have return successors, (200), 174 states have call predecessors, (200), 154 states have call successors, (200) [2022-04-08 15:02:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1437 transitions. [2022-04-08 15:02:27,901 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1437 transitions. Word has length 25 [2022-04-08 15:02:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:02:27,901 INFO L478 AbstractCegarLoop]: Abstraction has 983 states and 1437 transitions. [2022-04-08 15:02:27,902 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 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-08 15:02:27,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 983 states and 1437 transitions. [2022-04-08 15:02:29,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1437 edges. 1437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:02:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1437 transitions. [2022-04-08 15:02:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 15:02:29,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:02:29,809 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:02:29,809 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 15:02:29,809 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:02:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:02:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1565080577, now seen corresponding path program 1 times [2022-04-08 15:02:29,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:02:29,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [895858436] [2022-04-08 15:02:29,810 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:02:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1565080577, now seen corresponding path program 2 times [2022-04-08 15:02:29,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:02:29,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088645272] [2022-04-08 15:02:29,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:02:29,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:02:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:02:29,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:02:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:02:30,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14251#true} is VALID [2022-04-08 15:02:30,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 15:02:30,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4272#return; {14251#true} is VALID [2022-04-08 15:02:30,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 15:02:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:02:30,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {14264#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14251#true} is VALID [2022-04-08 15:02:30,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 15:02:30,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4138#return; {14251#true} is VALID [2022-04-08 15:02:30,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 15:02:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:02:30,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {14265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {14251#true} is VALID [2022-04-08 15:02:30,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 15:02:30,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14251#true} {14251#true} #4140#return; {14251#true} is VALID [2022-04-08 15:02:30,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {14251#true} call ULTIMATE.init(); {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:02:30,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {14263#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {14251#true} is VALID [2022-04-08 15:02:30,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 15:02:30,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14251#true} {14251#true} #4272#return; {14251#true} is VALID [2022-04-08 15:02:30,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {14251#true} call #t~ret1013 := main(); {14251#true} is VALID [2022-04-08 15:02:30,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {14251#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {14251#true} is VALID [2022-04-08 15:02:30,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {14251#true} call _BLAST_init(); {14264#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:02:30,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {14264#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {14251#true} is VALID [2022-04-08 15:02:30,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 15:02:30,095 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {14251#true} {14251#true} #4138#return; {14251#true} is VALID [2022-04-08 15:02:30,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {14251#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {14251#true} is VALID [2022-04-08 15:02:30,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {14251#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {14251#true} is VALID [2022-04-08 15:02:30,096 INFO L272 TraceCheckUtils]: 12: Hoare triple {14251#true} call stub_driver_init(); {14265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:02:30,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {14265#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {14251#true} is VALID [2022-04-08 15:02:30,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {14251#true} assume true; {14251#true} is VALID [2022-04-08 15:02:30,097 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14251#true} {14251#true} #4140#return; {14251#true} is VALID [2022-04-08 15:02:30,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {14251#true} assume !!(~status~15 >= 0); {14251#true} is VALID [2022-04-08 15:02:30,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {14251#true} assume !(2 == ~__BLAST_NONDET___0~0); {14251#true} is VALID [2022-04-08 15:02:30,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {14251#true} assume 3 == ~__BLAST_NONDET___0~0; {14251#true} is VALID [2022-04-08 15:02:30,097 INFO L272 TraceCheckUtils]: 19: Hoare triple {14251#true} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {14251#true} is VALID [2022-04-08 15:02:30,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {14251#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14251#true} is VALID [2022-04-08 15:02:30,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {14251#true} assume !(0 == #t~mem133 % 256);havoc #t~mem133;call #t~mem134 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14251#true} is VALID [2022-04-08 15:02:30,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {14251#true} assume 22 == #t~mem134 % 256;havoc #t~mem134; {14251#true} is VALID [2022-04-08 15:02:30,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {14251#true} call #t~mem136 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {14251#true} is VALID [2022-04-08 15:02:30,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {14251#true} assume !(1 != #t~mem136);havoc #t~mem136;call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem138.base, #t~mem138.offset;havoc #t~mem138.base, #t~mem138.offset; {14251#true} is VALID [2022-04-08 15:02:30,098 INFO L272 TraceCheckUtils]: 25: Hoare triple {14251#true} call #t~ret139 := KeWaitForSingleObject(~deviceExtension~1.base, 32 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {14251#true} is VALID [2022-04-08 15:02:30,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {14251#true} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet999;havoc #t~nondet999; {14251#true} is VALID [2022-04-08 15:02:30,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {14251#true} assume !(~s~0 == ~MPR3~0); {14262#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:02:30,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {14262#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {14262#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:02:30,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {14262#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {14252#false} is VALID [2022-04-08 15:02:30,101 INFO L272 TraceCheckUtils]: 30: Hoare triple {14252#false} call errorFn(); {14252#false} is VALID [2022-04-08 15:02:30,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {14252#false} assume !false; {14252#false} is VALID [2022-04-08 15:02:30,101 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-08 15:02:30,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:02:30,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088645272] [2022-04-08 15:02:30,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088645272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:02:30,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:02:30,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:02:30,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:02:30,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [895858436] [2022-04-08 15:02:30,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [895858436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:02:30,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:02:30,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:02:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366176399] [2022-04-08 15:02:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:02:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 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 32 [2022-04-08 15:02:30,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:02:30,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 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-08 15:02:30,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:02:30,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 15:02:30,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:02:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 15:02:30,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:02:30,136 INFO L87 Difference]: Start difference. First operand 983 states and 1437 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 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-08 15:02:46,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:02:52,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:02:59,645 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:03:03,722 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:03:11,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:03:13,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:03:15,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:03:20,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:03:29,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:03:31,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:03:34,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:03:38,338 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:03:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:03:46,576 INFO L93 Difference]: Finished difference Result 2287 states and 3438 transitions. [2022-04-08 15:03:46,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 15:03:46,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 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 32 [2022-04-08 15:03:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:03:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 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-08 15:03:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2358 transitions. [2022-04-08 15:03:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 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-08 15:03:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2358 transitions. [2022-04-08 15:03:46,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2358 transitions. [2022-04-08 15:03:49,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2358 edges. 2358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:03:49,773 INFO L225 Difference]: With dead ends: 2287 [2022-04-08 15:03:49,773 INFO L226 Difference]: Without dead ends: 1830 [2022-04-08 15:03:49,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 15:03:49,775 INFO L913 BasicCegarLoop]: 1374 mSDtfsCounter, 1543 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 516 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:03:49,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1595 Valid, 2172 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 2308 Invalid, 11 Unknown, 0 Unchecked, 31.5s Time] [2022-04-08 15:03:49,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2022-04-08 15:03:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1164. [2022-04-08 15:03:49,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:03:49,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 15:03:49,905 INFO L74 IsIncluded]: Start isIncluded. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 15:03:49,908 INFO L87 Difference]: Start difference. First operand 1830 states. Second operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 15:03:50,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:03:50,097 INFO L93 Difference]: Finished difference Result 1830 states and 2746 transitions. [2022-04-08 15:03:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2746 transitions. [2022-04-08 15:03:50,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:03:50,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:03:50,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1830 states. [2022-04-08 15:03:50,137 INFO L87 Difference]: Start difference. First operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) Second operand 1830 states. [2022-04-08 15:03:50,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:03:50,324 INFO L93 Difference]: Finished difference Result 1830 states and 2746 transitions. [2022-04-08 15:03:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2746 transitions. [2022-04-08 15:03:50,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:03:50,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:03:50,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:03:50,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:03:50,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 884 states have (on average 1.420814479638009) internal successors, (1256), 887 states have internal predecessors, (1256), 197 states have call successors, (197), 73 states have call predecessors, (197), 82 states have return successors, (269), 205 states have call predecessors, (269), 184 states have call successors, (269) [2022-04-08 15:03:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1722 transitions. [2022-04-08 15:03:50,459 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1722 transitions. Word has length 32 [2022-04-08 15:03:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:03:50,460 INFO L478 AbstractCegarLoop]: Abstraction has 1164 states and 1722 transitions. [2022-04-08 15:03:50,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (7), 5 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-08 15:03:50,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1164 states and 1722 transitions. [2022-04-08 15:03:52,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1722 edges. 1722 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:03:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1722 transitions. [2022-04-08 15:03:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 15:03:52,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:03:52,978 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:03:52,978 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 15:03:52,978 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:03:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:03:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1511122576, now seen corresponding path program 1 times [2022-04-08 15:03:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:03:52,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [639709337] [2022-04-08 15:03:52,979 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:03:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1511122576, now seen corresponding path program 2 times [2022-04-08 15:03:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:03:52,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679938559] [2022-04-08 15:03:52,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:03:52,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:03:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:03:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:03:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:03:53,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {24835#true} is VALID [2022-04-08 15:03:53,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {24835#true} assume true; {24835#true} is VALID [2022-04-08 15:03:53,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24835#true} {24835#true} #4272#return; {24835#true} is VALID [2022-04-08 15:03:53,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 15:03:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:03:53,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {24849#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 15:03:53,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume true; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 15:03:53,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24843#(not (= ~MPR3~0 ~NP~0))} {24835#true} #4138#return; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 15:03:53,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 15:03:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:03:53,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {24850#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:03:53,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {24851#(= ~s~0 ~NP~0)} assume true; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:03:53,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24851#(= ~s~0 ~NP~0)} {24843#(not (= ~MPR3~0 ~NP~0))} #4140#return; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {24835#true} call ULTIMATE.init(); {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:03:53,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {24848#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {24835#true} is VALID [2022-04-08 15:03:53,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {24835#true} assume true; {24835#true} is VALID [2022-04-08 15:03:53,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24835#true} {24835#true} #4272#return; {24835#true} is VALID [2022-04-08 15:03:53,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {24835#true} call #t~ret1013 := main(); {24835#true} is VALID [2022-04-08 15:03:53,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {24835#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {24835#true} is VALID [2022-04-08 15:03:53,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {24835#true} call _BLAST_init(); {24849#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:03:53,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {24849#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 15:03:53,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume true; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 15:03:53,334 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {24843#(not (= ~MPR3~0 ~NP~0))} {24835#true} #4138#return; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 15:03:53,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 15:03:53,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {24843#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-08 15:03:53,336 INFO L272 TraceCheckUtils]: 12: Hoare triple {24843#(not (= ~MPR3~0 ~NP~0))} call stub_driver_init(); {24850#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:03:53,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {24850#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:03:53,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {24851#(= ~s~0 ~NP~0)} assume true; {24851#(= ~s~0 ~NP~0)} is VALID [2022-04-08 15:03:53,337 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24851#(= ~s~0 ~NP~0)} {24843#(not (= ~MPR3~0 ~NP~0))} #4140#return; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !!(~status~15 >= 0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(2 == ~__BLAST_NONDET___0~0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume 3 == ~__BLAST_NONDET___0~0; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,339 INFO L272 TraceCheckUtils]: 19: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(0 == #t~mem133 % 256);havoc #t~mem133;call #t~mem134 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume 22 == #t~mem134 % 256;havoc #t~mem134; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~mem136 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume !(1 != #t~mem136);havoc #t~mem136;call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem138.base, #t~mem138.offset;havoc #t~mem138.base, #t~mem138.offset; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,342 INFO L272 TraceCheckUtils]: 25: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} call #t~ret139 := KeWaitForSingleObject(~deviceExtension~1.base, 32 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} ~Object.base, ~Object.offset := #in~Object.base, #in~Object.offset;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout.base, ~Timeout.offset := #in~Timeout.base, #in~Timeout.offset;assume -2147483648 <= #t~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet999;havoc #t~nondet999; {24847#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-08 15:03:53,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {24847#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {24836#false} is VALID [2022-04-08 15:03:53,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {24836#false} assume !(1 == ~setEventCalled~0); {24836#false} is VALID [2022-04-08 15:03:53,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {24836#false} assume !(1 == ~customIrp~0); {24836#false} is VALID [2022-04-08 15:03:53,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {24836#false} assume ~s~0 == ~MPR3~0; {24836#false} is VALID [2022-04-08 15:03:53,344 INFO L272 TraceCheckUtils]: 31: Hoare triple {24836#false} call errorFn(); {24836#false} is VALID [2022-04-08 15:03:53,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {24836#false} assume !false; {24836#false} is VALID [2022-04-08 15:03:53,345 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-08 15:03:53,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:03:53,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679938559] [2022-04-08 15:03:53,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679938559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:03:53,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:03:53,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 15:03:53,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:03:53,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [639709337] [2022-04-08 15:03:53,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [639709337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:03:53,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:03:53,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 15:03:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893061821] [2022-04-08 15:03:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:03:53,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-04-08 15:03:53,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:03:53,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 15:03:53,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:03:53,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 15:03:53,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:03:53,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 15:03:53,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 15:03:53,382 INFO L87 Difference]: Start difference. First operand 1164 states and 1722 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 15:04:22,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:04:28,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:04:30,510 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:04:35,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:04:41,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:04:45,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:04:49,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:04:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:04:50,196 INFO L93 Difference]: Finished difference Result 2216 states and 3337 transitions. [2022-04-08 15:04:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 15:04:50,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-04-08 15:04:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:04:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 15:04:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2771 transitions. [2022-04-08 15:04:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 15:04:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2771 transitions. [2022-04-08 15:04:50,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 2771 transitions. [2022-04-08 15:04:53,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2771 edges. 2771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:04:53,629 INFO L225 Difference]: With dead ends: 2216 [2022-04-08 15:04:53,629 INFO L226 Difference]: Without dead ends: 1508 [2022-04-08 15:04:53,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-04-08 15:04:53,632 INFO L913 BasicCegarLoop]: 1348 mSDtfsCounter, 3260 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 3682 mSolverCounterSat, 1179 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3291 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 4866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1179 IncrementalHoareTripleChecker+Valid, 3682 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:04:53,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3291 Valid, 2615 Invalid, 4866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1179 Valid, 3682 Invalid, 5 Unknown, 0 Unchecked, 23.8s Time] [2022-04-08 15:04:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-04-08 15:04:53,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1158. [2022-04-08 15:04:53,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:04:53,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 15:04:53,772 INFO L74 IsIncluded]: Start isIncluded. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 15:04:53,774 INFO L87 Difference]: Start difference. First operand 1508 states. Second operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 15:04:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:04:53,883 INFO L93 Difference]: Finished difference Result 1508 states and 2259 transitions. [2022-04-08 15:04:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2259 transitions. [2022-04-08 15:04:53,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:04:53,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:04:53,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1508 states. [2022-04-08 15:04:53,893 INFO L87 Difference]: Start difference. First operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) Second operand 1508 states. [2022-04-08 15:04:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:04:54,013 INFO L93 Difference]: Finished difference Result 1508 states and 2259 transitions. [2022-04-08 15:04:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2259 transitions. [2022-04-08 15:04:54,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:04:54,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:04:54,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:04:54,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:04:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 879 states have (on average 1.4186575654152447) internal successors, (1247), 882 states have internal predecessors, (1247), 196 states have call successors, (196), 72 states have call predecessors, (196), 82 states have return successors, (267), 205 states have call predecessors, (267), 183 states have call successors, (267) [2022-04-08 15:04:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1710 transitions. [2022-04-08 15:04:54,142 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1710 transitions. Word has length 33 [2022-04-08 15:04:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:04:54,142 INFO L478 AbstractCegarLoop]: Abstraction has 1158 states and 1710 transitions. [2022-04-08 15:04:54,142 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 15:04:54,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1158 states and 1710 transitions. [2022-04-08 15:04:56,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1710 edges. 1710 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:04:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1710 transitions. [2022-04-08 15:04:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 15:04:56,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:04:56,830 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:04:56,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 15:04:56,830 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:04:56,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:04:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash -296328802, now seen corresponding path program 1 times [2022-04-08 15:04:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:04:56,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1600908566] [2022-04-08 15:04:56,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:04:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash -296328802, now seen corresponding path program 2 times [2022-04-08 15:04:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:04:56,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665790016] [2022-04-08 15:04:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:04:56,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:04:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:04:56,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:04:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:04:56,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {34635#true} is VALID [2022-04-08 15:04:56,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-08 15:04:56,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34635#true} {34635#true} #4272#return; {34635#true} is VALID [2022-04-08 15:04:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 15:04:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:04:57,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {34648#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {34635#true} is VALID [2022-04-08 15:04:57,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-08 15:04:57,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34635#true} {34635#true} #4138#return; {34635#true} is VALID [2022-04-08 15:04:57,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 15:04:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:04:57,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {34649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {34646#(= ~compRegistered~0 0)} assume true; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34646#(= ~compRegistered~0 0)} {34635#true} #4140#return; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {34635#true} call ULTIMATE.init(); {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:04:57,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {34647#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {34635#true} is VALID [2022-04-08 15:04:57,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-08 15:04:57,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34635#true} {34635#true} #4272#return; {34635#true} is VALID [2022-04-08 15:04:57,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {34635#true} call #t~ret1013 := main(); {34635#true} is VALID [2022-04-08 15:04:57,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {34635#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {34635#true} is VALID [2022-04-08 15:04:57,149 INFO L272 TraceCheckUtils]: 6: Hoare triple {34635#true} call _BLAST_init(); {34648#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:04:57,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {34648#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {34635#true} is VALID [2022-04-08 15:04:57,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {34635#true} assume true; {34635#true} is VALID [2022-04-08 15:04:57,150 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {34635#true} {34635#true} #4138#return; {34635#true} is VALID [2022-04-08 15:04:57,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {34635#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {34635#true} is VALID [2022-04-08 15:04:57,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {34635#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {34635#true} is VALID [2022-04-08 15:04:57,151 INFO L272 TraceCheckUtils]: 12: Hoare triple {34635#true} call stub_driver_init(); {34649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:04:57,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {34649#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {34646#(= ~compRegistered~0 0)} assume true; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,152 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34646#(= ~compRegistered~0 0)} {34635#true} #4140#return; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {34646#(= ~compRegistered~0 0)} assume !!(~status~15 >= 0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {34646#(= ~compRegistered~0 0)} assume !(2 == ~__BLAST_NONDET___0~0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {34646#(= ~compRegistered~0 0)} assume !(3 == ~__BLAST_NONDET___0~0); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {34646#(= ~compRegistered~0 0)} assume 4 == ~__BLAST_NONDET___0~0; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,155 INFO L272 TraceCheckUtils]: 20: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {34646#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {34646#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~mem959 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem960.base, 68 + #t~mem960.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,157 INFO L272 TraceCheckUtils]: 24: Hoare triple {34646#(= ~compRegistered~0 0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {34646#(= ~compRegistered~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {34646#(= ~compRegistered~0 0)} is VALID [2022-04-08 15:04:57,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {34646#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {34636#false} is VALID [2022-04-08 15:04:57,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {34636#false} assume 0 == ~routine~0; {34636#false} is VALID [2022-04-08 15:04:57,158 INFO L272 TraceCheckUtils]: 28: Hoare triple {34636#false} call #t~ret1004 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~1.base, ~lcontext~1.offset); {34636#false} is VALID [2022-04-08 15:04:57,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {34636#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {34636#false} is VALID [2022-04-08 15:04:57,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {34636#false} assume 0 != ~myIrp_PendingReturned~0; {34636#false} is VALID [2022-04-08 15:04:57,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {34636#false} assume !(0 == ~pended~0); {34636#false} is VALID [2022-04-08 15:04:57,158 INFO L272 TraceCheckUtils]: 32: Hoare triple {34636#false} call errorFn(); {34636#false} is VALID [2022-04-08 15:04:57,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {34636#false} assume !false; {34636#false} is VALID [2022-04-08 15:04:57,159 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-08 15:04:57,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:04:57,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665790016] [2022-04-08 15:04:57,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665790016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:04:57,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:04:57,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:04:57,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:04:57,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1600908566] [2022-04-08 15:04:57,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1600908566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:04:57,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:04:57,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:04:57,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217928553] [2022-04-08 15:04:57,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:04:57,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-08 15:04:57,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:04:57,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 15:04:57,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:04:57,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 15:04:57,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:04:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 15:04:57,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:04:57,197 INFO L87 Difference]: Start difference. First operand 1158 states and 1710 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 15:05:12,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:05:18,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:05:20,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:05:29,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:05:31,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:05:38,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:05:40,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:05:42,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:05:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:05:43,482 INFO L93 Difference]: Finished difference Result 2061 states and 3001 transitions. [2022-04-08 15:05:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 15:05:43,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-04-08 15:05:43,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:05:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 15:05:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1787 transitions. [2022-04-08 15:05:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 15:05:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1787 transitions. [2022-04-08 15:05:43,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 1787 transitions. [2022-04-08 15:05:45,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1787 edges. 1787 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:05:45,817 INFO L225 Difference]: With dead ends: 2061 [2022-04-08 15:05:45,817 INFO L226 Difference]: Without dead ends: 1892 [2022-04-08 15:05:45,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 15:05:45,819 INFO L913 BasicCegarLoop]: 1123 mSDtfsCounter, 1421 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 333 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:05:45,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1465 Valid, 1820 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 1521 Invalid, 4 Unknown, 0 Unchecked, 19.1s Time] [2022-04-08 15:05:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2022-04-08 15:05:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1623. [2022-04-08 15:05:46,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:05:46,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 15:05:46,008 INFO L74 IsIncluded]: Start isIncluded. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 15:05:46,010 INFO L87 Difference]: Start difference. First operand 1892 states. Second operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 15:05:46,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:05:46,198 INFO L93 Difference]: Finished difference Result 1892 states and 2775 transitions. [2022-04-08 15:05:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2775 transitions. [2022-04-08 15:05:46,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:05:46,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:05:46,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1892 states. [2022-04-08 15:05:46,208 INFO L87 Difference]: Start difference. First operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1892 states. [2022-04-08 15:05:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:05:46,405 INFO L93 Difference]: Finished difference Result 1892 states and 2775 transitions. [2022-04-08 15:05:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2775 transitions. [2022-04-08 15:05:46,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:05:46,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:05:46,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:05:46,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:05:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1251 states have (on average 1.4236610711430855) internal successors, (1781), 1252 states have internal predecessors, (1781), 254 states have call successors, (254), 100 states have call predecessors, (254), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 15:05:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2381 transitions. [2022-04-08 15:05:46,616 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2381 transitions. Word has length 34 [2022-04-08 15:05:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:05:46,617 INFO L478 AbstractCegarLoop]: Abstraction has 1623 states and 2381 transitions. [2022-04-08 15:05:46,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 15:05:46,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1623 states and 2381 transitions. [2022-04-08 15:05:50,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2381 edges. 2381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:05:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2381 transitions. [2022-04-08 15:05:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 15:05:50,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:05:50,036 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:05:50,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 15:05:50,036 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:05:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:05:50,036 INFO L85 PathProgramCache]: Analyzing trace with hash -405552640, now seen corresponding path program 1 times [2022-04-08 15:05:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:05:50,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1096031784] [2022-04-08 15:05:50,037 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:05:50,037 INFO L85 PathProgramCache]: Analyzing trace with hash -405552640, now seen corresponding path program 2 times [2022-04-08 15:05:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:05:50,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778382160] [2022-04-08 15:05:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:05:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:05:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:05:50,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:05:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:05:50,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {45810#true} is VALID [2022-04-08 15:05:50,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 15:05:50,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4272#return; {45810#true} is VALID [2022-04-08 15:05:50,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 15:05:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:05:50,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {45823#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {45810#true} is VALID [2022-04-08 15:05:50,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 15:05:50,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4138#return; {45810#true} is VALID [2022-04-08 15:05:50,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 15:05:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:05:50,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {45824#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {45810#true} is VALID [2022-04-08 15:05:50,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 15:05:50,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45810#true} {45810#true} #4140#return; {45810#true} is VALID [2022-04-08 15:05:50,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {45810#true} call ULTIMATE.init(); {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:05:50,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {45822#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {45810#true} is VALID [2022-04-08 15:05:50,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 15:05:50,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45810#true} {45810#true} #4272#return; {45810#true} is VALID [2022-04-08 15:05:50,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {45810#true} call #t~ret1013 := main(); {45810#true} is VALID [2022-04-08 15:05:50,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {45810#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {45810#true} is VALID [2022-04-08 15:05:50,284 INFO L272 TraceCheckUtils]: 6: Hoare triple {45810#true} call _BLAST_init(); {45823#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:05:50,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {45823#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {45810#true} is VALID [2022-04-08 15:05:50,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 15:05:50,284 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {45810#true} {45810#true} #4138#return; {45810#true} is VALID [2022-04-08 15:05:50,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {45810#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {45810#true} is VALID [2022-04-08 15:05:50,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {45810#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {45810#true} is VALID [2022-04-08 15:05:50,285 INFO L272 TraceCheckUtils]: 12: Hoare triple {45810#true} call stub_driver_init(); {45824#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:05:50,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {45824#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {45810#true} is VALID [2022-04-08 15:05:50,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {45810#true} assume true; {45810#true} is VALID [2022-04-08 15:05:50,286 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45810#true} {45810#true} #4140#return; {45810#true} is VALID [2022-04-08 15:05:50,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {45810#true} assume !!(~status~15 >= 0); {45810#true} is VALID [2022-04-08 15:05:50,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {45810#true} assume !(2 == ~__BLAST_NONDET___0~0); {45810#true} is VALID [2022-04-08 15:05:50,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {45810#true} assume !(3 == ~__BLAST_NONDET___0~0); {45810#true} is VALID [2022-04-08 15:05:50,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {45810#true} assume 4 == ~__BLAST_NONDET___0~0; {45810#true} is VALID [2022-04-08 15:05:50,286 INFO L272 TraceCheckUtils]: 20: Hoare triple {45810#true} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {45810#true} is VALID [2022-04-08 15:05:50,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {45810#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {45810#true} is VALID [2022-04-08 15:05:50,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {45810#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:05:50,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem960.base, 68 + #t~mem960.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:05:50,288 INFO L272 TraceCheckUtils]: 24: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:05:50,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:05:50,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:05:50,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume 0 == ~__BLAST_NONDET___0~17; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:05:50,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} ~returnVal~0 := 0; {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:05:50,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:05:50,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {45821#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:05:50,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {45821#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {45811#false} is VALID [2022-04-08 15:05:50,292 INFO L272 TraceCheckUtils]: 32: Hoare triple {45811#false} call errorFn(); {45811#false} is VALID [2022-04-08 15:05:50,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {45811#false} assume !false; {45811#false} is VALID [2022-04-08 15:05:50,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-08 15:05:50,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:05:50,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778382160] [2022-04-08 15:05:50,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778382160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:05:50,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:05:50,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:05:50,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:05:50,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1096031784] [2022-04-08 15:05:50,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1096031784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:05:50,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:05:50,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 15:05:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920405488] [2022-04-08 15:05:50,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:05:50,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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 34 [2022-04-08 15:05:50,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:05:50,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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-08 15:05:50,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:05:50,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 15:05:50,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:05:50,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 15:05:50,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:05:50,328 INFO L87 Difference]: Start difference. First operand 1623 states and 2381 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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-08 15:05:55,254 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:03,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:10,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:12,836 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:17,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:19,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:24,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:26,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:28,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:34,658 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:44,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:46,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:53,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:06:58,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:07:01,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:07:05,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:07:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:07:06,542 INFO L93 Difference]: Finished difference Result 1760 states and 2607 transitions. [2022-04-08 15:07:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 15:07:06,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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 34 [2022-04-08 15:07:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:07:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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-08 15:07:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1223 transitions. [2022-04-08 15:07:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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-08 15:07:06,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1223 transitions. [2022-04-08 15:07:06,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 1223 transitions. [2022-04-08 15:07:08,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1223 edges. 1223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:07:08,241 INFO L225 Difference]: With dead ends: 1760 [2022-04-08 15:07:08,241 INFO L226 Difference]: Without dead ends: 1756 [2022-04-08 15:07:08,241 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-08 15:07:08,242 INFO L913 BasicCegarLoop]: 893 mSDtfsCounter, 903 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 360 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:07:08,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 1471 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1630 Invalid, 10 Unknown, 0 Unchecked, 36.2s Time] [2022-04-08 15:07:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2022-04-08 15:07:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1622. [2022-04-08 15:07:08,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:07:08,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 15:07:08,427 INFO L74 IsIncluded]: Start isIncluded. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 15:07:08,428 INFO L87 Difference]: Start difference. First operand 1756 states. Second operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 15:07:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:07:08,583 INFO L93 Difference]: Finished difference Result 1756 states and 2602 transitions. [2022-04-08 15:07:08,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2602 transitions. [2022-04-08 15:07:08,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:07:08,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:07:08,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1756 states. [2022-04-08 15:07:08,593 INFO L87 Difference]: Start difference. First operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) Second operand 1756 states. [2022-04-08 15:07:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:07:08,771 INFO L93 Difference]: Finished difference Result 1756 states and 2602 transitions. [2022-04-08 15:07:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2602 transitions. [2022-04-08 15:07:08,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:07:08,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:07:08,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:07:08,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:07:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1251 states have (on average 1.4220623501199041) internal successors, (1779), 1251 states have internal predecessors, (1779), 253 states have call successors, (253), 100 states have call predecessors, (253), 117 states have return successors, (346), 270 states have call predecessors, (346), 244 states have call successors, (346) [2022-04-08 15:07:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2378 transitions. [2022-04-08 15:07:08,988 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2378 transitions. Word has length 34 [2022-04-08 15:07:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:07:08,990 INFO L478 AbstractCegarLoop]: Abstraction has 1622 states and 2378 transitions. [2022-04-08 15:07:08,990 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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-08 15:07:08,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1622 states and 2378 transitions. [2022-04-08 15:07:12,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2378 edges. 2378 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:07:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2378 transitions. [2022-04-08 15:07:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 15:07:12,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:07:12,486 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:07:12,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 15:07:12,486 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:07:12,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:07:12,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1694493765, now seen corresponding path program 1 times [2022-04-08 15:07:12,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:07:12,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [325952458] [2022-04-08 15:07:12,487 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:07:12,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1694493765, now seen corresponding path program 2 times [2022-04-08 15:07:12,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:07:12,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424226042] [2022-04-08 15:07:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:07:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:07:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:07:12,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:07:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:07:12,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56108#true} is VALID [2022-04-08 15:07:12,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 15:07:12,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4272#return; {56108#true} is VALID [2022-04-08 15:07:12,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 15:07:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:07:12,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {56127#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56108#true} is VALID [2022-04-08 15:07:12,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 15:07:12,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4138#return; {56108#true} is VALID [2022-04-08 15:07:12,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 15:07:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:07:12,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {56128#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {56108#true} is VALID [2022-04-08 15:07:12,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 15:07:12,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56108#true} {56108#true} #4140#return; {56108#true} is VALID [2022-04-08 15:07:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-08 15:07:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:07:12,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {56108#true} is VALID [2022-04-08 15:07:12,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {56108#true} assume !(#t~loopctr1015 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1023 := 0; {56108#true} is VALID [2022-04-08 15:07:12,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {56108#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616); {56108#true} is VALID [2022-04-08 15:07:12,797 INFO L290 TraceCheckUtils]: 3: Hoare triple {56108#true} assume #res.base == dest.base && #res.offset == dest.offset; {56108#true} is VALID [2022-04-08 15:07:12,797 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {56108#true} {56108#true} #4320#return; {56108#true} is VALID [2022-04-08 15:07:12,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {56108#true} call ULTIMATE.init(); {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:07:12,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {56126#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {56108#true} is VALID [2022-04-08 15:07:12,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 15:07:12,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56108#true} {56108#true} #4272#return; {56108#true} is VALID [2022-04-08 15:07:12,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {56108#true} call #t~ret1013 := main(); {56108#true} is VALID [2022-04-08 15:07:12,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {56108#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {56108#true} is VALID [2022-04-08 15:07:12,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {56108#true} call _BLAST_init(); {56127#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:07:12,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {56127#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {56108#true} is VALID [2022-04-08 15:07:12,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 15:07:12,807 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {56108#true} {56108#true} #4138#return; {56108#true} is VALID [2022-04-08 15:07:12,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {56108#true} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {56108#true} is VALID [2022-04-08 15:07:12,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {56108#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {56108#true} is VALID [2022-04-08 15:07:12,810 INFO L272 TraceCheckUtils]: 12: Hoare triple {56108#true} call stub_driver_init(); {56128#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:07:12,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {56128#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {56108#true} is VALID [2022-04-08 15:07:12,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {56108#true} assume true; {56108#true} is VALID [2022-04-08 15:07:12,810 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56108#true} {56108#true} #4140#return; {56108#true} is VALID [2022-04-08 15:07:12,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {56108#true} assume !!(~status~15 >= 0); {56108#true} is VALID [2022-04-08 15:07:12,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {56108#true} assume !(2 == ~__BLAST_NONDET___0~0); {56108#true} is VALID [2022-04-08 15:07:12,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {56108#true} assume 3 == ~__BLAST_NONDET___0~0; {56108#true} is VALID [2022-04-08 15:07:12,811 INFO L272 TraceCheckUtils]: 19: Hoare triple {56108#true} call #t~ret973 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {56108#true} is VALID [2022-04-08 15:07:12,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~irpSp~0.base, ~irpSp~0.offset;havoc ~status~3;havoc ~setPagable~0;havoc ~deviceExtension~1.base, ~deviceExtension~1.offset;havoc ~tmp~1;havoc ~tmp___0~1;call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~0.base, ~irpSp~0.offset := #t~mem132.base, #t~mem132.offset;havoc #t~mem132.base, #t~mem132.offset;~status~3 := -1073741637;call #t~mem133 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {56108#true} is VALID [2022-04-08 15:07:12,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {56108#true} assume 0 == #t~mem133 % 256;havoc #t~mem133; {56108#true} is VALID [2022-04-08 15:07:12,811 INFO L272 TraceCheckUtils]: 22: Hoare triple {56108#true} call #t~ret135 := CdAudioStartDevice(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56108#true} is VALID [2022-04-08 15:07:12,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~0.base, ~deviceExtension~0.offset;havoc ~status~2;call ~#srb~0.base, ~#srb~0.offset := #Ultimate.allocOnStack(57);havoc ~cdb~0.base, ~cdb~0.offset;havoc ~inquiryDataPtr~0.base, ~inquiryDataPtr~0.offset;havoc ~attempt~0;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;havoc ~tmp___1~0;havoc ~tmp___2~0;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~tmp___10~0;havoc ~tmp___11~0;havoc ~tmp___12~0;havoc ~tmp___13~0;havoc ~tmp___14~0;havoc ~tmp___15~0;call ~#deviceParameterHandle~1.base, ~#deviceParameterHandle~1.offset := #Ultimate.allocOnStack(8);call ~#keyValue~0.base, ~#keyValue~0.offset := #Ultimate.allocOnStack(8);call #t~mem67.base, #t~mem67.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~0.base, ~deviceExtension~0.offset := #t~mem67.base, #t~mem67.offset;havoc #t~mem67.base, #t~mem67.offset; {56108#true} is VALID [2022-04-08 15:07:12,812 INFO L272 TraceCheckUtils]: 24: Hoare triple {56108#true} call #t~ret68 := CdAudioForwardIrpSynchronous(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56108#true} is VALID [2022-04-08 15:07:12,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {56108#true} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~15.base, ~deviceExtension~15.offset;call ~#event~2.base, ~#event~2.offset := #Ultimate.allocOnStack(28);havoc ~status~14;havoc ~irpSp~2.base, ~irpSp~2.offset;havoc ~nextIrpSp~1.base, ~nextIrpSp~1.offset;havoc ~irpSp___0~1.base, ~irpSp___0~1.offset;call #t~mem948.base, #t~mem948.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~15.base, ~deviceExtension~15.offset := #t~mem948.base, #t~mem948.offset;havoc #t~mem948.base, #t~mem948.offset;call #t~mem949.base, #t~mem949.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~2.base, ~irpSp~2.offset := #t~mem949.base, #t~mem949.offset;havoc #t~mem949.base, #t~mem949.offset;call #t~mem950.base, #t~mem950.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpSp~1.base, ~nextIrpSp~1.offset := #t~mem950.base, #t~mem950.offset - 68;havoc #t~mem950.base, #t~mem950.offset; {56108#true} is VALID [2022-04-08 15:07:12,813 INFO L272 TraceCheckUtils]: 26: Hoare triple {56108#true} call #t~memmove~res951.base, #t~memmove~res951.offset := #Ultimate.C_memmove(~nextIrpSp~1.base, ~nextIrpSp~1.offset, ~irpSp~2.base, ~irpSp~2.offset, 52); {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-08 15:07:12,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {56129#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {56108#true} is VALID [2022-04-08 15:07:12,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {56108#true} assume !(#t~loopctr1015 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1023 := 0; {56108#true} is VALID [2022-04-08 15:07:12,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {56108#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616); {56108#true} is VALID [2022-04-08 15:07:12,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {56108#true} assume #res.base == dest.base && #res.offset == dest.offset; {56108#true} is VALID [2022-04-08 15:07:12,814 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56108#true} {56108#true} #4320#return; {56108#true} is VALID [2022-04-08 15:07:12,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {56108#true} havoc #t~memmove~res951.base, #t~memmove~res951.offset;call write~int(0, ~nextIrpSp~1.base, 3 + ~nextIrpSp~1.offset, 1); {56108#true} is VALID [2022-04-08 15:07:12,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {56108#true} assume !(~s~0 != ~NP~0); {56108#true} is VALID [2022-04-08 15:07:12,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {56108#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset; {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 15:07:12,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} call #t~mem952.base, #t~mem952.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp___0~1.base, ~irpSp___0~1.offset := #t~mem952.base, #t~mem952.offset - 68;havoc #t~mem952.base, #t~mem952.offset;call write~$Pointer$(#funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset, ~irpSp___0~1.base, 52 + ~irpSp___0~1.offset, 8);call write~$Pointer$(~#event~2.base, ~#event~2.offset, ~irpSp___0~1.base, 60 + ~irpSp___0~1.offset, 8);call write~int(0, ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(64, ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call #t~mem953 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem953 % 256, 128), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem953;call #t~mem954 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem954 % 256, 32), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem954;call #t~mem955.base, #t~mem955.offset := read~$Pointer$(~deviceExtension~15.base, ~deviceExtension~15.offset, 8); {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 15:07:12,816 INFO L272 TraceCheckUtils]: 36: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} call #t~ret956 := IofCallDriver(#t~mem955.base, #t~mem955.offset, ~Irp.base, ~Irp.offset); {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 15:07:12,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet993 && #t~nondet993 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet993;havoc #t~nondet993;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {56124#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-08 15:07:12,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {56124#(= ~compRegistered~0 ~routine~0)} assume 0 != ~compRegistered~0; {56125#(not (= ~routine~0 0))} is VALID [2022-04-08 15:07:12,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {56125#(not (= ~routine~0 0))} assume 0 == ~routine~0; {56109#false} is VALID [2022-04-08 15:07:12,823 INFO L272 TraceCheckUtils]: 40: Hoare triple {56109#false} call #t~ret994 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {56109#false} is VALID [2022-04-08 15:07:12,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {56109#false} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {56109#false} is VALID [2022-04-08 15:07:12,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {56109#false} assume 0 != ~myIrp_PendingReturned~0; {56109#false} is VALID [2022-04-08 15:07:12,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {56109#false} assume !(0 == ~pended~0); {56109#false} is VALID [2022-04-08 15:07:12,823 INFO L272 TraceCheckUtils]: 44: Hoare triple {56109#false} call errorFn(); {56109#false} is VALID [2022-04-08 15:07:12,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {56109#false} assume !false; {56109#false} is VALID [2022-04-08 15:07:12,823 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-08 15:07:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:07:12,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424226042] [2022-04-08 15:07:12,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424226042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:07:12,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:07:12,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 15:07:12,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:07:12,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [325952458] [2022-04-08 15:07:12,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [325952458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:07:12,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:07:12,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 15:07:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633761092] [2022-04-08 15:07:12,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:07:12,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-04-08 15:07:12,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:07:12,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 15:07:12,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:07:12,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 15:07:12,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:07:12,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 15:07:12,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 15:07:12,875 INFO L87 Difference]: Start difference. First operand 1622 states and 2378 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 15:07:43,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:07:52,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:07:57,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:07:59,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:06,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:09,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:11,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:13,499 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:26,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:30,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:32,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:34,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:40,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:42,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:48,612 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:52,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:55,604 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:08:58,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:09:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:09:00,377 INFO L93 Difference]: Finished difference Result 2729 states and 4036 transitions. [2022-04-08 15:09:00,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 15:09:00,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-04-08 15:09:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:09:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 15:09:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2095 transitions. [2022-04-08 15:09:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 15:09:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2095 transitions. [2022-04-08 15:09:00,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 2095 transitions. [2022-04-08 15:09:03,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2095 edges. 2095 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:09:03,146 INFO L225 Difference]: With dead ends: 2729 [2022-04-08 15:09:03,147 INFO L226 Difference]: Without dead ends: 1590 [2022-04-08 15:09:03,149 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2022-04-08 15:09:03,149 INFO L913 BasicCegarLoop]: 893 mSDtfsCounter, 2049 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 1041 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 3599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1041 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:09:03,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2075 Valid, 1615 Invalid, 3599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1041 Valid, 2545 Invalid, 13 Unknown, 0 Unchecked, 52.4s Time] [2022-04-08 15:09:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2022-04-08 15:09:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1195. [2022-04-08 15:09:03,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:09:03,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 15:09:03,339 INFO L74 IsIncluded]: Start isIncluded. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 15:09:03,341 INFO L87 Difference]: Start difference. First operand 1590 states. Second operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 15:09:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:09:03,482 INFO L93 Difference]: Finished difference Result 1590 states and 2390 transitions. [2022-04-08 15:09:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2390 transitions. [2022-04-08 15:09:03,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:09:03,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:09:03,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1590 states. [2022-04-08 15:09:03,490 INFO L87 Difference]: Start difference. First operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1590 states. [2022-04-08 15:09:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:09:03,616 INFO L93 Difference]: Finished difference Result 1590 states and 2390 transitions. [2022-04-08 15:09:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2390 transitions. [2022-04-08 15:09:03,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:09:03,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:09:03,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:09:03,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:09:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 922 states have (on average 1.4045553145336225) internal successors, (1295), 924 states have internal predecessors, (1295), 182 states have call successors, (182), 75 states have call predecessors, (182), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 15:09:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1731 transitions. [2022-04-08 15:09:03,738 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1731 transitions. Word has length 46 [2022-04-08 15:09:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:09:03,738 INFO L478 AbstractCegarLoop]: Abstraction has 1195 states and 1731 transitions. [2022-04-08 15:09:03,739 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (11), 7 states have call predecessors, (11), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 15:09:03,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1195 states and 1731 transitions. [2022-04-08 15:09:06,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1731 edges. 1731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:09:06,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1731 transitions. [2022-04-08 15:09:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 15:09:06,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:09:06,865 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:09:06,865 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 15:09:06,865 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:09:06,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:09:06,865 INFO L85 PathProgramCache]: Analyzing trace with hash -847830418, now seen corresponding path program 1 times [2022-04-08 15:09:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:09:06,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [533403595] [2022-04-08 15:09:06,866 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:09:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash -847830418, now seen corresponding path program 2 times [2022-04-08 15:09:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:09:06,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44910526] [2022-04-08 15:09:06,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:09:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:09:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:09:07,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:09:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:09:07,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume true; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67187#(= ~myIrp_PendingReturned~0 0)} {67182#true} #4272#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 15:09:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:09:07,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {67200#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67182#true} is VALID [2022-04-08 15:09:07,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-08 15:09:07,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4138#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 15:09:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:09:07,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {67201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {67182#true} is VALID [2022-04-08 15:09:07,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-08 15:09:07,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4140#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-08 15:09:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:09:07,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {67182#true} is VALID [2022-04-08 15:09:07,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {67182#true} assume !(#t~loopctr1015 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1023 := 0; {67182#true} is VALID [2022-04-08 15:09:07,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {67182#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616); {67182#true} is VALID [2022-04-08 15:09:07,213 INFO L290 TraceCheckUtils]: 3: Hoare triple {67182#true} assume #res.base == dest.base && #res.offset == dest.offset; {67182#true} is VALID [2022-04-08 15:09:07,214 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4020#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {67182#true} call ULTIMATE.init(); {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:09:07,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {67199#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume true; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67187#(= ~myIrp_PendingReturned~0 0)} {67182#true} #4272#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret1013 := main(); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,219 INFO L272 TraceCheckUtils]: 6: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call _BLAST_init(); {67200#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:09:07,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {67200#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {67182#true} is VALID [2022-04-08 15:09:07,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-08 15:09:07,220 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4138#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,222 INFO L272 TraceCheckUtils]: 12: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call stub_driver_init(); {67201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:09:07,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {67201#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {67182#true} is VALID [2022-04-08 15:09:07,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {67182#true} assume true; {67182#true} is VALID [2022-04-08 15:09:07,223 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4140#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !!(~status~15 >= 0); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 2 == ~__BLAST_NONDET___0~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,224 INFO L272 TraceCheckUtils]: 18: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret972 := CdAudioDeviceControl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~3.base, ~deviceExtension~3.offset;havoc ~status~4;call #t~mem162.base, #t~mem162.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~3.base, ~deviceExtension~3.offset := #t~mem162.base, #t~mem162.offset;havoc #t~mem162.base, #t~mem162.offset;call #t~mem163 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(2 == #t~mem163 % 256);havoc #t~mem163;call #t~mem164 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(3 == #t~mem164 % 256);havoc #t~mem164;call #t~mem165 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(1 == #t~mem165 % 256);havoc #t~mem165;call #t~mem166 := read~int(~deviceExtension~3.base, 84 + ~deviceExtension~3.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 7 == #t~mem166 % 256;havoc #t~mem166; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,232 INFO L272 TraceCheckUtils]: 24: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret170 := CdAudioHPCdrDeviceControl(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~currentIrpStack~7.base, ~currentIrpStack~7.offset;havoc ~nextIrpStack~0.base, ~nextIrpStack~0.offset;havoc ~deviceExtension~14.base, ~deviceExtension~14.offset;havoc ~irpSp~1.base, ~irpSp~1.offset;havoc ~nextIrpSp~0.base, ~nextIrpSp~0.offset;havoc ~irpSp___0~0.base, ~irpSp___0~0.offset;havoc ~tmp~14;havoc ~tmp___0~8;call #t~mem935.base, #t~mem935.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~currentIrpStack~7.base, ~currentIrpStack~7.offset := #t~mem935.base, #t~mem935.offset;havoc #t~mem935.base, #t~mem935.offset;call #t~mem936.base, #t~mem936.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpStack~0.base, ~nextIrpStack~0.offset := #t~mem936.base, #t~mem936.offset - 68;havoc #t~mem936.base, #t~mem936.offset;call #t~mem937.base, #t~mem937.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~14.base, ~deviceExtension~14.offset := #t~mem937.base, #t~mem937.offset;havoc #t~mem937.base, #t~mem937.offset;call #t~mem938 := read~int(~currentIrpStack~7.base, 20 + ~currentIrpStack~7.offset, 8); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume #t~mem938 % 18446744073709551616 == ~bitwiseOr(~bitwiseOr(131072, 16384), 56) % 18446744073709551616;havoc #t~mem938;call #t~mem939.base, #t~mem939.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp~1.base, ~irpSp~1.offset := #t~mem939.base, #t~mem939.offset;havoc #t~mem939.base, #t~mem939.offset;call #t~mem940.base, #t~mem940.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem940.base, #t~mem940.offset - 68;havoc #t~mem940.base, #t~mem940.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,233 INFO L272 TraceCheckUtils]: 27: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~memmove~res941.base, #t~memmove~res941.offset := #Ultimate.C_memmove(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~1.base, ~irpSp~1.offset, 52); {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-08 15:09:07,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {67202#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1015 := 0; {67182#true} is VALID [2022-04-08 15:09:07,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {67182#true} assume !(#t~loopctr1015 % 18446744073709551616 < size % 18446744073709551616);#t~loopctr1023 := 0; {67182#true} is VALID [2022-04-08 15:09:07,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {67182#true} assume !(#t~loopctr1023 % 18446744073709551616 < size % 18446744073709551616); {67182#true} is VALID [2022-04-08 15:09:07,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {67182#true} assume #res.base == dest.base && #res.offset == dest.offset; {67182#true} is VALID [2022-04-08 15:09:07,235 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {67182#true} {67187#(= ~myIrp_PendingReturned~0 0)} #4020#return; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} havoc #t~memmove~res941.base, #t~memmove~res941.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(~s~0 != ~NP~0); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 0;~compFptr~0.base, ~compFptr~0.offset := #funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~mem942.base, #t~mem942.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem942.base, #t~mem942.offset - 68;havoc #t~mem942.base, #t~mem942.offset;call write~$Pointer$(#funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset, ~irpSp___0~0.base, 52 + ~irpSp___0~0.offset, 8);call write~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, ~irpSp___0~0.base, 60 + ~irpSp___0~0.offset, 8);call write~int(0, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(64, ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call #t~mem943 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem943 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem943;call #t~mem944 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem944 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem944;call #t~mem945.base, #t~mem945.offset := read~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, 8); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,237 INFO L272 TraceCheckUtils]: 37: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret946 := IofCallDriver(#t~mem945.base, #t~mem945.offset, ~Irp.base, ~Irp.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet993 && #t~nondet993 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet993;havoc #t~nondet993;havoc ~returnVal2~0;havoc ~compRetStatus~0;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~compRegistered~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~routine~0; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,239 INFO L272 TraceCheckUtils]: 41: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} call #t~ret994 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;~Context.base, ~Context.offset := #in~Context.base, #in~Context.offset; {67187#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-08 15:09:07,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {67187#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~myIrp_PendingReturned~0; {67183#false} is VALID [2022-04-08 15:09:07,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {67183#false} assume !(0 == ~pended~0); {67183#false} is VALID [2022-04-08 15:09:07,239 INFO L272 TraceCheckUtils]: 45: Hoare triple {67183#false} call errorFn(); {67183#false} is VALID [2022-04-08 15:09:07,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {67183#false} assume !false; {67183#false} is VALID [2022-04-08 15:09:07,240 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-08 15:09:07,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:09:07,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44910526] [2022-04-08 15:09:07,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44910526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:09:07,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:09:07,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 15:09:07,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:09:07,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [533403595] [2022-04-08 15:09:07,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [533403595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:09:07,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:09:07,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 15:09:07,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547453880] [2022-04-08 15:09:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:09:07,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-04-08 15:09:07,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:09:07,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 15:09:07,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:09:07,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 15:09:07,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:09:07,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 15:09:07,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 15:09:07,284 INFO L87 Difference]: Start difference. First operand 1195 states and 1731 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 15:09:14,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:09:24,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:09:32,173 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:09:36,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:09:40,375 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:09:42,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:09:47,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:09:49,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:09:56,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:10:01,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:10:06,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:10:11,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:10:14,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:10:16,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:10:23,158 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:10:25,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:10:29,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:10:31,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:10:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:32,210 INFO L93 Difference]: Finished difference Result 2147 states and 3201 transitions. [2022-04-08 15:10:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 15:10:32,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-04-08 15:10:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:10:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 15:10:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1894 transitions. [2022-04-08 15:10:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 15:10:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1894 transitions. [2022-04-08 15:10:32,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 1894 transitions. [2022-04-08 15:10:34,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1894 edges. 1894 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:34,787 INFO L225 Difference]: With dead ends: 2147 [2022-04-08 15:10:34,787 INFO L226 Difference]: Without dead ends: 1478 [2022-04-08 15:10:34,789 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-08 15:10:34,789 INFO L913 BasicCegarLoop]: 738 mSDtfsCounter, 1787 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 753 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 3071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.6s IncrementalHoareTripleChecker+Time [2022-04-08 15:10:34,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1846 Valid, 1168 Invalid, 3071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 2305 Invalid, 13 Unknown, 0 Unchecked, 46.6s Time] [2022-04-08 15:10:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-04-08 15:10:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1192. [2022-04-08 15:10:34,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:10:34,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 15:10:34,971 INFO L74 IsIncluded]: Start isIncluded. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 15:10:34,972 INFO L87 Difference]: Start difference. First operand 1478 states. Second operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 15:10:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:35,084 INFO L93 Difference]: Finished difference Result 1478 states and 2233 transitions. [2022-04-08 15:10:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2233 transitions. [2022-04-08 15:10:35,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:35,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:35,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1478 states. [2022-04-08 15:10:35,093 INFO L87 Difference]: Start difference. First operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) Second operand 1478 states. [2022-04-08 15:10:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:10:35,195 INFO L93 Difference]: Finished difference Result 1478 states and 2233 transitions. [2022-04-08 15:10:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2233 transitions. [2022-04-08 15:10:35,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:10:35,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:10:35,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:10:35,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:10:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 920 states have (on average 1.3967391304347827) internal successors, (1285), 921 states have internal predecessors, (1285), 181 states have call successors, (181), 75 states have call predecessors, (181), 90 states have return successors, (254), 195 states have call predecessors, (254), 173 states have call successors, (254) [2022-04-08 15:10:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1720 transitions. [2022-04-08 15:10:35,316 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1720 transitions. Word has length 47 [2022-04-08 15:10:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:10:35,316 INFO L478 AbstractCegarLoop]: Abstraction has 1192 states and 1720 transitions. [2022-04-08 15:10:35,317 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 15:10:35,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1192 states and 1720 transitions. [2022-04-08 15:10:38,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1720 edges. 1720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1720 transitions. [2022-04-08 15:10:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 15:10:38,390 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:10:38,390 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:10:38,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 15:10:38,391 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:10:38,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:10:38,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1701879472, now seen corresponding path program 1 times [2022-04-08 15:10:38,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:38,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1550361611] [2022-04-08 15:10:38,392 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:10:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1701879472, now seen corresponding path program 2 times [2022-04-08 15:10:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:10:38,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607186127] [2022-04-08 15:10:38,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:10:38,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:10:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:38,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:10:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:38,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {76852#true} is VALID [2022-04-08 15:10:38,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-08 15:10:38,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76852#true} {76852#true} #4272#return; {76852#true} is VALID [2022-04-08 15:10:38,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 15:10:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:38,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {76880#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume true; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,578 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76860#(not (= ~SKIP1~0 ~NP~0))} {76852#true} #4138#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 15:10:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:38,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {76881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {76852#true} is VALID [2022-04-08 15:10:38,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-08 15:10:38,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76852#true} {76860#(not (= ~SKIP1~0 ~NP~0))} #4140#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-08 15:10:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-08 15:10:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:10:38,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,715 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 15:10:38,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {76852#true} is VALID [2022-04-08 15:10:38,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {76852#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:10:38,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem960.base, 68 + #t~mem960.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:10:38,721 INFO L272 TraceCheckUtils]: 3: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:10:38,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,726 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 15:10:38,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume -9223372036854775808 <= #t~ret963 && #t~ret963 <= 9223372036854775807;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 15:10:38,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume true; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 15:10:38,727 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {76892#(= ~SKIP1~0 ~NP~0)} {76860#(not (= ~SKIP1~0 ~NP~0))} #4146#return; {76853#false} is VALID [2022-04-08 15:10:38,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {76852#true} call ULTIMATE.init(); {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:10:38,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {76879#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {76852#true} is VALID [2022-04-08 15:10:38,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-08 15:10:38,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76852#true} {76852#true} #4272#return; {76852#true} is VALID [2022-04-08 15:10:38,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {76852#true} call #t~ret1013 := main(); {76852#true} is VALID [2022-04-08 15:10:38,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {76852#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {76852#true} is VALID [2022-04-08 15:10:38,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {76852#true} call _BLAST_init(); {76880#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:10:38,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {76880#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume true; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,732 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {76860#(not (= ~SKIP1~0 ~NP~0))} {76852#true} #4138#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,733 INFO L272 TraceCheckUtils]: 12: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {76881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:10:38,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {76881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {76852#true} is VALID [2022-04-08 15:10:38,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {76852#true} assume true; {76852#true} is VALID [2022-04-08 15:10:38,734 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {76852#true} {76860#(not (= ~SKIP1~0 ~NP~0))} #4140#return; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !!(~status~15 >= 0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !(2 == ~__BLAST_NONDET___0~0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume !(3 == ~__BLAST_NONDET___0~0); {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} assume 4 == ~__BLAST_NONDET___0~0; {76860#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-08 15:10:38,736 INFO L272 TraceCheckUtils]: 20: Hoare triple {76860#(not (= ~SKIP1~0 ~NP~0))} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:10:38,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {76852#true} is VALID [2022-04-08 15:10:38,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {76852#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:10:38,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~mem959 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem960.base, 68 + #t~mem960.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {76883#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-08 15:10:38,739 INFO L272 TraceCheckUtils]: 24: Hoare triple {76883#(= ~SKIP1~0 ~s~0)} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:10:38,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {76882#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {76893#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {76893#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {76894#(= ~NP~0 |old(~s~0)|)} assume true; {76894#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-08 15:10:38,742 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {76894#(= ~NP~0 |old(~s~0)|)} {76883#(= ~SKIP1~0 ~s~0)} #3872#return; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 15:10:38,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume -9223372036854775808 <= #t~ret963 && #t~ret963 <= 9223372036854775807;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 15:10:38,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {76892#(= ~SKIP1~0 ~NP~0)} assume true; {76892#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-08 15:10:38,743 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {76892#(= ~SKIP1~0 ~NP~0)} {76860#(not (= ~SKIP1~0 ~NP~0))} #4146#return; {76853#false} is VALID [2022-04-08 15:10:38,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {76853#false} assume -9223372036854775808 <= #t~ret974 && #t~ret974 <= 9223372036854775807;~status~15 := #t~ret974;havoc #t~ret974; {76853#false} is VALID [2022-04-08 15:10:38,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {76853#false} assume 0 != ~we_should_unload~0; {76853#false} is VALID [2022-04-08 15:10:38,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {76853#false} assume !(1 == ~pended~0); {76853#false} is VALID [2022-04-08 15:10:38,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {76853#false} assume !(1 == ~pended~0); {76853#false} is VALID [2022-04-08 15:10:38,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {76853#false} assume !(~s~0 == ~UNLOADED~0); {76853#false} is VALID [2022-04-08 15:10:38,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {76853#false} assume !(-1 == ~status~15); {76853#false} is VALID [2022-04-08 15:10:38,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {76853#false} assume !(~s~0 != ~SKIP2~0); {76853#false} is VALID [2022-04-08 15:10:38,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {76853#false} assume 1 == ~pended~0; {76853#false} is VALID [2022-04-08 15:10:38,744 INFO L290 TraceCheckUtils]: 44: Hoare triple {76853#false} assume 259 != ~status~15; {76853#false} is VALID [2022-04-08 15:10:38,744 INFO L272 TraceCheckUtils]: 45: Hoare triple {76853#false} call errorFn(); {76853#false} is VALID [2022-04-08 15:10:38,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {76853#false} assume !false; {76853#false} is VALID [2022-04-08 15:10:38,747 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-08 15:10:38,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:10:38,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607186127] [2022-04-08 15:10:38,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607186127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:38,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:38,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 15:10:38,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:10:38,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1550361611] [2022-04-08 15:10:38,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1550361611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:10:38,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:10:38,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 15:10:38,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673261208] [2022-04-08 15:10:38,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:10:38,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 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 47 [2022-04-08 15:10:38,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:10:38,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 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-08 15:10:38,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:10:38,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 15:10:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:10:38,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 15:10:38,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-08 15:10:38,794 INFO L87 Difference]: Start difference. First operand 1192 states and 1720 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 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-08 15:10:43,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:02,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:14,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:19,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:28,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:36,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:40,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:49,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:11:56,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:09,405 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:11,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:13,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:15,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:20,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:32,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:36,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:40,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:42,338 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:46,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:49,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:51,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:12:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:56,733 INFO L93 Difference]: Finished difference Result 1825 states and 2709 transitions. [2022-04-08 15:12:56,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 15:12:56,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 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 47 [2022-04-08 15:12:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:12:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 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-08 15:12:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1912 transitions. [2022-04-08 15:12:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 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-08 15:12:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1912 transitions. [2022-04-08 15:12:56,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 1912 transitions. [2022-04-08 15:12:59,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1912 edges. 1912 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:12:59,535 INFO L225 Difference]: With dead ends: 1825 [2022-04-08 15:12:59,535 INFO L226 Difference]: Without dead ends: 1764 [2022-04-08 15:12:59,536 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2022-04-08 15:12:59,536 INFO L913 BasicCegarLoop]: 1030 mSDtfsCounter, 2875 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 4344 mSolverCounterSat, 1401 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2908 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 5762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1401 IncrementalHoareTripleChecker+Valid, 4344 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:12:59,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2908 Valid, 2797 Invalid, 5762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1401 Valid, 4344 Invalid, 17 Unknown, 0 Unchecked, 64.1s Time] [2022-04-08 15:12:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-04-08 15:12:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1264. [2022-04-08 15:12:59,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:12:59,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1764 states. Second operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 15:12:59,741 INFO L74 IsIncluded]: Start isIncluded. First operand 1764 states. Second operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 15:12:59,743 INFO L87 Difference]: Start difference. First operand 1764 states. Second operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 15:12:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:12:59,875 INFO L93 Difference]: Finished difference Result 1764 states and 2628 transitions. [2022-04-08 15:12:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2628 transitions. [2022-04-08 15:12:59,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:12:59,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:12:59,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1764 states. [2022-04-08 15:12:59,883 INFO L87 Difference]: Start difference. First operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) Second operand 1764 states. [2022-04-08 15:13:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:13:00,014 INFO L93 Difference]: Finished difference Result 1764 states and 2628 transitions. [2022-04-08 15:13:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2628 transitions. [2022-04-08 15:13:00,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:13:00,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:13:00,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:13:00,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:13:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 974 states have (on average 1.3901437371663243) internal successors, (1354), 974 states have internal predecessors, (1354), 190 states have call successors, (190), 83 states have call predecessors, (190), 99 states have return successors, (264), 206 states have call predecessors, (264), 182 states have call successors, (264) [2022-04-08 15:13:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1808 transitions. [2022-04-08 15:13:00,115 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1808 transitions. Word has length 47 [2022-04-08 15:13:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:13:00,116 INFO L478 AbstractCegarLoop]: Abstraction has 1264 states and 1808 transitions. [2022-04-08 15:13:00,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (7), 6 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-08 15:13:00,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1264 states and 1808 transitions. [2022-04-08 15:13:03,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1808 edges. 1808 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1808 transitions. [2022-04-08 15:13:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 15:13:03,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:13:03,473 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:13:03,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 15:13:03,474 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:13:03,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:13:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash 517296651, now seen corresponding path program 1 times [2022-04-08 15:13:03,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:03,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1307792153] [2022-04-08 15:13:03,475 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:13:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash 517296651, now seen corresponding path program 2 times [2022-04-08 15:13:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:13:03,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612684032] [2022-04-08 15:13:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:13:03,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:13:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:13:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:03,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {86664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {86635#true} is VALID [2022-04-08 15:13:03,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-08 15:13:03,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86635#true} {86635#true} #4272#return; {86635#true} is VALID [2022-04-08 15:13:03,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 15:13:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:03,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {86665#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume true; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86643#(not (= ~MPR1~0 ~SKIP1~0))} {86635#true} #4138#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 15:13:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:03,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {86666#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {86635#true} is VALID [2022-04-08 15:13:03,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-08 15:13:03,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86635#true} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4140#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-08 15:13:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-08 15:13:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:13:03,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {86635#true} is VALID [2022-04-08 15:13:03,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-08 15:13:03,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-08 15:13:03,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 15:13:03,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume !(~s~0 == ~NP~0); {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 15:13:03,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume ~s~0 == ~MPR1~0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 15:13:03,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {86636#false} is VALID [2022-04-08 15:13:03,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-08 15:13:03,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-08 15:13:03,821 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-08 15:13:03,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {86635#true} is VALID [2022-04-08 15:13:03,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {86635#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {86635#true} is VALID [2022-04-08 15:13:03,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {86635#true} call #t~mem959 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem960.base, 68 + #t~mem960.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {86635#true} is VALID [2022-04-08 15:13:03,823 INFO L272 TraceCheckUtils]: 3: Hoare triple {86635#true} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:13:03,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {86635#true} is VALID [2022-04-08 15:13:03,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-08 15:13:03,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-08 15:13:03,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 15:13:03,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume !(~s~0 == ~NP~0); {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 15:13:03,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume ~s~0 == ~MPR1~0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 15:13:03,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {86636#false} is VALID [2022-04-08 15:13:03,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-08 15:13:03,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-08 15:13:03,825 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-08 15:13:03,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {86636#false} assume -9223372036854775808 <= #t~ret963 && #t~ret963 <= 9223372036854775807;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {86636#false} is VALID [2022-04-08 15:13:03,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-08 15:13:03,826 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {86636#false} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4146#return; {86636#false} is VALID [2022-04-08 15:13:03,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {86635#true} call ULTIMATE.init(); {86664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:13:03,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {86664#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~myIrp_PendingReturned~0 |old(~myIrp_PendingReturned~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) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pirp~0.base |old(~pirp~0.base)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(~routine~0)| ~routine~0) (= ~pirp~0.offset |old(~pirp~0.offset)|) (= |old(~_SLAM_alloc_dummy~0)| ~_SLAM_alloc_dummy~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(18, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(15, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(9, 6);call #Ultimate.allocInit(15, 7);call #Ultimate.allocInit(7, 8);call write~init~int(67, 8, 0, 1);call write~init~int(72, 8, 1, 1);call write~init~int(73, 8, 2, 1);call write~init~int(78, 8, 3, 1);call write~init~int(79, 8, 4, 1);call write~init~int(78, 8, 5, 1);call write~init~int(0, 8, 6, 1);call #Ultimate.allocInit(9, 9);call #Ultimate.allocInit(17, 10);call #Ultimate.allocInit(17, 11);call #Ultimate.allocInit(9, 12);call #Ultimate.allocInit(9, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(4, 15);call write~init~int(82, 15, 0, 1);call write~init~int(85, 15, 1, 1);call write~init~int(66, 15, 2, 1);call write~init~int(0, 15, 3, 1);call #Ultimate.allocInit(9, 16);call #Ultimate.allocInit(9, 17);call #Ultimate.allocInit(12, 18);call #Ultimate.allocInit(15, 19);call #Ultimate.allocInit(17, 20);call #Ultimate.allocInit(17, 21);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(17, 23);call #Ultimate.allocInit(17, 24);call #Ultimate.allocInit(17, 25);call #Ultimate.allocInit(17, 26);call #Ultimate.allocInit(17, 27);call #Ultimate.allocInit(17, 28);call #Ultimate.allocInit(17, 29);call #Ultimate.allocInit(17, 30);call #Ultimate.allocInit(17, 31);~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~routine~0 := 0;~myStatus~0 := 0;~myIrp_PendingReturned~0 := 0;~pirp~0.base, ~pirp~0.offset := 0, 0;~_SLAM_alloc_dummy~0 := 0; {86635#true} is VALID [2022-04-08 15:13:03,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-08 15:13:03,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86635#true} {86635#true} #4272#return; {86635#true} is VALID [2022-04-08 15:13:03,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {86635#true} call #t~ret1013 := main(); {86635#true} is VALID [2022-04-08 15:13:03,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {86635#true} havoc ~d~0.Type, ~d~0.Size, ~d~0.DeviceObject.base, ~d~0.DeviceObject.offset, ~d~0.Flags, ~d~0.DriverStart.base, ~d~0.DriverStart.offset, ~d~0.DriverSize, ~d~0.DriverSection.base, ~d~0.DriverSection.offset, ~d~0.DriverExtension.base, ~d~0.DriverExtension.offset, ~d~0.DriverName.Length, ~d~0.DriverName.MaximumLength, ~d~0.DriverName.Buffer.base, ~d~0.DriverName.Buffer.offset, ~d~0.HardwareDatabase.base, ~d~0.HardwareDatabase.offset, ~d~0.FastIoDispatch.base, ~d~0.FastIoDispatch.offset, ~d~0.DriverInit.base, ~d~0.DriverInit.offset, ~d~0.DriverStartIo.base, ~d~0.DriverStartIo.offset, ~d~0.DriverUnload.base, ~d~0.DriverUnload.offset, ~d~0.MajorFunction.base, ~d~0.MajorFunction.offset;assume -9223372036854775808 <= #t~nondet964 && #t~nondet964 <= 9223372036854775807;~status~15 := #t~nondet964;havoc #t~nondet964;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(203);assume -2147483648 <= #t~nondet965 && #t~nondet965 <= 2147483647;~we_should_unload~0 := #t~nondet965;havoc #t~nondet965;assume -2147483648 <= #t~nondet966 && #t~nondet966 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet966;havoc #t~nondet966;assume -2147483648 <= #t~nondet967 && #t~nondet967 <= 2147483647;~irp_choice~0 := #t~nondet967;havoc #t~nondet967;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(327);call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(93);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#devobj~0.base, 76 + ~#devobj~0.offset, 8);havoc #t~malloc968.base, #t~malloc968.offset;call #t~malloc969.base, #t~malloc969.offset := #Ultimate.allocOnHeap(272);call write~$Pointer$(#t~malloc969.base, #t~malloc969.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~malloc969.base, #t~malloc969.offset;call #t~mem970.base, #t~mem970.offset := read~$Pointer$(~#irp~1.base, 180 + ~#irp~1.offset, 8);call write~$Pointer$(#t~mem970.base, 204 + #t~mem970.offset, ~#irp~1.base, 180 + ~#irp~1.offset, 8);havoc #t~mem970.base, #t~mem970.offset;call #t~malloc971.base, #t~malloc971.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc971.base, #t~malloc971.offset, ~#irp~1.base, 20 + ~#irp~1.offset, 8);havoc #t~malloc971.base, #t~malloc971.offset;~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {86635#true} is VALID [2022-04-08 15:13:03,829 INFO L272 TraceCheckUtils]: 6: Hoare triple {86635#true} call _BLAST_init(); {86665#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:13:03,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {86665#(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) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~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.base, ~compFptr~0.offset := 0, 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume true; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,830 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {86643#(not (= ~MPR1~0 ~SKIP1~0))} {86635#true} #4138#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume ~status~15 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296);call write~int(0, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := 0; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 44 + ~pirp~0.offset, 8);~myStatus~0 := -1073741637; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,832 INFO L272 TraceCheckUtils]: 12: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} call stub_driver_init(); {86666#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:13:03,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {86666#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 |old(~pended~0)|) (= |old(~compFptr~0.base)| ~compFptr~0.base) (= |old(~compFptr~0.offset)| ~compFptr~0.offset) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~compFptr~0.base, ~compFptr~0.offset := 0, ~compRegistered~0;~pended~0 := (if (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 <= 2147483647 then (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 else (~compFptr~0.base + ~compFptr~0.offset) % 4294967296 - 4294967296); {86635#true} is VALID [2022-04-08 15:13:03,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {86635#true} assume true; {86635#true} is VALID [2022-04-08 15:13:03,833 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {86635#true} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4140#return; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume !!(~status~15 >= 0); {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume !(2 == ~__BLAST_NONDET___0~0); {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume !(3 == ~__BLAST_NONDET___0~0); {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} assume 4 == ~__BLAST_NONDET___0~0; {86643#(not (= ~MPR1~0 ~SKIP1~0))} is VALID [2022-04-08 15:13:03,835 INFO L272 TraceCheckUtils]: 20: Hoare triple {86643#(not (= ~MPR1~0 ~SKIP1~0))} call #t~ret974 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:13:03,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;havoc ~deviceExtension~16.base, ~deviceExtension~16.offset;havoc ~tmp~15; {86635#true} is VALID [2022-04-08 15:13:03,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {86635#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {86635#true} is VALID [2022-04-08 15:13:03,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {86635#true} call #t~mem959 := read~int(~Irp.base, 63 + ~Irp.offset, 1);call write~int((if (1 + #t~mem959) % 256 <= 127 then (1 + #t~mem959) % 256 else (1 + #t~mem959) % 256 - 256), ~Irp.base, 63 + ~Irp.offset, 1);havoc #t~mem959;call #t~mem960.base, #t~mem960.offset := read~$Pointer$(~Irp.base, 180 + ~Irp.offset, 8);call write~$Pointer$(#t~mem960.base, 68 + #t~mem960.offset, ~Irp.base, 180 + ~Irp.offset, 8);havoc #t~mem960.base, #t~mem960.offset;call #t~mem961.base, #t~mem961.offset := read~$Pointer$(~DeviceObject.base, 76 + ~DeviceObject.offset, 8);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem961.base, #t~mem961.offset;havoc #t~mem961.base, #t~mem961.offset;call #t~mem962.base, #t~mem962.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 8); {86635#true} is VALID [2022-04-08 15:13:03,836 INFO L272 TraceCheckUtils]: 24: Hoare triple {86635#true} call #t~ret963 := PoCallDriver(#t~mem962.base, #t~mem962.offset, ~Irp.base, ~Irp.offset); {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-08 15:13:03,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {86667#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject.base, ~DeviceObject.offset := #in~DeviceObject.base, #in~DeviceObject.offset;~Irp.base, ~Irp.offset := #in~Irp.base, #in~Irp.offset;assume -2147483648 <= #t~nondet1003 && #t~nondet1003 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1003;havoc #t~nondet1003;havoc ~compRetStatus~1;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {86635#true} is VALID [2022-04-08 15:13:03,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {86635#true} assume !(0 != ~compRegistered~0); {86635#true} is VALID [2022-04-08 15:13:03,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {86635#true} assume 0 == ~__BLAST_NONDET___0~17; {86635#true} is VALID [2022-04-08 15:13:03,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {86635#true} ~returnVal~0 := 0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 15:13:03,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume !(~s~0 == ~NP~0); {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 15:13:03,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume ~s~0 == ~MPR1~0; {86678#(<= PoCallDriver_~returnVal~0 0)} is VALID [2022-04-08 15:13:03,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {86678#(<= PoCallDriver_~returnVal~0 0)} assume 259 == ~returnVal~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := (if ~returnVal~0 % 4294967296 <= 2147483647 then ~returnVal~0 % 4294967296 else ~returnVal~0 % 4294967296 - 4294967296); {86636#false} is VALID [2022-04-08 15:13:03,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {86636#false} #res := ~returnVal~0; {86636#false} is VALID [2022-04-08 15:13:03,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-08 15:13:03,839 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {86636#false} {86635#true} #3872#return; {86636#false} is VALID [2022-04-08 15:13:03,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {86636#false} assume -9223372036854775808 <= #t~ret963 && #t~ret963 <= 9223372036854775807;~tmp~15 := #t~ret963;havoc #t~mem962.base, #t~mem962.offset;havoc #t~ret963;#res := ~tmp~15; {86636#false} is VALID [2022-04-08 15:13:03,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {86636#false} assume true; {86636#false} is VALID [2022-04-08 15:13:03,839 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {86636#false} {86643#(not (= ~MPR1~0 ~SKIP1~0))} #4146#return; {86636#false} is VALID [2022-04-08 15:13:03,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {86636#false} assume -9223372036854775808 <= #t~ret974 && #t~ret974 <= 9223372036854775807;~status~15 := #t~ret974;havoc #t~ret974; {86636#false} is VALID [2022-04-08 15:13:03,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {86636#false} assume 0 != ~we_should_unload~0; {86636#false} is VALID [2022-04-08 15:13:03,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {86636#false} assume !(1 == ~pended~0); {86636#false} is VALID [2022-04-08 15:13:03,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {86636#false} assume !(1 == ~pended~0); {86636#false} is VALID [2022-04-08 15:13:03,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {86636#false} assume !(~s~0 == ~UNLOADED~0); {86636#false} is VALID [2022-04-08 15:13:03,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {86636#false} assume !(-1 == ~status~15); {86636#false} is VALID [2022-04-08 15:13:03,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {86636#false} assume !(~s~0 != ~SKIP2~0); {86636#false} is VALID [2022-04-08 15:13:03,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {86636#false} assume 1 == ~pended~0; {86636#false} is VALID [2022-04-08 15:13:03,840 INFO L290 TraceCheckUtils]: 46: Hoare triple {86636#false} assume 259 != ~status~15; {86636#false} is VALID [2022-04-08 15:13:03,840 INFO L272 TraceCheckUtils]: 47: Hoare triple {86636#false} call errorFn(); {86636#false} is VALID [2022-04-08 15:13:03,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {86636#false} assume !false; {86636#false} is VALID [2022-04-08 15:13:03,840 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-08 15:13:03,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:13:03,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612684032] [2022-04-08 15:13:03,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612684032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:03,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:03,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 15:13:03,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:13:03,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1307792153] [2022-04-08 15:13:03,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1307792153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:13:03,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:13:03,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 15:13:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784786344] [2022-04-08 15:13:03,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:13:03,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2022-04-08 15:13:03,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:13:03,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 15:13:03,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:13:03,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 15:13:03,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:13:03,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 15:13:03,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-08 15:13:03,893 INFO L87 Difference]: Start difference. First operand 1264 states and 1808 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)