/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:22:06,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:22:06,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:22:06,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:22:06,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:22:06,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:22:06,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:22:06,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:22:06,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:22:06,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:22:06,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:22:06,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:22:06,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:22:06,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:22:06,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:22:06,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:22:06,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:22:06,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:22:06,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:22:06,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:22:06,873 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:22:06,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:22:06,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:22:06,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:22:06,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:22:06,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:22:06,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:22:06,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:22:06,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:22:06,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:22:06,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:22:06,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:22:06,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:22:06,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:22:06,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:22:06,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:22:06,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:22:06,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:22:06,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:22:06,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:22:06,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:22:06,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:22:06,894 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:22:06,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:22:06,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:22:06,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:22:06,903 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:22:06,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:22:06,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:22:06,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:22:06,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:22:06,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:22:06,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:22:06,904 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:22:06,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:22:06,904 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:22:06,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:22:06,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:22:06,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:22:06,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:22:06,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:22:06,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:22:06,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:22:06,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:22:06,905 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:22:06,905 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:22:06,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:22:06,905 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:22:06,905 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:22:07,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:22:07,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:22:07,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:22:07,065 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:22:07,065 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:22:07,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2022-04-15 11:22:07,122 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c48623d4/2f796ec7b4a24944a97d45053425593b/FLAG5f8dd35d7 [2022-04-15 11:22:07,728 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:22:07,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2022-04-15 11:22:07,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c48623d4/2f796ec7b4a24944a97d45053425593b/FLAG5f8dd35d7 [2022-04-15 11:22:08,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c48623d4/2f796ec7b4a24944a97d45053425593b [2022-04-15 11:22:08,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:22:08,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:22:08,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:22:08,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:22:08,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:22:08,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:22:08" (1/1) ... [2022-04-15 11:22:08,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1dd8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:22:08, skipping insertion in model container [2022-04-15 11:22:08,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:22:08" (1/1) ... [2022-04-15 11:22:08,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:22:08,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:22:08,696 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-1.c[90162,90175] [2022-04-15 11:22:09,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:22:09,211 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:22:09,254 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-1.c[90162,90175] [2022-04-15 11:22:09,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:22:09,510 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:22:09,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:22:09 WrapperNode [2022-04-15 11:22:09,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:22:09,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:22:09,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:22:09,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:22:09,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:22:09" (1/1) ... [2022-04-15 11:22:09,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:22:09" (1/1) ... [2022-04-15 11:22:09,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:22:09" (1/1) ... [2022-04-15 11:22:09,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:22:09" (1/1) ... [2022-04-15 11:22:09,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:22:09" (1/1) ... [2022-04-15 11:22:09,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:22:09" (1/1) ... [2022-04-15 11:22:09,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:22:09" (1/1) ... [2022-04-15 11:22:09,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:22:09,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:22:09,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:22:09,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:22:09,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:22:09" (1/1) ... [2022-04-15 11:22:09,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:22:09,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:22:09,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:22:09,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:22:09,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:22:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:22:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:22:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2022-04-15 11:22:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-04-15 11:22:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-04-15 11:22:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-04-15 11:22:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-04-15 11:22:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-15 11:22:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-15 11:22:09,847 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-04-15 11:22:09,847 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2022-04-15 11:22:09,848 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2022-04-15 11:22:09,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-04-15 11:22:09,850 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2022-04-15 11:22:09,851 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2022-04-15 11:22:09,851 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2022-04-15 11:22:09,851 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2022-04-15 11:22:09,851 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-04-15 11:22:09,851 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-04-15 11:22:09,851 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2022-04-15 11:22:09,851 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-04-15 11:22:09,851 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2022-04-15 11:22:09,851 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-15 11:22:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-15 11:22:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-15 11:22:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2022-04-15 11:22:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2022-04-15 11:22:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2022-04-15 11:22:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2022-04-15 11:22:09,852 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2022-04-15 11:22:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2022-04-15 11:22:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2022-04-15 11:22:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-15 11:22:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-15 11:22:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2022-04-15 11:22:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2022-04-15 11:22:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2022-04-15 11:22:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2022-04-15 11:22:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2022-04-15 11:22:09,853 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2022-04-15 11:22:09,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-04-15 11:22:09,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2022-04-15 11:22:09,854 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-15 11:22:09,854 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2022-04-15 11:22:09,854 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-04-15 11:22:09,854 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2022-04-15 11:22:09,854 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2022-04-15 11:22:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2022-04-15 11:22:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2022-04-15 11:22:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2022-04-15 11:22:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2022-04-15 11:22:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2022-04-15 11:22:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2022-04-15 11:22:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2022-04-15 11:22:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-04-15 11:22:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-04-15 11:22:09,855 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:22:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:22:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:22:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:22:09,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:22:09,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:22:09,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:22:09,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:22:09,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:22:09,856 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:22:09,856 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:22:09,856 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-04-15 11:22:09,856 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2022-04-15 11:22:09,857 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2022-04-15 11:22:09,857 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2022-04-15 11:22:09,857 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2022-04-15 11:22:09,857 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2022-04-15 11:22:09,857 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2022-04-15 11:22:09,858 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2022-04-15 11:22:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2022-04-15 11:22:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-15 11:22:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2022-04-15 11:22:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2022-04-15 11:22:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-04-15 11:22:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2022-04-15 11:22:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2022-04-15 11:22:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2022-04-15 11:22:09,859 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2022-04-15 11:22:09,860 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2022-04-15 11:22:09,861 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2022-04-15 11:22:09,861 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2022-04-15 11:22:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2022-04-15 11:22:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-15 11:22:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2022-04-15 11:22:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-04-15 11:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-15 11:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-15 11:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2022-04-15 11:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2022-04-15 11:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-04-15 11:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-04-15 11:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-04-15 11:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2022-04-15 11:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2022-04-15 11:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2022-04-15 11:22:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:22:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:22:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:22:10,358 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:22:10,360 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:22:10,391 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:10,429 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:10,429 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:10,429 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:10,444 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:10,444 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:10,453 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:10,463 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:10,464 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:10,464 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:10,489 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:10,489 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:10,495 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:18,589 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-15 11:22:18,590 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-15 11:22:18,604 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:18,610 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:18,610 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:18,611 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:18,624 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:18,624 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:18,624 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:18,641 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:18,641 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:18,641 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:18,664 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:18,665 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:18,667 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:21,845 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 11:22:21,846 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 11:22:21,890 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:21,996 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2022-04-15 11:22:21,996 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2022-04-15 11:22:22,002 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:22,006 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:22,006 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:22,006 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:22,025 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-15 11:22:22,026 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-15 11:22:22,026 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:22,029 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:22,030 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:22,030 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:22,035 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:22,035 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:22,048 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:22,052 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:22,052 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:22,052 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:22,056 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:22,057 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:22,372 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:24,089 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 11:22:24,089 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 11:22:24,097 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:27,869 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-04-15 11:22:27,870 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-04-15 11:22:27,879 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:27,900 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-04-15 11:22:27,900 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-04-15 11:22:27,919 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:27,924 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:27,924 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:27,967 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:28,046 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume false; [2022-04-15 11:22:28,046 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !false; [2022-04-15 11:22:28,122 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:28,126 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:28,126 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:28,211 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:28,215 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:28,216 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:28,216 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:30,736 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2022-04-15 11:22:30,736 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2022-04-15 11:22:30,739 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:30,759 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-04-15 11:22:30,759 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-04-15 11:22:30,787 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:30,796 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-15 11:22:30,797 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-15 11:22:30,806 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:30,811 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:30,811 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:31,068 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:31,105 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-04-15 11:22:31,105 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-04-15 11:22:31,105 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: #res := 0; [2022-04-15 11:22:31,105 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:31,109 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-15 11:22:31,109 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-15 11:22:31,158 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:22:37,157 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-04-15 11:22:37,157 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-04-15 11:22:37,210 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:22:37,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:22:37,239 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-04-15 11:22:37,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:22:37 BoogieIcfgContainer [2022-04-15 11:22:37,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:22:37,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:22:37,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:22:37,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:22:37,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:22:08" (1/3) ... [2022-04-15 11:22:37,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a63bc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:22:37, skipping insertion in model container [2022-04-15 11:22:37,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:22:09" (2/3) ... [2022-04-15 11:22:37,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a63bc3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:22:37, skipping insertion in model container [2022-04-15 11:22:37,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:22:37" (3/3) ... [2022-04-15 11:22:37,253 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-1.c [2022-04-15 11:22:37,256 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:22:37,256 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:22:37,288 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:22:37,294 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:22:37,295 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:22:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 1261 states, 960 states have (on average 1.5177083333333334) internal successors, (1457), 990 states have internal predecessors, (1457), 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-15 11:22:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 11:22:37,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:22:37,352 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] [2022-04-15 11:22:37,352 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:22:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:22:37,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1165007651, now seen corresponding path program 1 times [2022-04-15 11:22:37,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:22:37,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1793822233] [2022-04-15 11:22:37,371 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:22:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1165007651, now seen corresponding path program 2 times [2022-04-15 11:22:37,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:22:37,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480257693] [2022-04-15 11:22:37,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:22:37,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:22:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:22:37,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:22:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:22:37,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {1273#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {1264#true} is VALID [2022-04-15 11:22:37,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-15 11:22:37,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#true} {1264#true} #4308#return; {1264#true} is VALID [2022-04-15 11:22:37,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:22:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:22:37,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {1274#(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; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:22:37,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume true; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:22:37,864 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1272#(= ~s~0 ~UNLOADED~0)} {1264#true} #4174#return; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:22:37,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {1264#true} call ULTIMATE.init(); {1273#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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-15 11:22:37,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1273#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {1264#true} is VALID [2022-04-15 11:22:37,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-15 11:22:37,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1264#true} {1264#true} #4308#return; {1264#true} is VALID [2022-04-15 11:22:37,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {1264#true} call #t~ret1021 := main(); {1264#true} is VALID [2022-04-15 11:22:37,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {1264#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 -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {1264#true} is VALID [2022-04-15 11:22:37,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {1264#true} assume !(~a~0 % 4294967296 < 53); {1264#true} is VALID [2022-04-15 11:22:37,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {1264#true} ~a~0 := 0; {1264#true} is VALID [2022-04-15 11:22:37,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#true} assume !(~a~0 % 4294967296 < 36); {1264#true} is VALID [2022-04-15 11:22:37,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {1264#true} ~a~0 := 0; {1264#true} is VALID [2022-04-15 11:22:37,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {1264#true} assume !(~a~0 % 4294967296 < 904); {1264#true} is VALID [2022-04-15 11:22:37,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {1264#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {1264#true} is VALID [2022-04-15 11:22:37,870 INFO L272 TraceCheckUtils]: 12: Hoare triple {1264#true} call _BLAST_init(); {1274#(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-15 11:22:37,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {1274#(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; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:22:37,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume true; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:22:37,871 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1272#(= ~s~0 ~UNLOADED~0)} {1264#true} #4174#return; {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:22:37,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(~status~15 >= 0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:22:37,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:22:37,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(1 == ~pended~0); {1272#(= ~s~0 ~UNLOADED~0)} is VALID [2022-04-15 11:22:37,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {1272#(= ~s~0 ~UNLOADED~0)} assume !(~s~0 == ~UNLOADED~0); {1265#false} is VALID [2022-04-15 11:22:37,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {1265#false} assume !(-1 == ~status~15); {1265#false} is VALID [2022-04-15 11:22:37,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {1265#false} assume !(~s~0 != ~SKIP2~0); {1265#false} is VALID [2022-04-15 11:22:37,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {1265#false} assume !(1 == ~pended~0); {1265#false} is VALID [2022-04-15 11:22:37,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {1265#false} assume ~s~0 == ~DC~0; {1265#false} is VALID [2022-04-15 11:22:37,873 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#false} call errorFn(); {1265#false} is VALID [2022-04-15 11:22:37,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {1265#false} assume !false; {1265#false} is VALID [2022-04-15 11:22:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:22:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:22:37,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480257693] [2022-04-15 11:22:37,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480257693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:22:37,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:22:37,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:22:37,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:22:37,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1793822233] [2022-04-15 11:22:37,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1793822233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:22:37,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:22:37,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:22:37,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612855124] [2022-04-15 11:22:37,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:22:37,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 26 [2022-04-15 11:22:37,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:22:37,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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-15 11:22:37,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:22:37,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:22:37,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:22:37,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:22:37,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:22:37,948 INFO L87 Difference]: Start difference. First operand has 1261 states, 960 states have (on average 1.5177083333333334) internal successors, (1457), 990 states have internal predecessors, (1457), 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 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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-15 11:22:49,721 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-15 11:22:54,479 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-15 11:23:01,510 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-15 11:23:06,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:23:09,149 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-15 11:23:12,630 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-15 11:23:14,635 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-15 11:23:18,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:23:20,667 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-15 11:23:22,687 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-15 11:23:36,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:23:37,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:23:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:23:38,203 INFO L93 Difference]: Finished difference Result 1537 states and 2438 transitions. [2022-04-15 11:23:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 11:23:38,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 26 [2022-04-15 11:23:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:23:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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-15 11:23:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2438 transitions. [2022-04-15 11:23:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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-15 11:23:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2438 transitions. [2022-04-15 11:23:38,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2438 transitions. [2022-04-15 11:23:41,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2438 edges. 2438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:23:41,292 INFO L225 Difference]: With dead ends: 1537 [2022-04-15 11:23:41,292 INFO L226 Difference]: Without dead ends: 842 [2022-04-15 11:23:41,298 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:23:41,300 INFO L913 BasicCegarLoop]: 930 mSDtfsCounter, 484 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 187 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:23:41,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 1302 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1973 Invalid, 7 Unknown, 0 Unchecked, 28.8s Time] [2022-04-15 11:23:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-04-15 11:23:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 679. [2022-04-15 11:23:41,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:23:41,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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-15 11:23:41,437 INFO L74 IsIncluded]: Start isIncluded. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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-15 11:23:41,438 INFO L87 Difference]: Start difference. First operand 842 states. Second operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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-15 11:23:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:23:41,476 INFO L93 Difference]: Finished difference Result 842 states and 1272 transitions. [2022-04-15 11:23:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1272 transitions. [2022-04-15 11:23:41,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:23:41,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:23:41,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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 842 states. [2022-04-15 11:23:41,490 INFO L87 Difference]: Start difference. First operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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 842 states. [2022-04-15 11:23:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:23:41,522 INFO L93 Difference]: Finished difference Result 842 states and 1272 transitions. [2022-04-15 11:23:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1272 transitions. [2022-04-15 11:23:41,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:23:41,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:23:41,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:23:41,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:23:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 510 states have (on average 1.4588235294117646) internal successors, (744), 527 states have internal predecessors, (744), 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-15 11:23:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 991 transitions. [2022-04-15 11:23:41,557 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 991 transitions. Word has length 26 [2022-04-15 11:23:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:23:41,557 INFO L478 AbstractCegarLoop]: Abstraction has 679 states and 991 transitions. [2022-04-15 11:23:41,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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-15 11:23:41,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 679 states and 991 transitions. [2022-04-15 11:23:42,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 991 edges. 991 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:23:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 991 transitions. [2022-04-15 11:23:42,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 11:23:42,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:23:42,565 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] [2022-04-15 11:23:42,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:23:42,565 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:23:42,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:23:42,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1118603387, now seen corresponding path program 1 times [2022-04-15 11:23:42,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:23:42,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [231461292] [2022-04-15 11:23:42,566 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:23:42,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1118603387, now seen corresponding path program 2 times [2022-04-15 11:23:42,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:23:42,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926095460] [2022-04-15 11:23:42,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:23:42,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:23:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:23:42,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:23:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:23:42,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {7410#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {7398#true} is VALID [2022-04-15 11:23:42,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-15 11:23:42,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7398#true} {7398#true} #4308#return; {7398#true} is VALID [2022-04-15 11:23:42,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:23:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:23:42,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {7411#(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; {7398#true} is VALID [2022-04-15 11:23:42,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-15 11:23:42,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7398#true} {7398#true} #4174#return; {7398#true} is VALID [2022-04-15 11:23:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 11:23:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:23:42,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {7412#(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 := ~compFptr~0.base + ~compFptr~0.offset; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {7409#(= ~s~0 ~NP~0)} assume true; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7409#(= ~s~0 ~NP~0)} {7398#true} #4176#return; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {7398#true} call ULTIMATE.init(); {7410#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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-15 11:23:42,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {7398#true} is VALID [2022-04-15 11:23:42,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-15 11:23:42,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7398#true} {7398#true} #4308#return; {7398#true} is VALID [2022-04-15 11:23:42,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {7398#true} call #t~ret1021 := main(); {7398#true} is VALID [2022-04-15 11:23:42,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {7398#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 -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {7398#true} is VALID [2022-04-15 11:23:42,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {7398#true} assume !(~a~0 % 4294967296 < 53); {7398#true} is VALID [2022-04-15 11:23:42,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#true} ~a~0 := 0; {7398#true} is VALID [2022-04-15 11:23:42,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {7398#true} assume !(~a~0 % 4294967296 < 36); {7398#true} is VALID [2022-04-15 11:23:42,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {7398#true} ~a~0 := 0; {7398#true} is VALID [2022-04-15 11:23:42,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {7398#true} assume !(~a~0 % 4294967296 < 904); {7398#true} is VALID [2022-04-15 11:23:42,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {7398#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {7398#true} is VALID [2022-04-15 11:23:42,839 INFO L272 TraceCheckUtils]: 12: Hoare triple {7398#true} call _BLAST_init(); {7411#(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-15 11:23:42,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {7411#(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; {7398#true} is VALID [2022-04-15 11:23:42,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {7398#true} assume true; {7398#true} is VALID [2022-04-15 11:23:42,840 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7398#true} {7398#true} #4174#return; {7398#true} is VALID [2022-04-15 11:23:42,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {7398#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 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {7398#true} is VALID [2022-04-15 11:23:42,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {7398#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {7398#true} is VALID [2022-04-15 11:23:42,841 INFO L272 TraceCheckUtils]: 18: Hoare triple {7398#true} call stub_driver_init(); {7412#(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-15 11:23:42,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {7412#(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 := ~compFptr~0.base + ~compFptr~0.offset; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {7409#(= ~s~0 ~NP~0)} assume true; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,842 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7409#(= ~s~0 ~NP~0)} {7398#true} #4176#return; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !!(~status~15 >= 0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(2 == ~__BLAST_NONDET___0~0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(3 == ~__BLAST_NONDET___0~0); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {7409#(= ~s~0 ~NP~0)} assume 4 == ~__BLAST_NONDET___0~0; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,844 INFO L272 TraceCheckUtils]: 26: Hoare triple {7409#(= ~s~0 ~NP~0)} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {7409#(= ~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; {7409#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:23:42,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {7409#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {7399#false} is VALID [2022-04-15 11:23:42,845 INFO L272 TraceCheckUtils]: 29: Hoare triple {7399#false} call errorFn(); {7399#false} is VALID [2022-04-15 11:23:42,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {7399#false} assume !false; {7399#false} is VALID [2022-04-15 11:23:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:23:42,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:23:42,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926095460] [2022-04-15 11:23:42,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926095460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:23:42,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:23:42,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:23:42,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:23:42,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [231461292] [2022-04-15 11:23:42,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [231461292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:23:42,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:23:42,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:23:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601015659] [2022-04-15 11:23:42,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:23:42,850 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), 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 31 [2022-04-15 11:23:42,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:23:42,851 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), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:23:42,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:23:42,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:23:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:23:42,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:23:42,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:23:42,879 INFO L87 Difference]: Start difference. First operand 679 states and 991 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:23:57,933 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-15 11:24:08,465 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-15 11:24:12,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:24:14,776 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-15 11:24:19,099 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-15 11:24:22,501 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-15 11:24:25,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:24:29,040 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:24:33,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:24:35,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:24:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:24:36,906 INFO L93 Difference]: Finished difference Result 1457 states and 2151 transitions. [2022-04-15 11:24:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:24:36,907 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), 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 31 [2022-04-15 11:24:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:24:36,907 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), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:24:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2022-04-15 11:24:36,926 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), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:24:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2151 transitions. [2022-04-15 11:24:36,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 2151 transitions. [2022-04-15 11:24:39,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2151 edges. 2151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:24:39,124 INFO L225 Difference]: With dead ends: 1457 [2022-04-15 11:24:39,125 INFO L226 Difference]: Without dead ends: 1180 [2022-04-15 11:24:39,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:24:39,130 INFO L913 BasicCegarLoop]: 1197 mSDtfsCounter, 1465 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 360 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:24:39,130 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1503 Valid, 1916 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2631 Invalid, 5 Unknown, 0 Unchecked, 24.9s Time] [2022-04-15 11:24:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-04-15 11:24:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 991. [2022-04-15 11:24:39,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:24:39,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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-15 11:24:39,249 INFO L74 IsIncluded]: Start isIncluded. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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-15 11:24:39,251 INFO L87 Difference]: Start difference. First operand 1180 states. Second operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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-15 11:24:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:24:39,297 INFO L93 Difference]: Finished difference Result 1180 states and 1750 transitions. [2022-04-15 11:24:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1750 transitions. [2022-04-15 11:24:39,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:24:39,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:24:39,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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 1180 states. [2022-04-15 11:24:39,304 INFO L87 Difference]: Start difference. First operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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 1180 states. [2022-04-15 11:24:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:24:39,352 INFO L93 Difference]: Finished difference Result 1180 states and 1750 transitions. [2022-04-15 11:24:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1750 transitions. [2022-04-15 11:24:39,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:24:39,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:24:39,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:24:39,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:24:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 756 states have (on average 1.42989417989418) internal successors, (1081), 760 states have internal predecessors, (1081), 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-15 11:24:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1448 transitions. [2022-04-15 11:24:39,407 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1448 transitions. Word has length 31 [2022-04-15 11:24:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:24:39,407 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1448 transitions. [2022-04-15 11:24:39,407 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), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 11:24:39,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1448 transitions. [2022-04-15 11:24:41,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1448 edges. 1448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:24:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1448 transitions. [2022-04-15 11:24:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 11:24:41,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:24:41,065 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:24:41,065 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:24:41,065 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:24:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:24:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash 425780201, now seen corresponding path program 1 times [2022-04-15 11:24:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:24:41,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [768293195] [2022-04-15 11:24:41,066 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:24:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash 425780201, now seen corresponding path program 2 times [2022-04-15 11:24:41,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:24:41,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474675163] [2022-04-15 11:24:41,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:24:41,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:24:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:24:41,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:24:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:24:41,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {14689#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {14677#true} is VALID [2022-04-15 11:24:41,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 11:24:41,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4308#return; {14677#true} is VALID [2022-04-15 11:24:41,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:24:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:24:41,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {14690#(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; {14677#true} is VALID [2022-04-15 11:24:41,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 11:24:41,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4174#return; {14677#true} is VALID [2022-04-15 11:24:41,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 11:24:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:24:41,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {14691#(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 := ~compFptr~0.base + ~compFptr~0.offset; {14677#true} is VALID [2022-04-15 11:24:41,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 11:24:41,262 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14677#true} {14677#true} #4176#return; {14677#true} is VALID [2022-04-15 11:24:41,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {14677#true} call ULTIMATE.init(); {14689#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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-15 11:24:41,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {14689#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {14677#true} is VALID [2022-04-15 11:24:41,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 11:24:41,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14677#true} {14677#true} #4308#return; {14677#true} is VALID [2022-04-15 11:24:41,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {14677#true} call #t~ret1021 := main(); {14677#true} is VALID [2022-04-15 11:24:41,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {14677#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 -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {14677#true} is VALID [2022-04-15 11:24:41,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {14677#true} assume !(~a~0 % 4294967296 < 53); {14677#true} is VALID [2022-04-15 11:24:41,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {14677#true} ~a~0 := 0; {14677#true} is VALID [2022-04-15 11:24:41,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {14677#true} assume !(~a~0 % 4294967296 < 36); {14677#true} is VALID [2022-04-15 11:24:41,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {14677#true} ~a~0 := 0; {14677#true} is VALID [2022-04-15 11:24:41,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {14677#true} assume !(~a~0 % 4294967296 < 904); {14677#true} is VALID [2022-04-15 11:24:41,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {14677#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {14677#true} is VALID [2022-04-15 11:24:41,265 INFO L272 TraceCheckUtils]: 12: Hoare triple {14677#true} call _BLAST_init(); {14690#(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-15 11:24:41,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {14690#(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; {14677#true} is VALID [2022-04-15 11:24:41,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 11:24:41,266 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14677#true} {14677#true} #4174#return; {14677#true} is VALID [2022-04-15 11:24:41,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {14677#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 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {14677#true} is VALID [2022-04-15 11:24:41,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {14677#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {14677#true} is VALID [2022-04-15 11:24:41,266 INFO L272 TraceCheckUtils]: 18: Hoare triple {14677#true} call stub_driver_init(); {14691#(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-15 11:24:41,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {14691#(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 := ~compFptr~0.base + ~compFptr~0.offset; {14677#true} is VALID [2022-04-15 11:24:41,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {14677#true} assume true; {14677#true} is VALID [2022-04-15 11:24:41,267 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14677#true} {14677#true} #4176#return; {14677#true} is VALID [2022-04-15 11:24:41,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {14677#true} assume !!(~status~15 >= 0); {14677#true} is VALID [2022-04-15 11:24:41,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {14677#true} assume !(2 == ~__BLAST_NONDET___0~0); {14677#true} is VALID [2022-04-15 11:24:41,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {14677#true} assume 3 == ~__BLAST_NONDET___0~0; {14677#true} is VALID [2022-04-15 11:24:41,267 INFO L272 TraceCheckUtils]: 25: Hoare triple {14677#true} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {14677#true} is VALID [2022-04-15 11:24:41,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {14677#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~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14677#true} is VALID [2022-04-15 11:24:41,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {14677#true} assume !(0 == #t~mem130 % 256);havoc #t~mem130;call #t~mem131 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {14677#true} is VALID [2022-04-15 11:24:41,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {14677#true} assume 22 == #t~mem131 % 256;havoc #t~mem131; {14677#true} is VALID [2022-04-15 11:24:41,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {14677#true} call #t~mem133 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {14677#true} is VALID [2022-04-15 11:24:41,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {14677#true} assume !(1 != #t~mem133);havoc #t~mem133;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem135.base, #t~mem135.offset;havoc #t~mem135.base, #t~mem135.offset; {14677#true} is VALID [2022-04-15 11:24:41,268 INFO L272 TraceCheckUtils]: 31: Hoare triple {14677#true} call #t~ret136 := KeWaitForSingleObject(~deviceExtension~1.base, 16 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {14677#true} is VALID [2022-04-15 11:24:41,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {14677#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~nondet1006 && #t~nondet1006 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet1006;havoc #t~nondet1006; {14677#true} is VALID [2022-04-15 11:24:41,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {14677#true} assume !(~s~0 == ~MPR3~0); {14688#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:24:41,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {14688#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {14688#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:24:41,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {14688#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {14678#false} is VALID [2022-04-15 11:24:41,269 INFO L272 TraceCheckUtils]: 36: Hoare triple {14678#false} call errorFn(); {14678#false} is VALID [2022-04-15 11:24:41,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {14678#false} assume !false; {14678#false} is VALID [2022-04-15 11:24:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:24:41,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:24:41,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474675163] [2022-04-15 11:24:41,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474675163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:24:41,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:24:41,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:24:41,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:24:41,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [768293195] [2022-04-15 11:24:41,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [768293195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:24:41,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:24:41,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:24:41,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096068380] [2022-04-15 11:24:41,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:24:41,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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 38 [2022-04-15 11:24:41,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:24:41,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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-15 11:24:41,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:24:41,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:24:41,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:24:41,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:24:41,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:24:41,302 INFO L87 Difference]: Start difference. First operand 991 states and 1448 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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-15 11:24:52,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:24:54,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:00,756 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-15 11:25:08,359 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-15 11:25:10,397 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-15 11:25:17,100 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-15 11:25:21,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:26,422 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-15 11:25:30,232 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-15 11:25:32,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:35,045 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-15 11:25:37,090 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-15 11:25:44,616 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-15 11:25:47,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:25:49,984 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-15 11:25:54,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-15 11:25:57,270 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-15 11:25:59,300 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-15 11:26:01,338 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-15 11:26:05,150 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-15 11:26:05,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:26:05,874 INFO L93 Difference]: Finished difference Result 2293 states and 3447 transitions. [2022-04-15 11:26:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 11:26:05,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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 38 [2022-04-15 11:26:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:26:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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-15 11:26:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2367 transitions. [2022-04-15 11:26:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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-15 11:26:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2367 transitions. [2022-04-15 11:26:05,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 2367 transitions. [2022-04-15 11:26:08,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2367 edges. 2367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:26:09,058 INFO L225 Difference]: With dead ends: 2293 [2022-04-15 11:26:09,058 INFO L226 Difference]: Without dead ends: 1837 [2022-04-15 11:26:09,059 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:26:09,060 INFO L913 BasicCegarLoop]: 1375 mSDtfsCounter, 1581 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 517 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:26:09,060 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1633 Valid, 2171 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2327 Invalid, 12 Unknown, 0 Unchecked, 43.1s Time] [2022-04-15 11:26:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2022-04-15 11:26:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1172. [2022-04-15 11:26:09,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:26:09,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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-15 11:26:09,154 INFO L74 IsIncluded]: Start isIncluded. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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-15 11:26:09,156 INFO L87 Difference]: Start difference. First operand 1837 states. Second operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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-15 11:26:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:26:09,257 INFO L93 Difference]: Finished difference Result 1837 states and 2756 transitions. [2022-04-15 11:26:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2756 transitions. [2022-04-15 11:26:09,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:26:09,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:26:09,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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 1837 states. [2022-04-15 11:26:09,292 INFO L87 Difference]: Start difference. First operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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 1837 states. [2022-04-15 11:26:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:26:09,394 INFO L93 Difference]: Finished difference Result 1837 states and 2756 transitions. [2022-04-15 11:26:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2756 transitions. [2022-04-15 11:26:09,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:26:09,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:26:09,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:26:09,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:26:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 892 states have (on average 1.4204035874439462) internal successors, (1267), 895 states have internal predecessors, (1267), 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-15 11:26:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1733 transitions. [2022-04-15 11:26:09,471 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1733 transitions. Word has length 38 [2022-04-15 11:26:09,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:26:09,473 INFO L478 AbstractCegarLoop]: Abstraction has 1172 states and 1733 transitions. [2022-04-15 11:26:09,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 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-15 11:26:09,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1172 states and 1733 transitions. [2022-04-15 11:26:11,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1733 edges. 1733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:26:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1733 transitions. [2022-04-15 11:26:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 11:26:11,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:26:11,783 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] [2022-04-15 11:26:11,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:26:11,783 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:26:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:26:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash 76033968, now seen corresponding path program 1 times [2022-04-15 11:26:11,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:26:11,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759859082] [2022-04-15 11:26:11,784 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:26:11,784 INFO L85 PathProgramCache]: Analyzing trace with hash 76033968, now seen corresponding path program 2 times [2022-04-15 11:26:11,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:26:11,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671884303] [2022-04-15 11:26:11,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:26:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:26:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:26:11,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:26:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:26:11,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {25316#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {25303#true} is VALID [2022-04-15 11:26:11,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {25303#true} assume true; {25303#true} is VALID [2022-04-15 11:26:11,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25303#true} {25303#true} #4308#return; {25303#true} is VALID [2022-04-15 11:26:11,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:26:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:26:11,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {25317#(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; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:26:11,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume true; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:26:11,991 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25311#(not (= ~MPR3~0 ~NP~0))} {25303#true} #4174#return; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:26:12,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 11:26:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:26:12,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {25318#(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 := ~compFptr~0.base + ~compFptr~0.offset; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:12,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {25319#(= ~s~0 ~NP~0)} assume true; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:12,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25319#(= ~s~0 ~NP~0)} {25311#(not (= ~MPR3~0 ~NP~0))} #4176#return; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {25303#true} call ULTIMATE.init(); {25316#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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-15 11:26:12,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {25316#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {25303#true} is VALID [2022-04-15 11:26:12,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {25303#true} assume true; {25303#true} is VALID [2022-04-15 11:26:12,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25303#true} {25303#true} #4308#return; {25303#true} is VALID [2022-04-15 11:26:12,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {25303#true} call #t~ret1021 := main(); {25303#true} is VALID [2022-04-15 11:26:12,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {25303#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 -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {25303#true} is VALID [2022-04-15 11:26:12,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {25303#true} assume !(~a~0 % 4294967296 < 53); {25303#true} is VALID [2022-04-15 11:26:12,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {25303#true} ~a~0 := 0; {25303#true} is VALID [2022-04-15 11:26:12,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {25303#true} assume !(~a~0 % 4294967296 < 36); {25303#true} is VALID [2022-04-15 11:26:12,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {25303#true} ~a~0 := 0; {25303#true} is VALID [2022-04-15 11:26:12,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {25303#true} assume !(~a~0 % 4294967296 < 904); {25303#true} is VALID [2022-04-15 11:26:12,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {25303#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {25303#true} is VALID [2022-04-15 11:26:12,024 INFO L272 TraceCheckUtils]: 12: Hoare triple {25303#true} call _BLAST_init(); {25317#(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-15 11:26:12,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {25317#(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; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:26:12,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume true; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:26:12,025 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {25311#(not (= ~MPR3~0 ~NP~0))} {25303#true} #4174#return; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:26:12,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {25311#(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 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:26:12,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {25311#(not (= ~MPR3~0 ~NP~0))} is VALID [2022-04-15 11:26:12,027 INFO L272 TraceCheckUtils]: 18: Hoare triple {25311#(not (= ~MPR3~0 ~NP~0))} call stub_driver_init(); {25318#(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-15 11:26:12,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {25318#(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 := ~compFptr~0.base + ~compFptr~0.offset; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:12,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {25319#(= ~s~0 ~NP~0)} assume true; {25319#(= ~s~0 ~NP~0)} is VALID [2022-04-15 11:26:12,028 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25319#(= ~s~0 ~NP~0)} {25311#(not (= ~MPR3~0 ~NP~0))} #4176#return; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !!(~status~15 >= 0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(2 == ~__BLAST_NONDET___0~0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume 3 == ~__BLAST_NONDET___0~0; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,029 INFO L272 TraceCheckUtils]: 25: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {25315#(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~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(0 == #t~mem130 % 256);havoc #t~mem130;call #t~mem131 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume 22 == #t~mem131 % 256;havoc #t~mem131; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~mem133 := read~int(~irpSp~0.base, 8 + ~irpSp~0.offset, 4); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume !(1 != #t~mem133);havoc #t~mem133;call #t~mem135.base, #t~mem135.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~1.base, ~deviceExtension~1.offset := #t~mem135.base, #t~mem135.offset;havoc #t~mem135.base, #t~mem135.offset; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,032 INFO L272 TraceCheckUtils]: 31: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} call #t~ret136 := KeWaitForSingleObject(~deviceExtension~1.base, 16 + ~deviceExtension~1.offset, 0, 0, 0, 0, 0); {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {25315#(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~nondet1006 && #t~nondet1006 <= 2147483647;~__BLAST_NONDET___0~14 := #t~nondet1006;havoc #t~nondet1006; {25315#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 11:26:12,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {25315#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {25304#false} is VALID [2022-04-15 11:26:12,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {25304#false} assume !(1 == ~setEventCalled~0); {25304#false} is VALID [2022-04-15 11:26:12,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {25304#false} assume !(1 == ~customIrp~0); {25304#false} is VALID [2022-04-15 11:26:12,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {25304#false} assume ~s~0 == ~MPR3~0; {25304#false} is VALID [2022-04-15 11:26:12,033 INFO L272 TraceCheckUtils]: 37: Hoare triple {25304#false} call errorFn(); {25304#false} is VALID [2022-04-15 11:26:12,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {25304#false} assume !false; {25304#false} is VALID [2022-04-15 11:26:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:26:12,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:26:12,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671884303] [2022-04-15 11:26:12,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671884303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:26:12,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:26:12,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:26:12,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:26:12,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759859082] [2022-04-15 11:26:12,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759859082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:26:12,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:26:12,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:26:12,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105791458] [2022-04-15 11:26:12,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:26:12,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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 39 [2022-04-15 11:26:12,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:26:12,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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-15 11:26:12,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:26:12,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:26:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:26:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:26:12,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:26:12,067 INFO L87 Difference]: Start difference. First operand 1172 states and 1733 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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-15 11:26:35,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-15 11:26:37,121 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-15 11:26:41,035 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-15 11:26:43,729 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:26:52,375 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-15 11:26:54,419 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-15 11:27:01,177 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-15 11:27:03,209 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-15 11:27:05,243 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-15 11:27:07,282 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-15 11:27:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:27:07,908 INFO L93 Difference]: Finished difference Result 2221 states and 3345 transitions. [2022-04-15 11:27:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:27:07,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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 39 [2022-04-15 11:27:07,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:27:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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-15 11:27:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2779 transitions. [2022-04-15 11:27:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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-15 11:27:07,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2779 transitions. [2022-04-15 11:27:07,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 2779 transitions. [2022-04-15 11:27:10,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2779 edges. 2779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:10,985 INFO L225 Difference]: With dead ends: 2221 [2022-04-15 11:27:10,985 INFO L226 Difference]: Without dead ends: 1514 [2022-04-15 11:27:10,987 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-04-15 11:27:10,988 INFO L913 BasicCegarLoop]: 1359 mSDtfsCounter, 3782 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 1393 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3813 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1393 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:27:10,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3813 Valid, 2590 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1393 Valid, 1598 Invalid, 9 Unknown, 0 Unchecked, 27.9s Time] [2022-04-15 11:27:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-04-15 11:27:11,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1166. [2022-04-15 11:27:11,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:27:11,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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-15 11:27:11,106 INFO L74 IsIncluded]: Start isIncluded. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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-15 11:27:11,108 INFO L87 Difference]: Start difference. First operand 1514 states. Second operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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-15 11:27:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:27:11,175 INFO L93 Difference]: Finished difference Result 1514 states and 2268 transitions. [2022-04-15 11:27:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2268 transitions. [2022-04-15 11:27:11,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:27:11,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:27:11,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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 1514 states. [2022-04-15 11:27:11,182 INFO L87 Difference]: Start difference. First operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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 1514 states. [2022-04-15 11:27:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:27:11,249 INFO L93 Difference]: Finished difference Result 1514 states and 2268 transitions. [2022-04-15 11:27:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2268 transitions. [2022-04-15 11:27:11,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:27:11,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:27:11,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:27:11,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:27:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 887 states have (on average 1.4182638105975198) internal successors, (1258), 890 states have internal predecessors, (1258), 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-15 11:27:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1721 transitions. [2022-04-15 11:27:11,319 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1721 transitions. Word has length 39 [2022-04-15 11:27:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:27:11,319 INFO L478 AbstractCegarLoop]: Abstraction has 1166 states and 1721 transitions. [2022-04-15 11:27:11,319 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 5 states have internal predecessors, (29), 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-15 11:27:11,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1166 states and 1721 transitions. [2022-04-15 11:27:13,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1721 transitions. [2022-04-15 11:27:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 11:27:13,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:27:13,642 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] [2022-04-15 11:27:13,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:27:13,642 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:27:13,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:27:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash -610227898, now seen corresponding path program 1 times [2022-04-15 11:27:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:13,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [442339273] [2022-04-15 11:27:13,643 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:27:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash -610227898, now seen corresponding path program 2 times [2022-04-15 11:27:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:27:13,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086508899] [2022-04-15 11:27:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:27:13,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:27:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:27:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:13,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {35153#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {35141#true} is VALID [2022-04-15 11:27:13,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-15 11:27:13,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35141#true} {35141#true} #4308#return; {35141#true} is VALID [2022-04-15 11:27:13,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:27:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:13,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {35154#(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; {35141#true} is VALID [2022-04-15 11:27:13,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-15 11:27:13,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35141#true} {35141#true} #4174#return; {35141#true} is VALID [2022-04-15 11:27:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 11:27:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:27:13,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {35155#(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 := ~compFptr~0.base + ~compFptr~0.offset; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {35152#(= ~compRegistered~0 0)} assume true; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35152#(= ~compRegistered~0 0)} {35141#true} #4176#return; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {35141#true} call ULTIMATE.init(); {35153#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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-15 11:27:13,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {35153#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {35141#true} is VALID [2022-04-15 11:27:13,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-15 11:27:13,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35141#true} {35141#true} #4308#return; {35141#true} is VALID [2022-04-15 11:27:13,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {35141#true} call #t~ret1021 := main(); {35141#true} is VALID [2022-04-15 11:27:13,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {35141#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 -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {35141#true} is VALID [2022-04-15 11:27:13,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {35141#true} assume !(~a~0 % 4294967296 < 53); {35141#true} is VALID [2022-04-15 11:27:13,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {35141#true} ~a~0 := 0; {35141#true} is VALID [2022-04-15 11:27:13,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {35141#true} assume !(~a~0 % 4294967296 < 36); {35141#true} is VALID [2022-04-15 11:27:13,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {35141#true} ~a~0 := 0; {35141#true} is VALID [2022-04-15 11:27:13,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {35141#true} assume !(~a~0 % 4294967296 < 904); {35141#true} is VALID [2022-04-15 11:27:13,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {35141#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {35141#true} is VALID [2022-04-15 11:27:13,960 INFO L272 TraceCheckUtils]: 12: Hoare triple {35141#true} call _BLAST_init(); {35154#(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-15 11:27:13,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {35154#(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; {35141#true} is VALID [2022-04-15 11:27:13,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {35141#true} assume true; {35141#true} is VALID [2022-04-15 11:27:13,960 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35141#true} {35141#true} #4174#return; {35141#true} is VALID [2022-04-15 11:27:13,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {35141#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 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {35141#true} is VALID [2022-04-15 11:27:13,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {35141#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {35141#true} is VALID [2022-04-15 11:27:13,961 INFO L272 TraceCheckUtils]: 18: Hoare triple {35141#true} call stub_driver_init(); {35155#(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-15 11:27:13,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {35155#(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 := ~compFptr~0.base + ~compFptr~0.offset; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {35152#(= ~compRegistered~0 0)} assume true; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,962 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35152#(= ~compRegistered~0 0)} {35141#true} #4176#return; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {35152#(= ~compRegistered~0 0)} assume !!(~status~15 >= 0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {35152#(= ~compRegistered~0 0)} assume !(2 == ~__BLAST_NONDET___0~0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {35152#(= ~compRegistered~0 0)} assume !(3 == ~__BLAST_NONDET___0~0); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {35152#(= ~compRegistered~0 0)} assume 4 == ~__BLAST_NONDET___0~0; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,964 INFO L272 TraceCheckUtils]: 26: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {35152#(= ~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; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {35152#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,965 INFO L272 TraceCheckUtils]: 30: Hoare triple {35152#(= ~compRegistered~0 0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {35152#(= ~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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {35152#(= ~compRegistered~0 0)} is VALID [2022-04-15 11:27:13,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {35152#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {35142#false} is VALID [2022-04-15 11:27:13,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {35142#false} assume 0 == ~routine~0; {35142#false} is VALID [2022-04-15 11:27:13,966 INFO L272 TraceCheckUtils]: 34: Hoare triple {35142#false} call #t~ret1012 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~1.base, ~lcontext~1.offset); {35142#false} is VALID [2022-04-15 11:27:13,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {35142#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; {35142#false} is VALID [2022-04-15 11:27:13,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {35142#false} assume 0 != ~myIrp_PendingReturned~0; {35142#false} is VALID [2022-04-15 11:27:13,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {35142#false} assume !(0 == ~pended~0); {35142#false} is VALID [2022-04-15 11:27:13,966 INFO L272 TraceCheckUtils]: 38: Hoare triple {35142#false} call errorFn(); {35142#false} is VALID [2022-04-15 11:27:13,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {35142#false} assume !false; {35142#false} is VALID [2022-04-15 11:27:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:27:13,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:27:13,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086508899] [2022-04-15 11:27:13,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086508899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:13,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:13,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:27:13,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:27:13,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [442339273] [2022-04-15 11:27:13,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [442339273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:27:13,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:27:13,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:27:13,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798372172] [2022-04-15 11:27:13,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:27:13,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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 40 [2022-04-15 11:27:13,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:27:13,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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-15 11:27:14,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:27:14,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:27:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:27:14,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:27:14,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:27:14,004 INFO L87 Difference]: Start difference. First operand 1166 states and 1721 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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-15 11:27:30,507 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-15 11:27:34,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:36,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:39,433 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-15 11:27:41,598 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-15 11:27:48,249 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-15 11:27:50,292 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-15 11:27:52,331 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-15 11:27:58,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:27:59,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:04,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-15 11:28:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:06,375 INFO L93 Difference]: Finished difference Result 2067 states and 3010 transitions. [2022-04-15 11:28:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:28:06,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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 40 [2022-04-15 11:28:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:28:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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-15 11:28:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2022-04-15 11:28:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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-15 11:28:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2022-04-15 11:28:06,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 1796 transitions. [2022-04-15 11:28:08,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1796 edges. 1796 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:08,556 INFO L225 Difference]: With dead ends: 2067 [2022-04-15 11:28:08,556 INFO L226 Difference]: Without dead ends: 1899 [2022-04-15 11:28:08,557 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-15 11:28:08,558 INFO L913 BasicCegarLoop]: 1135 mSDtfsCounter, 1444 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 333 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:28:08,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1488 Valid, 1831 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 1522 Invalid, 8 Unknown, 0 Unchecked, 27.1s Time] [2022-04-15 11:28:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-15 11:28:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1631. [2022-04-15 11:28:08,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:28:08,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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-15 11:28:08,688 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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-15 11:28:08,690 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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-15 11:28:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:08,788 INFO L93 Difference]: Finished difference Result 1899 states and 2785 transitions. [2022-04-15 11:28:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2785 transitions. [2022-04-15 11:28:08,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:08,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:08,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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 1899 states. [2022-04-15 11:28:08,800 INFO L87 Difference]: Start difference. First operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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 1899 states. [2022-04-15 11:28:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:28:08,901 INFO L93 Difference]: Finished difference Result 1899 states and 2785 transitions. [2022-04-15 11:28:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2785 transitions. [2022-04-15 11:28:08,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:28:08,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:28:08,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:28:08,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:28:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1259 states have (on average 1.4233518665607625) internal successors, (1792), 1260 states have internal predecessors, (1792), 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-15 11:28:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2392 transitions. [2022-04-15 11:28:09,057 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2392 transitions. Word has length 40 [2022-04-15 11:28:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:28:09,057 INFO L478 AbstractCegarLoop]: Abstraction has 1631 states and 2392 transitions. [2022-04-15 11:28:09,057 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 3 states have internal predecessors, (29), 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-15 11:28:09,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1631 states and 2392 transitions. [2022-04-15 11:28:12,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2392 edges. 2392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2392 transitions. [2022-04-15 11:28:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 11:28:12,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:28:12,171 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] [2022-04-15 11:28:12,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:28:12,171 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:28:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:28:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash -305283800, now seen corresponding path program 1 times [2022-04-15 11:28:12,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:28:12,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [599973492] [2022-04-15 11:28:12,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:28:12,172 INFO L85 PathProgramCache]: Analyzing trace with hash -305283800, now seen corresponding path program 2 times [2022-04-15 11:28:12,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:28:12,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360692865] [2022-04-15 11:28:12,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:28:12,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:28:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:28:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {46370#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {46358#true} is VALID [2022-04-15 11:28:12,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 11:28:12,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4308#return; {46358#true} is VALID [2022-04-15 11:28:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:28:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {46371#(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; {46358#true} is VALID [2022-04-15 11:28:12,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 11:28:12,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4174#return; {46358#true} is VALID [2022-04-15 11:28:12,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 11:28:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:28:12,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {46372#(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 := ~compFptr~0.base + ~compFptr~0.offset; {46358#true} is VALID [2022-04-15 11:28:12,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 11:28:12,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46358#true} {46358#true} #4176#return; {46358#true} is VALID [2022-04-15 11:28:12,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {46358#true} call ULTIMATE.init(); {46370#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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-15 11:28:12,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {46370#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {46358#true} is VALID [2022-04-15 11:28:12,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 11:28:12,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46358#true} {46358#true} #4308#return; {46358#true} is VALID [2022-04-15 11:28:12,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {46358#true} call #t~ret1021 := main(); {46358#true} is VALID [2022-04-15 11:28:12,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {46358#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 -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {46358#true} is VALID [2022-04-15 11:28:12,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {46358#true} assume !(~a~0 % 4294967296 < 53); {46358#true} is VALID [2022-04-15 11:28:12,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {46358#true} ~a~0 := 0; {46358#true} is VALID [2022-04-15 11:28:12,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {46358#true} assume !(~a~0 % 4294967296 < 36); {46358#true} is VALID [2022-04-15 11:28:12,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {46358#true} ~a~0 := 0; {46358#true} is VALID [2022-04-15 11:28:12,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {46358#true} assume !(~a~0 % 4294967296 < 904); {46358#true} is VALID [2022-04-15 11:28:12,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {46358#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {46358#true} is VALID [2022-04-15 11:28:12,414 INFO L272 TraceCheckUtils]: 12: Hoare triple {46358#true} call _BLAST_init(); {46371#(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-15 11:28:12,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {46371#(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; {46358#true} is VALID [2022-04-15 11:28:12,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 11:28:12,416 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {46358#true} {46358#true} #4174#return; {46358#true} is VALID [2022-04-15 11:28:12,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {46358#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 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {46358#true} is VALID [2022-04-15 11:28:12,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {46358#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {46358#true} is VALID [2022-04-15 11:28:12,418 INFO L272 TraceCheckUtils]: 18: Hoare triple {46358#true} call stub_driver_init(); {46372#(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-15 11:28:12,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {46372#(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 := ~compFptr~0.base + ~compFptr~0.offset; {46358#true} is VALID [2022-04-15 11:28:12,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {46358#true} assume true; {46358#true} is VALID [2022-04-15 11:28:12,421 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {46358#true} {46358#true} #4176#return; {46358#true} is VALID [2022-04-15 11:28:12,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {46358#true} assume !!(~status~15 >= 0); {46358#true} is VALID [2022-04-15 11:28:12,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {46358#true} assume !(2 == ~__BLAST_NONDET___0~0); {46358#true} is VALID [2022-04-15 11:28:12,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {46358#true} assume !(3 == ~__BLAST_NONDET___0~0); {46358#true} is VALID [2022-04-15 11:28:12,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {46358#true} assume 4 == ~__BLAST_NONDET___0~0; {46358#true} is VALID [2022-04-15 11:28:12,421 INFO L272 TraceCheckUtils]: 26: Hoare triple {46358#true} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {46358#true} is VALID [2022-04-15 11:28:12,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {46358#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; {46358#true} is VALID [2022-04-15 11:28:12,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {46358#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:28:12,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:28:12,427 INFO L272 TraceCheckUtils]: 30: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:28:12,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {46369#(= ~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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:28:12,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:28:12,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume 0 == ~__BLAST_NONDET___0~17; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:28:12,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} ~returnVal~0 := 0; {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:28:12,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:28:12,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {46369#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:28:12,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {46369#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {46359#false} is VALID [2022-04-15 11:28:12,430 INFO L272 TraceCheckUtils]: 38: Hoare triple {46359#false} call errorFn(); {46359#false} is VALID [2022-04-15 11:28:12,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {46359#false} assume !false; {46359#false} is VALID [2022-04-15 11:28:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:28:12,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:28:12,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360692865] [2022-04-15 11:28:12,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360692865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:28:12,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:28:12,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:28:12,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:28:12,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [599973492] [2022-04-15 11:28:12,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [599973492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:28:12,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:28:12,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:28:12,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000793816] [2022-04-15 11:28:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:28:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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 40 [2022-04-15 11:28:12,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:28:12,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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-15 11:28:12,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:28:12,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:28:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:28:12,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:28:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:28:12,463 INFO L87 Difference]: Start difference. First operand 1631 states and 2392 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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-15 11:28:25,174 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-15 11:28:28,478 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-15 11:28:31,504 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-15 11:28:35,202 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-15 11:28:37,245 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-15 11:28:39,377 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-15 11:28:43,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:48,372 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:28:57,318 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-15 11:28:59,351 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-15 11:29:03,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:06,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:10,241 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-15 11:29:12,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:29:14,063 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-15 11:29:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:18,105 INFO L93 Difference]: Finished difference Result 1768 states and 2618 transitions. [2022-04-15 11:29:18,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 11:29:18,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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 40 [2022-04-15 11:29:18,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:29:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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-15 11:29:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1234 transitions. [2022-04-15 11:29:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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-15 11:29:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1234 transitions. [2022-04-15 11:29:18,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 1234 transitions. [2022-04-15 11:29:19,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1234 edges. 1234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:19,655 INFO L225 Difference]: With dead ends: 1768 [2022-04-15 11:29:19,656 INFO L226 Difference]: Without dead ends: 1764 [2022-04-15 11:29:19,656 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-15 11:29:19,658 INFO L913 BasicCegarLoop]: 904 mSDtfsCounter, 939 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 360 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:29:19,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [963 Valid, 1479 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1631 Invalid, 9 Unknown, 0 Unchecked, 34.0s Time] [2022-04-15 11:29:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-04-15 11:29:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1630. [2022-04-15 11:29:19,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:29:19,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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-15 11:29:19,953 INFO L74 IsIncluded]: Start isIncluded. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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-15 11:29:19,961 INFO L87 Difference]: Start difference. First operand 1764 states. Second operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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-15 11:29:20,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:20,099 INFO L93 Difference]: Finished difference Result 1764 states and 2613 transitions. [2022-04-15 11:29:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2613 transitions. [2022-04-15 11:29:20,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:20,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:20,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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 1764 states. [2022-04-15 11:29:20,107 INFO L87 Difference]: Start difference. First operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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 1764 states. [2022-04-15 11:29:20,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:29:20,195 INFO L93 Difference]: Finished difference Result 1764 states and 2613 transitions. [2022-04-15 11:29:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2613 transitions. [2022-04-15 11:29:20,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:29:20,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:29:20,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:29:20,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:29:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1259 states have (on average 1.4217633042096902) internal successors, (1790), 1259 states have internal predecessors, (1790), 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-15 11:29:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2389 transitions. [2022-04-15 11:29:20,336 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2389 transitions. Word has length 40 [2022-04-15 11:29:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:29:20,336 INFO L478 AbstractCegarLoop]: Abstraction has 1630 states and 2389 transitions. [2022-04-15 11:29:20,336 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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-15 11:29:20,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1630 states and 2389 transitions. [2022-04-15 11:29:23,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2389 edges. 2389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2389 transitions. [2022-04-15 11:29:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 11:29:23,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:29:23,455 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:29:23,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:29:23,455 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:29:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:29:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2118625593, now seen corresponding path program 1 times [2022-04-15 11:29:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:23,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1116935236] [2022-04-15 11:29:23,457 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:29:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2118625593, now seen corresponding path program 2 times [2022-04-15 11:29:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:29:23,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838164228] [2022-04-15 11:29:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:29:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:29:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:23,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:29:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:23,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {56722#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {56704#true} is VALID [2022-04-15 11:29:23,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 11:29:23,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4308#return; {56704#true} is VALID [2022-04-15 11:29:23,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:29:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:23,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {56723#(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; {56704#true} is VALID [2022-04-15 11:29:23,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 11:29:23,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4174#return; {56704#true} is VALID [2022-04-15 11:29:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 11:29:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:23,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {56724#(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 := ~compFptr~0.base + ~compFptr~0.offset; {56704#true} is VALID [2022-04-15 11:29:23,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 11:29:23,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56704#true} {56704#true} #4176#return; {56704#true} is VALID [2022-04-15 11:29:23,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 11:29:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:29:23,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {56704#true} is VALID [2022-04-15 11:29:23,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {56704#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {56704#true} is VALID [2022-04-15 11:29:23,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {56704#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {56704#true} is VALID [2022-04-15 11:29:23,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {56704#true} assume #res.base == dest.base && #res.offset == dest.offset; {56704#true} is VALID [2022-04-15 11:29:23,723 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {56704#true} {56704#true} #4356#return; {56704#true} is VALID [2022-04-15 11:29:23,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {56704#true} call ULTIMATE.init(); {56722#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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-15 11:29:23,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {56722#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {56704#true} is VALID [2022-04-15 11:29:23,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 11:29:23,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56704#true} {56704#true} #4308#return; {56704#true} is VALID [2022-04-15 11:29:23,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {56704#true} call #t~ret1021 := main(); {56704#true} is VALID [2022-04-15 11:29:23,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {56704#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 -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {56704#true} is VALID [2022-04-15 11:29:23,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {56704#true} assume !(~a~0 % 4294967296 < 53); {56704#true} is VALID [2022-04-15 11:29:23,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {56704#true} ~a~0 := 0; {56704#true} is VALID [2022-04-15 11:29:23,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {56704#true} assume !(~a~0 % 4294967296 < 36); {56704#true} is VALID [2022-04-15 11:29:23,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {56704#true} ~a~0 := 0; {56704#true} is VALID [2022-04-15 11:29:23,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {56704#true} assume !(~a~0 % 4294967296 < 904); {56704#true} is VALID [2022-04-15 11:29:23,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {56704#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {56704#true} is VALID [2022-04-15 11:29:23,727 INFO L272 TraceCheckUtils]: 12: Hoare triple {56704#true} call _BLAST_init(); {56723#(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-15 11:29:23,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {56723#(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; {56704#true} is VALID [2022-04-15 11:29:23,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 11:29:23,727 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56704#true} {56704#true} #4174#return; {56704#true} is VALID [2022-04-15 11:29:23,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {56704#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 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {56704#true} is VALID [2022-04-15 11:29:23,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {56704#true} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {56704#true} is VALID [2022-04-15 11:29:23,728 INFO L272 TraceCheckUtils]: 18: Hoare triple {56704#true} call stub_driver_init(); {56724#(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-15 11:29:23,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {56724#(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 := ~compFptr~0.base + ~compFptr~0.offset; {56704#true} is VALID [2022-04-15 11:29:23,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {56704#true} assume true; {56704#true} is VALID [2022-04-15 11:29:23,728 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {56704#true} {56704#true} #4176#return; {56704#true} is VALID [2022-04-15 11:29:23,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {56704#true} assume !!(~status~15 >= 0); {56704#true} is VALID [2022-04-15 11:29:23,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {56704#true} assume !(2 == ~__BLAST_NONDET___0~0); {56704#true} is VALID [2022-04-15 11:29:23,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {56704#true} assume 3 == ~__BLAST_NONDET___0~0; {56704#true} is VALID [2022-04-15 11:29:23,728 INFO L272 TraceCheckUtils]: 25: Hoare triple {56704#true} call #t~ret979 := CdAudioPnp(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {56704#true} is VALID [2022-04-15 11:29:23,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {56704#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~mem129.base, #t~mem129.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~0.base, ~irpSp~0.offset := #t~mem129.base, #t~mem129.offset;havoc #t~mem129.base, #t~mem129.offset;~status~3 := -1073741637;call #t~mem130 := read~int(~irpSp~0.base, 1 + ~irpSp~0.offset, 1); {56704#true} is VALID [2022-04-15 11:29:23,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {56704#true} assume 0 == #t~mem130 % 256;havoc #t~mem130; {56704#true} is VALID [2022-04-15 11:29:23,728 INFO L272 TraceCheckUtils]: 28: Hoare triple {56704#true} call #t~ret132 := CdAudioStartDevice(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56704#true} is VALID [2022-04-15 11:29:23,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {56704#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(41);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(4);call ~#keyValue~0.base, ~#keyValue~0.offset := #Ultimate.allocOnStack(4);call #t~mem64.base, #t~mem64.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~0.base, ~deviceExtension~0.offset := #t~mem64.base, #t~mem64.offset;havoc #t~mem64.base, #t~mem64.offset; {56704#true} is VALID [2022-04-15 11:29:23,729 INFO L272 TraceCheckUtils]: 30: Hoare triple {56704#true} call #t~ret65 := CdAudioForwardIrpSynchronous(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {56704#true} is VALID [2022-04-15 11:29:23,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {56704#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(16);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~mem945.base, #t~mem945.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~15.base, ~deviceExtension~15.offset := #t~mem945.base, #t~mem945.offset;havoc #t~mem945.base, #t~mem945.offset;call #t~mem946.base, #t~mem946.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~2.base, ~irpSp~2.offset := #t~mem946.base, #t~mem946.offset;havoc #t~mem946.base, #t~mem946.offset;call #t~mem947.base, #t~mem947.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~1.base, ~nextIrpSp~1.offset := #t~mem947.base, #t~mem947.offset - 36;havoc #t~mem947.base, #t~mem947.offset; {56704#true} is VALID [2022-04-15 11:29:23,730 INFO L272 TraceCheckUtils]: 32: Hoare triple {56704#true} call #t~memcpy~res948.base, #t~memcpy~res948.offset := #Ultimate.C_memcpy(~nextIrpSp~1.base, ~nextIrpSp~1.offset, ~irpSp~2.base, ~irpSp~2.offset, 28); {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:29:23,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {56725#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {56704#true} is VALID [2022-04-15 11:29:23,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {56704#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {56704#true} is VALID [2022-04-15 11:29:23,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {56704#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {56704#true} is VALID [2022-04-15 11:29:23,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {56704#true} assume #res.base == dest.base && #res.offset == dest.offset; {56704#true} is VALID [2022-04-15 11:29:23,731 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {56704#true} {56704#true} #4356#return; {56704#true} is VALID [2022-04-15 11:29:23,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {56704#true} havoc #t~memcpy~res948.base, #t~memcpy~res948.offset;call write~int(0, ~nextIrpSp~1.base, 3 + ~nextIrpSp~1.offset, 1); {56704#true} is VALID [2022-04-15 11:29:23,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {56704#true} assume !(~s~0 != ~NP~0); {56704#true} is VALID [2022-04-15 11:29:23,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {56704#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1;~routine~0 := 1;~compFptr~0.base, ~compFptr~0.offset := #funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset; {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 11:29:23,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} call #t~mem949.base, #t~mem949.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~1.base, ~irpSp___0~1.offset := #t~mem949.base, #t~mem949.offset - 36;havoc #t~mem949.base, #t~mem949.offset;call write~$Pointer$(#funAddr~CdAudioSignalCompletion.base, #funAddr~CdAudioSignalCompletion.offset, ~irpSp___0~1.base, 28 + ~irpSp___0~1.offset, 4);call write~$Pointer$(~#event~2.base, ~#event~2.offset, ~irpSp___0~1.base, 32 + ~irpSp___0~1.offset, 4);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~mem950 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem950 % 256, 128), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem950;call #t~mem951 := read~int(~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);call write~int(~bitwiseOr(#t~mem951 % 256, 32), ~irpSp___0~1.base, 3 + ~irpSp___0~1.offset, 1);havoc #t~mem951;call #t~mem952.base, #t~mem952.offset := read~$Pointer$(~deviceExtension~15.base, ~deviceExtension~15.offset, 4); {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 11:29:23,733 INFO L272 TraceCheckUtils]: 42: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} call #t~ret953 := IofCallDriver(#t~mem952.base, #t~mem952.offset, ~Irp.base, ~Irp.offset); {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 11:29:23,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {56720#(= ~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~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet999;havoc #t~nondet999;havoc ~returnVal2~0;assume -2147483648 <= #t~nondet1000 && #t~nondet1000 <= 2147483647;~compRetStatus~0 := #t~nondet1000;havoc #t~nondet1000;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {56720#(= ~compRegistered~0 ~routine~0)} is VALID [2022-04-15 11:29:23,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {56720#(= ~compRegistered~0 ~routine~0)} assume 0 != ~compRegistered~0; {56721#(not (= ~routine~0 0))} is VALID [2022-04-15 11:29:23,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {56721#(not (= ~routine~0 0))} assume 0 == ~routine~0; {56705#false} is VALID [2022-04-15 11:29:23,734 INFO L272 TraceCheckUtils]: 46: Hoare triple {56705#false} call #t~ret1001 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {56705#false} is VALID [2022-04-15 11:29:23,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {56705#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; {56705#false} is VALID [2022-04-15 11:29:23,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {56705#false} assume 0 != ~myIrp_PendingReturned~0; {56705#false} is VALID [2022-04-15 11:29:23,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {56705#false} assume !(0 == ~pended~0); {56705#false} is VALID [2022-04-15 11:29:23,734 INFO L272 TraceCheckUtils]: 50: Hoare triple {56705#false} call errorFn(); {56705#false} is VALID [2022-04-15 11:29:23,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {56705#false} assume !false; {56705#false} is VALID [2022-04-15 11:29:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:29:23,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:29:23,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838164228] [2022-04-15 11:29:23,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838164228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:23,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:23,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:29:23,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:29:23,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1116935236] [2022-04-15 11:29:23,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1116935236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:29:23,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:29:23,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 11:29:23,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234591554] [2022-04-15 11:29:23,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:29:23,737 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, (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 52 [2022-04-15 11:29:23,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:29:23,738 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, (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-15 11:29:23,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:29:23,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 11:29:23,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:29:23,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 11:29:23,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 11:29:23,779 INFO L87 Difference]: Start difference. First operand 1630 states and 2389 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, (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-15 11:29:47,976 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-15 11:29:50,027 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-15 11:29:52,068 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-15 11:29:56,690 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-15 11:29:59,856 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-15 11:30:03,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-15 11:30:05,221 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-15 11:30:10,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:13,685 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-15 11:30:18,403 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-15 11:30:22,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:24,186 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-15 11:30:25,500 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-15 11:30:27,518 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-15 11:30:34,475 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-15 11:30:36,524 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-15 11:30:42,017 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-15 11:30:44,066 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-15 11:30:53,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:30:55,653 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-15 11:30:57,816 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-15 11:30:59,850 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-15 11:31:06,683 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-15 11:31:08,689 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-15 11:31:13,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:14,781 INFO L93 Difference]: Finished difference Result 2734 states and 4044 transitions. [2022-04-15 11:31:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 11:31:14,781 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, (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 52 [2022-04-15 11:31:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:31:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. 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, (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-15 11:31:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2103 transitions. [2022-04-15 11:31:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. 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, (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-15 11:31:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2103 transitions. [2022-04-15 11:31:14,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 2103 transitions. [2022-04-15 11:31:17,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2103 edges. 2103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:17,476 INFO L225 Difference]: With dead ends: 2734 [2022-04-15 11:31:17,476 INFO L226 Difference]: Without dead ends: 1596 [2022-04-15 11:31:17,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:31:17,503 INFO L913 BasicCegarLoop]: 922 mSDtfsCounter, 2060 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 3245 mSolverCounterSat, 1015 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 4276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1015 IncrementalHoareTripleChecker+Valid, 3245 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:31:17,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2086 Valid, 1659 Invalid, 4276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1015 Valid, 3245 Invalid, 16 Unknown, 0 Unchecked, 60.7s Time] [2022-04-15 11:31:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-04-15 11:31:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1203. [2022-04-15 11:31:17,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:31:17,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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-15 11:31:17,639 INFO L74 IsIncluded]: Start isIncluded. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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-15 11:31:17,641 INFO L87 Difference]: Start difference. First operand 1596 states. Second operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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-15 11:31:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:17,779 INFO L93 Difference]: Finished difference Result 1596 states and 2399 transitions. [2022-04-15 11:31:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2399 transitions. [2022-04-15 11:31:17,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:17,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:17,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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 1596 states. [2022-04-15 11:31:17,786 INFO L87 Difference]: Start difference. First operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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 1596 states. [2022-04-15 11:31:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:31:17,862 INFO L93 Difference]: Finished difference Result 1596 states and 2399 transitions. [2022-04-15 11:31:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2399 transitions. [2022-04-15 11:31:17,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:31:17,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:31:17,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:31:17,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:31:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 930 states have (on average 1.4043010752688172) internal successors, (1306), 932 states have internal predecessors, (1306), 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-15 11:31:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1742 transitions. [2022-04-15 11:31:17,934 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1742 transitions. Word has length 52 [2022-04-15 11:31:17,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:31:17,934 INFO L478 AbstractCegarLoop]: Abstraction has 1203 states and 1742 transitions. [2022-04-15 11:31:17,934 INFO L479 AbstractCegarLoop]: INTERPOLANT 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, (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-15 11:31:17,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1203 states and 1742 transitions. [2022-04-15 11:31:20,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1742 edges. 1742 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1742 transitions. [2022-04-15 11:31:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 11:31:20,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:31:20,376 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:31:20,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:31:20,376 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:31:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:31:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash 975245132, now seen corresponding path program 1 times [2022-04-15 11:31:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:20,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [126178480] [2022-04-15 11:31:20,377 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:31:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash 975245132, now seen corresponding path program 2 times [2022-04-15 11:31:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:31:20,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040407434] [2022-04-15 11:31:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:31:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:31:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:20,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:31:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:20,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {67836#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume true; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67824#(= ~myIrp_PendingReturned~0 0)} {67819#true} #4308#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:31:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:20,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {67837#(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; {67819#true} is VALID [2022-04-15 11:31:20,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-15 11:31:20,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4174#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 11:31:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:20,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {67838#(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 := ~compFptr~0.base + ~compFptr~0.offset; {67819#true} is VALID [2022-04-15 11:31:20,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-15 11:31:20,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4176#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-15 11:31:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:31:20,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {67819#true} is VALID [2022-04-15 11:31:20,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {67819#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {67819#true} is VALID [2022-04-15 11:31:20,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {67819#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {67819#true} is VALID [2022-04-15 11:31:20,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {67819#true} assume #res.base == dest.base && #res.offset == dest.offset; {67819#true} is VALID [2022-04-15 11:31:20,636 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4056#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {67819#true} call ULTIMATE.init(); {67836#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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-15 11:31:20,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {67836#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume true; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67824#(= ~myIrp_PendingReturned~0 0)} {67819#true} #4308#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret1021 := main(); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {67824#(= ~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 -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 4294967296 < 53); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 4294967296 < 36); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~a~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~a~0 % 4294967296 < 904); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,640 INFO L272 TraceCheckUtils]: 12: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call _BLAST_init(); {67837#(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-15 11:31:20,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {67837#(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; {67819#true} is VALID [2022-04-15 11:31:20,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-15 11:31:20,641 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4174#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {67824#(= ~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 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,642 INFO L272 TraceCheckUtils]: 18: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call stub_driver_init(); {67838#(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-15 11:31:20,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {67838#(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 := ~compFptr~0.base + ~compFptr~0.offset; {67819#true} is VALID [2022-04-15 11:31:20,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {67819#true} assume true; {67819#true} is VALID [2022-04-15 11:31:20,644 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4176#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !!(~status~15 >= 0); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 2 == ~__BLAST_NONDET___0~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,647 INFO L272 TraceCheckUtils]: 24: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret978 := CdAudioDeviceControl(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {67824#(= ~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~mem159.base, #t~mem159.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~3.base, ~deviceExtension~3.offset := #t~mem159.base, #t~mem159.offset;havoc #t~mem159.base, #t~mem159.offset;call #t~mem160 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(2 == #t~mem160 % 256);havoc #t~mem160;call #t~mem161 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(3 == #t~mem161 % 256);havoc #t~mem161;call #t~mem162 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(1 == #t~mem162 % 256);havoc #t~mem162;call #t~mem163 := read~int(~deviceExtension~3.base, 44 + ~deviceExtension~3.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 7 == #t~mem163 % 256;havoc #t~mem163; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,649 INFO L272 TraceCheckUtils]: 30: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret167 := CdAudioHPCdrDeviceControl(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {67824#(= ~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~mem932.base, #t~mem932.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~currentIrpStack~7.base, ~currentIrpStack~7.offset := #t~mem932.base, #t~mem932.offset;havoc #t~mem932.base, #t~mem932.offset;call #t~mem933.base, #t~mem933.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpStack~0.base, ~nextIrpStack~0.offset := #t~mem933.base, #t~mem933.offset - 36;havoc #t~mem933.base, #t~mem933.offset;call #t~mem934.base, #t~mem934.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~14.base, ~deviceExtension~14.offset := #t~mem934.base, #t~mem934.offset;havoc #t~mem934.base, #t~mem934.offset;call #t~mem935 := read~int(~currentIrpStack~7.base, 12 + ~currentIrpStack~7.offset, 4); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume #t~mem935 % 4294967296 == ~bitwiseOr(~bitwiseOr(131072, 16384), 56) % 4294967296;havoc #t~mem935;call #t~mem936.base, #t~mem936.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp~1.base, ~irpSp~1.offset := #t~mem936.base, #t~mem936.offset;havoc #t~mem936.base, #t~mem936.offset;call #t~mem937.base, #t~mem937.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~nextIrpSp~0.base, ~nextIrpSp~0.offset := #t~mem937.base, #t~mem937.offset - 36;havoc #t~mem937.base, #t~mem937.offset; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,650 INFO L272 TraceCheckUtils]: 33: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~memcpy~res938.base, #t~memcpy~res938.offset := #Ultimate.C_memcpy(~nextIrpSp~0.base, ~nextIrpSp~0.offset, ~irpSp~1.base, ~irpSp~1.offset, 28); {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-15 11:31:20,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {67839#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1023 := 0; {67819#true} is VALID [2022-04-15 11:31:20,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {67819#true} assume !(#t~loopctr1023 % 4294967296 < size % 4294967296);#t~loopctr1031 := 0; {67819#true} is VALID [2022-04-15 11:31:20,651 INFO L290 TraceCheckUtils]: 36: Hoare triple {67819#true} assume !(#t~loopctr1031 % 4294967296 < size % 4294967296); {67819#true} is VALID [2022-04-15 11:31:20,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {67819#true} assume #res.base == dest.base && #res.offset == dest.offset; {67819#true} is VALID [2022-04-15 11:31:20,651 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {67819#true} {67824#(= ~myIrp_PendingReturned~0 0)} #4056#return; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} havoc #t~memcpy~res938.base, #t~memcpy~res938.offset;call write~int(0, ~nextIrpSp~0.base, 3 + ~nextIrpSp~0.offset, 1); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume !(~s~0 != ~NP~0); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {67824#(= ~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; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~mem939.base, #t~mem939.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);~irpSp___0~0.base, ~irpSp___0~0.offset := #t~mem939.base, #t~mem939.offset - 36;havoc #t~mem939.base, #t~mem939.offset;call write~$Pointer$(#funAddr~HPCdrCompletion.base, #funAddr~HPCdrCompletion.offset, ~irpSp___0~0.base, 28 + ~irpSp___0~0.offset, 4);call write~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, ~irpSp___0~0.base, 32 + ~irpSp___0~0.offset, 4);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~mem940 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem940 % 256, 128), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem940;call #t~mem941 := read~int(~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);call write~int(~bitwiseOr(#t~mem941 % 256, 32), ~irpSp___0~0.base, 3 + ~irpSp___0~0.offset, 1);havoc #t~mem941;call #t~mem942.base, #t~mem942.offset := read~$Pointer$(~deviceExtension~14.base, ~deviceExtension~14.offset, 4); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,653 INFO L272 TraceCheckUtils]: 43: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret943 := IofCallDriver(#t~mem942.base, #t~mem942.offset, ~Irp.base, ~Irp.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {67824#(= ~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~nondet999 && #t~nondet999 <= 2147483647;~__BLAST_NONDET___0~12 := #t~nondet999;havoc #t~nondet999;havoc ~returnVal2~0;assume -2147483648 <= #t~nondet1000 && #t~nondet1000 <= 2147483647;~compRetStatus~0 := #t~nondet1000;havoc #t~nondet1000;~lcontext~0.base, ~lcontext~0.offset := 0, 0;havoc ~tmp~23;havoc ~tmp___0~9; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,653 INFO L290 TraceCheckUtils]: 45: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~compRegistered~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,653 INFO L290 TraceCheckUtils]: 46: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 == ~routine~0; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,654 INFO L272 TraceCheckUtils]: 47: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} call #t~ret1001 := HPCdrCompletion(~DeviceObject.base, ~DeviceObject.offset, ~Irp.base, ~Irp.offset, ~lcontext~0.base, ~lcontext~0.offset); {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,654 INFO L290 TraceCheckUtils]: 48: Hoare triple {67824#(= ~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; {67824#(= ~myIrp_PendingReturned~0 0)} is VALID [2022-04-15 11:31:20,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {67824#(= ~myIrp_PendingReturned~0 0)} assume 0 != ~myIrp_PendingReturned~0; {67820#false} is VALID [2022-04-15 11:31:20,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {67820#false} assume !(0 == ~pended~0); {67820#false} is VALID [2022-04-15 11:31:20,655 INFO L272 TraceCheckUtils]: 51: Hoare triple {67820#false} call errorFn(); {67820#false} is VALID [2022-04-15 11:31:20,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {67820#false} assume !false; {67820#false} is VALID [2022-04-15 11:31:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:31:20,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:31:20,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040407434] [2022-04-15 11:31:20,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040407434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:20,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:20,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 11:31:20,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:31:20,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [126178480] [2022-04-15 11:31:20,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [126178480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:31:20,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:31:20,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 11:31:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419608402] [2022-04-15 11:31:20,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:31:20,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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 53 [2022-04-15 11:31:20,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:31:20,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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-15 11:31:20,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:31:20,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 11:31:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:31:20,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 11:31:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:31:20,702 INFO L87 Difference]: Start difference. First operand 1203 states and 1742 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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-15 11:31:35,891 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-15 11:31:41,415 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-15 11:31:45,470 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-15 11:31:50,035 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-15 11:31:53,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:31:55,653 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-15 11:32:00,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:02,756 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-15 11:32:07,551 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-15 11:32:11,659 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-15 11:32:14,052 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-15 11:32:18,613 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-15 11:32:23,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:28,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:32:30,086 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-15 11:32:34,133 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-15 11:32:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:34,953 INFO L93 Difference]: Finished difference Result 2154 states and 3211 transitions. [2022-04-15 11:32:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 11:32:34,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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 53 [2022-04-15 11:32:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:32:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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-15 11:32:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1904 transitions. [2022-04-15 11:32:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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-15 11:32:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1904 transitions. [2022-04-15 11:32:35,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 1904 transitions. [2022-04-15 11:32:37,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1904 edges. 1904 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:37,534 INFO L225 Difference]: With dead ends: 2154 [2022-04-15 11:32:37,534 INFO L226 Difference]: Without dead ends: 1486 [2022-04-15 11:32:37,535 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-15 11:32:37,536 INFO L913 BasicCegarLoop]: 761 mSDtfsCounter, 1797 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 741 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 2521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:32:37,536 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1856 Valid, 1170 Invalid, 2521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 1768 Invalid, 12 Unknown, 0 Unchecked, 39.3s Time] [2022-04-15 11:32:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2022-04-15 11:32:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1200. [2022-04-15 11:32:37,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:32:37,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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-15 11:32:37,693 INFO L74 IsIncluded]: Start isIncluded. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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-15 11:32:37,694 INFO L87 Difference]: Start difference. First operand 1486 states. Second operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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-15 11:32:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:37,755 INFO L93 Difference]: Finished difference Result 1486 states and 2244 transitions. [2022-04-15 11:32:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2244 transitions. [2022-04-15 11:32:37,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:37,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:37,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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 1486 states. [2022-04-15 11:32:37,761 INFO L87 Difference]: Start difference. First operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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 1486 states. [2022-04-15 11:32:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:32:37,821 INFO L93 Difference]: Finished difference Result 1486 states and 2244 transitions. [2022-04-15 11:32:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2244 transitions. [2022-04-15 11:32:37,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:32:37,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:32:37,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:32:37,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:32:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 928 states have (on average 1.396551724137931) internal successors, (1296), 929 states have internal predecessors, (1296), 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-15 11:32:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1731 transitions. [2022-04-15 11:32:37,891 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1731 transitions. Word has length 53 [2022-04-15 11:32:37,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:32:37,892 INFO L478 AbstractCegarLoop]: Abstraction has 1200 states and 1731 transitions. [2022-04-15 11:32:37,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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-15 11:32:37,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1200 states and 1731 transitions. [2022-04-15 11:32:40,606 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-15 11:32:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1731 transitions. [2022-04-15 11:32:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 11:32:40,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:32:40,608 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:32:40,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:32:40,608 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:32:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:32:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -990249866, now seen corresponding path program 1 times [2022-04-15 11:32:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:40,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [567970812] [2022-04-15 11:32:40,619 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:32:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash -990249866, now seen corresponding path program 2 times [2022-04-15 11:32:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:32:40,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375694206] [2022-04-15 11:32:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:32:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:32:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:32:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:40,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {77562#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {77535#true} is VALID [2022-04-15 11:32:40,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-15 11:32:40,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77535#true} {77535#true} #4308#return; {77535#true} is VALID [2022-04-15 11:32:40,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:32:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:40,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {77563#(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; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume true; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,765 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77543#(not (= ~SKIP1~0 ~NP~0))} {77535#true} #4174#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 11:32:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:40,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {77564#(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 := ~compFptr~0.base + ~compFptr~0.offset; {77535#true} is VALID [2022-04-15 11:32:40,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-15 11:32:40,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77535#true} {77543#(not (= ~SKIP1~0 ~NP~0))} #4176#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:32:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:40,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 11:32:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:32:40,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {77565#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,862 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:32:40,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {77565#(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; {77535#true} is VALID [2022-04-15 11:32:40,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {77535#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:32:40,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:32:40,864 INFO L272 TraceCheckUtils]: 3: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {77565#(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-15 11:32:40,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {77565#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,866 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:32:40,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret960 && #t~ret960 <= 2147483647;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:32:40,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume true; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:32:40,867 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {77575#(= ~SKIP1~0 ~NP~0)} {77543#(not (= ~SKIP1~0 ~NP~0))} #4182#return; {77536#false} is VALID [2022-04-15 11:32:40,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {77535#true} call ULTIMATE.init(); {77562#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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-15 11:32:40,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {77562#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {77535#true} is VALID [2022-04-15 11:32:40,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-15 11:32:40,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77535#true} {77535#true} #4308#return; {77535#true} is VALID [2022-04-15 11:32:40,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {77535#true} call #t~ret1021 := main(); {77535#true} is VALID [2022-04-15 11:32:40,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {77535#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 -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {77535#true} is VALID [2022-04-15 11:32:40,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {77535#true} assume !(~a~0 % 4294967296 < 53); {77535#true} is VALID [2022-04-15 11:32:40,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {77535#true} ~a~0 := 0; {77535#true} is VALID [2022-04-15 11:32:40,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {77535#true} assume !(~a~0 % 4294967296 < 36); {77535#true} is VALID [2022-04-15 11:32:40,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {77535#true} ~a~0 := 0; {77535#true} is VALID [2022-04-15 11:32:40,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {77535#true} assume !(~a~0 % 4294967296 < 904); {77535#true} is VALID [2022-04-15 11:32:40,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {77535#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {77535#true} is VALID [2022-04-15 11:32:40,871 INFO L272 TraceCheckUtils]: 12: Hoare triple {77535#true} call _BLAST_init(); {77563#(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-15 11:32:40,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {77563#(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; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume true; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,872 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {77543#(not (= ~SKIP1~0 ~NP~0))} {77535#true} #4174#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {77543#(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 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,873 INFO L272 TraceCheckUtils]: 18: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {77564#(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-15 11:32:40,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {77564#(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 := ~compFptr~0.base + ~compFptr~0.offset; {77535#true} is VALID [2022-04-15 11:32:40,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {77535#true} assume true; {77535#true} is VALID [2022-04-15 11:32:40,874 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {77535#true} {77543#(not (= ~SKIP1~0 ~NP~0))} #4176#return; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !!(~status~15 >= 0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !(2 == ~__BLAST_NONDET___0~0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume !(3 == ~__BLAST_NONDET___0~0); {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} assume 4 == ~__BLAST_NONDET___0~0; {77543#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-15 11:32:40,876 INFO L272 TraceCheckUtils]: 26: Hoare triple {77543#(not (= ~SKIP1~0 ~NP~0))} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {77565#(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-15 11:32:40,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {77565#(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; {77535#true} is VALID [2022-04-15 11:32:40,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {77535#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:32:40,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {77566#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 11:32:40,877 INFO L272 TraceCheckUtils]: 30: Hoare triple {77566#(= ~SKIP1~0 ~s~0)} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {77565#(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-15 11:32:40,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {77565#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume 0 == ~__BLAST_NONDET___0~17; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} ~returnVal~0 := 0; {77576#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {77576#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal~0; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {77577#(= ~NP~0 |old(~s~0)|)} assume true; {77577#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-15 11:32:40,880 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77577#(= ~NP~0 |old(~s~0)|)} {77566#(= ~SKIP1~0 ~s~0)} #3908#return; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:32:40,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret960 && #t~ret960 <= 2147483647;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:32:40,880 INFO L290 TraceCheckUtils]: 40: Hoare triple {77575#(= ~SKIP1~0 ~NP~0)} assume true; {77575#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-15 11:32:40,881 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {77575#(= ~SKIP1~0 ~NP~0)} {77543#(not (= ~SKIP1~0 ~NP~0))} #4182#return; {77536#false} is VALID [2022-04-15 11:32:40,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {77536#false} assume -2147483648 <= #t~ret980 && #t~ret980 <= 2147483647;~status~15 := #t~ret980;havoc #t~ret980; {77536#false} is VALID [2022-04-15 11:32:40,881 INFO L290 TraceCheckUtils]: 43: Hoare triple {77536#false} assume 0 != ~we_should_unload~0; {77536#false} is VALID [2022-04-15 11:32:40,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-15 11:32:40,881 INFO L290 TraceCheckUtils]: 45: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-15 11:32:40,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {77536#false} assume !(~s~0 == ~UNLOADED~0); {77536#false} is VALID [2022-04-15 11:32:40,881 INFO L290 TraceCheckUtils]: 47: Hoare triple {77536#false} assume !(-1 == ~status~15); {77536#false} is VALID [2022-04-15 11:32:40,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {77536#false} assume !(~s~0 != ~SKIP2~0); {77536#false} is VALID [2022-04-15 11:32:40,882 INFO L290 TraceCheckUtils]: 49: Hoare triple {77536#false} assume !(1 == ~pended~0); {77536#false} is VALID [2022-04-15 11:32:40,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {77536#false} assume ~s~0 == ~DC~0; {77536#false} is VALID [2022-04-15 11:32:40,882 INFO L272 TraceCheckUtils]: 51: Hoare triple {77536#false} call errorFn(); {77536#false} is VALID [2022-04-15 11:32:40,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {77536#false} assume !false; {77536#false} is VALID [2022-04-15 11:32:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:32:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:32:40,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375694206] [2022-04-15 11:32:40,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375694206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:40,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:40,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:32:40,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:32:40,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [567970812] [2022-04-15 11:32:40,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [567970812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:32:40,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:32:40,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:32:40,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508836659] [2022-04-15 11:32:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:32:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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 53 [2022-04-15 11:32:40,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:32:40,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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-15 11:32:40,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:32:40,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:32:40,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:32:40,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:32:40,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:32:40,922 INFO L87 Difference]: Start difference. First operand 1200 states and 1731 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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-15 11:33:15,881 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-15 11:33:20,762 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-15 11:33:24,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:30,006 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-15 11:33:33,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:37,786 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-15 11:33:41,020 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-15 11:33:43,056 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-15 11:33:44,990 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:33:46,995 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-15 11:33:54,797 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-15 11:34:19,674 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-15 11:34:21,718 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-15 11:34:23,761 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-15 11:34:40,544 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-15 11:34:42,582 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-15 11:34:44,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:34:46,919 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-15 11:34:50,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-15 11:34:53,879 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-15 11:34:57,810 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-15 11:35:01,106 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-15 11:35:07,248 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-15 11:35:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:11,412 INFO L93 Difference]: Finished difference Result 1832 states and 2719 transitions. [2022-04-15 11:35:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 11:35:11,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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 53 [2022-04-15 11:35:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:35:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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-15 11:35:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1922 transitions. [2022-04-15 11:35:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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-15 11:35:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1922 transitions. [2022-04-15 11:35:11,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 1922 transitions. [2022-04-15 11:35:13,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1922 edges. 1922 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:14,102 INFO L225 Difference]: With dead ends: 1832 [2022-04-15 11:35:14,102 INFO L226 Difference]: Without dead ends: 1772 [2022-04-15 11:35:14,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2022-04-15 11:35:14,111 INFO L913 BasicCegarLoop]: 1062 mSDtfsCounter, 2903 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 4438 mSolverCounterSat, 1366 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2936 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 5821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1366 IncrementalHoareTripleChecker+Valid, 4438 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:35:14,111 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2936 Valid, 2828 Invalid, 5821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1366 Valid, 4438 Invalid, 17 Unknown, 0 Unchecked, 66.6s Time] [2022-04-15 11:35:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2022-04-15 11:35:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1272. [2022-04-15 11:35:14,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:35:14,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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-15 11:35:14,299 INFO L74 IsIncluded]: Start isIncluded. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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-15 11:35:14,300 INFO L87 Difference]: Start difference. First operand 1772 states. Second operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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-15 11:35:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:14,386 INFO L93 Difference]: Finished difference Result 1772 states and 2639 transitions. [2022-04-15 11:35:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2639 transitions. [2022-04-15 11:35:14,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:14,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:14,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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 1772 states. [2022-04-15 11:35:14,393 INFO L87 Difference]: Start difference. First operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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 1772 states. [2022-04-15 11:35:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:35:14,481 INFO L93 Difference]: Finished difference Result 1772 states and 2639 transitions. [2022-04-15 11:35:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2639 transitions. [2022-04-15 11:35:14,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:35:14,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:35:14,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:35:14,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:35:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 982 states have (on average 1.390020366598778) internal successors, (1365), 982 states have internal predecessors, (1365), 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-15 11:35:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1819 transitions. [2022-04-15 11:35:14,555 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1819 transitions. Word has length 53 [2022-04-15 11:35:14,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:35:14,555 INFO L478 AbstractCegarLoop]: Abstraction has 1272 states and 1819 transitions. [2022-04-15 11:35:14,555 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 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-15 11:35:14,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1272 states and 1819 transitions. [2022-04-15 11:35:17,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1819 edges. 1819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:17,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1819 transitions. [2022-04-15 11:35:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 11:35:17,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:35:17,503 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:35:17,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:35:17,504 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:35:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:35:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1812095217, now seen corresponding path program 1 times [2022-04-15 11:35:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [463056510] [2022-04-15 11:35:17,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:35:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1812095217, now seen corresponding path program 2 times [2022-04-15 11:35:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:35:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637106646] [2022-04-15 11:35:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:35:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:35:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:35:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:17,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {87399#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {87367#true} is VALID [2022-04-15 11:35:17,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-15 11:35:17,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87367#true} {87367#true} #4308#return; {87367#true} is VALID [2022-04-15 11:35:17,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 11:35:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:17,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {87400#(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; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 11:35:17,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume true; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 11:35:17,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} {87367#true} #4174#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 11:35:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 11:35:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:17,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {87401#(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 := ~compFptr~0.base + ~compFptr~0.offset; {87367#true} is VALID [2022-04-15 11:35:17,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-15 11:35:17,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87367#true} {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} #4176#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 11:35:17,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 11:35:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:17,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-15 11:35:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:35:17,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {87402#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-15 11:35:17,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-15 11:35:17,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-15 11:35:17,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-15 11:35:17,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-15 11:35:17,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-15 11:35:17,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,813 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {87402#(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; {87367#true} is VALID [2022-04-15 11:35:17,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {87367#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {87367#true} is VALID [2022-04-15 11:35:17,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {87367#true} is VALID [2022-04-15 11:35:17,815 INFO L272 TraceCheckUtils]: 3: Hoare triple {87367#true} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {87402#(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-15 11:35:17,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {87402#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-15 11:35:17,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-15 11:35:17,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-15 11:35:17,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-15 11:35:17,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-15 11:35:17,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-15 11:35:17,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,817 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume -2147483648 <= #t~ret960 && #t~ret960 <= 2147483647;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,818 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87380#(not (= ~SKIP2~0 ~DC~0))} #4182#return; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:35:17,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {87367#true} call ULTIMATE.init(); {87399#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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-15 11:35:17,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {87399#(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)|) (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~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);~__BLAST_NONDET~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0.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; {87367#true} is VALID [2022-04-15 11:35:17,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-15 11:35:17,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87367#true} {87367#true} #4308#return; {87367#true} is VALID [2022-04-15 11:35:17,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {87367#true} call #t~ret1021 := main(); {87367#true} is VALID [2022-04-15 11:35:17,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {87367#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 -2147483648 <= #t~nondet961 && #t~nondet961 <= 2147483647;~status~15 := #t~nondet961;havoc #t~nondet961;call ~#irp~1.base, ~#irp~1.offset := #Ultimate.allocOnStack(111);assume -2147483648 <= #t~nondet962 && #t~nondet962 <= 2147483647;~we_should_unload~0 := #t~nondet962;havoc #t~nondet962;assume -2147483648 <= #t~nondet963 && #t~nondet963 <= 2147483647;~__BLAST_NONDET___0~0 := #t~nondet963;havoc #t~nondet963;assume -2147483648 <= #t~nondet964 && #t~nondet964 <= 2147483647;~irp_choice~0 := #t~nondet964;havoc #t~nondet964;call ~#devobj~0.base, ~#devobj~0.offset := #Ultimate.allocOnStack(175);call #t~malloc965.base, #t~malloc965.offset := #Ultimate.allocOnHeap(53);call write~$Pointer$(#t~malloc965.base, #t~malloc965.offset, ~#devobj~0.base, 40 + ~#devobj~0.offset, 4);havoc #t~malloc965.base, #t~malloc965.offset;call #t~malloc966.base, #t~malloc966.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc966.base, #t~malloc966.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~malloc966.base, #t~malloc966.offset;call #t~mem967.base, #t~mem967.offset := read~$Pointer$(~#irp~1.base, 96 + ~#irp~1.offset, 4);call write~$Pointer$(#t~mem967.base, 108 + #t~mem967.offset, ~#irp~1.base, 96 + ~#irp~1.offset, 4);havoc #t~mem967.base, #t~mem967.offset;call #t~malloc968.base, #t~malloc968.offset := #Ultimate.allocOnHeap(904);call write~$Pointer$(#t~malloc968.base, #t~malloc968.offset, ~#irp~1.base, 12 + ~#irp~1.offset, 4);havoc #t~malloc968.base, #t~malloc968.offset;havoc ~a~0;~a~0 := 0; {87367#true} is VALID [2022-04-15 11:35:17,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {87367#true} assume !(~a~0 % 4294967296 < 53); {87367#true} is VALID [2022-04-15 11:35:17,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {87367#true} ~a~0 := 0; {87367#true} is VALID [2022-04-15 11:35:17,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {87367#true} assume !(~a~0 % 4294967296 < 36); {87367#true} is VALID [2022-04-15 11:35:17,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {87367#true} ~a~0 := 0; {87367#true} is VALID [2022-04-15 11:35:17,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {87367#true} assume !(~a~0 % 4294967296 < 904); {87367#true} is VALID [2022-04-15 11:35:17,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {87367#true} ~pirp~0.base, ~pirp~0.offset := ~#irp~1.base, ~#irp~1.offset; {87367#true} is VALID [2022-04-15 11:35:17,821 INFO L272 TraceCheckUtils]: 12: Hoare triple {87367#true} call _BLAST_init(); {87400#(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-15 11:35:17,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {87400#(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; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 11:35:17,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume true; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 11:35:17,822 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} {87367#true} #4174#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 11:35:17,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} 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 := ~compFptr~0.base + ~compFptr~0.offset;call write~int(0, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := 0; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 11:35:17,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume 0 == ~irp_choice~0;call write~int(-1073741637, ~pirp~0.base, 24 + ~pirp~0.offset, 4);~myStatus~0 := -1073741637; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 11:35:17,824 INFO L272 TraceCheckUtils]: 18: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} call stub_driver_init(); {87401#(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-15 11:35:17,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {87401#(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 := ~compFptr~0.base + ~compFptr~0.offset; {87367#true} is VALID [2022-04-15 11:35:17,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {87367#true} assume true; {87367#true} is VALID [2022-04-15 11:35:17,824 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {87367#true} {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} #4176#return; {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 11:35:17,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume !!(~status~15 >= 0); {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} is VALID [2022-04-15 11:35:17,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {87375#(and (= 2 ~DC~0) (= ~SKIP2~0 4))} assume !(2 == ~__BLAST_NONDET___0~0); {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} is VALID [2022-04-15 11:35:17,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} assume !(3 == ~__BLAST_NONDET___0~0); {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} is VALID [2022-04-15 11:35:17,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {87379#(and (= ~SKIP2~0 4) (not (= ~DC~0 main_~__BLAST_NONDET___0~0)))} assume 4 == ~__BLAST_NONDET___0~0; {87380#(not (= ~SKIP2~0 ~DC~0))} is VALID [2022-04-15 11:35:17,827 INFO L272 TraceCheckUtils]: 26: Hoare triple {87380#(not (= ~SKIP2~0 ~DC~0))} call #t~ret980 := CdAudioPower(~#devobj~0.base, ~#devobj~0.offset, ~pirp~0.base, ~pirp~0.offset); {87402#(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-15 11:35:17,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {87402#(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; {87367#true} is VALID [2022-04-15 11:35:17,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {87367#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {87367#true} is VALID [2022-04-15 11:35:17,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {87367#true} call #t~mem956 := read~int(~Irp.base, 35 + ~Irp.offset, 1);call write~int((if (1 + #t~mem956) % 256 <= 127 then (1 + #t~mem956) % 256 else (1 + #t~mem956) % 256 - 256), ~Irp.base, 35 + ~Irp.offset, 1);havoc #t~mem956;call #t~mem957.base, #t~mem957.offset := read~$Pointer$(~Irp.base, 96 + ~Irp.offset, 4);call write~$Pointer$(#t~mem957.base, 36 + #t~mem957.offset, ~Irp.base, 96 + ~Irp.offset, 4);havoc #t~mem957.base, #t~mem957.offset;call #t~mem958.base, #t~mem958.offset := read~$Pointer$(~DeviceObject.base, 40 + ~DeviceObject.offset, 4);~deviceExtension~16.base, ~deviceExtension~16.offset := #t~mem958.base, #t~mem958.offset;havoc #t~mem958.base, #t~mem958.offset;call #t~mem959.base, #t~mem959.offset := read~$Pointer$(~deviceExtension~16.base, ~deviceExtension~16.offset, 4); {87367#true} is VALID [2022-04-15 11:35:17,828 INFO L272 TraceCheckUtils]: 30: Hoare triple {87367#true} call #t~ret960 := PoCallDriver(#t~mem959.base, #t~mem959.offset, ~Irp.base, ~Irp.offset); {87402#(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-15 11:35:17,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {87402#(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~nondet1010 && #t~nondet1010 <= 2147483647;~__BLAST_NONDET___0~17 := #t~nondet1010;havoc #t~nondet1010;assume -2147483648 <= #t~nondet1011 && #t~nondet1011 <= 2147483647;~compRetStatus~1 := #t~nondet1011;havoc #t~nondet1011;havoc ~returnVal~0;~lcontext~1.base, ~lcontext~1.offset := 0, 0;havoc ~tmp~25;havoc ~tmp___0~10; {87367#true} is VALID [2022-04-15 11:35:17,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {87367#true} assume !(0 != ~compRegistered~0); {87367#true} is VALID [2022-04-15 11:35:17,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {87367#true} assume 0 == ~__BLAST_NONDET___0~17; {87367#true} is VALID [2022-04-15 11:35:17,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {87367#true} ~returnVal~0 := 0; {87367#true} is VALID [2022-04-15 11:35:17,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {87367#true} assume !(~s~0 == ~NP~0); {87367#true} is VALID [2022-04-15 11:35:17,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {87367#true} assume !(~s~0 == ~MPR1~0); {87367#true} is VALID [2022-04-15 11:35:17,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {87367#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} #res := ~returnVal~0; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,830 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87367#true} #3908#return; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume -2147483648 <= #t~ret960 && #t~ret960 <= 2147483647;~tmp~15 := #t~ret960;havoc #t~mem959.base, #t~mem959.offset;havoc #t~ret960;#res := ~tmp~15; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,830 INFO L290 TraceCheckUtils]: 42: Hoare triple {87413#(= ~SKIP2~0 ~s~0)} assume true; {87413#(= ~SKIP2~0 ~s~0)} is VALID [2022-04-15 11:35:17,831 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {87413#(= ~SKIP2~0 ~s~0)} {87380#(not (= ~SKIP2~0 ~DC~0))} #4182#return; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:35:17,831 INFO L290 TraceCheckUtils]: 44: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume -2147483648 <= #t~ret980 && #t~ret980 <= 2147483647;~status~15 := #t~ret980;havoc #t~ret980; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:35:17,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume 0 != ~we_should_unload~0; {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:35:17,832 INFO L290 TraceCheckUtils]: 46: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:35:17,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:35:17,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(~s~0 == ~UNLOADED~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:35:17,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(-1 == ~status~15); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:35:17,833 INFO L290 TraceCheckUtils]: 50: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(~s~0 != ~SKIP2~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:35:17,833 INFO L290 TraceCheckUtils]: 51: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume !(1 == ~pended~0); {87398#(not (= ~s~0 ~DC~0))} is VALID [2022-04-15 11:35:17,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {87398#(not (= ~s~0 ~DC~0))} assume ~s~0 == ~DC~0; {87368#false} is VALID [2022-04-15 11:35:17,834 INFO L272 TraceCheckUtils]: 53: Hoare triple {87368#false} call errorFn(); {87368#false} is VALID [2022-04-15 11:35:17,834 INFO L290 TraceCheckUtils]: 54: Hoare triple {87368#false} assume !false; {87368#false} is VALID [2022-04-15 11:35:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:35:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:35:17,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637106646] [2022-04-15 11:35:17,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637106646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:17,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:17,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:35:17,835 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:35:17,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [463056510] [2022-04-15 11:35:17,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [463056510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:35:17,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:35:17,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:35:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531043538] [2022-04-15 11:35:17,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:35:17,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-04-15 11:35:17,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:35:17,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 11:35:17,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:35:17,882 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:35:17,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:35:17,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:35:17,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 11:35:17,883 INFO L87 Difference]: Start difference. First operand 1272 states and 1819 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 11:35:43,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:35:46,313 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-15 11:35:54,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-15 11:35:56,436 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-15 11:35:58,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:00,878 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-15 11:36:08,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:12,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:14,533 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-15 11:36:17,282 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-15 11:36:19,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:23,351 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-15 11:36:29,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:36:32,994 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-15 11:36:35,026 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-15 11:36:37,063 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 []