java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers/diskperf.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:42:36,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:42:36,086 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:42:36,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:42:36,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:42:36,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:42:36,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:42:36,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:42:36,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:42:36,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:42:36,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:42:36,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:42:36,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:42:36,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:42:36,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:42:36,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:42:36,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:42:36,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:42:36,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:42:36,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:42:36,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:42:36,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:42:36,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:42:36,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:42:36,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:42:36,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:42:36,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:42:36,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:42:36,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:42:36,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:42:36,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:42:36,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:42:36,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:42:36,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:42:36,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:42:36,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:42:36,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:42:36,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:42:36,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:42:36,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:42:36,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:42:36,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:42:36,174 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:42:36,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:42:36,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:42:36,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:42:36,176 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:42:36,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:42:36,177 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:42:36,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:42:36,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:42:36,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:42:36,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:42:36,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:42:36,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:42:36,178 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:42:36,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:42:36,178 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:42:36,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:42:36,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:42:36,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:42:36,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:42:36,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:42:36,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:42:36,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:42:36,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:42:36,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:42:36,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:42:36,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:42:36,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:42:36,181 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:42:36,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:42:36,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:42:36,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:42:36,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:42:36,242 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:42:36,242 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/diskperf.i.cil-1.c [2019-10-02 11:42:36,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c758e87/04a0103d68a44bbca3953cde0f29d9d0/FLAGf71755bd0 [2019-10-02 11:42:37,015 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:42:37,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/diskperf.i.cil-1.c [2019-10-02 11:42:37,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c758e87/04a0103d68a44bbca3953cde0f29d9d0/FLAGf71755bd0 [2019-10-02 11:42:37,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c758e87/04a0103d68a44bbca3953cde0f29d9d0 [2019-10-02 11:42:37,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:42:37,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:42:37,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:42:37,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:42:37,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:42:37,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:42:37" (1/1) ... [2019-10-02 11:42:37,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fb5a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:37, skipping insertion in model container [2019-10-02 11:42:37,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:42:37" (1/1) ... [2019-10-02 11:42:37,161 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:42:37,264 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:42:38,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:42:38,494 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:42:38,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:42:38,848 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:42:38,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:38 WrapperNode [2019-10-02 11:42:38,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:42:38,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:42:38,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:42:38,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:42:38,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:38" (1/1) ... [2019-10-02 11:42:38,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:38" (1/1) ... [2019-10-02 11:42:38,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:38" (1/1) ... [2019-10-02 11:42:38,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:38" (1/1) ... [2019-10-02 11:42:39,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:38" (1/1) ... [2019-10-02 11:42:39,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:38" (1/1) ... [2019-10-02 11:42:39,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:38" (1/1) ... [2019-10-02 11:42:39,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:42:39,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:42:39,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:42:39,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:42:39,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:42:39,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:42:39,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:42:39,331 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2019-10-02 11:42:39,331 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2019-10-02 11:42:39,331 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2019-10-02 11:42:39,331 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2019-10-02 11:42:39,332 INFO L138 BoogieDeclarations]: Found implementation of procedure KeGetCurrentProcessorNumber [2019-10-02 11:42:39,332 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQuerySystemTime [2019-10-02 11:42:39,332 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateErrorLogEntry [2019-10-02 11:42:39,332 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWriteErrorLogEntry [2019-10-02 11:42:39,332 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2019-10-02 11:42:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryPerformanceCounter [2019-10-02 11:42:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiCompleteRequest [2019-10-02 11:42:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-02 11:42:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-02 11:42:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2019-10-02 11:42:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-10-02 11:42:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfAddDevice [2019-10-02 11:42:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-10-02 11:42:39,335 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-10-02 11:42:39,335 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-10-02 11:42:39,335 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-10-02 11:42:39,335 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-10-02 11:42:39,335 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-10-02 11:42:39,335 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-10-02 11:42:39,335 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-10-02 11:42:39,336 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfReadWrite [2019-10-02 11:42:39,336 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-10-02 11:42:39,336 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-10-02 11:42:39,336 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfWmi [2019-10-02 11:42:39,336 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-10-02 11:42:39,336 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-10-02 11:42:39,337 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-10-02 11:42:39,337 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfLogError [2019-10-02 11:42:39,337 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskperfQueryWmiRegInfo [2019-10-02 11:42:39,337 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskperfQueryWmiDataBlock [2019-10-02 11:42:39,337 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskperfWmiFunctionControl [2019-10-02 11:42:39,337 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfAddCounters [2019-10-02 11:42:39,337 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-02 11:42:39,338 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:42:39,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2019-10-02 11:42:39,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2019-10-02 11:42:39,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2019-10-02 11:42:39,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2019-10-02 11:42:39,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2019-10-02 11:42:39,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2019-10-02 11:42:39,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2019-10-02 11:42:39,339 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2019-10-02 11:42:39,339 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2019-10-02 11:42:39,339 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2019-10-02 11:42:39,339 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-02 11:42:39,339 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2019-10-02 11:42:39,339 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2019-10-02 11:42:39,340 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2019-10-02 11:42:39,340 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-02 11:42:39,340 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2019-10-02 11:42:39,340 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2019-10-02 11:42:39,340 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2019-10-02 11:42:39,340 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2019-10-02 11:42:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-02 11:42:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-02 11:42:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2019-10-02 11:42:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-02 11:42:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2019-10-02 11:42:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-02 11:42:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-02 11:42:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-02 11:42:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2019-10-02 11:42:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2019-10-02 11:42:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2019-10-02 11:42:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2019-10-02 11:42:39,342 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2019-10-02 11:42:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2019-10-02 11:42:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2019-10-02 11:42:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-02 11:42:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-02 11:42:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2019-10-02 11:42:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2019-10-02 11:42:39,343 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2019-10-02 11:42:39,344 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2019-10-02 11:42:39,344 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2019-10-02 11:42:39,344 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2019-10-02 11:42:39,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-02 11:42:39,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2019-10-02 11:42:39,344 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-02 11:42:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2019-10-02 11:42:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-02 11:42:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2019-10-02 11:42:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2019-10-02 11:42:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2019-10-02 11:42:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2019-10-02 11:42:39,345 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2019-10-02 11:42:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2019-10-02 11:42:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2019-10-02 11:42:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2019-10-02 11:42:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2019-10-02 11:42:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-02 11:42:39,346 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiSystemControl [2019-10-02 11:42:39,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 11:42:39,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-02 11:42:39,347 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-10-02 11:42:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:42:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 11:42:39,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:42:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 11:42:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 11:42:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 11:42:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 11:42:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2019-10-02 11:42:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-02 11:42:39,348 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-10-02 11:42:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 11:42:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:42:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2019-10-02 11:42:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2019-10-02 11:42:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2019-10-02 11:42:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2019-10-02 11:42:39,349 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2019-10-02 11:42:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2019-10-02 11:42:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2019-10-02 11:42:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2019-10-02 11:42:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2019-10-02 11:42:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:42:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:42:39,350 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2019-10-02 11:42:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2019-10-02 11:42:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure KeGetCurrentProcessorNumber [2019-10-02 11:42:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2019-10-02 11:42:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-02 11:42:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2019-10-02 11:42:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2019-10-02 11:42:39,351 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2019-10-02 11:42:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-02 11:42:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2019-10-02 11:42:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2019-10-02 11:42:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure KeQuerySystemTime [2019-10-02 11:42:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2019-10-02 11:42:39,352 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2019-10-02 11:42:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2019-10-02 11:42:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2019-10-02 11:42:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2019-10-02 11:42:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2019-10-02 11:42:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2019-10-02 11:42:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2019-10-02 11:42:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2019-10-02 11:42:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2019-10-02 11:42:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2019-10-02 11:42:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2019-10-02 11:42:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2019-10-02 11:42:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-02 11:42:39,354 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2019-10-02 11:42:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateErrorLogEntry [2019-10-02 11:42:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:42:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2019-10-02 11:42:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2019-10-02 11:42:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2019-10-02 11:42:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-02 11:42:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-02 11:42:39,355 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-02 11:42:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2019-10-02 11:42:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2019-10-02 11:42:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2019-10-02 11:42:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-02 11:42:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2019-10-02 11:42:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2019-10-02 11:42:39,356 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2019-10-02 11:42:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2019-10-02 11:42:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-02 11:42:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2019-10-02 11:42:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2019-10-02 11:42:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure IoWriteErrorLogEntry [2019-10-02 11:42:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2019-10-02 11:42:39,357 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-02 11:42:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-02 11:42:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryPerformanceCounter [2019-10-02 11:42:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:42:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:42:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:42:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-02 11:42:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2019-10-02 11:42:39,358 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-02 11:42:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2019-10-02 11:42:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-02 11:42:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure swprintf [2019-10-02 11:42:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure WmiCompleteRequest [2019-10-02 11:42:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure WmiSystemControl [2019-10-02 11:42:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-02 11:42:39,359 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-02 11:42:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2019-10-02 11:42:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-10-02 11:42:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfAddDevice [2019-10-02 11:42:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-10-02 11:42:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-10-02 11:42:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-10-02 11:42:39,360 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-10-02 11:42:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-10-02 11:42:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-10-02 11:42:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfReadWrite [2019-10-02 11:42:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-10-02 11:42:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-10-02 11:42:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-10-02 11:42:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-10-02 11:42:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfWmi [2019-10-02 11:42:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfLogError [2019-10-02 11:42:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-10-02 11:42:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-10-02 11:42:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure DiskperfQueryWmiRegInfo [2019-10-02 11:42:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure DiskperfQueryWmiDataBlock [2019-10-02 11:42:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-10-02 11:42:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure DiskperfWmiFunctionControl [2019-10-02 11:42:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfAddCounters [2019-10-02 11:42:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:42:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:42:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 11:42:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-10-02 11:42:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-02 11:42:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-02 11:42:39,364 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:42:39,364 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-02 11:42:39,364 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2019-10-02 11:42:39,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:42:39,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 11:42:39,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:42:39,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-02 11:42:39,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-02 11:42:39,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-02 11:42:39,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-02 11:42:40,383 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:40,456 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:40,457 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:40,457 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:40,468 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:40,469 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:40,502 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:40,523 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:40,523 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:40,523 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:40,541 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:40,542 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:40,549 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:40,563 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:40,564 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:40,564 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:40,580 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:40,581 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:40,581 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:40,601 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:40,602 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:40,602 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:40,625 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:40,625 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:40,914 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:40,927 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:40,928 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:40,954 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:40,963 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:40,964 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:40,964 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:40,975 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:40,975 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:40,994 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:41,003 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:41,004 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:41,030 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:41,038 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:41,039 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:41,046 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:43,305 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !false; [2019-10-02 11:42:43,306 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume false; [2019-10-02 11:42:45,680 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:45,715 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-02 11:42:45,716 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-02 11:42:48,317 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:48,329 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:48,329 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:48,365 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:44,173 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2019-10-02 11:43:44,173 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2019-10-02 11:43:44,276 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:44,284 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:44,284 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:44,723 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:44,731 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:44,732 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:44,739 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:46,916 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-02 11:43:46,916 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-02 11:44:13,957 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:14,019 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-02 11:44:14,019 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-02 11:44:14,044 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:14,069 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-02 11:44:14,069 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-02 11:44:14,152 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:14,161 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:14,161 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:19,341 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:19,349 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:44:19,349 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:44:23,098 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:44:23,098 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 11:44:23,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:23 BoogieIcfgContainer [2019-10-02 11:44:23,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:44:23,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:44:23,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:44:23,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:44:23,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:42:37" (1/3) ... [2019-10-02 11:44:23,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a57b4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:44:23, skipping insertion in model container [2019-10-02 11:44:23,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:38" (2/3) ... [2019-10-02 11:44:23,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a57b4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:44:23, skipping insertion in model container [2019-10-02 11:44:23,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:23" (3/3) ... [2019-10-02 11:44:23,109 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf.i.cil-1.c [2019-10-02 11:44:23,119 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:44:23,129 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:44:23,146 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:44:23,180 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:44:23,180 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:44:23,181 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:44:23,181 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:44:23,181 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:44:23,181 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:44:23,181 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:44:23,181 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:44:23,181 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:44:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states. [2019-10-02 11:44:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:44:23,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:23,219 INFO L411 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] [2019-10-02 11:44:23,222 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash -489655456, now seen corresponding path program 1 times [2019-10-02 11:44:23,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:23,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:23,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:23,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:23,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:24,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:24,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:44:24,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:44:24,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:44:24,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:44:24,340 INFO L87 Difference]: Start difference. First operand 533 states. Second operand 2 states. [2019-10-02 11:44:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:24,466 INFO L93 Difference]: Finished difference Result 860 states and 1247 transitions. [2019-10-02 11:44:24,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:44:24,468 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2019-10-02 11:44:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:24,501 INFO L225 Difference]: With dead ends: 860 [2019-10-02 11:44:24,501 INFO L226 Difference]: Without dead ends: 427 [2019-10-02 11:44:24,516 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:44:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-02 11:44:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-10-02 11:44:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-02 11:44:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 568 transitions. [2019-10-02 11:44:24,679 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 568 transitions. Word has length 24 [2019-10-02 11:44:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:24,679 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 568 transitions. [2019-10-02 11:44:24,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:44:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 568 transitions. [2019-10-02 11:44:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:44:24,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:24,682 INFO L411 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] [2019-10-02 11:44:24,682 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:24,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:24,682 INFO L82 PathProgramCache]: Analyzing trace with hash 871488700, now seen corresponding path program 1 times [2019-10-02 11:44:24,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:24,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:24,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:24,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:24,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:25,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:25,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:25,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:25,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:25,602 INFO L87 Difference]: Start difference. First operand 427 states and 568 transitions. Second operand 3 states. [2019-10-02 11:44:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:25,884 INFO L93 Difference]: Finished difference Result 447 states and 594 transitions. [2019-10-02 11:44:25,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:25,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-02 11:44:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:25,890 INFO L225 Difference]: With dead ends: 447 [2019-10-02 11:44:25,890 INFO L226 Difference]: Without dead ends: 427 [2019-10-02 11:44:25,892 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-02 11:44:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-10-02 11:44:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-02 11:44:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 567 transitions. [2019-10-02 11:44:25,927 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 567 transitions. Word has length 26 [2019-10-02 11:44:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:25,927 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 567 transitions. [2019-10-02 11:44:25,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 567 transitions. [2019-10-02 11:44:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:44:25,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:25,931 INFO L411 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] [2019-10-02 11:44:25,934 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:25,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:25,934 INFO L82 PathProgramCache]: Analyzing trace with hash -832326001, now seen corresponding path program 1 times [2019-10-02 11:44:25,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:25,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:25,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:25,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:28,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:28,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:28,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:28,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:28,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:28,141 INFO L87 Difference]: Start difference. First operand 427 states and 567 transitions. Second operand 3 states. [2019-10-02 11:44:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:28,470 INFO L93 Difference]: Finished difference Result 977 states and 1328 transitions. [2019-10-02 11:44:28,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:28,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 11:44:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:28,480 INFO L225 Difference]: With dead ends: 977 [2019-10-02 11:44:28,481 INFO L226 Difference]: Without dead ends: 694 [2019-10-02 11:44:28,483 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-10-02 11:44:28,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 674. [2019-10-02 11:44:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-10-02 11:44:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 912 transitions. [2019-10-02 11:44:28,521 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 912 transitions. Word has length 31 [2019-10-02 11:44:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:28,521 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 912 transitions. [2019-10-02 11:44:28,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 912 transitions. [2019-10-02 11:44:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 11:44:28,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:28,525 INFO L411 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] [2019-10-02 11:44:28,525 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1703184005, now seen corresponding path program 1 times [2019-10-02 11:44:28,525 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:28,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:28,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:28,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:28,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:30,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:30,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:30,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:30,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:30,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:30,385 INFO L87 Difference]: Start difference. First operand 674 states and 912 transitions. Second operand 3 states. [2019-10-02 11:44:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:30,499 INFO L93 Difference]: Finished difference Result 1564 states and 2178 transitions. [2019-10-02 11:44:30,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:30,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-02 11:44:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:30,510 INFO L225 Difference]: With dead ends: 1564 [2019-10-02 11:44:30,510 INFO L226 Difference]: Without dead ends: 1055 [2019-10-02 11:44:30,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-10-02 11:44:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1019. [2019-10-02 11:44:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-10-02 11:44:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1414 transitions. [2019-10-02 11:44:30,579 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1414 transitions. Word has length 41 [2019-10-02 11:44:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:30,580 INFO L475 AbstractCegarLoop]: Abstraction has 1019 states and 1414 transitions. [2019-10-02 11:44:30,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1414 transitions. [2019-10-02 11:44:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 11:44:30,586 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:30,586 INFO L411 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] [2019-10-02 11:44:30,586 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:30,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:30,587 INFO L82 PathProgramCache]: Analyzing trace with hash -666873609, now seen corresponding path program 1 times [2019-10-02 11:44:30,587 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:30,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:30,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:33,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:33,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:33,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:33,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:33,127 INFO L87 Difference]: Start difference. First operand 1019 states and 1414 transitions. Second operand 3 states. [2019-10-02 11:44:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:33,331 INFO L93 Difference]: Finished difference Result 1033 states and 1433 transitions. [2019-10-02 11:44:33,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:33,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-02 11:44:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:33,339 INFO L225 Difference]: With dead ends: 1033 [2019-10-02 11:44:33,339 INFO L226 Difference]: Without dead ends: 1029 [2019-10-02 11:44:33,340 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-10-02 11:44:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1028. [2019-10-02 11:44:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-10-02 11:44:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1426 transitions. [2019-10-02 11:44:33,398 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1426 transitions. Word has length 41 [2019-10-02 11:44:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:33,399 INFO L475 AbstractCegarLoop]: Abstraction has 1028 states and 1426 transitions. [2019-10-02 11:44:33,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1426 transitions. [2019-10-02 11:44:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 11:44:33,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:33,400 INFO L411 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] [2019-10-02 11:44:33,401 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:33,401 INFO L82 PathProgramCache]: Analyzing trace with hash -251975648, now seen corresponding path program 1 times [2019-10-02 11:44:33,401 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:33,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:33,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:33,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:33,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:34,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:34,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:44:34,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:44:34,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:44:34,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:44:34,875 INFO L87 Difference]: Start difference. First operand 1028 states and 1426 transitions. Second operand 5 states. [2019-10-02 11:44:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:36,021 INFO L93 Difference]: Finished difference Result 1069 states and 1476 transitions. [2019-10-02 11:44:36,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:44:36,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-02 11:44:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:36,029 INFO L225 Difference]: With dead ends: 1069 [2019-10-02 11:44:36,030 INFO L226 Difference]: Without dead ends: 1058 [2019-10-02 11:44:36,031 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:44:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-10-02 11:44:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1046. [2019-10-02 11:44:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-10-02 11:44:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1449 transitions. [2019-10-02 11:44:36,088 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1449 transitions. Word has length 45 [2019-10-02 11:44:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:36,089 INFO L475 AbstractCegarLoop]: Abstraction has 1046 states and 1449 transitions. [2019-10-02 11:44:36,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:44:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1449 transitions. [2019-10-02 11:44:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:44:36,090 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:36,090 INFO L411 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] [2019-10-02 11:44:36,091 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:36,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:36,091 INFO L82 PathProgramCache]: Analyzing trace with hash 341959863, now seen corresponding path program 1 times [2019-10-02 11:44:36,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:36,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:36,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:36,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:36,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:37,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:37,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:44:37,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:44:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:44:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:44:37,384 INFO L87 Difference]: Start difference. First operand 1046 states and 1449 transitions. Second operand 5 states. [2019-10-02 11:44:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:38,703 INFO L93 Difference]: Finished difference Result 1060 states and 1461 transitions. [2019-10-02 11:44:38,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:44:38,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-02 11:44:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:38,711 INFO L225 Difference]: With dead ends: 1060 [2019-10-02 11:44:38,711 INFO L226 Difference]: Without dead ends: 1052 [2019-10-02 11:44:38,712 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:44:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-02 11:44:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1046. [2019-10-02 11:44:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-10-02 11:44:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1448 transitions. [2019-10-02 11:44:38,790 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1448 transitions. Word has length 46 [2019-10-02 11:44:38,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:38,792 INFO L475 AbstractCegarLoop]: Abstraction has 1046 states and 1448 transitions. [2019-10-02 11:44:38,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:44:38,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1448 transitions. [2019-10-02 11:44:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 11:44:38,794 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:38,795 INFO L411 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] [2019-10-02 11:44:38,795 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1743095863, now seen corresponding path program 1 times [2019-10-02 11:44:38,795 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:38,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:38,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:38,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:38,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:40,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:40,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:40,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:40,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:40,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:40,422 INFO L87 Difference]: Start difference. First operand 1046 states and 1448 transitions. Second operand 3 states. [2019-10-02 11:44:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:40,582 INFO L93 Difference]: Finished difference Result 1871 states and 2637 transitions. [2019-10-02 11:44:40,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:40,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-02 11:44:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:40,611 INFO L225 Difference]: With dead ends: 1871 [2019-10-02 11:44:40,611 INFO L226 Difference]: Without dead ends: 1842 [2019-10-02 11:44:40,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2019-10-02 11:44:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1817. [2019-10-02 11:44:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2019-10-02 11:44:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2568 transitions. [2019-10-02 11:44:40,754 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2568 transitions. Word has length 47 [2019-10-02 11:44:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:40,755 INFO L475 AbstractCegarLoop]: Abstraction has 1817 states and 2568 transitions. [2019-10-02 11:44:40,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2568 transitions. [2019-10-02 11:44:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 11:44:40,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:40,757 INFO L411 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] [2019-10-02 11:44:40,757 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:40,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:40,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1790750049, now seen corresponding path program 1 times [2019-10-02 11:44:40,758 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:40,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:40,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:40,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:40,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:42,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:42,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:44:42,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:44:42,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:44:42,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:44:42,213 INFO L87 Difference]: Start difference. First operand 1817 states and 2568 transitions. Second operand 5 states. [2019-10-02 11:44:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:44,419 INFO L93 Difference]: Finished difference Result 1831 states and 2582 transitions. [2019-10-02 11:44:44,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:44:44,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-02 11:44:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:44,431 INFO L225 Difference]: With dead ends: 1831 [2019-10-02 11:44:44,431 INFO L226 Difference]: Without dead ends: 1810 [2019-10-02 11:44:44,432 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:44:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2019-10-02 11:44:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2019-10-02 11:44:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1810 states. [2019-10-02 11:44:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2559 transitions. [2019-10-02 11:44:44,532 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2559 transitions. Word has length 48 [2019-10-02 11:44:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:44,533 INFO L475 AbstractCegarLoop]: Abstraction has 1810 states and 2559 transitions. [2019-10-02 11:44:44,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:44:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2559 transitions. [2019-10-02 11:44:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 11:44:44,534 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:44,534 INFO L411 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] [2019-10-02 11:44:44,535 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:44,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:44,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1650606311, now seen corresponding path program 1 times [2019-10-02 11:44:44,535 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:44,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:44,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:44,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:44,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:46,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:46,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:46,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:46,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:46,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:46,394 INFO L87 Difference]: Start difference. First operand 1810 states and 2559 transitions. Second operand 3 states. [2019-10-02 11:44:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:46,687 INFO L93 Difference]: Finished difference Result 2622 states and 3830 transitions. [2019-10-02 11:44:46,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:46,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-02 11:44:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:46,706 INFO L225 Difference]: With dead ends: 2622 [2019-10-02 11:44:46,706 INFO L226 Difference]: Without dead ends: 2614 [2019-10-02 11:44:46,709 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2019-10-02 11:44:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 1964. [2019-10-02 11:44:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-10-02 11:44:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2788 transitions. [2019-10-02 11:44:46,835 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2788 transitions. Word has length 51 [2019-10-02 11:44:46,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:46,835 INFO L475 AbstractCegarLoop]: Abstraction has 1964 states and 2788 transitions. [2019-10-02 11:44:46,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2788 transitions. [2019-10-02 11:44:46,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:44:46,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:46,837 INFO L411 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] [2019-10-02 11:44:46,837 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:46,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1062369270, now seen corresponding path program 1 times [2019-10-02 11:44:46,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:46,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:46,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:46,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:46,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:48,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:48,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:44:48,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:44:48,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:44:48,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:44:48,417 INFO L87 Difference]: Start difference. First operand 1964 states and 2788 transitions. Second operand 6 states. [2019-10-02 11:44:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:52,651 INFO L93 Difference]: Finished difference Result 1980 states and 2804 transitions. [2019-10-02 11:44:52,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:44:52,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-02 11:44:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:52,665 INFO L225 Difference]: With dead ends: 1980 [2019-10-02 11:44:52,665 INFO L226 Difference]: Without dead ends: 1921 [2019-10-02 11:44:52,669 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:44:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2019-10-02 11:44:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1907. [2019-10-02 11:44:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2019-10-02 11:44:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2713 transitions. [2019-10-02 11:44:52,773 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2713 transitions. Word has length 52 [2019-10-02 11:44:52,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:52,774 INFO L475 AbstractCegarLoop]: Abstraction has 1907 states and 2713 transitions. [2019-10-02 11:44:52,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:44:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2713 transitions. [2019-10-02 11:44:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:44:52,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:52,776 INFO L411 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] [2019-10-02 11:44:52,776 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:52,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:52,777 INFO L82 PathProgramCache]: Analyzing trace with hash 823633966, now seen corresponding path program 1 times [2019-10-02 11:44:52,777 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:52,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:52,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:52,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:52,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:54,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:54,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:44:54,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:44:54,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:44:54,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:44:54,044 INFO L87 Difference]: Start difference. First operand 1907 states and 2713 transitions. Second operand 5 states. [2019-10-02 11:44:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:55,531 INFO L93 Difference]: Finished difference Result 2565 states and 3751 transitions. [2019-10-02 11:44:55,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:44:55,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-10-02 11:44:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:55,550 INFO L225 Difference]: With dead ends: 2565 [2019-10-02 11:44:55,551 INFO L226 Difference]: Without dead ends: 2557 [2019-10-02 11:44:55,553 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:44:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2019-10-02 11:44:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 1907. [2019-10-02 11:44:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2019-10-02 11:44:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2712 transitions. [2019-10-02 11:44:55,662 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2712 transitions. Word has length 52 [2019-10-02 11:44:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:55,662 INFO L475 AbstractCegarLoop]: Abstraction has 1907 states and 2712 transitions. [2019-10-02 11:44:55,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:44:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2712 transitions. [2019-10-02 11:44:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 11:44:55,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:55,664 INFO L411 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] [2019-10-02 11:44:55,664 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1134764093, now seen corresponding path program 1 times [2019-10-02 11:44:55,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:55,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:55,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:55,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:55,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:44:57,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:57,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:44:57,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:44:57,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:44:57,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:44:57,195 INFO L87 Difference]: Start difference. First operand 1907 states and 2712 transitions. Second operand 8 states. [2019-10-02 11:45:00,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:00,072 INFO L93 Difference]: Finished difference Result 1922 states and 2728 transitions. [2019-10-02 11:45:00,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:00,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-02 11:45:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:00,085 INFO L225 Difference]: With dead ends: 1922 [2019-10-02 11:45:00,086 INFO L226 Difference]: Without dead ends: 1918 [2019-10-02 11:45:00,087 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2019-10-02 11:45:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1914. [2019-10-02 11:45:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-10-02 11:45:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2720 transitions. [2019-10-02 11:45:00,185 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2720 transitions. Word has length 53 [2019-10-02 11:45:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:00,186 INFO L475 AbstractCegarLoop]: Abstraction has 1914 states and 2720 transitions. [2019-10-02 11:45:00,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2720 transitions. [2019-10-02 11:45:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 11:45:00,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:00,187 INFO L411 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] [2019-10-02 11:45:00,188 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:00,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1135040923, now seen corresponding path program 1 times [2019-10-02 11:45:00,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:00,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:00,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:00,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:01,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:01,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:45:01,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:45:01,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:45:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:45:01,649 INFO L87 Difference]: Start difference. First operand 1914 states and 2720 transitions. Second operand 5 states. [2019-10-02 11:45:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:03,026 INFO L93 Difference]: Finished difference Result 2566 states and 3751 transitions. [2019-10-02 11:45:03,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:45:03,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-02 11:45:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:03,048 INFO L225 Difference]: With dead ends: 2566 [2019-10-02 11:45:03,048 INFO L226 Difference]: Without dead ends: 2545 [2019-10-02 11:45:03,051 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:45:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2019-10-02 11:45:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 1901. [2019-10-02 11:45:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1901 states. [2019-10-02 11:45:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2704 transitions. [2019-10-02 11:45:03,168 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2704 transitions. Word has length 53 [2019-10-02 11:45:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:03,168 INFO L475 AbstractCegarLoop]: Abstraction has 1901 states and 2704 transitions. [2019-10-02 11:45:03,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:45:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2704 transitions. [2019-10-02 11:45:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 11:45:03,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:03,171 INFO L411 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] [2019-10-02 11:45:03,172 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:03,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1201448389, now seen corresponding path program 1 times [2019-10-02 11:45:03,172 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:03,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:03,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:03,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:03,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:05,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:05,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:45:05,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:05,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:05,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:05,336 INFO L87 Difference]: Start difference. First operand 1901 states and 2704 transitions. Second operand 8 states. [2019-10-02 11:45:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:08,052 INFO L93 Difference]: Finished difference Result 1914 states and 2717 transitions. [2019-10-02 11:45:08,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:08,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-10-02 11:45:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:08,068 INFO L225 Difference]: With dead ends: 1914 [2019-10-02 11:45:08,068 INFO L226 Difference]: Without dead ends: 1893 [2019-10-02 11:45:08,072 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2019-10-02 11:45:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1893. [2019-10-02 11:45:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-10-02 11:45:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2694 transitions. [2019-10-02 11:45:08,163 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2694 transitions. Word has length 55 [2019-10-02 11:45:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:08,164 INFO L475 AbstractCegarLoop]: Abstraction has 1893 states and 2694 transitions. [2019-10-02 11:45:08,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2694 transitions. [2019-10-02 11:45:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 11:45:08,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:08,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:08,169 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1919540531, now seen corresponding path program 1 times [2019-10-02 11:45:08,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:08,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:08,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:08,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:08,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:09,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:09,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:45:09,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:45:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:45:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:45:09,739 INFO L87 Difference]: Start difference. First operand 1893 states and 2694 transitions. Second operand 7 states. [2019-10-02 11:45:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:24,514 INFO L93 Difference]: Finished difference Result 2636 states and 4020 transitions. [2019-10-02 11:45:24,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:45:24,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-02 11:45:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:24,545 INFO L225 Difference]: With dead ends: 2636 [2019-10-02 11:45:24,545 INFO L226 Difference]: Without dead ends: 2593 [2019-10-02 11:45:24,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:45:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-10-02 11:45:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2588. [2019-10-02 11:45:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2019-10-02 11:45:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 3962 transitions. [2019-10-02 11:45:24,701 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 3962 transitions. Word has length 56 [2019-10-02 11:45:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:24,702 INFO L475 AbstractCegarLoop]: Abstraction has 2588 states and 3962 transitions. [2019-10-02 11:45:24,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:45:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 3962 transitions. [2019-10-02 11:45:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 11:45:24,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:24,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:24,706 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash 72088627, now seen corresponding path program 1 times [2019-10-02 11:45:24,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:24,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:24,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:24,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:24,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:25,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:25,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:45:25,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:45:25,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:45:25,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:45:25,922 INFO L87 Difference]: Start difference. First operand 2588 states and 3962 transitions. Second operand 3 states. [2019-10-02 11:45:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:26,347 INFO L93 Difference]: Finished difference Result 3575 states and 5650 transitions. [2019-10-02 11:45:26,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:45:26,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-02 11:45:26,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:26,373 INFO L225 Difference]: With dead ends: 3575 [2019-10-02 11:45:26,374 INFO L226 Difference]: Without dead ends: 3562 [2019-10-02 11:45:26,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:45:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2019-10-02 11:45:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3308. [2019-10-02 11:45:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-10-02 11:45:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 5119 transitions. [2019-10-02 11:45:26,603 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 5119 transitions. Word has length 56 [2019-10-02 11:45:26,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:26,603 INFO L475 AbstractCegarLoop]: Abstraction has 3308 states and 5119 transitions. [2019-10-02 11:45:26,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:45:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 5119 transitions. [2019-10-02 11:45:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 11:45:26,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:26,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:26,605 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:26,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1508214174, now seen corresponding path program 1 times [2019-10-02 11:45:26,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:26,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:26,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:26,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:26,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:27,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:27,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:45:27,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:45:27,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:45:27,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:45:27,898 INFO L87 Difference]: Start difference. First operand 3308 states and 5119 transitions. Second operand 7 states. [2019-10-02 11:45:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:51,543 INFO L93 Difference]: Finished difference Result 4566 states and 7281 transitions. [2019-10-02 11:45:51,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:45:51,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-02 11:45:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:51,572 INFO L225 Difference]: With dead ends: 4566 [2019-10-02 11:45:51,572 INFO L226 Difference]: Without dead ends: 4536 [2019-10-02 11:45:51,577 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:45:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-10-02 11:45:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3007. [2019-10-02 11:45:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3007 states. [2019-10-02 11:45:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4579 transitions. [2019-10-02 11:45:51,790 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4579 transitions. Word has length 56 [2019-10-02 11:45:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:51,790 INFO L475 AbstractCegarLoop]: Abstraction has 3007 states and 4579 transitions. [2019-10-02 11:45:51,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:45:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4579 transitions. [2019-10-02 11:45:51,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 11:45:51,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:51,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:51,793 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:51,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:51,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1607397804, now seen corresponding path program 1 times [2019-10-02 11:45:51,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:51,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:51,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:51,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:53,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:53,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:45:53,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:45:53,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:45:53,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:45:53,274 INFO L87 Difference]: Start difference. First operand 3007 states and 4579 transitions. Second operand 8 states. [2019-10-02 11:45:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:56,023 INFO L93 Difference]: Finished difference Result 3021 states and 4594 transitions. [2019-10-02 11:45:56,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:45:56,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-02 11:45:56,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:56,039 INFO L225 Difference]: With dead ends: 3021 [2019-10-02 11:45:56,040 INFO L226 Difference]: Without dead ends: 3017 [2019-10-02 11:45:56,043 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2019-10-02 11:45:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 3013. [2019-10-02 11:45:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3013 states. [2019-10-02 11:45:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 4586 transitions. [2019-10-02 11:45:56,292 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 4586 transitions. Word has length 57 [2019-10-02 11:45:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:56,293 INFO L475 AbstractCegarLoop]: Abstraction has 3013 states and 4586 transitions. [2019-10-02 11:45:56,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:45:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 4586 transitions. [2019-10-02 11:45:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 11:45:56,294 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:56,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:56,295 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:56,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1607674634, now seen corresponding path program 1 times [2019-10-02 11:45:56,295 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:56,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:56,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:56,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:56,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:45:57,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:57,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:45:57,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:45:57,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:45:57,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:45:57,547 INFO L87 Difference]: Start difference. First operand 3013 states and 4586 transitions. Second operand 5 states. [2019-10-02 11:45:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:58,782 INFO L93 Difference]: Finished difference Result 3879 states and 6165 transitions. [2019-10-02 11:45:58,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:45:58,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-02 11:45:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:58,806 INFO L225 Difference]: With dead ends: 3879 [2019-10-02 11:45:58,806 INFO L226 Difference]: Without dead ends: 3844 [2019-10-02 11:45:58,810 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:45:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2019-10-02 11:45:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 2984. [2019-10-02 11:45:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2019-10-02 11:45:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 4552 transitions. [2019-10-02 11:45:59,011 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 4552 transitions. Word has length 57 [2019-10-02 11:45:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:59,012 INFO L475 AbstractCegarLoop]: Abstraction has 2984 states and 4552 transitions. [2019-10-02 11:45:59,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:45:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 4552 transitions. [2019-10-02 11:45:59,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 11:45:59,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:59,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:59,015 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:59,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:59,015 INFO L82 PathProgramCache]: Analyzing trace with hash -483045091, now seen corresponding path program 1 times [2019-10-02 11:45:59,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:59,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:59,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:59,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:46:00,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:00,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:46:00,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:46:00,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:46:00,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:46:00,553 INFO L87 Difference]: Start difference. First operand 2984 states and 4552 transitions. Second operand 4 states. [2019-10-02 11:46:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:01,174 INFO L93 Difference]: Finished difference Result 3076 states and 4656 transitions. [2019-10-02 11:46:01,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:46:01,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-02 11:46:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:01,181 INFO L225 Difference]: With dead ends: 3076 [2019-10-02 11:46:01,181 INFO L226 Difference]: Without dead ends: 1711 [2019-10-02 11:46:01,191 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:46:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-10-02 11:46:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1709. [2019-10-02 11:46:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1709 states. [2019-10-02 11:46:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2511 transitions. [2019-10-02 11:46:01,286 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2511 transitions. Word has length 66 [2019-10-02 11:46:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:01,287 INFO L475 AbstractCegarLoop]: Abstraction has 1709 states and 2511 transitions. [2019-10-02 11:46:01,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:46:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2511 transitions. [2019-10-02 11:46:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 11:46:01,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:01,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:01,288 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:01,289 INFO L82 PathProgramCache]: Analyzing trace with hash -363600951, now seen corresponding path program 1 times [2019-10-02 11:46:01,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:01,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:01,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:01,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:01,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:46:02,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:02,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:46:02,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:46:02,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:46:02,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:46:02,699 INFO L87 Difference]: Start difference. First operand 1709 states and 2511 transitions. Second operand 10 states. [2019-10-02 11:46:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:05,732 INFO L93 Difference]: Finished difference Result 1711 states and 2512 transitions. [2019-10-02 11:46:05,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:46:05,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-10-02 11:46:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:05,741 INFO L225 Difference]: With dead ends: 1711 [2019-10-02 11:46:05,742 INFO L226 Difference]: Without dead ends: 1674 [2019-10-02 11:46:05,743 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:46:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-10-02 11:46:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1674. [2019-10-02 11:46:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2019-10-02 11:46:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2472 transitions. [2019-10-02 11:46:05,841 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2472 transitions. Word has length 63 [2019-10-02 11:46:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:05,842 INFO L475 AbstractCegarLoop]: Abstraction has 1674 states and 2472 transitions. [2019-10-02 11:46:05,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:46:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2472 transitions. [2019-10-02 11:46:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 11:46:05,843 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:05,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:05,843 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:05,844 INFO L82 PathProgramCache]: Analyzing trace with hash -613627622, now seen corresponding path program 1 times [2019-10-02 11:46:05,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:05,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:05,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:05,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:46:07,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:07,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:46:07,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:46:07,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:46:07,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:46:07,278 INFO L87 Difference]: Start difference. First operand 1674 states and 2472 transitions. Second operand 3 states. [2019-10-02 11:46:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:07,394 INFO L93 Difference]: Finished difference Result 2406 states and 3651 transitions. [2019-10-02 11:46:07,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:46:07,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-02 11:46:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:07,400 INFO L225 Difference]: With dead ends: 2406 [2019-10-02 11:46:07,400 INFO L226 Difference]: Without dead ends: 808 [2019-10-02 11:46:07,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:46:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2019-10-02 11:46:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2019-10-02 11:46:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-10-02 11:46:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1167 transitions. [2019-10-02 11:46:07,460 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1167 transitions. Word has length 70 [2019-10-02 11:46:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:07,461 INFO L475 AbstractCegarLoop]: Abstraction has 808 states and 1167 transitions. [2019-10-02 11:46:07,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:46:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1167 transitions. [2019-10-02 11:46:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 11:46:07,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:07,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:07,462 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:07,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:07,463 INFO L82 PathProgramCache]: Analyzing trace with hash 97694375, now seen corresponding path program 1 times [2019-10-02 11:46:07,463 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:07,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:07,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:07,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:46:08,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:08,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:46:08,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:46:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:46:08,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:46:08,677 INFO L87 Difference]: Start difference. First operand 808 states and 1167 transitions. Second operand 3 states. [2019-10-02 11:46:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:08,793 INFO L93 Difference]: Finished difference Result 1517 states and 2233 transitions. [2019-10-02 11:46:08,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:46:08,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-02 11:46:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:08,797 INFO L225 Difference]: With dead ends: 1517 [2019-10-02 11:46:08,797 INFO L226 Difference]: Without dead ends: 807 [2019-10-02 11:46:08,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:46:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-10-02 11:46:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2019-10-02 11:46:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-10-02 11:46:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1164 transitions. [2019-10-02 11:46:08,850 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1164 transitions. Word has length 74 [2019-10-02 11:46:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:08,850 INFO L475 AbstractCegarLoop]: Abstraction has 807 states and 1164 transitions. [2019-10-02 11:46:08,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:46:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1164 transitions. [2019-10-02 11:46:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 11:46:08,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:08,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:08,852 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:08,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:08,852 INFO L82 PathProgramCache]: Analyzing trace with hash -62178244, now seen corresponding path program 1 times [2019-10-02 11:46:08,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:08,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:08,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:08,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:08,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:46:10,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:10,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:46:10,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:46:10,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:46:10,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:46:10,266 INFO L87 Difference]: Start difference. First operand 807 states and 1164 transitions. Second operand 6 states. [2019-10-02 11:46:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:12,397 INFO L93 Difference]: Finished difference Result 1567 states and 2344 transitions. [2019-10-02 11:46:12,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:46:12,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-02 11:46:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:12,407 INFO L225 Difference]: With dead ends: 1567 [2019-10-02 11:46:12,407 INFO L226 Difference]: Without dead ends: 838 [2019-10-02 11:46:12,411 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:46:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-10-02 11:46:12,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 824. [2019-10-02 11:46:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2019-10-02 11:46:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1212 transitions. [2019-10-02 11:46:12,457 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1212 transitions. Word has length 96 [2019-10-02 11:46:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:12,458 INFO L475 AbstractCegarLoop]: Abstraction has 824 states and 1212 transitions. [2019-10-02 11:46:12,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:46:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1212 transitions. [2019-10-02 11:46:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 11:46:12,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:12,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:12,460 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:12,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:12,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2013265241, now seen corresponding path program 1 times [2019-10-02 11:46:12,460 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:12,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:12,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:12,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:12,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:46:13,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:13,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:46:13,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:46:13,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:46:13,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:46:13,760 INFO L87 Difference]: Start difference. First operand 824 states and 1212 transitions. Second operand 3 states. [2019-10-02 11:46:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:14,018 INFO L93 Difference]: Finished difference Result 1385 states and 2084 transitions. [2019-10-02 11:46:14,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:46:14,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-02 11:46:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:14,025 INFO L225 Difference]: With dead ends: 1385 [2019-10-02 11:46:14,025 INFO L226 Difference]: Without dead ends: 1382 [2019-10-02 11:46:14,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:46:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-10-02 11:46:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 972. [2019-10-02 11:46:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-10-02 11:46:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1431 transitions. [2019-10-02 11:46:14,097 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1431 transitions. Word has length 97 [2019-10-02 11:46:14,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:14,098 INFO L475 AbstractCegarLoop]: Abstraction has 972 states and 1431 transitions. [2019-10-02 11:46:14,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:46:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1431 transitions. [2019-10-02 11:46:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 11:46:14,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:14,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:14,100 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:14,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:14,100 INFO L82 PathProgramCache]: Analyzing trace with hash 611295629, now seen corresponding path program 1 times [2019-10-02 11:46:14,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:14,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:14,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:14,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:14,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:46:15,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:15,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:46:15,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:46:15,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:46:15,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:46:15,852 INFO L87 Difference]: Start difference. First operand 972 states and 1431 transitions. Second operand 4 states. [2019-10-02 11:46:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:15,966 INFO L93 Difference]: Finished difference Result 1942 states and 2861 transitions. [2019-10-02 11:46:15,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:46:15,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-02 11:46:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:15,971 INFO L225 Difference]: With dead ends: 1942 [2019-10-02 11:46:15,972 INFO L226 Difference]: Without dead ends: 978 [2019-10-02 11:46:15,976 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:46:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-02 11:46:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-10-02 11:46:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-10-02 11:46:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1435 transitions. [2019-10-02 11:46:16,037 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1435 transitions. Word has length 98 [2019-10-02 11:46:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:16,038 INFO L475 AbstractCegarLoop]: Abstraction has 976 states and 1435 transitions. [2019-10-02 11:46:16,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:46:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1435 transitions. [2019-10-02 11:46:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 11:46:16,039 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:16,039 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:16,039 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:16,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:16,040 INFO L82 PathProgramCache]: Analyzing trace with hash -925397907, now seen corresponding path program 1 times [2019-10-02 11:46:16,040 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:16,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:16,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:46:17,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:17,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:46:17,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:46:17,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:46:17,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:46:17,661 INFO L87 Difference]: Start difference. First operand 976 states and 1435 transitions. Second operand 4 states. [2019-10-02 11:46:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:17,846 INFO L93 Difference]: Finished difference Result 1897 states and 2891 transitions. [2019-10-02 11:46:17,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:46:17,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-02 11:46:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:17,852 INFO L225 Difference]: With dead ends: 1897 [2019-10-02 11:46:17,852 INFO L226 Difference]: Without dead ends: 993 [2019-10-02 11:46:17,858 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:46:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-10-02 11:46:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2019-10-02 11:46:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-10-02 11:46:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1463 transitions. [2019-10-02 11:46:17,919 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1463 transitions. Word has length 102 [2019-10-02 11:46:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:17,919 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1463 transitions. [2019-10-02 11:46:17,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:46:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1463 transitions. [2019-10-02 11:46:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 11:46:17,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:17,921 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:17,921 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:17,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:17,922 INFO L82 PathProgramCache]: Analyzing trace with hash 412987593, now seen corresponding path program 1 times [2019-10-02 11:46:17,922 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:17,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:17,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:17,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:17,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 11:46:19,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:19,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:46:19,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:46:19,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:46:19,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:46:19,397 INFO L87 Difference]: Start difference. First operand 993 states and 1463 transitions. Second operand 4 states. [2019-10-02 11:46:19,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:19,592 INFO L93 Difference]: Finished difference Result 1937 states and 2955 transitions. [2019-10-02 11:46:19,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:46:19,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-02 11:46:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:19,600 INFO L225 Difference]: With dead ends: 1937 [2019-10-02 11:46:19,600 INFO L226 Difference]: Without dead ends: 1018 [2019-10-02 11:46:19,607 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:46:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2019-10-02 11:46:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 998. [2019-10-02 11:46:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-10-02 11:46:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1472 transitions. [2019-10-02 11:46:19,697 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1472 transitions. Word has length 103 [2019-10-02 11:46:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:19,698 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1472 transitions. [2019-10-02 11:46:19,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:46:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1472 transitions. [2019-10-02 11:46:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 11:46:19,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:19,701 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:19,701 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:19,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash 928264555, now seen corresponding path program 1 times [2019-10-02 11:46:19,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:19,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:19,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:19,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:19,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 11:46:21,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:46:21,270 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:46:21,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:22,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 5704 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:46:22,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:46:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:46:23,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:46:23,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 11:46:23,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:46:23,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:46:23,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:46:23,045 INFO L87 Difference]: Start difference. First operand 998 states and 1472 transitions. Second operand 8 states. [2019-10-02 11:46:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:23,341 INFO L93 Difference]: Finished difference Result 2031 states and 3088 transitions. [2019-10-02 11:46:23,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:46:23,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-10-02 11:46:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:23,351 INFO L225 Difference]: With dead ends: 2031 [2019-10-02 11:46:23,351 INFO L226 Difference]: Without dead ends: 1041 [2019-10-02 11:46:23,365 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:46:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-02 11:46:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1007. [2019-10-02 11:46:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-10-02 11:46:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1485 transitions. [2019-10-02 11:46:23,488 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1485 transitions. Word has length 104 [2019-10-02 11:46:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:23,488 INFO L475 AbstractCegarLoop]: Abstraction has 1007 states and 1485 transitions. [2019-10-02 11:46:23,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:46:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1485 transitions. [2019-10-02 11:46:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-02 11:46:23,490 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:23,490 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:23,491 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:23,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:23,491 INFO L82 PathProgramCache]: Analyzing trace with hash 544837801, now seen corresponding path program 2 times [2019-10-02 11:46:23,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:23,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:23,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:23,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:23,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-02 11:46:25,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:46:25,381 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:46:25,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:46:27,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 11:46:27,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:46:27,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 5647 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:46:27,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:46:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 11:46:27,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:46:27,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 11:46:27,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:46:27,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:46:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:46:27,118 INFO L87 Difference]: Start difference. First operand 1007 states and 1485 transitions. Second operand 8 states. [2019-10-02 11:46:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:27,372 INFO L93 Difference]: Finished difference Result 2015 states and 3076 transitions. [2019-10-02 11:46:27,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:46:27,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2019-10-02 11:46:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:27,388 INFO L225 Difference]: With dead ends: 2015 [2019-10-02 11:46:27,388 INFO L226 Difference]: Without dead ends: 1061 [2019-10-02 11:46:27,397 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:46:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-10-02 11:46:27,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1017. [2019-10-02 11:46:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2019-10-02 11:46:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1499 transitions. [2019-10-02 11:46:27,466 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1499 transitions. Word has length 109 [2019-10-02 11:46:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:27,467 INFO L475 AbstractCegarLoop]: Abstraction has 1017 states and 1499 transitions. [2019-10-02 11:46:27,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:46:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1499 transitions. [2019-10-02 11:46:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-02 11:46:27,468 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:27,469 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:27,469 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:27,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1918335568, now seen corresponding path program 1 times [2019-10-02 11:46:27,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:27,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:27,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:27,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:46:27,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 11:46:28,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:46:28,944 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:46:29,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:30,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 5741 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:46:30,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:46:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 11:46:30,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:46:30,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-02 11:46:30,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:46:30,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:46:30,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:46:30,897 INFO L87 Difference]: Start difference. First operand 1017 states and 1499 transitions. Second operand 11 states. [2019-10-02 11:46:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:31,196 INFO L93 Difference]: Finished difference Result 2090 states and 3177 transitions. [2019-10-02 11:46:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:46:31,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2019-10-02 11:46:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:31,203 INFO L225 Difference]: With dead ends: 2090 [2019-10-02 11:46:31,203 INFO L226 Difference]: Without dead ends: 1083 [2019-10-02 11:46:31,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:46:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-10-02 11:46:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1026. [2019-10-02 11:46:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-10-02 11:46:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1512 transitions. [2019-10-02 11:46:31,281 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1512 transitions. Word has length 111 [2019-10-02 11:46:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:31,281 INFO L475 AbstractCegarLoop]: Abstraction has 1026 states and 1512 transitions. [2019-10-02 11:46:31,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:46:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1512 transitions. [2019-10-02 11:46:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 11:46:31,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:31,283 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:31,283 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:31,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1428334940, now seen corresponding path program 2 times [2019-10-02 11:46:31,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:31,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:31,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:31,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:31,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 11:46:32,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:46:32,542 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:46:33,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:46:34,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 11:46:34,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:46:34,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 5647 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:46:34,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:46:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:46:34,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:46:34,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-10-02 11:46:34,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:46:34,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:46:34,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:46:34,317 INFO L87 Difference]: Start difference. First operand 1026 states and 1512 transitions. Second operand 11 states. [2019-10-02 11:46:34,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:34,963 INFO L93 Difference]: Finished difference Result 1733 states and 2586 transitions. [2019-10-02 11:46:34,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:46:34,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2019-10-02 11:46:34,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:34,967 INFO L225 Difference]: With dead ends: 1733 [2019-10-02 11:46:34,967 INFO L226 Difference]: Without dead ends: 770 [2019-10-02 11:46:34,976 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:46:34,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2019-10-02 11:46:35,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 578. [2019-10-02 11:46:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-02 11:46:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 796 transitions. [2019-10-02 11:46:35,018 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 796 transitions. Word has length 116 [2019-10-02 11:46:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:35,018 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 796 transitions. [2019-10-02 11:46:35,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:46:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 796 transitions. [2019-10-02 11:46:35,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-02 11:46:35,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:35,020 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:35,020 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:35,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:35,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1052665335, now seen corresponding path program 1 times [2019-10-02 11:46:35,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:35,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:35,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:35,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:46:35,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 11:46:36,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:36,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:46:36,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:46:36,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:46:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:46:36,760 INFO L87 Difference]: Start difference. First operand 578 states and 796 transitions. Second operand 5 states. [2019-10-02 11:46:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:37,560 INFO L93 Difference]: Finished difference Result 1051 states and 1481 transitions. [2019-10-02 11:46:37,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:46:37,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-02 11:46:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:37,564 INFO L225 Difference]: With dead ends: 1051 [2019-10-02 11:46:37,564 INFO L226 Difference]: Without dead ends: 573 [2019-10-02 11:46:37,568 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:46:37,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-10-02 11:46:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-10-02 11:46:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-02 11:46:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 781 transitions. [2019-10-02 11:46:37,611 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 781 transitions. Word has length 121 [2019-10-02 11:46:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:37,611 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 781 transitions. [2019-10-02 11:46:37,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:46:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 781 transitions. [2019-10-02 11:46:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 11:46:37,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:37,613 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:37,613 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:37,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:37,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1105430342, now seen corresponding path program 1 times [2019-10-02 11:46:37,614 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:37,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:37,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:37,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:37,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:46:39,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:39,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:46:39,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:46:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:46:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:46:39,115 INFO L87 Difference]: Start difference. First operand 573 states and 781 transitions. Second operand 3 states. [2019-10-02 11:46:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:39,158 INFO L93 Difference]: Finished difference Result 1052 states and 1471 transitions. [2019-10-02 11:46:39,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:46:39,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-02 11:46:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:39,162 INFO L225 Difference]: With dead ends: 1052 [2019-10-02 11:46:39,162 INFO L226 Difference]: Without dead ends: 579 [2019-10-02 11:46:39,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:46:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-02 11:46:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 576. [2019-10-02 11:46:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-02 11:46:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 784 transitions. [2019-10-02 11:46:39,207 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 784 transitions. Word has length 104 [2019-10-02 11:46:39,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:39,207 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 784 transitions. [2019-10-02 11:46:39,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:46:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 784 transitions. [2019-10-02 11:46:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 11:46:39,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:39,209 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:39,209 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:39,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:39,209 INFO L82 PathProgramCache]: Analyzing trace with hash 94313092, now seen corresponding path program 1 times [2019-10-02 11:46:39,210 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:39,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:39,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:39,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:39,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:46:40,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:40,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:46:40,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:46:40,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:46:40,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:46:40,699 INFO L87 Difference]: Start difference. First operand 576 states and 784 transitions. Second operand 5 states. [2019-10-02 11:46:41,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:41,979 INFO L93 Difference]: Finished difference Result 1205 states and 1679 transitions. [2019-10-02 11:46:41,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:46:41,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-02 11:46:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:41,987 INFO L225 Difference]: With dead ends: 1205 [2019-10-02 11:46:41,987 INFO L226 Difference]: Without dead ends: 754 [2019-10-02 11:46:41,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:46:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-02 11:46:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 573. [2019-10-02 11:46:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-02 11:46:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 777 transitions. [2019-10-02 11:46:42,035 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 777 transitions. Word has length 104 [2019-10-02 11:46:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:42,036 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 777 transitions. [2019-10-02 11:46:42,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:46:42,036 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 777 transitions. [2019-10-02 11:46:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 11:46:42,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:42,038 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:42,038 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash -921891257, now seen corresponding path program 1 times [2019-10-02 11:46:42,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:42,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:42,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:42,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:42,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 11:46:43,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:43,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:46:43,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:46:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:46:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:46:43,562 INFO L87 Difference]: Start difference. First operand 573 states and 777 transitions. Second operand 3 states. [2019-10-02 11:46:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:43,684 INFO L93 Difference]: Finished difference Result 1246 states and 1732 transitions. [2019-10-02 11:46:43,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:46:43,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-02 11:46:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:43,688 INFO L225 Difference]: With dead ends: 1246 [2019-10-02 11:46:43,688 INFO L226 Difference]: Without dead ends: 776 [2019-10-02 11:46:43,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:46:43,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-10-02 11:46:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 739. [2019-10-02 11:46:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-10-02 11:46:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1012 transitions. [2019-10-02 11:46:43,747 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1012 transitions. Word has length 123 [2019-10-02 11:46:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:43,747 INFO L475 AbstractCegarLoop]: Abstraction has 739 states and 1012 transitions. [2019-10-02 11:46:43,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:46:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1012 transitions. [2019-10-02 11:46:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 11:46:43,748 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:43,749 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:43,749 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:43,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:43,749 INFO L82 PathProgramCache]: Analyzing trace with hash 505159219, now seen corresponding path program 1 times [2019-10-02 11:46:43,749 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:43,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:43,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:43,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:43,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 11:46:45,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:45,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:46:45,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:46:45,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:46:45,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:46:45,223 INFO L87 Difference]: Start difference. First operand 739 states and 1012 transitions. Second operand 6 states. [2019-10-02 11:46:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:47,355 INFO L93 Difference]: Finished difference Result 1356 states and 1891 transitions. [2019-10-02 11:46:47,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:46:47,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-10-02 11:46:47,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:47,360 INFO L225 Difference]: With dead ends: 1356 [2019-10-02 11:46:47,361 INFO L226 Difference]: Without dead ends: 739 [2019-10-02 11:46:47,366 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:46:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-10-02 11:46:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2019-10-02 11:46:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-10-02 11:46:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1010 transitions. [2019-10-02 11:46:47,425 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1010 transitions. Word has length 124 [2019-10-02 11:46:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:47,425 INFO L475 AbstractCegarLoop]: Abstraction has 739 states and 1010 transitions. [2019-10-02 11:46:47,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:46:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1010 transitions. [2019-10-02 11:46:47,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 11:46:47,428 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:47,429 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:47,429 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:47,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:47,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1153596553, now seen corresponding path program 1 times [2019-10-02 11:46:47,429 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:47,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:47,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:47,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:47,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 11:46:48,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:48,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:46:48,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:46:48,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:46:48,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:46:48,625 INFO L87 Difference]: Start difference. First operand 739 states and 1010 transitions. Second operand 6 states. [2019-10-02 11:46:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:50,469 INFO L93 Difference]: Finished difference Result 1323 states and 1833 transitions. [2019-10-02 11:46:50,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:46:50,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-10-02 11:46:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:50,472 INFO L225 Difference]: With dead ends: 1323 [2019-10-02 11:46:50,472 INFO L226 Difference]: Without dead ends: 708 [2019-10-02 11:46:50,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:46:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-10-02 11:46:50,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 701. [2019-10-02 11:46:50,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-10-02 11:46:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 949 transitions. [2019-10-02 11:46:50,528 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 949 transitions. Word has length 134 [2019-10-02 11:46:50,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:50,528 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 949 transitions. [2019-10-02 11:46:50,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:46:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 949 transitions. [2019-10-02 11:46:50,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 11:46:50,530 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:50,530 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:50,530 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:50,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:50,530 INFO L82 PathProgramCache]: Analyzing trace with hash 274299940, now seen corresponding path program 1 times [2019-10-02 11:46:50,530 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:50,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:50,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:50,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:50,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 11:46:52,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:52,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 11:46:52,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:46:52,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:46:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:46:52,087 INFO L87 Difference]: Start difference. First operand 701 states and 949 transitions. Second operand 15 states. [2019-10-02 11:46:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:57,436 INFO L93 Difference]: Finished difference Result 1296 states and 1765 transitions. [2019-10-02 11:46:57,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:46:57,439 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 144 [2019-10-02 11:46:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:57,443 INFO L225 Difference]: With dead ends: 1296 [2019-10-02 11:46:57,443 INFO L226 Difference]: Without dead ends: 697 [2019-10-02 11:46:57,444 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:46:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-10-02 11:46:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 689. [2019-10-02 11:46:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-10-02 11:46:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 926 transitions. [2019-10-02 11:46:57,497 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 926 transitions. Word has length 144 [2019-10-02 11:46:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:57,497 INFO L475 AbstractCegarLoop]: Abstraction has 689 states and 926 transitions. [2019-10-02 11:46:57,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:46:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 926 transitions. [2019-10-02 11:46:57,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 11:46:57,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:57,499 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:57,499 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:57,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1147429934, now seen corresponding path program 1 times [2019-10-02 11:46:57,500 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:57,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:57,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:57,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:57,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 11:46:59,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:59,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:46:59,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:46:59,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:46:59,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:46:59,911 INFO L87 Difference]: Start difference. First operand 689 states and 926 transitions. Second operand 14 states. [2019-10-02 11:47:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:47:49,229 INFO L93 Difference]: Finished difference Result 713 states and 948 transitions. [2019-10-02 11:47:49,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:47:49,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 154 [2019-10-02 11:47:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:47:49,232 INFO L225 Difference]: With dead ends: 713 [2019-10-02 11:47:49,232 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 11:47:49,233 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:47:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 11:47:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2019-10-02 11:47:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-02 11:47:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 881 transitions. [2019-10-02 11:47:49,270 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 881 transitions. Word has length 154 [2019-10-02 11:47:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:47:49,270 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 881 transitions. [2019-10-02 11:47:49,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:47:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 881 transitions. [2019-10-02 11:47:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 11:47:49,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:47:49,272 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:47:49,273 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:47:49,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:47:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1425986904, now seen corresponding path program 1 times [2019-10-02 11:47:49,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:47:49,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:47:49,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:49,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:47:49,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:47:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:47:50,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:47:50,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:47:50,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:47:50,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:47:50,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:47:50,388 INFO L87 Difference]: Start difference. First operand 655 states and 881 transitions. Second operand 5 states. [2019-10-02 11:47:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:47:50,481 INFO L93 Difference]: Finished difference Result 846 states and 1145 transitions. [2019-10-02 11:47:50,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:47:50,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-02 11:47:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:47:50,484 INFO L225 Difference]: With dead ends: 846 [2019-10-02 11:47:50,484 INFO L226 Difference]: Without dead ends: 728 [2019-10-02 11:47:50,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:47:50,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-02 11:47:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 661. [2019-10-02 11:47:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-02 11:47:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 893 transitions. [2019-10-02 11:47:50,545 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 893 transitions. Word has length 156 [2019-10-02 11:47:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:47:50,545 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 893 transitions. [2019-10-02 11:47:50,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:47:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 893 transitions. [2019-10-02 11:47:50,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 11:47:50,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:47:50,548 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:47:50,548 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:47:50,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:47:50,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1041121111, now seen corresponding path program 1 times [2019-10-02 11:47:50,548 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:47:50,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:47:50,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:50,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:47:50,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:47:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:47:51,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:47:51,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 11:47:51,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:47:51,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:47:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:47:51,973 INFO L87 Difference]: Start difference. First operand 661 states and 893 transitions. Second operand 15 states. [2019-10-02 11:47:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:47:58,406 INFO L93 Difference]: Finished difference Result 689 states and 924 transitions. [2019-10-02 11:47:58,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:47:58,420 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 156 [2019-10-02 11:47:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:47:58,424 INFO L225 Difference]: With dead ends: 689 [2019-10-02 11:47:58,424 INFO L226 Difference]: Without dead ends: 659 [2019-10-02 11:47:58,425 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:47:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-02 11:47:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 653. [2019-10-02 11:47:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-10-02 11:47:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 878 transitions. [2019-10-02 11:47:58,483 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 878 transitions. Word has length 156 [2019-10-02 11:47:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:47:58,485 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 878 transitions. [2019-10-02 11:47:58,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:47:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 878 transitions. [2019-10-02 11:47:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 11:47:58,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:47:58,497 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:47:58,497 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:47:58,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:47:58,498 INFO L82 PathProgramCache]: Analyzing trace with hash -642148414, now seen corresponding path program 1 times [2019-10-02 11:47:58,498 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:47:58,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:47:58,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:58,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:47:58,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:47:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 11:47:59,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:47:59,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:47:59,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:47:59,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:47:59,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:47:59,784 INFO L87 Difference]: Start difference. First operand 653 states and 878 transitions. Second operand 6 states. [2019-10-02 11:47:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:47:59,933 INFO L93 Difference]: Finished difference Result 1150 states and 1546 transitions. [2019-10-02 11:47:59,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:47:59,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-10-02 11:47:59,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:47:59,936 INFO L225 Difference]: With dead ends: 1150 [2019-10-02 11:47:59,936 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 11:47:59,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:47:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 11:48:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-02 11:48:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-02 11:48:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 850 transitions. [2019-10-02 11:48:00,071 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 850 transitions. Word has length 172 [2019-10-02 11:48:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:00,072 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 850 transitions. [2019-10-02 11:48:00,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:48:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 850 transitions. [2019-10-02 11:48:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 11:48:00,074 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:00,074 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:00,075 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:00,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1747284813, now seen corresponding path program 1 times [2019-10-02 11:48:00,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:00,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:00,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:00,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:00,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:48:01,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:01,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:48:01,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:48:01,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:48:01,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:48:01,447 INFO L87 Difference]: Start difference. First operand 638 states and 850 transitions. Second operand 14 states. [2019-10-02 11:48:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:50,356 INFO L93 Difference]: Finished difference Result 647 states and 857 transitions. [2019-10-02 11:48:50,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:48:50,356 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 166 [2019-10-02 11:48:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:50,358 INFO L225 Difference]: With dead ends: 647 [2019-10-02 11:48:50,358 INFO L226 Difference]: Without dead ends: 453 [2019-10-02 11:48:50,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2019-10-02 11:48:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-02 11:48:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 358. [2019-10-02 11:48:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-10-02 11:48:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 446 transitions. [2019-10-02 11:48:50,393 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 446 transitions. Word has length 166 [2019-10-02 11:48:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:50,396 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 446 transitions. [2019-10-02 11:48:50,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:48:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 446 transitions. [2019-10-02 11:48:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 11:48:50,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:50,398 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:50,399 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:50,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:50,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1342593285, now seen corresponding path program 1 times [2019-10-02 11:48:50,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:50,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:50,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:50,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:50,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-02 11:48:51,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:48:51,937 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:48:52,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:53,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 6499 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:48:53,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:48:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-02 11:48:53,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:48:53,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-10-02 11:48:53,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:48:53,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:48:53,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:48:53,894 INFO L87 Difference]: Start difference. First operand 358 states and 446 transitions. Second operand 11 states. [2019-10-02 11:48:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:54,128 INFO L93 Difference]: Finished difference Result 714 states and 896 transitions. [2019-10-02 11:48:54,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:48:54,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 211 [2019-10-02 11:48:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:54,130 INFO L225 Difference]: With dead ends: 714 [2019-10-02 11:48:54,130 INFO L226 Difference]: Without dead ends: 367 [2019-10-02 11:48:54,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:48:54,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-10-02 11:48:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 366. [2019-10-02 11:48:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-02 11:48:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 457 transitions. [2019-10-02 11:48:54,164 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 457 transitions. Word has length 211 [2019-10-02 11:48:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:54,164 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 457 transitions. [2019-10-02 11:48:54,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:48:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 457 transitions. [2019-10-02 11:48:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 11:48:54,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:54,167 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:54,167 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:54,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:54,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1626297899, now seen corresponding path program 1 times [2019-10-02 11:48:54,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:54,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:54,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:54,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-02 11:48:55,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:55,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:48:55,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:48:55,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:48:55,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:48:55,610 INFO L87 Difference]: Start difference. First operand 366 states and 457 transitions. Second operand 6 states. [2019-10-02 11:48:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:55,714 INFO L93 Difference]: Finished difference Result 594 states and 738 transitions. [2019-10-02 11:48:55,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:48:55,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 214 [2019-10-02 11:48:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:55,715 INFO L225 Difference]: With dead ends: 594 [2019-10-02 11:48:55,716 INFO L226 Difference]: Without dead ends: 351 [2019-10-02 11:48:55,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:48:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-02 11:48:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-10-02 11:48:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-10-02 11:48:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 432 transitions. [2019-10-02 11:48:55,739 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 432 transitions. Word has length 214 [2019-10-02 11:48:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:55,740 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 432 transitions. [2019-10-02 11:48:55,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:48:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 432 transitions. [2019-10-02 11:48:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-02 11:48:55,742 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:55,742 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:55,742 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:55,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2025272901, now seen corresponding path program 1 times [2019-10-02 11:48:55,743 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:55,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:55,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:55,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:55,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-02 11:48:57,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:48:57,118 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:48:57,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:58,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 6830 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:48:59,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:48:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-10-02 11:48:59,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:48:59,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-10-02 11:48:59,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:48:59,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:48:59,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:48:59,178 INFO L87 Difference]: Start difference. First operand 351 states and 432 transitions. Second operand 12 states. [2019-10-02 11:48:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:59,580 INFO L93 Difference]: Finished difference Result 704 states and 874 transitions. [2019-10-02 11:48:59,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:48:59,580 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 257 [2019-10-02 11:48:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:59,583 INFO L225 Difference]: With dead ends: 704 [2019-10-02 11:48:59,583 INFO L226 Difference]: Without dead ends: 369 [2019-10-02 11:48:59,585 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:48:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-02 11:48:59,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 356. [2019-10-02 11:48:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-02 11:48:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 437 transitions. [2019-10-02 11:48:59,630 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 437 transitions. Word has length 257 [2019-10-02 11:48:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:59,631 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 437 transitions. [2019-10-02 11:48:59,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:48:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 437 transitions. [2019-10-02 11:48:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-02 11:48:59,635 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:59,636 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:59,636 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:59,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash 834884455, now seen corresponding path program 2 times [2019-10-02 11:48:59,637 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:59,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:59,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:59,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:59,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-10-02 11:49:01,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:01,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:49:01,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:49:01,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:49:01,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:49:01,326 INFO L87 Difference]: Start difference. First operand 356 states and 437 transitions. Second operand 6 states. [2019-10-02 11:49:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:01,419 INFO L93 Difference]: Finished difference Result 470 states and 580 transitions. [2019-10-02 11:49:01,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:49:01,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 260 [2019-10-02 11:49:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:01,421 INFO L225 Difference]: With dead ends: 470 [2019-10-02 11:49:01,422 INFO L226 Difference]: Without dead ends: 310 [2019-10-02 11:49:01,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:49:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-02 11:49:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2019-10-02 11:49:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-02 11:49:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 364 transitions. [2019-10-02 11:49:01,441 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 364 transitions. Word has length 260 [2019-10-02 11:49:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:01,441 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 364 transitions. [2019-10-02 11:49:01,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:49:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 364 transitions. [2019-10-02 11:49:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 11:49:01,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:01,444 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:01,444 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:01,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:01,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1170638044, now seen corresponding path program 1 times [2019-10-02 11:49:01,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:01,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:01,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:01,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:49:01,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-02 11:49:02,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:02,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:49:02,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:49:02,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:49:02,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:49:02,810 INFO L87 Difference]: Start difference. First operand 307 states and 364 transitions. Second operand 6 states. [2019-10-02 11:49:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:02,881 INFO L93 Difference]: Finished difference Result 307 states and 364 transitions. [2019-10-02 11:49:02,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:49:02,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 282 [2019-10-02 11:49:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:02,882 INFO L225 Difference]: With dead ends: 307 [2019-10-02 11:49:02,882 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:49:02,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:49:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:49:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:49:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:49:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:49:02,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 282 [2019-10-02 11:49:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:02,886 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:49:02,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:49:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:49:02,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:49:02,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:49:05,569 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102 [2019-10-02 11:49:07,021 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 95 [2019-10-02 11:49:09,676 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:09,818 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:10,045 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-10-02 11:49:10,223 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-10-02 11:49:10,363 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:10,581 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-02 11:49:10,904 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 37 [2019-10-02 11:49:11,161 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-02 11:49:11,416 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-10-02 11:49:11,555 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:11,691 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:12,010 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2019-10-02 11:49:12,149 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:12,638 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-10-02 11:49:12,983 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:13,185 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-10-02 11:49:13,406 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-10-02 11:49:13,793 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:13,927 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-10-02 11:49:14,428 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-10-02 11:49:14,748 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:14,888 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-10-02 11:49:15,095 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:15,214 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-02 11:49:15,352 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:15,504 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-10-02 11:49:15,612 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-02 11:49:15,751 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-10-02 11:49:16,215 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-10-02 11:49:16,336 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 1 [2019-10-02 11:49:16,577 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-10-02 11:49:16,917 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 47 [2019-10-02 11:49:17,092 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-02 11:49:17,234 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:17,420 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:17,716 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-10-02 11:49:18,121 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-10-02 11:49:18,271 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-10-02 11:49:18,578 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-10-02 11:49:18,864 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:19,211 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-10-02 11:49:19,542 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 47 [2019-10-02 11:49:19,856 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-10-02 11:49:20,033 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:20,337 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-10-02 11:49:20,477 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:20,588 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-10-02 11:49:20,723 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:20,964 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-10-02 11:49:21,196 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-10-02 11:49:21,338 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:21,476 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-02 11:49:21,606 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 1 [2019-10-02 11:49:21,813 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:22,082 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-10-02 11:49:22,302 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-10-02 11:49:22,537 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-10-02 11:49:22,743 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:22,982 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:23,096 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-10-02 11:49:23,445 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-10-02 11:49:23,674 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-02 11:49:23,796 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-10-02 11:49:24,194 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-10-02 11:49:24,338 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:24,572 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-10-02 11:49:24,802 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-10-02 11:49:25,040 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-10-02 11:49:25,744 WARN L191 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-10-02 11:49:26,016 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-10-02 11:49:26,130 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-02 11:49:26,363 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:26,476 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-02 11:49:27,727 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 189 DAG size of output: 1 [2019-10-02 11:49:27,854 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 1 [2019-10-02 11:49:28,099 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:28,241 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:28,506 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:28,793 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:28,907 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-10-02 11:49:29,044 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:29,197 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-02 11:49:29,504 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-10-02 11:49:29,700 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-02 11:49:29,813 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-10-02 11:49:30,121 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-10-02 11:49:30,261 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-10-02 11:49:30,321 INFO L443 ceAbstractionStarter]: For program point L3713(lines 3712 3725) no Hoare annotation was computed. [2019-10-02 11:49:30,321 INFO L443 ceAbstractionStarter]: For program point L3710(lines 3709 3726) no Hoare annotation was computed. [2019-10-02 11:49:30,321 INFO L443 ceAbstractionStarter]: For program point L3709(lines 3709 3726) no Hoare annotation was computed. [2019-10-02 11:49:30,321 INFO L443 ceAbstractionStarter]: For program point IoAllocateMdlEXIT(lines 3703 3728) no Hoare annotation was computed. [2019-10-02 11:49:30,321 INFO L443 ceAbstractionStarter]: For program point IoAllocateMdlENTRY(lines 3703 3728) no Hoare annotation was computed. [2019-10-02 11:49:30,321 INFO L443 ceAbstractionStarter]: For program point L3723(lines 3703 3728) no Hoare annotation was computed. [2019-10-02 11:49:30,322 INFO L443 ceAbstractionStarter]: For program point IoAttachDeviceToDeviceStackENTRY(lines 3731 3751) no Hoare annotation was computed. [2019-10-02 11:49:30,322 INFO L443 ceAbstractionStarter]: For program point IoAttachDeviceToDeviceStackEXIT(lines 3731 3751) no Hoare annotation was computed. [2019-10-02 11:49:30,322 INFO L443 ceAbstractionStarter]: For program point L3739(lines 3738 3748) no Hoare annotation was computed. [2019-10-02 11:49:30,322 INFO L443 ceAbstractionStarter]: For program point L3736(lines 3735 3749) no Hoare annotation was computed. [2019-10-02 11:49:30,322 INFO L443 ceAbstractionStarter]: For program point L3735(lines 3735 3749) no Hoare annotation was computed. [2019-10-02 11:49:30,322 INFO L443 ceAbstractionStarter]: For program point L3746(lines 3731 3751) no Hoare annotation was computed. [2019-10-02 11:49:30,322 INFO L443 ceAbstractionStarter]: For program point IoGetConfigurationInformationFINAL(lines 3935 3944) no Hoare annotation was computed. [2019-10-02 11:49:30,322 INFO L443 ceAbstractionStarter]: For program point IoGetConfigurationInformationENTRY(lines 3935 3944) no Hoare annotation was computed. [2019-10-02 11:49:30,322 INFO L443 ceAbstractionStarter]: For program point IoGetConfigurationInformationEXIT(lines 3935 3944) no Hoare annotation was computed. [2019-10-02 11:49:30,323 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 2059 2080) no Hoare annotation was computed. [2019-10-02 11:49:30,323 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 2059 2080) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= ~myStatus~0 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~DC~0) (= ~IPC~0 ~s~0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~NP~0) (= ~NP~0 |old(~s~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,323 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 2059 2080) no Hoare annotation was computed. [2019-10-02 11:49:30,323 INFO L446 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 2156 2166) the Hoare annotation is: true [2019-10-02 11:49:30,323 INFO L443 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 2156 2166) no Hoare annotation was computed. [2019-10-02 11:49:30,324 INFO L443 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 2156 2166) no Hoare annotation was computed. [2019-10-02 11:49:30,324 INFO L443 ceAbstractionStarter]: For program point KeDelayExecutionThreadEXIT(lines 4189 4209) no Hoare annotation was computed. [2019-10-02 11:49:30,324 INFO L443 ceAbstractionStarter]: For program point L4193(lines 4193 4207) no Hoare annotation was computed. [2019-10-02 11:49:30,324 INFO L443 ceAbstractionStarter]: For program point KeDelayExecutionThreadENTRY(lines 4189 4209) no Hoare annotation was computed. [2019-10-02 11:49:30,324 INFO L443 ceAbstractionStarter]: For program point L4204(lines 4189 4209) no Hoare annotation was computed. [2019-10-02 11:49:30,324 INFO L443 ceAbstractionStarter]: For program point L4197(lines 4196 4206) no Hoare annotation was computed. [2019-10-02 11:49:30,324 INFO L443 ceAbstractionStarter]: For program point L4194(lines 4193 4207) no Hoare annotation was computed. [2019-10-02 11:49:30,324 INFO L443 ceAbstractionStarter]: For program point L3770(lines 3769 3782) no Hoare annotation was computed. [2019-10-02 11:49:30,324 INFO L443 ceAbstractionStarter]: For program point L3766(lines 3766 3783) no Hoare annotation was computed. [2019-10-02 11:49:30,325 INFO L443 ceAbstractionStarter]: For program point L3767(lines 3766 3783) no Hoare annotation was computed. [2019-10-02 11:49:30,325 INFO L443 ceAbstractionStarter]: For program point IoBuildAsynchronousFsdRequestENTRY(lines 3758 3785) no Hoare annotation was computed. [2019-10-02 11:49:30,325 INFO L443 ceAbstractionStarter]: For program point L3780(lines 3758 3785) no Hoare annotation was computed. [2019-10-02 11:49:30,325 INFO L443 ceAbstractionStarter]: For program point IoBuildAsynchronousFsdRequestEXIT(lines 3758 3785) no Hoare annotation was computed. [2019-10-02 11:49:30,325 INFO L443 ceAbstractionStarter]: For program point RtlInitStringENTRY(lines 4654 4660) no Hoare annotation was computed. [2019-10-02 11:49:30,325 INFO L443 ceAbstractionStarter]: For program point RtlInitStringFINAL(lines 4654 4660) no Hoare annotation was computed. [2019-10-02 11:49:30,325 INFO L443 ceAbstractionStarter]: For program point RtlInitStringEXIT(lines 4654 4660) no Hoare annotation was computed. [2019-10-02 11:49:30,325 INFO L443 ceAbstractionStarter]: For program point RtlInitUnicodeStringFINAL(lines 4663 4670) no Hoare annotation was computed. [2019-10-02 11:49:30,325 INFO L443 ceAbstractionStarter]: For program point RtlInitUnicodeStringENTRY(lines 4663 4670) no Hoare annotation was computed. [2019-10-02 11:49:30,326 INFO L443 ceAbstractionStarter]: For program point RtlInitUnicodeStringEXIT(lines 4663 4670) no Hoare annotation was computed. [2019-10-02 11:49:30,326 INFO L443 ceAbstractionStarter]: For program point L4544(lines 4527 4549) no Hoare annotation was computed. [2019-10-02 11:49:30,326 INFO L443 ceAbstractionStarter]: For program point L4534(lines 4533 4547) no Hoare annotation was computed. [2019-10-02 11:49:30,326 INFO L443 ceAbstractionStarter]: For program point L4537(lines 4536 4546) no Hoare annotation was computed. [2019-10-02 11:49:30,326 INFO L443 ceAbstractionStarter]: For program point L4533(lines 4533 4547) no Hoare annotation was computed. [2019-10-02 11:49:30,326 INFO L443 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 4527 4549) no Hoare annotation was computed. [2019-10-02 11:49:30,326 INFO L443 ceAbstractionStarter]: For program point PsCreateSystemThreadENTRY(lines 4527 4549) no Hoare annotation was computed. [2019-10-02 11:49:30,326 INFO L443 ceAbstractionStarter]: For program point L4411(lines 4395 4416) no Hoare annotation was computed. [2019-10-02 11:49:30,326 INFO L443 ceAbstractionStarter]: For program point L4404(lines 4403 4413) no Hoare annotation was computed. [2019-10-02 11:49:30,327 INFO L443 ceAbstractionStarter]: For program point L4401(lines 4400 4414) no Hoare annotation was computed. [2019-10-02 11:49:30,327 INFO L443 ceAbstractionStarter]: For program point L4400(lines 4400 4414) no Hoare annotation was computed. [2019-10-02 11:49:30,327 INFO L443 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 4395 4416) no Hoare annotation was computed. [2019-10-02 11:49:30,327 INFO L443 ceAbstractionStarter]: For program point ObReferenceObjectByHandleENTRY(lines 4395 4416) no Hoare annotation was computed. [2019-10-02 11:49:30,327 INFO L446 ceAbstractionStarter]: At program point L3808(lines 3807 3820) the Hoare annotation is: true [2019-10-02 11:49:30,327 INFO L443 ceAbstractionStarter]: For program point L3804(lines 3804 3821) no Hoare annotation was computed. [2019-10-02 11:49:30,327 INFO L446 ceAbstractionStarter]: At program point L3805(lines 3804 3821) the Hoare annotation is: true [2019-10-02 11:49:30,327 INFO L446 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 3795 3823) the Hoare annotation is: true [2019-10-02 11:49:30,327 INFO L443 ceAbstractionStarter]: For program point L3818(lines 3795 3823) no Hoare annotation was computed. [2019-10-02 11:49:30,328 INFO L443 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 3795 3823) no Hoare annotation was computed. [2019-10-02 11:49:30,328 INFO L443 ceAbstractionStarter]: For program point L3840(lines 3839 3853) no Hoare annotation was computed. [2019-10-02 11:49:30,328 INFO L443 ceAbstractionStarter]: For program point L3836(lines 3836 3854) no Hoare annotation was computed. [2019-10-02 11:49:30,328 INFO L443 ceAbstractionStarter]: For program point L3837(lines 3836 3854) no Hoare annotation was computed. [2019-10-02 11:49:30,328 INFO L443 ceAbstractionStarter]: For program point IoCreateDeviceENTRY(lines 3829 3856) no Hoare annotation was computed. [2019-10-02 11:49:30,328 INFO L443 ceAbstractionStarter]: For program point L3851(lines 3829 3856) no Hoare annotation was computed. [2019-10-02 11:49:30,328 INFO L443 ceAbstractionStarter]: For program point IoCreateDeviceEXIT(lines 3829 3856) no Hoare annotation was computed. [2019-10-02 11:49:30,328 INFO L443 ceAbstractionStarter]: For program point L2337-1(lines 2333 2339) no Hoare annotation was computed. [2019-10-02 11:49:30,328 INFO L439 ceAbstractionStarter]: At program point DiskPerfSendToNextDriverENTRY(lines 2328 2348) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~s~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,328 INFO L439 ceAbstractionStarter]: At program point L2337(line 2337) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,328 INFO L443 ceAbstractionStarter]: For program point L2333(lines 2333 2339) no Hoare annotation was computed. [2019-10-02 11:49:30,328 INFO L443 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 2328 2348) no Hoare annotation was computed. [2019-10-02 11:49:30,328 INFO L439 ceAbstractionStarter]: At program point L2344(line 2344) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,329 INFO L443 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 2328 2348) no Hoare annotation was computed. [2019-10-02 11:49:30,329 INFO L443 ceAbstractionStarter]: For program point L2344-1(line 2344) no Hoare annotation was computed. [2019-10-02 11:49:30,329 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 2035 2041) the Hoare annotation is: true [2019-10-02 11:49:30,329 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 2035 2041) no Hoare annotation was computed. [2019-10-02 11:49:30,329 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2039) no Hoare annotation was computed. [2019-10-02 11:49:30,329 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 2035 2041) no Hoare annotation was computed. [2019-10-02 11:49:30,329 INFO L443 ceAbstractionStarter]: For program point L2434-1(line 2434) no Hoare annotation was computed. [2019-10-02 11:49:30,329 INFO L439 ceAbstractionStarter]: At program point DiskPerfCreateENTRY(lines 2427 2438) the Hoare annotation is: (or (= ~s~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,329 INFO L443 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 2427 2438) no Hoare annotation was computed. [2019-10-02 11:49:30,329 INFO L443 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 2427 2438) no Hoare annotation was computed. [2019-10-02 11:49:30,330 INFO L439 ceAbstractionStarter]: At program point L2434(line 2434) the Hoare annotation is: (or (= ~s~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= 1 ~pended~0) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,330 INFO L443 ceAbstractionStarter]: For program point L3184(lines 3184 3192) no Hoare annotation was computed. [2019-10-02 11:49:30,330 INFO L443 ceAbstractionStarter]: For program point L3184-2(lines 3184 3192) no Hoare annotation was computed. [2019-10-02 11:49:30,330 INFO L446 ceAbstractionStarter]: At program point DiskPerfAddCountersENTRY(lines 3174 3195) the Hoare annotation is: true [2019-10-02 11:49:30,330 INFO L443 ceAbstractionStarter]: For program point DiskPerfAddCountersFINAL(lines 3174 3195) no Hoare annotation was computed. [2019-10-02 11:49:30,330 INFO L443 ceAbstractionStarter]: For program point DiskPerfAddCountersEXIT(lines 3174 3195) no Hoare annotation was computed. [2019-10-02 11:49:30,330 INFO L446 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2019-10-02 11:49:30,330 INFO L446 ceAbstractionStarter]: At program point L-1-3(line -1) the Hoare annotation is: true [2019-10-02 11:49:30,330 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:49:30,331 INFO L446 ceAbstractionStarter]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:49:30,331 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:49:30,331 INFO L443 ceAbstractionStarter]: For program point IoReleaseCancelSpinLockENTRY(lines 4026 4032) no Hoare annotation was computed. [2019-10-02 11:49:30,331 INFO L443 ceAbstractionStarter]: For program point IoReleaseCancelSpinLockFINAL(lines 4026 4032) no Hoare annotation was computed. [2019-10-02 11:49:30,331 INFO L443 ceAbstractionStarter]: For program point IoReleaseCancelSpinLockEXIT(lines 4026 4032) no Hoare annotation was computed. [2019-10-02 11:49:30,331 INFO L443 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceEXIT(lines 4057 4063) no Hoare annotation was computed. [2019-10-02 11:49:30,331 INFO L443 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceENTRY(lines 4057 4063) no Hoare annotation was computed. [2019-10-02 11:49:30,331 INFO L443 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceFINAL(lines 4057 4063) no Hoare annotation was computed. [2019-10-02 11:49:30,331 INFO L446 ceAbstractionStarter]: At program point InterlockedDecrementENTRY(lines 1530 1532) the Hoare annotation is: true [2019-10-02 11:49:30,331 INFO L443 ceAbstractionStarter]: For program point InterlockedDecrementEXIT(lines 1530 1532) no Hoare annotation was computed. [2019-10-02 11:49:30,332 INFO L443 ceAbstractionStarter]: For program point InterlockedDecrementFINAL(lines 1530 1532) no Hoare annotation was computed. [2019-10-02 11:49:30,332 INFO L443 ceAbstractionStarter]: For program point IoDetachDeviceEXIT(lines 3911 3917) no Hoare annotation was computed. [2019-10-02 11:49:30,332 INFO L443 ceAbstractionStarter]: For program point IoDetachDeviceFINAL(lines 3911 3917) no Hoare annotation was computed. [2019-10-02 11:49:30,332 INFO L443 ceAbstractionStarter]: For program point IoDetachDeviceENTRY(lines 3911 3917) no Hoare annotation was computed. [2019-10-02 11:49:30,332 INFO L443 ceAbstractionStarter]: For program point RtlAnsiStringToUnicodeStringEXIT(lines 4575 4597) no Hoare annotation was computed. [2019-10-02 11:49:30,332 INFO L443 ceAbstractionStarter]: For program point L4592(lines 4575 4597) no Hoare annotation was computed. [2019-10-02 11:49:30,332 INFO L443 ceAbstractionStarter]: For program point RtlAnsiStringToUnicodeStringENTRY(lines 4575 4597) no Hoare annotation was computed. [2019-10-02 11:49:30,332 INFO L443 ceAbstractionStarter]: For program point L4582(lines 4581 4595) no Hoare annotation was computed. [2019-10-02 11:49:30,332 INFO L443 ceAbstractionStarter]: For program point L4585(lines 4584 4594) no Hoare annotation was computed. [2019-10-02 11:49:30,332 INFO L443 ceAbstractionStarter]: For program point L4581(lines 4581 4595) no Hoare annotation was computed. [2019-10-02 11:49:30,332 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiRegInfoEXIT(lines 3004 3029) no Hoare annotation was computed. [2019-10-02 11:49:30,333 INFO L443 ceAbstractionStarter]: For program point L3019(lines 3019 3026) no Hoare annotation was computed. [2019-10-02 11:49:30,333 INFO L443 ceAbstractionStarter]: For program point L3016(line 3016) no Hoare annotation was computed. [2019-10-02 11:49:30,333 INFO L443 ceAbstractionStarter]: For program point L3019-2(lines 3019 3026) no Hoare annotation was computed. [2019-10-02 11:49:30,333 INFO L443 ceAbstractionStarter]: For program point L3016-1(line 3016) no Hoare annotation was computed. [2019-10-02 11:49:30,333 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiRegInfoENTRY(lines 3004 3029) no Hoare annotation was computed. [2019-10-02 11:49:30,333 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiRegInfoFINAL(lines 3004 3029) no Hoare annotation was computed. [2019-10-02 11:49:30,333 INFO L443 ceAbstractionStarter]: For program point L3904(lines 3889 3909) no Hoare annotation was computed. [2019-10-02 11:49:30,333 INFO L443 ceAbstractionStarter]: For program point L3897(lines 3896 3906) no Hoare annotation was computed. [2019-10-02 11:49:30,333 INFO L443 ceAbstractionStarter]: For program point L3894(lines 3893 3907) no Hoare annotation was computed. [2019-10-02 11:49:30,333 INFO L443 ceAbstractionStarter]: For program point L3893(lines 3893 3907) no Hoare annotation was computed. [2019-10-02 11:49:30,334 INFO L443 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkENTRY(lines 3889 3909) no Hoare annotation was computed. [2019-10-02 11:49:30,334 INFO L443 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 3889 3909) no Hoare annotation was computed. [2019-10-02 11:49:30,334 INFO L443 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 3963 3996) no Hoare annotation was computed. [2019-10-02 11:49:30,334 INFO L443 ceAbstractionStarter]: For program point L3991(lines 3963 3996) no Hoare annotation was computed. [2019-10-02 11:49:30,334 INFO L443 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionENTRY(lines 3963 3996) no Hoare annotation was computed. [2019-10-02 11:49:30,334 INFO L443 ceAbstractionStarter]: For program point L3984(lines 3983 3993) no Hoare annotation was computed. [2019-10-02 11:49:30,334 INFO L443 ceAbstractionStarter]: For program point L3980(lines 3980 3994) no Hoare annotation was computed. [2019-10-02 11:49:30,334 INFO L443 ceAbstractionStarter]: For program point L3981(lines 3980 3994) no Hoare annotation was computed. [2019-10-02 11:49:30,334 INFO L443 ceAbstractionStarter]: For program point L4320(lines 4320 4338) no Hoare annotation was computed. [2019-10-02 11:49:30,334 INFO L443 ceAbstractionStarter]: For program point L4335(line 4335) no Hoare annotation was computed. [2019-10-02 11:49:30,335 INFO L443 ceAbstractionStarter]: For program point MmAllocateContiguousMemoryFINAL(lines 4315 4341) no Hoare annotation was computed. [2019-10-02 11:49:30,335 INFO L443 ceAbstractionStarter]: For program point L4327(lines 4320 4338) no Hoare annotation was computed. [2019-10-02 11:49:30,335 INFO L443 ceAbstractionStarter]: For program point L4326(lines 4326 4336) no Hoare annotation was computed. [2019-10-02 11:49:30,335 INFO L443 ceAbstractionStarter]: For program point MmAllocateContiguousMemoryENTRY(lines 4315 4341) no Hoare annotation was computed. [2019-10-02 11:49:30,335 INFO L443 ceAbstractionStarter]: For program point L4323(lines 4323 4337) no Hoare annotation was computed. [2019-10-02 11:49:30,335 INFO L443 ceAbstractionStarter]: For program point L4324(lines 4323 4337) no Hoare annotation was computed. [2019-10-02 11:49:30,335 INFO L443 ceAbstractionStarter]: For program point MmAllocateContiguousMemoryEXIT(lines 4315 4341) no Hoare annotation was computed. [2019-10-02 11:49:30,335 INFO L443 ceAbstractionStarter]: For program point MmResetDriverPagingFINAL(lines 4374 4380) no Hoare annotation was computed. [2019-10-02 11:49:30,335 INFO L443 ceAbstractionStarter]: For program point MmResetDriverPagingEXIT(lines 4374 4380) no Hoare annotation was computed. [2019-10-02 11:49:30,336 INFO L443 ceAbstractionStarter]: For program point MmResetDriverPagingENTRY(lines 4374 4380) no Hoare annotation was computed. [2019-10-02 11:49:30,336 INFO L443 ceAbstractionStarter]: For program point MmUnlockPagesENTRY(lines 4382 4388) no Hoare annotation was computed. [2019-10-02 11:49:30,336 INFO L443 ceAbstractionStarter]: For program point MmUnlockPagesFINAL(lines 4382 4388) no Hoare annotation was computed. [2019-10-02 11:49:30,336 INFO L443 ceAbstractionStarter]: For program point MmUnlockPagesEXIT(lines 4382 4388) no Hoare annotation was computed. [2019-10-02 11:49:30,336 INFO L443 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 4001 4024) no Hoare annotation was computed. [2019-10-02 11:49:30,336 INFO L443 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceENTRY(lines 4001 4024) no Hoare annotation was computed. [2019-10-02 11:49:30,336 INFO L443 ceAbstractionStarter]: For program point L4019(lines 4001 4024) no Hoare annotation was computed. [2019-10-02 11:49:30,336 INFO L443 ceAbstractionStarter]: For program point L4012(lines 4011 4021) no Hoare annotation was computed. [2019-10-02 11:49:30,336 INFO L443 ceAbstractionStarter]: For program point L4008(lines 4008 4022) no Hoare annotation was computed. [2019-10-02 11:49:30,337 INFO L443 ceAbstractionStarter]: For program point L4009(lines 4008 4022) no Hoare annotation was computed. [2019-10-02 11:49:30,337 INFO L443 ceAbstractionStarter]: For program point IoWMIRegistrationControlEXIT(lines 1677 1695) no Hoare annotation was computed. [2019-10-02 11:49:30,337 INFO L443 ceAbstractionStarter]: For program point IoWMIRegistrationControlFINAL(lines 1677 1695) no Hoare annotation was computed. [2019-10-02 11:49:30,337 INFO L446 ceAbstractionStarter]: At program point IoWMIRegistrationControlENTRY(lines 1677 1695) the Hoare annotation is: true [2019-10-02 11:49:30,337 INFO L443 ceAbstractionStarter]: For program point L1690(lines 1690 1694) no Hoare annotation was computed. [2019-10-02 11:49:30,337 INFO L443 ceAbstractionStarter]: For program point L1688(lines 1688 1694) no Hoare annotation was computed. [2019-10-02 11:49:30,337 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1694) no Hoare annotation was computed. [2019-10-02 11:49:30,337 INFO L443 ceAbstractionStarter]: For program point L1684(lines 1684 1694) no Hoare annotation was computed. [2019-10-02 11:49:30,338 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1694) no Hoare annotation was computed. [2019-10-02 11:49:30,338 INFO L443 ceAbstractionStarter]: For program point L1680(lines 1680 1694) no Hoare annotation was computed. [2019-10-02 11:49:30,338 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1694) no Hoare annotation was computed. [2019-10-02 11:49:30,338 INFO L443 ceAbstractionStarter]: For program point L4050(lines 4035 4055) no Hoare annotation was computed. [2019-10-02 11:49:30,338 INFO L443 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 4035 4055) no Hoare annotation was computed. [2019-10-02 11:49:30,338 INFO L443 ceAbstractionStarter]: For program point L4043(lines 4042 4052) no Hoare annotation was computed. [2019-10-02 11:49:30,338 INFO L443 ceAbstractionStarter]: For program point L4040(lines 4039 4053) no Hoare annotation was computed. [2019-10-02 11:49:30,338 INFO L443 ceAbstractionStarter]: For program point L4039(lines 4039 4053) no Hoare annotation was computed. [2019-10-02 11:49:30,338 INFO L443 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateENTRY(lines 4035 4055) no Hoare annotation was computed. [2019-10-02 11:49:30,339 INFO L443 ceAbstractionStarter]: For program point KeInitializeEventEXIT(lines 4212 4218) no Hoare annotation was computed. [2019-10-02 11:49:30,339 INFO L443 ceAbstractionStarter]: For program point KeInitializeEventENTRY(lines 4212 4218) no Hoare annotation was computed. [2019-10-02 11:49:30,339 INFO L443 ceAbstractionStarter]: For program point KeInitializeEventFINAL(lines 4212 4218) no Hoare annotation was computed. [2019-10-02 11:49:30,339 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListEXIT(lines 3692 3699) no Hoare annotation was computed. [2019-10-02 11:49:30,339 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListENTRY(lines 3692 3699) no Hoare annotation was computed. [2019-10-02 11:49:30,339 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListFINAL(lines 3692 3699) no Hoare annotation was computed. [2019-10-02 11:49:30,339 INFO L443 ceAbstractionStarter]: For program point L2713(lines 2712 2734) no Hoare annotation was computed. [2019-10-02 11:49:30,339 INFO L443 ceAbstractionStarter]: For program point L2709(lines 2709 2735) no Hoare annotation was computed. [2019-10-02 11:49:30,339 INFO L443 ceAbstractionStarter]: For program point DiskPerfWmiENTRY(lines 2686 2738) no Hoare annotation was computed. [2019-10-02 11:49:30,339 INFO L443 ceAbstractionStarter]: For program point L2699-1(line 2699) no Hoare annotation was computed. [2019-10-02 11:49:30,340 INFO L443 ceAbstractionStarter]: For program point L2699(line 2699) no Hoare annotation was computed. [2019-10-02 11:49:30,340 INFO L443 ceAbstractionStarter]: For program point L2697(lines 2697 2704) no Hoare annotation was computed. [2019-10-02 11:49:30,340 INFO L443 ceAbstractionStarter]: For program point DiskPerfWmiFINAL(lines 2686 2738) no Hoare annotation was computed. [2019-10-02 11:49:30,340 INFO L443 ceAbstractionStarter]: For program point L2716(lines 2715 2733) no Hoare annotation was computed. [2019-10-02 11:49:30,340 INFO L443 ceAbstractionStarter]: For program point L2712(lines 2712 2734) no Hoare annotation was computed. [2019-10-02 11:49:30,340 INFO L443 ceAbstractionStarter]: For program point DiskPerfWmiEXIT(lines 2686 2738) no Hoare annotation was computed. [2019-10-02 11:49:30,340 INFO L443 ceAbstractionStarter]: For program point L2731(lines 2709 2735) no Hoare annotation was computed. [2019-10-02 11:49:30,340 INFO L443 ceAbstractionStarter]: For program point L2727(line 2727) no Hoare annotation was computed. [2019-10-02 11:49:30,340 INFO L443 ceAbstractionStarter]: For program point IoFreeIrpEXIT(lines 3919 3925) no Hoare annotation was computed. [2019-10-02 11:49:30,341 INFO L443 ceAbstractionStarter]: For program point IoFreeIrpENTRY(lines 3919 3925) no Hoare annotation was computed. [2019-10-02 11:49:30,341 INFO L443 ceAbstractionStarter]: For program point IoFreeIrpFINAL(lines 3919 3925) no Hoare annotation was computed. [2019-10-02 11:49:30,341 INFO L439 ceAbstractionStarter]: At program point L4172(line 4172) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~IPC~0)) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse2 (= 1 ~pended~0)) (.cse3 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 (not (= ~compRegistered~0 0)) .cse3) (or (= ~NP~0 ~MPR3~0) (or (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~SKIP1~0 ~MPR1~0) (= ~SKIP2~0 ~IPC~0) (or .cse0 .cse1 .cse2)) .cse3) (= ~NP~0 ~MPR1~0)))) [2019-10-02 11:49:30,341 INFO L443 ceAbstractionStarter]: For program point L4172-1(lines 4164 4177) no Hoare annotation was computed. [2019-10-02 11:49:30,341 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 4164 4177) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse3 (= 1 ~pended~0)) (.cse4 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (= ~NP~0 ~MPR3~0) (or (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~SKIP1~0 ~MPR1~0) (= ~SKIP2~0 ~IPC~0) (or .cse1 .cse2 .cse3)) .cse4) (= ~NP~0 ~MPR1~0)) (or .cse0 .cse1 .cse2 .cse3 (not (= ~compRegistered~0 0)) .cse4))) [2019-10-02 11:49:30,341 INFO L443 ceAbstractionStarter]: For program point L4168(lines 4168 4174) no Hoare annotation was computed. [2019-10-02 11:49:30,342 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 4164 4177) no Hoare annotation was computed. [2019-10-02 11:49:30,342 INFO L446 ceAbstractionStarter]: At program point InterlockedExchangeENTRY(lines 1533 1537) the Hoare annotation is: true [2019-10-02 11:49:30,342 INFO L443 ceAbstractionStarter]: For program point InterlockedExchangeFINAL(lines 1533 1537) no Hoare annotation was computed. [2019-10-02 11:49:30,342 INFO L443 ceAbstractionStarter]: For program point InterlockedExchangeEXIT(lines 1533 1537) no Hoare annotation was computed. [2019-10-02 11:49:30,342 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertHeadListEXIT(lines 3669 3677) no Hoare annotation was computed. [2019-10-02 11:49:30,342 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertHeadListENTRY(lines 3669 3677) no Hoare annotation was computed. [2019-10-02 11:49:30,342 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertHeadListFINAL(lines 3669 3677) no Hoare annotation was computed. [2019-10-02 11:49:30,342 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:49:30,342 INFO L446 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2019-10-02 11:49:30,342 INFO L446 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:49:30,342 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:49:30,342 INFO L443 ceAbstractionStarter]: For program point IoDeleteDeviceEXIT(lines 3881 3887) no Hoare annotation was computed. [2019-10-02 11:49:30,343 INFO L443 ceAbstractionStarter]: For program point IoDeleteDeviceFINAL(lines 3881 3887) no Hoare annotation was computed. [2019-10-02 11:49:30,343 INFO L443 ceAbstractionStarter]: For program point IoDeleteDeviceENTRY(lines 3881 3887) no Hoare annotation was computed. [2019-10-02 11:49:30,343 INFO L443 ceAbstractionStarter]: For program point ExAcquireFastMutexEXIT(lines 3627 3633) no Hoare annotation was computed. [2019-10-02 11:49:30,343 INFO L443 ceAbstractionStarter]: For program point ExAcquireFastMutexENTRY(lines 3627 3633) no Hoare annotation was computed. [2019-10-02 11:49:30,343 INFO L443 ceAbstractionStarter]: For program point ExAcquireFastMutexFINAL(lines 3627 3633) no Hoare annotation was computed. [2019-10-02 11:49:30,343 INFO L443 ceAbstractionStarter]: For program point L2301-1(line 2301) no Hoare annotation was computed. [2019-10-02 11:49:30,343 INFO L439 ceAbstractionStarter]: At program point L2301(line 2301) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (and (not (= DiskPerfStartDevice_~status~2 259)) (= ~s~0 ~NP~0) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= 1 ~compRegistered~0)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,343 INFO L439 ceAbstractionStarter]: At program point DiskPerfStartDeviceENTRY(lines 2289 2305) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,343 INFO L439 ceAbstractionStarter]: At program point L2298(line 2298) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= 0 ~routine~0)) (.cse2 (not (= 1 ~pended~0))) (.cse3 (= 1 ~compRegistered~0)) (.cse4 (= ~myStatus~0 |old(~myStatus~0)|))) (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (and (not (= DiskPerfStartDevice_~status~2 259)) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~setEventCalled~0 1)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (and (= DiskPerfStartDevice_~status~2 |old(~myStatus~0)|) .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-10-02 11:49:30,343 INFO L443 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 2289 2305) no Hoare annotation was computed. [2019-10-02 11:49:30,344 INFO L439 ceAbstractionStarter]: At program point L2296(line 2296) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,344 INFO L443 ceAbstractionStarter]: For program point L2297-1(line 2297) no Hoare annotation was computed. [2019-10-02 11:49:30,344 INFO L439 ceAbstractionStarter]: At program point L2297(line 2297) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= 0 ~routine~0)) (.cse2 (not (= 1 ~pended~0))) (.cse3 (= 1 ~compRegistered~0)) (.cse4 (= ~myStatus~0 |old(~myStatus~0)|))) (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (and (not (= DiskPerfStartDevice_~status~2 259)) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~setEventCalled~0 1)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (and (= DiskPerfStartDevice_~status~2 |old(~myStatus~0)|) .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-10-02 11:49:30,344 INFO L443 ceAbstractionStarter]: For program point L2298-1(line 2298) no Hoare annotation was computed. [2019-10-02 11:49:30,344 INFO L443 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 2289 2305) no Hoare annotation was computed. [2019-10-02 11:49:30,344 INFO L443 ceAbstractionStarter]: For program point L2296-1(line 2296) no Hoare annotation was computed. [2019-10-02 11:49:30,344 INFO L443 ceAbstractionStarter]: For program point L2653(lines 2653 2657) no Hoare annotation was computed. [2019-10-02 11:49:30,344 INFO L443 ceAbstractionStarter]: For program point L2612(lines 2612 2669) no Hoare annotation was computed. [2019-10-02 11:49:30,344 INFO L443 ceAbstractionStarter]: For program point L2612-2(lines 2612 2669) no Hoare annotation was computed. [2019-10-02 11:49:30,344 INFO L443 ceAbstractionStarter]: For program point L2637-1(lines 2637 2641) no Hoare annotation was computed. [2019-10-02 11:49:30,344 INFO L443 ceAbstractionStarter]: For program point L2637(lines 2637 2641) no Hoare annotation was computed. [2019-10-02 11:49:30,344 INFO L443 ceAbstractionStarter]: For program point L2629-1(line 2629) no Hoare annotation was computed. [2019-10-02 11:49:30,344 INFO L439 ceAbstractionStarter]: At program point L2629(line 2629) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,345 INFO L443 ceAbstractionStarter]: For program point L2621-1(line 2621) no Hoare annotation was computed. [2019-10-02 11:49:30,345 INFO L439 ceAbstractionStarter]: At program point L2621(line 2621) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,345 INFO L443 ceAbstractionStarter]: For program point L2617(lines 2617 2626) no Hoare annotation was computed. [2019-10-02 11:49:30,345 INFO L439 ceAbstractionStarter]: At program point L2630(line 2630) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,345 INFO L439 ceAbstractionStarter]: At program point L2663-1(line 2663) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,345 INFO L439 ceAbstractionStarter]: At program point L2663(line 2663) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,345 INFO L443 ceAbstractionStarter]: For program point L2630-1(line 2630) no Hoare annotation was computed. [2019-10-02 11:49:30,345 INFO L443 ceAbstractionStarter]: For program point L2651-1(lines 2651 2660) no Hoare annotation was computed. [2019-10-02 11:49:30,345 INFO L443 ceAbstractionStarter]: For program point L2651(lines 2651 2660) no Hoare annotation was computed. [2019-10-02 11:49:30,345 INFO L439 ceAbstractionStarter]: At program point L2680(line 2680) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0))) [2019-10-02 11:49:30,345 INFO L443 ceAbstractionStarter]: For program point L2680-1(line 2680) no Hoare annotation was computed. [2019-10-02 11:49:30,345 INFO L443 ceAbstractionStarter]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2019-10-02 11:49:30,346 INFO L439 ceAbstractionStarter]: At program point L2643(line 2643) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,346 INFO L443 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 2596 2685) no Hoare annotation was computed. [2019-10-02 11:49:30,346 INFO L443 ceAbstractionStarter]: For program point L2664(lines 2664 2665) no Hoare annotation was computed. [2019-10-02 11:49:30,346 INFO L439 ceAbstractionStarter]: At program point L2635-2(lines 2635 2647) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,346 INFO L443 ceAbstractionStarter]: For program point L2631-1(line 2631) no Hoare annotation was computed. [2019-10-02 11:49:30,346 INFO L439 ceAbstractionStarter]: At program point L2631(line 2631) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,346 INFO L439 ceAbstractionStarter]: At program point DiskPerfDeviceControlENTRY(lines 2596 2685) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0))) [2019-10-02 11:49:30,346 INFO L439 ceAbstractionStarter]: At program point L2648(lines 2634 2649) the Hoare annotation is: (or (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0)) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,346 INFO L443 ceAbstractionStarter]: For program point L2611(lines 2611 2683) no Hoare annotation was computed. [2019-10-02 11:49:30,346 INFO L443 ceAbstractionStarter]: For program point L2673-1(line 2673) no Hoare annotation was computed. [2019-10-02 11:49:30,346 INFO L439 ceAbstractionStarter]: At program point L2673(line 2673) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (not (= 259 DiskPerfDeviceControl_~status~5))) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,346 INFO L443 ceAbstractionStarter]: For program point L2636(line 2636) no Hoare annotation was computed. [2019-10-02 11:49:30,346 INFO L443 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 2596 2685) no Hoare annotation was computed. [2019-10-02 11:49:30,347 INFO L443 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 2306 2327) no Hoare annotation was computed. [2019-10-02 11:49:30,347 INFO L443 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 2306 2327) no Hoare annotation was computed. [2019-10-02 11:49:30,347 INFO L443 ceAbstractionStarter]: For program point L2323-1(line 2323) no Hoare annotation was computed. [2019-10-02 11:49:30,347 INFO L439 ceAbstractionStarter]: At program point L2323(line 2323) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= 0 ~routine~0)) (.cse2 (not (= 1 ~pended~0))) (.cse3 (= 1 ~compRegistered~0))) (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (and .cse0 .cse1 (not (= 259 DiskPerfRemoveDevice_~status~3)) .cse2 .cse3 (= ~setEventCalled~0 1)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (and .cse0 .cse1 (= |old(~myStatus~0)| DiskPerfRemoveDevice_~status~3) .cse2 .cse3 (= ~myStatus~0 |old(~myStatus~0)|)) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)))) [2019-10-02 11:49:30,347 INFO L439 ceAbstractionStarter]: At program point L2318(line 2318) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,347 INFO L439 ceAbstractionStarter]: At program point L2316(line 2316) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,347 INFO L443 ceAbstractionStarter]: For program point L2317-1(line 2317) no Hoare annotation was computed. [2019-10-02 11:49:30,347 INFO L439 ceAbstractionStarter]: At program point L2317(line 2317) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,347 INFO L443 ceAbstractionStarter]: For program point L2318-1(line 2318) no Hoare annotation was computed. [2019-10-02 11:49:30,348 INFO L439 ceAbstractionStarter]: At program point DiskPerfRemoveDeviceENTRY(lines 2306 2327) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,348 INFO L439 ceAbstractionStarter]: At program point L2314(line 2314) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,348 INFO L443 ceAbstractionStarter]: For program point L2316-1(line 2316) no Hoare annotation was computed. [2019-10-02 11:49:30,348 INFO L443 ceAbstractionStarter]: For program point L2314-1(line 2314) no Hoare annotation was computed. [2019-10-02 11:49:30,348 INFO L443 ceAbstractionStarter]: For program point L4098-1(line 4098) no Hoare annotation was computed. [2019-10-02 11:49:30,348 INFO L443 ceAbstractionStarter]: For program point L4090(lines 4090 4111) no Hoare annotation was computed. [2019-10-02 11:49:30,348 INFO L443 ceAbstractionStarter]: For program point L4090-1(lines 4089 4160) no Hoare annotation was computed. [2019-10-02 11:49:30,349 INFO L439 ceAbstractionStarter]: At program point L4119(lines 4118 4133) the Hoare annotation is: (let ((.cse5 (not (= ~compRegistered~0 0))) (.cse0 (= ~DC~0 ~IPC~0)) (.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse3 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= 1 |old(~pended~0)|)) (.cse6 (= ~SKIP2~0 ~DC~0)) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse2 (not (= 1 ~pended~0)))) (and (or .cse0 .cse1 (and .cse2 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6) (or .cse0 .cse7 .cse3 .cse4 .cse5 .cse6 (and .cse2 (= ~s~0 ~NP~0))) (or (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse3 .cse4 .cse6) .cse7 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259) (and .cse2 (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1) (= 0 (+ IofCallDriver_~compRetStatus~0 1073741802)))))) [2019-10-02 11:49:30,349 INFO L443 ceAbstractionStarter]: For program point L4115(lines 4115 4134) no Hoare annotation was computed. [2019-10-02 11:49:30,349 INFO L443 ceAbstractionStarter]: For program point L4140(lines 4140 4157) no Hoare annotation was computed. [2019-10-02 11:49:30,349 INFO L443 ceAbstractionStarter]: For program point L4091(lines 4091 4101) no Hoare annotation was computed. [2019-10-02 11:49:30,349 INFO L443 ceAbstractionStarter]: For program point L4091-2(lines 4090 4109) no Hoare annotation was computed. [2019-10-02 11:49:30,349 INFO L439 ceAbstractionStarter]: At program point L4116(lines 4115 4134) the Hoare annotation is: (let ((.cse5 (not (= ~compRegistered~0 0))) (.cse0 (= ~DC~0 ~IPC~0)) (.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse3 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= 1 |old(~pended~0)|)) (.cse6 (= ~SKIP2~0 ~DC~0)) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse2 (not (= 1 ~pended~0)))) (and (or .cse0 .cse1 (and .cse2 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6) (or .cse0 .cse7 .cse3 .cse4 .cse5 .cse6 (and .cse2 (= ~s~0 ~NP~0))) (or (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse3 .cse4 .cse6) .cse7 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259) (and .cse2 (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1) (= 0 (+ IofCallDriver_~compRetStatus~0 1073741802)))))) [2019-10-02 11:49:30,349 INFO L443 ceAbstractionStarter]: For program point L4149(lines 4149 4156) no Hoare annotation was computed. [2019-10-02 11:49:30,350 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 4080 4161) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (= ~DC~0 ~IPC~0)) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse3 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (= ~SKIP2~0 ~DC~0)) (.cse2 (not (= 1 ~pended~0)))) (and (or .cse0 .cse1 (and .cse2 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6) (or (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse3 .cse4 .cse6) .cse7 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259) (and (= ~s~0 |old(~s~0)|) .cse2)) (or .cse0 .cse7 .cse3 .cse4 .cse5 .cse6 (and .cse2 (= ~s~0 ~NP~0))))) [2019-10-02 11:49:30,350 INFO L443 ceAbstractionStarter]: For program point L4141(lines 4141 4147) no Hoare annotation was computed. [2019-10-02 11:49:30,350 INFO L439 ceAbstractionStarter]: At program point L4104(line 4104) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (= ~DC~0 ~IPC~0)) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse2 (= ~SKIP2~0 ~IPC~0)) (.cse3 (= 1 |old(~pended~0)|)) (.cse4 (not (= ~compRegistered~0 0))) (.cse5 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5) (or (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse2 .cse3 .cse5) .cse6 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259) (and (= ~s~0 |old(~s~0)|) (not (= 1 ~pended~0)) (= ~setEventCalled~0 1) (= 0 (+ IofCallDriver_~compRetStatus~0 1073741802)))) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse5))) [2019-10-02 11:49:30,350 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 4080 4161) no Hoare annotation was computed. [2019-10-02 11:49:30,350 INFO L439 ceAbstractionStarter]: At program point L4154(line 4154) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (= ~DC~0 ~IPC~0)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse2 (= ~SKIP2~0 ~IPC~0)) (.cse3 (= 1 |old(~pended~0)|)) (.cse6 (not (= ~compRegistered~0 0))) (.cse4 (= ~SKIP2~0 ~DC~0))) (and (or (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse2 .cse3 .cse4) .cse5 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (or .cse0 .cse1 .cse2 .cse3 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or .cse0 .cse5 .cse2 .cse3 .cse6 .cse4))) [2019-10-02 11:49:30,350 INFO L443 ceAbstractionStarter]: For program point L4154-1(lines 4136 4158) no Hoare annotation was computed. [2019-10-02 11:49:30,350 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 4080 4161) no Hoare annotation was computed. [2019-10-02 11:49:30,350 INFO L439 ceAbstractionStarter]: At program point L4113(lines 4112 4135) the Hoare annotation is: (let ((.cse5 (not (= ~compRegistered~0 0))) (.cse0 (= ~DC~0 ~IPC~0)) (.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse3 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= 1 |old(~pended~0)|)) (.cse6 (= ~SKIP2~0 ~DC~0)) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse2 (not (= 1 ~pended~0)))) (and (or .cse0 .cse1 (and .cse2 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6) (or .cse0 .cse7 .cse3 .cse4 .cse5 .cse6 (and .cse2 (= ~s~0 ~NP~0))) (or (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse3 .cse4 .cse6) .cse7 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259) (and .cse2 (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1) (= 0 (+ IofCallDriver_~compRetStatus~0 1073741802)))))) [2019-10-02 11:49:30,350 INFO L443 ceAbstractionStarter]: For program point L4093-1(line 4093) no Hoare annotation was computed. [2019-10-02 11:49:30,351 INFO L439 ceAbstractionStarter]: At program point L4093(line 4093) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (= ~DC~0 ~IPC~0)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse2 (= ~SKIP2~0 ~IPC~0)) (.cse3 (= 1 |old(~pended~0)|)) (.cse6 (not (= ~compRegistered~0 0))) (.cse4 (= ~SKIP2~0 ~DC~0))) (and (or (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse2 .cse3 .cse4) .cse5 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259) (and (= ~s~0 |old(~s~0)|) (not (= 1 ~pended~0)))) (or .cse0 .cse1 .cse2 .cse3 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or .cse0 .cse5 .cse2 .cse3 .cse6 .cse4))) [2019-10-02 11:49:30,351 INFO L439 ceAbstractionStarter]: At program point L4098(line 4098) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (= ~DC~0 ~IPC~0)) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse2 (= ~SKIP2~0 ~IPC~0)) (.cse3 (= 1 |old(~pended~0)|)) (.cse6 (not (= ~compRegistered~0 0))) (.cse4 (= ~SKIP2~0 ~DC~0))) (and (or (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse2 .cse3 .cse4) .cse5 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259)) (or .cse0 .cse1 .cse2 .cse3 .cse6 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or .cse0 .cse5 .cse2 .cse3 .cse6 .cse4))) [2019-10-02 11:49:30,351 INFO L439 ceAbstractionStarter]: At program point L4131(lines 4089 4160) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse0 (= ~DC~0 ~IPC~0)) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse3 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (= ~SKIP2~0 ~DC~0)) (.cse2 (not (= 1 ~pended~0)))) (and (or .cse0 .cse1 (and .cse2 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6) (let ((.cse7 (and (not .cse6) (not (= ~IPC~0 ~DC~0)) (not .cse3) .cse2)) (.cse8 (= ~MPR1~0 ~s~0)) (.cse9 (= ~setEventCalled~0 1)) (.cse10 (= 0 (+ IofCallDriver_~compRetStatus~0 1073741802)))) (or (and .cse7 (= 259 IofCallDriver_~returnVal2~0) .cse8 .cse9 .cse10) (or (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) .cse3 .cse4 .cse6) .cse11 (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (= ~myStatus~0 259) (or (and .cse7 .cse8 (= 0 IofCallDriver_~returnVal2~0) .cse9 .cse10) (and .cse7 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse8 .cse9 .cse10)))) (or .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 (and .cse2 (= ~s~0 ~NP~0))))) [2019-10-02 11:49:30,351 INFO L443 ceAbstractionStarter]: For program point ExReleaseFastMutexFINAL(lines 3635 3641) no Hoare annotation was computed. [2019-10-02 11:49:30,351 INFO L443 ceAbstractionStarter]: For program point ExReleaseFastMutexENTRY(lines 3635 3641) no Hoare annotation was computed. [2019-10-02 11:49:30,351 INFO L443 ceAbstractionStarter]: For program point ExReleaseFastMutexEXIT(lines 3635 3641) no Hoare annotation was computed. [2019-10-02 11:49:30,351 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:49:30,351 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) [2019-10-02 11:49:30,351 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:49:30,351 INFO L443 ceAbstractionStarter]: For program point L3074-1(line 3074) no Hoare annotation was computed. [2019-10-02 11:49:30,351 INFO L443 ceAbstractionStarter]: For program point L3103-1(line 3103) no Hoare annotation was computed. [2019-10-02 11:49:30,351 INFO L443 ceAbstractionStarter]: For program point L3103(line 3103) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3066-2(lines 3066 3078) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiDataBlockENTRY(lines 3030 3119) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3062(line 3062) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3058(line 3058) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3058-1(line 3058) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiDataBlockFINAL(lines 3030 3119) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3079(lines 3065 3080) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3067(line 3067) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3096(lines 3096 3097) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3084(lines 3084 3088) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3068(lines 3068 3072) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3068-1(lines 3068 3072) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3056(lines 3056 3109) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3102(line 3102) no Hoare annotation was computed. [2019-10-02 11:49:30,352 INFO L443 ceAbstractionStarter]: For program point L3102-1(line 3102) no Hoare annotation was computed. [2019-10-02 11:49:30,353 INFO L443 ceAbstractionStarter]: For program point L3094(lines 3094 3095) no Hoare annotation was computed. [2019-10-02 11:49:30,353 INFO L443 ceAbstractionStarter]: For program point L3061-1(line 3061) no Hoare annotation was computed. [2019-10-02 11:49:30,353 INFO L443 ceAbstractionStarter]: For program point L3061(line 3061) no Hoare annotation was computed. [2019-10-02 11:49:30,353 INFO L443 ceAbstractionStarter]: For program point L3094-1(lines 3094 3095) no Hoare annotation was computed. [2019-10-02 11:49:30,353 INFO L443 ceAbstractionStarter]: For program point L3053(lines 3053 3110) no Hoare annotation was computed. [2019-10-02 11:49:30,353 INFO L443 ceAbstractionStarter]: For program point L3082(lines 3082 3091) no Hoare annotation was computed. [2019-10-02 11:49:30,353 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiDataBlockEXIT(lines 3030 3119) no Hoare annotation was computed. [2019-10-02 11:49:30,353 INFO L443 ceAbstractionStarter]: For program point L3115(line 3115) no Hoare annotation was computed. [2019-10-02 11:49:30,353 INFO L443 ceAbstractionStarter]: For program point L3049-1(lines 3049 3113) no Hoare annotation was computed. [2019-10-02 11:49:30,353 INFO L443 ceAbstractionStarter]: For program point L3049(lines 3049 3113) no Hoare annotation was computed. [2019-10-02 11:49:30,354 INFO L443 ceAbstractionStarter]: For program point L3082-1(lines 3082 3091) no Hoare annotation was computed. [2019-10-02 11:49:30,354 INFO L443 ceAbstractionStarter]: For program point L3074(line 3074) no Hoare annotation was computed. [2019-10-02 11:49:30,354 INFO L443 ceAbstractionStarter]: For program point KeGetCurrentProcessorNumberEXIT(lines 1539 1545) no Hoare annotation was computed. [2019-10-02 11:49:30,354 INFO L443 ceAbstractionStarter]: For program point KeGetCurrentProcessorNumberENTRY(lines 1539 1545) no Hoare annotation was computed. [2019-10-02 11:49:30,354 INFO L443 ceAbstractionStarter]: For program point KeGetCurrentProcessorNumberFINAL(lines 1539 1545) no Hoare annotation was computed. [2019-10-02 11:49:30,354 INFO L443 ceAbstractionStarter]: For program point RtlCopyUnicodeStringEXIT(lines 4611 4618) no Hoare annotation was computed. [2019-10-02 11:49:30,354 INFO L443 ceAbstractionStarter]: For program point RtlCopyUnicodeStringENTRY(lines 4611 4618) no Hoare annotation was computed. [2019-10-02 11:49:30,354 INFO L443 ceAbstractionStarter]: For program point RtlCopyUnicodeStringFINAL(lines 4611 4618) no Hoare annotation was computed. [2019-10-02 11:49:30,354 INFO L439 ceAbstractionStarter]: At program point L2748(line 2748) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0))) [2019-10-02 11:49:30,354 INFO L443 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 2739 2752) no Hoare annotation was computed. [2019-10-02 11:49:30,355 INFO L443 ceAbstractionStarter]: For program point L2748-1(line 2748) no Hoare annotation was computed. [2019-10-02 11:49:30,355 INFO L443 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 2739 2752) no Hoare annotation was computed. [2019-10-02 11:49:30,355 INFO L439 ceAbstractionStarter]: At program point DiskPerfShutdownFlushENTRY(lines 2739 2752) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0) (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0))) [2019-10-02 11:49:30,355 INFO L443 ceAbstractionStarter]: For program point KeInitializeSemaphoreFINAL(lines 4221 4227) no Hoare annotation was computed. [2019-10-02 11:49:30,355 INFO L443 ceAbstractionStarter]: For program point KeInitializeSemaphoreEXIT(lines 4221 4227) no Hoare annotation was computed. [2019-10-02 11:49:30,355 INFO L443 ceAbstractionStarter]: For program point KeInitializeSemaphoreENTRY(lines 4221 4227) no Hoare annotation was computed. [2019-10-02 11:49:30,355 INFO L443 ceAbstractionStarter]: For program point KfReleaseSpinLockENTRY(lines 4248 4254) no Hoare annotation was computed. [2019-10-02 11:49:30,355 INFO L443 ceAbstractionStarter]: For program point KfReleaseSpinLockFINAL(lines 4248 4254) no Hoare annotation was computed. [2019-10-02 11:49:30,355 INFO L443 ceAbstractionStarter]: For program point KfReleaseSpinLockEXIT(lines 4248 4254) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point L4705(lines 4704 4718) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point ZwCloseENTRY(lines 4700 4720) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point L4704(lines 4704 4718) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 4700 4720) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point L4715(lines 4700 4720) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point L4708(lines 4707 4717) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point MmMapLockedPagesSpecifyCacheEXIT(lines 4356 4364) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point MmMapLockedPagesSpecifyCacheENTRY(lines 4356 4364) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point MmMapLockedPagesSpecifyCacheFINAL(lines 4356 4364) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point WmiSystemControlEXIT(lines 4721 4728) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point WmiSystemControlENTRY(lines 4721 4728) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L443 ceAbstractionStarter]: For program point WmiSystemControlFINAL(lines 4721 4728) no Hoare annotation was computed. [2019-10-02 11:49:30,356 INFO L446 ceAbstractionStarter]: At program point KeQuerySystemTimeENTRY(lines 1573 1576) the Hoare annotation is: true [2019-10-02 11:49:30,357 INFO L443 ceAbstractionStarter]: For program point KeQuerySystemTimeFINAL(lines 1573 1576) no Hoare annotation was computed. [2019-10-02 11:49:30,357 INFO L443 ceAbstractionStarter]: For program point KeQuerySystemTimeEXIT(lines 1573 1576) no Hoare annotation was computed. [2019-10-02 11:49:30,357 INFO L439 ceAbstractionStarter]: At program point L3330-2(lines 3330 3335) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (<= main_~i_1~0 3) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= 0 ~routine~0) (= ~s~0 ~DC~0) (= ~IPC~0 ~s~0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~NP~0) (= ~NP~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~SKIP1~0 ~s~0))) [2019-10-02 11:49:30,357 INFO L443 ceAbstractionStarter]: For program point L3520(line 3520) no Hoare annotation was computed. [2019-10-02 11:49:30,357 INFO L443 ceAbstractionStarter]: For program point L3330-3(lines 3330 3335) no Hoare annotation was computed. [2019-10-02 11:49:30,357 INFO L443 ceAbstractionStarter]: For program point L3578(lines 3578 3584) no Hoare annotation was computed. [2019-10-02 11:49:30,357 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 3233 3624) no Hoare annotation was computed. [2019-10-02 11:49:30,357 INFO L439 ceAbstractionStarter]: At program point L3256-2(lines 3256 3261) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= 0 ~routine~0) (= ~s~0 ~DC~0) (= ~IPC~0 ~s~0) (not (= 1 ~pended~0)) (= ~SKIP1~0 ~NP~0) (= ~NP~0 |old(~s~0)|) (= ~SKIP1~0 ~s~0)) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,357 INFO L443 ceAbstractionStarter]: For program point L3256-3(lines 3256 3261) no Hoare annotation was computed. [2019-10-02 11:49:30,357 INFO L443 ceAbstractionStarter]: For program point L3496(lines 3496 3541) no Hoare annotation was computed. [2019-10-02 11:49:30,357 INFO L443 ceAbstractionStarter]: For program point L3530(line 3530) no Hoare annotation was computed. [2019-10-02 11:49:30,357 INFO L443 ceAbstractionStarter]: For program point L3563(lines 3563 3567) no Hoare annotation was computed. [2019-10-02 11:49:30,358 INFO L439 ceAbstractionStarter]: At program point L3464(line 3464) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (<= main_~i_1~0 4) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= 0 ~routine~0) (= ~s~0 ~DC~0) (= ~IPC~0 ~s~0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~NP~0) (= ~NP~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,358 INFO L439 ceAbstractionStarter]: At program point L3497(lines 3496 3541) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (and (<= main_~i_1~0 4) (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~SKIP2~0 ~IPC~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (not (= 259 ~myStatus~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (not (= 1 ~pended~0)) (not (= ~MPR3~0 ~NP~0)) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,358 INFO L443 ceAbstractionStarter]: For program point L3464-1(lines 3461 3623) no Hoare annotation was computed. [2019-10-02 11:49:30,358 INFO L443 ceAbstractionStarter]: For program point L3555(lines 3555 3559) no Hoare annotation was computed. [2019-10-02 11:49:30,358 INFO L439 ceAbstractionStarter]: At program point L3580(line 3580) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,358 INFO L446 ceAbstractionStarter]: At program point L3506(lines 3505 3538) the Hoare annotation is: true [2019-10-02 11:49:30,358 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 3233 3624) no Hoare annotation was computed. [2019-10-02 11:49:30,358 INFO L443 ceAbstractionStarter]: For program point L3333(lines 3333 3334) no Hoare annotation was computed. [2019-10-02 11:49:30,358 INFO L439 ceAbstractionStarter]: At program point L3589(lines 3576 3617) the Hoare annotation is: (let ((.cse12 (not (= ~SKIP2~0 ~IPC~0))) (.cse4 (not (= 1 ~pended~0))) (.cse11 (= ~IPC~0 ~s~0)) (.cse2 (= ~SKIP2~0 ~s~0))) (let ((.cse6 (not .cse2)) (.cse7 (= ~s~0 ~DC~0)) (.cse8 (not .cse11)) (.cse9 (= ~lowerDriverReturn~0 main_~status~11)) (.cse10 (and (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) .cse12 .cse4))) (let ((.cse5 (not (= main_~status~11 259))) (.cse0 (not (= ~MPR1~0 ~SKIP1~0))) (.cse1 (or (and .cse4 .cse12 .cse6 .cse7 .cse8) (and .cse9 .cse10))) (.cse3 (not (= ~SKIP1~0 ~NP~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (and .cse9 .cse10 .cse11) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse5 (and .cse0 .cse1 (= 0 ~routine~0) (= 1 ~compRegistered~0) (not (= ~MPR3~0 ~NP~0)) .cse3 (not (= ~MPR1~0 ~NP~0)))))))) [2019-10-02 11:49:30,358 INFO L443 ceAbstractionStarter]: For program point L3490(lines 3490 3543) no Hoare annotation was computed. [2019-10-02 11:49:30,359 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 3233 3624) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= 0 ~routine~0) (= ~s~0 ~DC~0) (= ~IPC~0 ~s~0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~NP~0) (= ~NP~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,359 INFO L443 ceAbstractionStarter]: For program point L3259(lines 3259 3260) no Hoare annotation was computed. [2019-10-02 11:49:30,359 INFO L443 ceAbstractionStarter]: For program point L3515(line 3515) no Hoare annotation was computed. [2019-10-02 11:49:30,359 INFO L443 ceAbstractionStarter]: For program point L3573(lines 3573 3618) no Hoare annotation was computed. [2019-10-02 11:49:30,359 INFO L443 ceAbstractionStarter]: For program point L3466(lines 3461 3623) no Hoare annotation was computed. [2019-10-02 11:49:30,359 INFO L443 ceAbstractionStarter]: For program point L3499(lines 3499 3540) no Hoare annotation was computed. [2019-10-02 11:49:30,359 INFO L439 ceAbstractionStarter]: At program point L3491(lines 3490 3543) the Hoare annotation is: (or (and (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,359 INFO L443 ceAbstractionStarter]: For program point L3483(lines 3466 3551) no Hoare annotation was computed. [2019-10-02 11:49:30,359 INFO L443 ceAbstractionStarter]: For program point L3599(lines 3599 3615) no Hoare annotation was computed. [2019-10-02 11:49:30,360 INFO L439 ceAbstractionStarter]: At program point L3500(lines 3499 3540) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and (not (= ~SKIP2~0 ~DC~0)) (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~IPC~0 ~DC~0)) (not (= 1 ~pended~0)) (not (= ~SKIP2~0 ~IPC~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,360 INFO L443 ceAbstractionStarter]: For program point L3591(lines 3591 3597) no Hoare annotation was computed. [2019-10-02 11:49:30,360 INFO L443 ceAbstractionStarter]: For program point L3525(line 3525) no Hoare annotation was computed. [2019-10-02 11:49:30,360 INFO L443 ceAbstractionStarter]: For program point L3608(lines 3608 3614) no Hoare annotation was computed. [2019-10-02 11:49:30,360 INFO L443 ceAbstractionStarter]: For program point L3608-1(lines 3554 3621) no Hoare annotation was computed. [2019-10-02 11:49:30,360 INFO L443 ceAbstractionStarter]: For program point L3476(lines 3476 3481) no Hoare annotation was computed. [2019-10-02 11:49:30,360 INFO L439 ceAbstractionStarter]: At program point L3476-2(lines 3476 3481) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (and (<= main_~i_1~0 4) (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~SKIP2~0 ~IPC~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 ~routine~0) (not (= 259 ~myStatus~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (not (= 1 ~pended~0)) (not (= ~MPR3~0 ~NP~0)) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,360 INFO L443 ceAbstractionStarter]: For program point L3600(lines 3600 3606) no Hoare annotation was computed. [2019-10-02 11:49:30,361 INFO L443 ceAbstractionStarter]: For program point L3493(lines 3493 3542) no Hoare annotation was computed. [2019-10-02 11:49:30,361 INFO L443 ceAbstractionStarter]: For program point L3576(lines 3576 3617) no Hoare annotation was computed. [2019-10-02 11:49:30,361 INFO L443 ceAbstractionStarter]: For program point L3510(line 3510) no Hoare annotation was computed. [2019-10-02 11:49:30,361 INFO L443 ceAbstractionStarter]: For program point L3502(lines 3502 3539) no Hoare annotation was computed. [2019-10-02 11:49:30,361 INFO L439 ceAbstractionStarter]: At program point L3593(line 3593) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,361 INFO L439 ceAbstractionStarter]: At program point L3494(lines 3493 3542) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (not (= 1 ~pended~0)) (not (= ~SKIP2~0 ~IPC~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,361 INFO L439 ceAbstractionStarter]: At program point L3610(line 3610) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,362 INFO L443 ceAbstractionStarter]: For program point L3577(lines 3577 3587) no Hoare annotation was computed. [2019-10-02 11:49:30,362 INFO L439 ceAbstractionStarter]: At program point L3602(line 3602) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,362 INFO L439 ceAbstractionStarter]: At program point L3536(lines 3466 3551) the Hoare annotation is: (let ((.cse6 (= ~SKIP2~0 ~s~0))) (let ((.cse1 (not .cse6)) (.cse2 (= ~IPC~0 ~s~0)) (.cse3 (= ~lowerDriverReturn~0 main_~status~11)) (.cse4 (not (= ~SKIP2~0 ~DC~0))) (.cse5 (not (= ~IPC~0 ~DC~0))) (.cse0 (not (= 1 ~pended~0)))) (or (and .cse0 (not (= main_~status~11 259)) .cse1 (= ~s~0 ~DC~0) (not .cse2)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse3 .cse4 .cse5 .cse0 .cse1 .cse2) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and .cse3 (not (= ~MPR1~0 ~SKIP1~0)) .cse4 .cse5 (not (= ~SKIP2~0 ~IPC~0)) .cse0 .cse6 (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~s~0)| |old(~IPC~0)|))))) [2019-10-02 11:49:30,362 INFO L439 ceAbstractionStarter]: At program point L3569(lines 3562 3620) the Hoare annotation is: (let ((.cse6 (= ~SKIP2~0 ~s~0))) (let ((.cse1 (not .cse6)) (.cse3 (= ~IPC~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 main_~status~11)) (.cse2 (= ~s~0 ~DC~0)) (.cse5 (not (= ~IPC~0 ~DC~0))) (.cse0 (not (= 1 ~pended~0)))) (or (and .cse0 (not (= main_~status~11 259)) .cse1 .cse2 (not .cse3)) (= 1 |old(~pended~0)|) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse4 (not (= ~SKIP2~0 ~DC~0)) .cse5 .cse0 .cse1 .cse3) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse4 (not .cse2) (not (= ~MPR1~0 ~SKIP1~0)) .cse5 .cse0 (not (= ~SKIP2~0 ~IPC~0)) .cse6 (not (= ~SKIP1~0 ~NP~0)))))) [2019-10-02 11:49:30,362 INFO L439 ceAbstractionStarter]: At program point L3503(lines 3502 3539) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (not (= 1 ~pended~0)) (not (= ~SKIP2~0 ~IPC~0)) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|))) [2019-10-02 11:49:30,363 INFO L439 ceAbstractionStarter]: At program point L3561(lines 3554 3621) the Hoare annotation is: (let ((.cse6 (= ~SKIP2~0 ~s~0))) (let ((.cse1 (not .cse6)) (.cse3 (= ~IPC~0 ~s~0)) (.cse4 (= ~lowerDriverReturn~0 main_~status~11)) (.cse2 (= ~s~0 ~DC~0)) (.cse5 (not (= ~IPC~0 ~DC~0))) (.cse0 (not (= 1 ~pended~0)))) (or (and .cse0 (not (= main_~status~11 259)) .cse1 .cse2 (not .cse3)) (= 1 |old(~pended~0)|) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse4 (not (= ~SKIP2~0 ~DC~0)) .cse5 .cse0 .cse1 .cse3) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~SKIP1~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse4 (not .cse2) (not (= ~MPR1~0 ~SKIP1~0)) .cse5 .cse0 (not (= ~SKIP2~0 ~IPC~0)) .cse6 (not (= ~SKIP1~0 ~NP~0)))))) [2019-10-02 11:49:30,363 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListENTRY(lines 3681 3689) no Hoare annotation was computed. [2019-10-02 11:49:30,363 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListFINAL(lines 3681 3689) no Hoare annotation was computed. [2019-10-02 11:49:30,363 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListEXIT(lines 3681 3689) no Hoare annotation was computed. [2019-10-02 11:49:30,363 INFO L439 ceAbstractionStarter]: At program point L4072(line 4072) the Hoare annotation is: (or (not (= ~setEventCalled~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 ~pended~0) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) [2019-10-02 11:49:30,363 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 4064 4077) the Hoare annotation is: (or (not (= ~setEventCalled~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 ~pended~0) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~s~0 |old(~s~0)|) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) [2019-10-02 11:49:30,364 INFO L443 ceAbstractionStarter]: For program point L4072-1(lines 4064 4077) no Hoare annotation was computed. [2019-10-02 11:49:30,364 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 4064 4077) no Hoare annotation was computed. [2019-10-02 11:49:30,364 INFO L443 ceAbstractionStarter]: For program point PoStartNextPowerIrpENTRY(lines 4513 4519) no Hoare annotation was computed. [2019-10-02 11:49:30,364 INFO L443 ceAbstractionStarter]: For program point PoStartNextPowerIrpFINAL(lines 4513 4519) no Hoare annotation was computed. [2019-10-02 11:49:30,364 INFO L443 ceAbstractionStarter]: For program point PoStartNextPowerIrpEXIT(lines 4513 4519) no Hoare annotation was computed. [2019-10-02 11:49:30,364 INFO L443 ceAbstractionStarter]: For program point IoAllocateErrorLogEntryFINAL(lines 1613 1618) no Hoare annotation was computed. [2019-10-02 11:49:30,364 INFO L443 ceAbstractionStarter]: For program point L1614(lines 1614 1616) no Hoare annotation was computed. [2019-10-02 11:49:30,364 INFO L443 ceAbstractionStarter]: For program point IoAllocateErrorLogEntryEXIT(lines 1613 1618) no Hoare annotation was computed. [2019-10-02 11:49:30,364 INFO L446 ceAbstractionStarter]: At program point IoAllocateErrorLogEntryENTRY(lines 1613 1618) the Hoare annotation is: true [2019-10-02 11:49:30,364 INFO L443 ceAbstractionStarter]: For program point ExFreePoolENTRY(lines 3659 3665) no Hoare annotation was computed. [2019-10-02 11:49:30,364 INFO L443 ceAbstractionStarter]: For program point ExFreePoolFINAL(lines 3659 3665) no Hoare annotation was computed. [2019-10-02 11:49:30,365 INFO L443 ceAbstractionStarter]: For program point ExFreePoolEXIT(lines 3659 3665) no Hoare annotation was computed. [2019-10-02 11:49:30,365 INFO L443 ceAbstractionStarter]: For program point KeAcquireSpinLockRaiseToDpcENTRY(lines 4179 4185) no Hoare annotation was computed. [2019-10-02 11:49:30,365 INFO L443 ceAbstractionStarter]: For program point KeAcquireSpinLockRaiseToDpcFINAL(lines 4179 4185) no Hoare annotation was computed. [2019-10-02 11:49:30,365 INFO L443 ceAbstractionStarter]: For program point KeAcquireSpinLockRaiseToDpcEXIT(lines 4179 4185) no Hoare annotation was computed. [2019-10-02 11:49:30,365 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 4257 4264) the Hoare annotation is: true [2019-10-02 11:49:30,365 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 4257 4264) no Hoare annotation was computed. [2019-10-02 11:49:30,365 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 4257 4264) no Hoare annotation was computed. [2019-10-02 11:49:30,365 INFO L443 ceAbstractionStarter]: For program point L3136(lines 3136 3142) no Hoare annotation was computed. [2019-10-02 11:49:30,365 INFO L443 ceAbstractionStarter]: For program point L3138-1(line 3138) no Hoare annotation was computed. [2019-10-02 11:49:30,365 INFO L443 ceAbstractionStarter]: For program point L3169(line 3169) no Hoare annotation was computed. [2019-10-02 11:49:30,366 INFO L443 ceAbstractionStarter]: For program point DiskperfWmiFunctionControlFINAL(lines 3120 3173) no Hoare annotation was computed. [2019-10-02 11:49:30,366 INFO L443 ceAbstractionStarter]: For program point L3136-2(lines 3136 3142) no Hoare annotation was computed. [2019-10-02 11:49:30,366 INFO L443 ceAbstractionStarter]: For program point L3130(lines 3130 3163) no Hoare annotation was computed. [2019-10-02 11:49:30,366 INFO L443 ceAbstractionStarter]: For program point DiskperfWmiFunctionControlENTRY(lines 3120 3173) no Hoare annotation was computed. [2019-10-02 11:49:30,366 INFO L443 ceAbstractionStarter]: For program point L3130-1(lines 3130 3163) no Hoare annotation was computed. [2019-10-02 11:49:30,366 INFO L443 ceAbstractionStarter]: For program point L3135(lines 3135 3149) no Hoare annotation was computed. [2019-10-02 11:49:30,366 INFO L443 ceAbstractionStarter]: For program point L3133-1(line 3133) no Hoare annotation was computed. [2019-10-02 11:49:30,366 INFO L443 ceAbstractionStarter]: For program point L3133(line 3133) no Hoare annotation was computed. [2019-10-02 11:49:30,366 INFO L443 ceAbstractionStarter]: For program point DiskperfWmiFunctionControlEXIT(lines 3120 3173) no Hoare annotation was computed. [2019-10-02 11:49:30,366 INFO L443 ceAbstractionStarter]: For program point L3131(lines 3131 3160) no Hoare annotation was computed. [2019-10-02 11:49:30,366 INFO L443 ceAbstractionStarter]: For program point L3129(lines 3129 3167) no Hoare annotation was computed. [2019-10-02 11:49:30,367 INFO L443 ceAbstractionStarter]: For program point L3129-2(lines 3129 3167) no Hoare annotation was computed. [2019-10-02 11:49:30,367 INFO L443 ceAbstractionStarter]: For program point L3154(lines 3154 3159) no Hoare annotation was computed. [2019-10-02 11:49:30,367 INFO L443 ceAbstractionStarter]: For program point L3152(line 3152) no Hoare annotation was computed. [2019-10-02 11:49:30,367 INFO L443 ceAbstractionStarter]: For program point L3152-1(line 3152) no Hoare annotation was computed. [2019-10-02 11:49:30,367 INFO L443 ceAbstractionStarter]: For program point L3144(line 3144) no Hoare annotation was computed. [2019-10-02 11:49:30,367 INFO L443 ceAbstractionStarter]: For program point L3138(line 3138) no Hoare annotation was computed. [2019-10-02 11:49:30,367 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 3219 3232) no Hoare annotation was computed. [2019-10-02 11:49:30,367 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 3219 3232) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (not (= 1 ~pended~0))) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,367 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 3219 3232) no Hoare annotation was computed. [2019-10-02 11:49:30,368 INFO L443 ceAbstractionStarter]: For program point L3867(lines 3866 3876) no Hoare annotation was computed. [2019-10-02 11:49:30,368 INFO L443 ceAbstractionStarter]: For program point L3864(lines 3863 3877) no Hoare annotation was computed. [2019-10-02 11:49:30,368 INFO L443 ceAbstractionStarter]: For program point L3863(lines 3863 3877) no Hoare annotation was computed. [2019-10-02 11:49:30,368 INFO L443 ceAbstractionStarter]: For program point IoCreateSymbolicLinkEXIT(lines 3859 3879) no Hoare annotation was computed. [2019-10-02 11:49:30,368 INFO L443 ceAbstractionStarter]: For program point IoCreateSymbolicLinkENTRY(lines 3859 3879) no Hoare annotation was computed. [2019-10-02 11:49:30,368 INFO L443 ceAbstractionStarter]: For program point L3874(lines 3859 3879) no Hoare annotation was computed. [2019-10-02 11:49:30,368 INFO L443 ceAbstractionStarter]: For program point L2130-1(line 2130) no Hoare annotation was computed. [2019-10-02 11:49:30,368 INFO L443 ceAbstractionStarter]: For program point DriverEntryFINAL(lines 2123 2155) no Hoare annotation was computed. [2019-10-02 11:49:30,368 INFO L443 ceAbstractionStarter]: For program point DriverEntryEXIT(lines 2123 2155) no Hoare annotation was computed. [2019-10-02 11:49:30,368 INFO L443 ceAbstractionStarter]: For program point DriverEntryENTRY(lines 2123 2155) no Hoare annotation was computed. [2019-10-02 11:49:30,368 INFO L443 ceAbstractionStarter]: For program point L2133(lines 2133 2140) no Hoare annotation was computed. [2019-10-02 11:49:30,369 INFO L443 ceAbstractionStarter]: For program point L2130(line 2130) no Hoare annotation was computed. [2019-10-02 11:49:30,369 INFO L443 ceAbstractionStarter]: For program point L2133-2(lines 2133 2140) no Hoare annotation was computed. [2019-10-02 11:49:30,369 INFO L443 ceAbstractionStarter]: For program point RtlCompareMemoryEXIT(lines 4601 4608) no Hoare annotation was computed. [2019-10-02 11:49:30,369 INFO L443 ceAbstractionStarter]: For program point RtlCompareMemoryENTRY(lines 4601 4608) no Hoare annotation was computed. [2019-10-02 11:49:30,369 INFO L443 ceAbstractionStarter]: For program point RtlCompareMemoryFINAL(lines 4601 4608) no Hoare annotation was computed. [2019-10-02 11:49:30,369 INFO L443 ceAbstractionStarter]: For program point DiskPerfUnloadENTRY(lines 2753 2759) no Hoare annotation was computed. [2019-10-02 11:49:30,369 INFO L443 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 2753 2759) no Hoare annotation was computed. [2019-10-02 11:49:30,369 INFO L443 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 2753 2759) no Hoare annotation was computed. [2019-10-02 11:49:30,369 INFO L443 ceAbstractionStarter]: For program point L4566(lines 4551 4571) no Hoare annotation was computed. [2019-10-02 11:49:30,369 INFO L443 ceAbstractionStarter]: For program point L4559(lines 4558 4568) no Hoare annotation was computed. [2019-10-02 11:49:30,369 INFO L443 ceAbstractionStarter]: For program point L4555(lines 4555 4569) no Hoare annotation was computed. [2019-10-02 11:49:30,370 INFO L443 ceAbstractionStarter]: For program point L4556(lines 4555 4569) no Hoare annotation was computed. [2019-10-02 11:49:30,370 INFO L443 ceAbstractionStarter]: For program point PsTerminateSystemThreadEXIT(lines 4551 4571) no Hoare annotation was computed. [2019-10-02 11:49:30,370 INFO L443 ceAbstractionStarter]: For program point PsTerminateSystemThreadENTRY(lines 4551 4571) no Hoare annotation was computed. [2019-10-02 11:49:30,370 INFO L443 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 2278 2288) no Hoare annotation was computed. [2019-10-02 11:49:30,370 INFO L446 ceAbstractionStarter]: At program point L2284(line 2284) the Hoare annotation is: true [2019-10-02 11:49:30,370 INFO L446 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 2278 2288) the Hoare annotation is: true [2019-10-02 11:49:30,370 INFO L443 ceAbstractionStarter]: For program point L2284-1(line 2284) no Hoare annotation was computed. [2019-10-02 11:49:30,370 INFO L443 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 2278 2288) no Hoare annotation was computed. [2019-10-02 11:49:30,370 INFO L439 ceAbstractionStarter]: At program point L2270(lines 2253 2271) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (and (not (= DiskPerfDispatchPnp_~status~1 259)) (= 0 ~routine~0) (= ~s~0 ~DC~0) (not (= 1 ~pended~0)) (= 1 ~compRegistered~0))) [2019-10-02 11:49:30,371 INFO L443 ceAbstractionStarter]: For program point L2266(line 2266) no Hoare annotation was computed. [2019-10-02 11:49:30,371 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 2238 2277) no Hoare annotation was computed. [2019-10-02 11:49:30,371 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 2238 2277) no Hoare annotation was computed. [2019-10-02 11:49:30,371 INFO L443 ceAbstractionStarter]: For program point L2261(line 2261) no Hoare annotation was computed. [2019-10-02 11:49:30,371 INFO L443 ceAbstractionStarter]: For program point L2256(line 2256) no Hoare annotation was computed. [2019-10-02 11:49:30,371 INFO L439 ceAbstractionStarter]: At program point L2252(lines 2251 2272) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|))) [2019-10-02 11:49:30,371 INFO L439 ceAbstractionStarter]: At program point DiskPerfDispatchPnpENTRY(lines 2238 2277) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,371 INFO L443 ceAbstractionStarter]: For program point L2248(lines 2248 2273) no Hoare annotation was computed. [2019-10-02 11:49:30,372 INFO L439 ceAbstractionStarter]: At program point L2249(lines 2248 2273) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,372 INFO L439 ceAbstractionStarter]: At program point L2246(lines 2245 2274) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= ~myStatus~0 |old(~myStatus~0)|)) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= |old(~myStatus~0)| 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,372 INFO L443 ceAbstractionStarter]: For program point L2245(lines 2245 2274) no Hoare annotation was computed. [2019-10-02 11:49:30,372 INFO L443 ceAbstractionStarter]: For program point MmFreeContiguousMemoryEXIT(lines 4343 4349) no Hoare annotation was computed. [2019-10-02 11:49:30,372 INFO L443 ceAbstractionStarter]: For program point MmFreeContiguousMemoryENTRY(lines 4343 4349) no Hoare annotation was computed. [2019-10-02 11:49:30,372 INFO L443 ceAbstractionStarter]: For program point MmFreeContiguousMemoryFINAL(lines 4343 4349) no Hoare annotation was computed. [2019-10-02 11:49:30,372 INFO L443 ceAbstractionStarter]: For program point KeInitializeSpinLockEXIT(lines 4229 4235) no Hoare annotation was computed. [2019-10-02 11:49:30,372 INFO L443 ceAbstractionStarter]: For program point KeInitializeSpinLockENTRY(lines 4229 4235) no Hoare annotation was computed. [2019-10-02 11:49:30,372 INFO L443 ceAbstractionStarter]: For program point KeInitializeSpinLockFINAL(lines 4229 4235) no Hoare annotation was computed. [2019-10-02 11:49:30,373 INFO L443 ceAbstractionStarter]: For program point L2494(lines 2494 2499) no Hoare annotation was computed. [2019-10-02 11:49:30,373 INFO L443 ceAbstractionStarter]: For program point L2492(line 2492) no Hoare annotation was computed. [2019-10-02 11:49:30,373 INFO L443 ceAbstractionStarter]: For program point L2494-2(lines 2452 2526) no Hoare annotation was computed. [2019-10-02 11:49:30,373 INFO L443 ceAbstractionStarter]: For program point L2461(lines 2461 2465) no Hoare annotation was computed. [2019-10-02 11:49:30,373 INFO L443 ceAbstractionStarter]: For program point DiskPerfReadWriteEXIT(lines 2439 2527) no Hoare annotation was computed. [2019-10-02 11:49:30,373 INFO L443 ceAbstractionStarter]: For program point L2523-1(line 2523) no Hoare annotation was computed. [2019-10-02 11:49:30,373 INFO L443 ceAbstractionStarter]: For program point L2461-2(lines 2461 2465) no Hoare annotation was computed. [2019-10-02 11:49:30,373 INFO L443 ceAbstractionStarter]: For program point L2492-1(line 2492) no Hoare annotation was computed. [2019-10-02 11:49:30,373 INFO L443 ceAbstractionStarter]: For program point L2523(line 2523) no Hoare annotation was computed. [2019-10-02 11:49:30,373 INFO L443 ceAbstractionStarter]: For program point L2480(line 2480) no Hoare annotation was computed. [2019-10-02 11:49:30,373 INFO L443 ceAbstractionStarter]: For program point L2478(lines 2478 2485) no Hoare annotation was computed. [2019-10-02 11:49:30,374 INFO L443 ceAbstractionStarter]: For program point L2480-1(line 2480) no Hoare annotation was computed. [2019-10-02 11:49:30,374 INFO L443 ceAbstractionStarter]: For program point L2474(line 2474) no Hoare annotation was computed. [2019-10-02 11:49:30,374 INFO L443 ceAbstractionStarter]: For program point L2507(line 2507) no Hoare annotation was computed. [2019-10-02 11:49:30,374 INFO L443 ceAbstractionStarter]: For program point L2472(lines 2472 2486) no Hoare annotation was computed. [2019-10-02 11:49:30,374 INFO L443 ceAbstractionStarter]: For program point L2505-1(lines 2500 2514) no Hoare annotation was computed. [2019-10-02 11:49:30,374 INFO L443 ceAbstractionStarter]: For program point L2474-1(line 2474) no Hoare annotation was computed. [2019-10-02 11:49:30,374 INFO L443 ceAbstractionStarter]: For program point L2505(lines 2505 2513) no Hoare annotation was computed. [2019-10-02 11:49:30,374 INFO L443 ceAbstractionStarter]: For program point L2468(line 2468) no Hoare annotation was computed. [2019-10-02 11:49:30,374 INFO L443 ceAbstractionStarter]: For program point L2466(lines 2466 2487) no Hoare annotation was computed. [2019-10-02 11:49:30,374 INFO L443 ceAbstractionStarter]: For program point L2468-1(line 2468) no Hoare annotation was computed. [2019-10-02 11:49:30,374 INFO L443 ceAbstractionStarter]: For program point DiskPerfReadWriteFINAL(lines 2439 2527) no Hoare annotation was computed. [2019-10-02 11:49:30,375 INFO L443 ceAbstractionStarter]: For program point L2489-1(line 2489) no Hoare annotation was computed. [2019-10-02 11:49:30,375 INFO L443 ceAbstractionStarter]: For program point L2489(line 2489) no Hoare annotation was computed. [2019-10-02 11:49:30,375 INFO L443 ceAbstractionStarter]: For program point DiskPerfReadWriteENTRY(lines 2439 2527) no Hoare annotation was computed. [2019-10-02 11:49:30,375 INFO L443 ceAbstractionStarter]: For program point L2502(line 2502) no Hoare annotation was computed. [2019-10-02 11:49:30,375 INFO L443 ceAbstractionStarter]: For program point DiskPerfLogErrorFINAL(lines 2978 3003) no Hoare annotation was computed. [2019-10-02 11:49:30,375 INFO L446 ceAbstractionStarter]: At program point L2996(line 2996) the Hoare annotation is: true [2019-10-02 11:49:30,375 INFO L443 ceAbstractionStarter]: For program point L2994(line 2994) no Hoare annotation was computed. [2019-10-02 11:49:30,375 INFO L446 ceAbstractionStarter]: At program point L2993-1(line 2993) the Hoare annotation is: true [2019-10-02 11:49:30,375 INFO L446 ceAbstractionStarter]: At program point L2993(line 2993) the Hoare annotation is: true [2019-10-02 11:49:30,375 INFO L446 ceAbstractionStarter]: At program point DiskPerfLogErrorENTRY(lines 2978 3003) the Hoare annotation is: true [2019-10-02 11:49:30,376 INFO L443 ceAbstractionStarter]: For program point L2988(lines 2988 3000) no Hoare annotation was computed. [2019-10-02 11:49:30,376 INFO L443 ceAbstractionStarter]: For program point L2988-1(lines 2988 3000) no Hoare annotation was computed. [2019-10-02 11:49:30,376 INFO L443 ceAbstractionStarter]: For program point L2985-1(line 2985) no Hoare annotation was computed. [2019-10-02 11:49:30,376 INFO L446 ceAbstractionStarter]: At program point L2985(line 2985) the Hoare annotation is: true [2019-10-02 11:49:30,376 INFO L443 ceAbstractionStarter]: For program point DiskPerfLogErrorEXIT(lines 2978 3003) no Hoare annotation was computed. [2019-10-02 11:49:30,376 INFO L446 ceAbstractionStarter]: At program point KeQueryPerformanceCounterENTRY(lines 1702 1716) the Hoare annotation is: true [2019-10-02 11:49:30,376 INFO L443 ceAbstractionStarter]: For program point KeQueryPerformanceCounterEXIT(lines 1702 1716) no Hoare annotation was computed. [2019-10-02 11:49:30,376 INFO L443 ceAbstractionStarter]: For program point L1711-1(lines 1711 1714) no Hoare annotation was computed. [2019-10-02 11:49:30,376 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1710) no Hoare annotation was computed. [2019-10-02 11:49:30,376 INFO L443 ceAbstractionStarter]: For program point L1706-2(lines 1702 1716) no Hoare annotation was computed. [2019-10-02 11:49:30,376 INFO L443 ceAbstractionStarter]: For program point KeQueryPerformanceCounterFINAL(lines 1702 1716) no Hoare annotation was computed. [2019-10-02 11:49:30,377 INFO L443 ceAbstractionStarter]: For program point ObfDereferenceObjectFINAL(lines 4418 4424) no Hoare annotation was computed. [2019-10-02 11:49:30,377 INFO L443 ceAbstractionStarter]: For program point ObfDereferenceObjectENTRY(lines 4418 4424) no Hoare annotation was computed. [2019-10-02 11:49:30,377 INFO L443 ceAbstractionStarter]: For program point ObfDereferenceObjectEXIT(lines 4418 4424) no Hoare annotation was computed. [2019-10-02 11:49:30,377 INFO L443 ceAbstractionStarter]: For program point WmiCompleteRequestENTRY(lines 2027 2032) no Hoare annotation was computed. [2019-10-02 11:49:30,377 INFO L443 ceAbstractionStarter]: For program point L2028(lines 2028 2030) no Hoare annotation was computed. [2019-10-02 11:49:30,377 INFO L443 ceAbstractionStarter]: For program point WmiCompleteRequestFINAL(lines 2027 2032) no Hoare annotation was computed. [2019-10-02 11:49:30,377 INFO L443 ceAbstractionStarter]: For program point WmiCompleteRequestEXIT(lines 2027 2032) no Hoare annotation was computed. [2019-10-02 11:49:30,377 INFO L439 ceAbstractionStarter]: At program point L4445(line 4445) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,377 INFO L443 ceAbstractionStarter]: For program point L4445-1(line 4445) no Hoare annotation was computed. [2019-10-02 11:49:30,377 INFO L443 ceAbstractionStarter]: For program point L4499(lines 4499 4506) no Hoare annotation was computed. [2019-10-02 11:49:30,378 INFO L439 ceAbstractionStarter]: At program point L4466(lines 4465 4484) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,378 INFO L443 ceAbstractionStarter]: For program point L4437(lines 4437 4451) no Hoare annotation was computed. [2019-10-02 11:49:30,378 INFO L443 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 4427 4511) no Hoare annotation was computed. [2019-10-02 11:49:30,378 INFO L443 ceAbstractionStarter]: For program point L4491(lines 4491 4497) no Hoare annotation was computed. [2019-10-02 11:49:30,378 INFO L439 ceAbstractionStarter]: At program point L4454(line 4454) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,378 INFO L443 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 4427 4511) no Hoare annotation was computed. [2019-10-02 11:49:30,378 INFO L443 ceAbstractionStarter]: For program point L4504-1(lines 4486 4508) no Hoare annotation was computed. [2019-10-02 11:49:30,379 INFO L439 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 4427 4511) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,379 INFO L439 ceAbstractionStarter]: At program point L4504(line 4504) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,379 INFO L439 ceAbstractionStarter]: At program point L4463(lines 4462 4485) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,379 INFO L443 ceAbstractionStarter]: For program point L4443(lines 4443 4450) no Hoare annotation was computed. [2019-10-02 11:49:30,379 INFO L439 ceAbstractionStarter]: At program point L4439(line 4439) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,379 INFO L443 ceAbstractionStarter]: For program point L4439-1(line 4439) no Hoare annotation was computed. [2019-10-02 11:49:30,379 INFO L443 ceAbstractionStarter]: For program point L4443-2(lines 4436 4459) no Hoare annotation was computed. [2019-10-02 11:49:30,379 INFO L439 ceAbstractionStarter]: At program point L4481(lines 4435 4510) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,379 INFO L443 ceAbstractionStarter]: For program point L4436-1(lines 4435 4510) no Hoare annotation was computed. [2019-10-02 11:49:30,380 INFO L439 ceAbstractionStarter]: At program point L4469(lines 4468 4483) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,380 INFO L443 ceAbstractionStarter]: For program point L4436(lines 4436 4461) no Hoare annotation was computed. [2019-10-02 11:49:30,380 INFO L443 ceAbstractionStarter]: For program point L4465(lines 4465 4484) no Hoare annotation was computed. [2019-10-02 11:49:30,380 INFO L443 ceAbstractionStarter]: For program point L4490(lines 4490 4507) no Hoare annotation was computed. [2019-10-02 11:49:30,380 INFO L443 ceAbstractionStarter]: For program point RtlFreeUnicodeStringFINAL(lines 4645 4651) no Hoare annotation was computed. [2019-10-02 11:49:30,380 INFO L443 ceAbstractionStarter]: For program point RtlFreeUnicodeStringEXIT(lines 4645 4651) no Hoare annotation was computed. [2019-10-02 11:49:30,380 INFO L443 ceAbstractionStarter]: For program point RtlFreeUnicodeStringENTRY(lines 4645 4651) no Hoare annotation was computed. [2019-10-02 11:49:30,380 INFO L446 ceAbstractionStarter]: At program point InterlockedIncrementENTRY(lines 1527 1529) the Hoare annotation is: true [2019-10-02 11:49:30,380 INFO L443 ceAbstractionStarter]: For program point InterlockedIncrementFINAL(lines 1527 1529) no Hoare annotation was computed. [2019-10-02 11:49:30,380 INFO L443 ceAbstractionStarter]: For program point InterlockedIncrementEXIT(lines 1527 1529) no Hoare annotation was computed. [2019-10-02 11:49:30,381 INFO L439 ceAbstractionStarter]: At program point L2368(line 2368) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~SKIP1~0 ~s~0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,381 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 2349 2372) no Hoare annotation was computed. [2019-10-02 11:49:30,381 INFO L443 ceAbstractionStarter]: For program point L2368-1(line 2368) no Hoare annotation was computed. [2019-10-02 11:49:30,381 INFO L439 ceAbstractionStarter]: At program point DiskPerfDispatchPowerENTRY(lines 2349 2372) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (and (not (= 1 ~pended~0)) (= ~s~0 |old(~s~0)|)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,381 INFO L443 ceAbstractionStarter]: For program point L2361-1(lines 2357 2363) no Hoare annotation was computed. [2019-10-02 11:49:30,381 INFO L439 ceAbstractionStarter]: At program point L2361(line 2361) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,381 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 2349 2372) no Hoare annotation was computed. [2019-10-02 11:49:30,381 INFO L443 ceAbstractionStarter]: For program point L2357(lines 2357 2363) no Hoare annotation was computed. [2019-10-02 11:49:30,382 INFO L443 ceAbstractionStarter]: For program point KeReleaseSemaphoreFINAL(lines 4238 4245) no Hoare annotation was computed. [2019-10-02 11:49:30,382 INFO L443 ceAbstractionStarter]: For program point KeReleaseSemaphoreENTRY(lines 4238 4245) no Hoare annotation was computed. [2019-10-02 11:49:30,382 INFO L443 ceAbstractionStarter]: For program point KeReleaseSemaphoreEXIT(lines 4238 4245) no Hoare annotation was computed. [2019-10-02 11:49:30,382 INFO L439 ceAbstractionStarter]: At program point L4282(lines 4274 4295) the Hoare annotation is: (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse9 (= 1 ~pended~0)) (.cse5 (= ~NP~0 ~MPR1~0)) (.cse10 (= ~SKIP2~0 ~DC~0)) (.cse8 (= ~DC~0 ~IPC~0)) (.cse6 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= 0 ~routine~0))) (.cse2 (= ~myStatus~0 259)) (.cse3 (not (= ~compRegistered~0 1))) (.cse11 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= ~NP~0 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| ~MPR3~0)) (or .cse6 .cse7 (or (or .cse8 .cse9 .cse10) .cse11))) (or .cse0 .cse7 (and (= ~s~0 |old(~s~0)|) (= ~setEventCalled~0 1)) .cse9 .cse5 .cse10 .cse8 .cse6 .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse11 .cse4))) [2019-10-02 11:49:30,382 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 4269 4312) no Hoare annotation was computed. [2019-10-02 11:49:30,382 INFO L443 ceAbstractionStarter]: For program point L4307(lines 4269 4312) no Hoare annotation was computed. [2019-10-02 11:49:30,382 INFO L443 ceAbstractionStarter]: For program point L4274(lines 4274 4295) no Hoare annotation was computed. [2019-10-02 11:49:30,382 INFO L439 ceAbstractionStarter]: At program point L4297(lines 4296 4310) the Hoare annotation is: (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse9 (= 1 ~pended~0)) (.cse5 (= ~NP~0 ~MPR1~0)) (.cse10 (= ~SKIP2~0 ~DC~0)) (.cse8 (= ~DC~0 ~IPC~0)) (.cse6 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= 0 ~routine~0))) (.cse2 (= ~myStatus~0 259)) (.cse3 (not (= ~compRegistered~0 1))) (.cse11 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= ~NP~0 ~MPR3~0))) (and (or .cse0 (= ~s~0 ~NP~0) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| ~MPR3~0)) (or .cse6 .cse7 (or (or .cse8 .cse9 .cse10) .cse11))) (or .cse0 .cse7 .cse9 .cse5 .cse10 (and (= ~s~0 |old(~s~0)|) (= ~setEventCalled~0 1)) .cse8 .cse6 .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse11 .cse4))) [2019-10-02 11:49:30,383 INFO L443 ceAbstractionStarter]: For program point L4287(lines 4287 4293) no Hoare annotation was computed. [2019-10-02 11:49:30,383 INFO L443 ceAbstractionStarter]: For program point L4287-1(lines 4273 4311) no Hoare annotation was computed. [2019-10-02 11:49:30,383 INFO L439 ceAbstractionStarter]: At program point L4289(line 4289) the Hoare annotation is: (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse7 (not (= 0 ~routine~0))) (.cse8 (= ~myStatus~0 259)) (.cse9 (not (= ~compRegistered~0 1))) (.cse11 (= ~NP~0 ~MPR3~0)) (.cse3 (= ~NP~0 ~MPR1~0)) (.cse6 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse5 (= ~DC~0 ~IPC~0)) (.cse2 (= 1 ~pended~0)) (.cse4 (= ~SKIP2~0 ~DC~0)) (.cse10 (= ~SKIP2~0 ~IPC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |old(~s~0)| ~NP~0)) .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse7 .cse8 .cse9 .cse11 .cse3 (not (= |old(~s~0)| ~MPR3~0)) (or .cse6 .cse1 (or (or .cse5 .cse2 .cse4) .cse10))))) [2019-10-02 11:49:30,383 INFO L443 ceAbstractionStarter]: For program point L4275(lines 4275 4280) no Hoare annotation was computed. [2019-10-02 11:49:30,383 INFO L439 ceAbstractionStarter]: At program point L4300(lines 4299 4309) the Hoare annotation is: (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse9 (= 1 ~pended~0)) (.cse5 (= ~NP~0 ~MPR1~0)) (.cse10 (= ~SKIP2~0 ~DC~0)) (.cse8 (= ~DC~0 ~IPC~0)) (.cse6 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= 0 ~routine~0))) (.cse2 (= ~myStatus~0 259)) (.cse3 (not (= ~compRegistered~0 1))) (.cse11 (= ~SKIP2~0 ~IPC~0)) (.cse4 (= ~NP~0 ~MPR3~0))) (and (or .cse0 (= ~s~0 ~NP~0) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~s~0)| ~MPR3~0)) (or .cse6 .cse7 (or (or .cse8 .cse9 .cse10) .cse11))) (or .cse0 .cse7 .cse9 .cse5 .cse10 (and (= ~s~0 |old(~s~0)|) (= ~setEventCalled~0 1)) .cse8 .cse6 .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse11 .cse4))) [2019-10-02 11:49:30,383 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 4269 4312) the Hoare annotation is: (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse8 (not (= 0 ~routine~0))) (.cse9 (= ~myStatus~0 259)) (.cse10 (not (= ~compRegistered~0 1))) (.cse12 (= ~NP~0 ~MPR3~0)) (.cse3 (= ~setEventCalled~0 1)) (.cse4 (= ~NP~0 ~MPR1~0)) (.cse7 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~SKIP1~0 ~MPR1~0)) (.cse6 (= ~DC~0 ~IPC~0)) (.cse2 (= 1 ~pended~0)) (.cse5 (= ~SKIP2~0 ~DC~0)) (.cse11 (= ~SKIP2~0 ~IPC~0))) (and (or .cse0 .cse1 .cse2 (and (= ~s~0 |old(~s~0)|) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |old(~s~0)| ~NP~0)) .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse8 .cse9 .cse10 .cse12 (and (= ~MPR3~0 ~s~0) .cse3) .cse4 (not (= |old(~s~0)| ~MPR3~0)) (or .cse7 .cse1 (or (or .cse6 .cse2 .cse5) .cse11))))) [2019-10-02 11:49:30,384 INFO L446 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2019-10-02 11:49:30,384 INFO L446 ceAbstractionStarter]: At program point #Ultimate.C_memmoveENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:49:30,384 INFO L446 ceAbstractionStarter]: At program point L-1-3(line -1) the Hoare annotation is: true [2019-10-02 11:49:30,384 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memmoveFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:49:30,384 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memmoveEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:49:30,384 INFO L443 ceAbstractionStarter]: For program point MmPageEntireDriverEXIT(lines 4366 4372) no Hoare annotation was computed. [2019-10-02 11:49:30,384 INFO L443 ceAbstractionStarter]: For program point MmPageEntireDriverENTRY(lines 4366 4372) no Hoare annotation was computed. [2019-10-02 11:49:30,384 INFO L443 ceAbstractionStarter]: For program point MmPageEntireDriverFINAL(lines 4366 4372) no Hoare annotation was computed. [2019-10-02 11:49:30,384 INFO L443 ceAbstractionStarter]: For program point L4638(lines 4622 4643) no Hoare annotation was computed. [2019-10-02 11:49:30,384 INFO L443 ceAbstractionStarter]: For program point L4631(lines 4630 4640) no Hoare annotation was computed. [2019-10-02 11:49:30,385 INFO L443 ceAbstractionStarter]: For program point L4627(lines 4627 4641) no Hoare annotation was computed. [2019-10-02 11:49:30,385 INFO L443 ceAbstractionStarter]: For program point L4628(lines 4627 4641) no Hoare annotation was computed. [2019-10-02 11:49:30,385 INFO L443 ceAbstractionStarter]: For program point RtlDeleteRegistryValueEXIT(lines 4622 4643) no Hoare annotation was computed. [2019-10-02 11:49:30,385 INFO L443 ceAbstractionStarter]: For program point RtlDeleteRegistryValueENTRY(lines 4622 4643) no Hoare annotation was computed. [2019-10-02 11:49:30,385 INFO L443 ceAbstractionStarter]: For program point DiskPerfAddDeviceEXIT(lines 2167 2237) no Hoare annotation was computed. [2019-10-02 11:49:30,385 INFO L443 ceAbstractionStarter]: For program point L2205-1(line 2205) no Hoare annotation was computed. [2019-10-02 11:49:30,385 INFO L443 ceAbstractionStarter]: For program point L2205(line 2205) no Hoare annotation was computed. [2019-10-02 11:49:30,385 INFO L443 ceAbstractionStarter]: For program point L2195-1(line 2195) no Hoare annotation was computed. [2019-10-02 11:49:30,385 INFO L443 ceAbstractionStarter]: For program point L2226(line 2226) no Hoare annotation was computed. [2019-10-02 11:49:30,385 INFO L443 ceAbstractionStarter]: For program point L2195(line 2195) no Hoare annotation was computed. [2019-10-02 11:49:30,385 INFO L443 ceAbstractionStarter]: For program point L2226-1(line 2226) no Hoare annotation was computed. [2019-10-02 11:49:30,386 INFO L443 ceAbstractionStarter]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2019-10-02 11:49:30,386 INFO L443 ceAbstractionStarter]: For program point L2191(line 2191) no Hoare annotation was computed. [2019-10-02 11:49:30,386 INFO L443 ceAbstractionStarter]: For program point L2183(lines 2183 2187) no Hoare annotation was computed. [2019-10-02 11:49:30,386 INFO L443 ceAbstractionStarter]: For program point DiskPerfAddDeviceENTRY(lines 2167 2237) no Hoare annotation was computed. [2019-10-02 11:49:30,386 INFO L443 ceAbstractionStarter]: For program point L2210(lines 2210 2211) no Hoare annotation was computed. [2019-10-02 11:49:30,386 INFO L443 ceAbstractionStarter]: For program point L2210-1(lines 2210 2211) no Hoare annotation was computed. [2019-10-02 11:49:30,386 INFO L443 ceAbstractionStarter]: For program point L2200(line 2200) no Hoare annotation was computed. [2019-10-02 11:49:30,386 INFO L443 ceAbstractionStarter]: For program point L2198(lines 2198 2207) no Hoare annotation was computed. [2019-10-02 11:49:30,386 INFO L443 ceAbstractionStarter]: For program point L2200-1(line 2200) no Hoare annotation was computed. [2019-10-02 11:49:30,386 INFO L443 ceAbstractionStarter]: For program point L2198-2(lines 2198 2207) no Hoare annotation was computed. [2019-10-02 11:49:30,387 INFO L443 ceAbstractionStarter]: For program point DiskPerfAddDeviceFINAL(lines 2167 2237) no Hoare annotation was computed. [2019-10-02 11:49:30,387 INFO L443 ceAbstractionStarter]: For program point L2192(line 2192) no Hoare annotation was computed. [2019-10-02 11:49:30,387 INFO L443 ceAbstractionStarter]: For program point L2192-1(line 2192) no Hoare annotation was computed. [2019-10-02 11:49:30,387 INFO L443 ceAbstractionStarter]: For program point L2180(lines 2180 2181) no Hoare annotation was computed. [2019-10-02 11:49:30,387 INFO L443 ceAbstractionStarter]: For program point L2213(lines 2213 2220) no Hoare annotation was computed. [2019-10-02 11:49:30,387 INFO L443 ceAbstractionStarter]: For program point L2180-1(lines 2180 2181) no Hoare annotation was computed. [2019-10-02 11:49:30,387 INFO L443 ceAbstractionStarter]: For program point IoFreeMdlENTRY(lines 3927 3933) no Hoare annotation was computed. [2019-10-02 11:49:30,387 INFO L443 ceAbstractionStarter]: For program point IoFreeMdlFINAL(lines 3927 3933) no Hoare annotation was computed. [2019-10-02 11:49:30,387 INFO L443 ceAbstractionStarter]: For program point IoFreeMdlEXIT(lines 3927 3933) no Hoare annotation was computed. [2019-10-02 11:49:30,387 INFO L439 ceAbstractionStarter]: At program point L2393(line 2393) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,388 INFO L443 ceAbstractionStarter]: For program point L2391(lines 2391 2405) no Hoare annotation was computed. [2019-10-02 11:49:30,388 INFO L443 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 2373 2426) no Hoare annotation was computed. [2019-10-02 11:49:30,388 INFO L439 ceAbstractionStarter]: At program point L2387-1(line 2387) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0))) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,388 INFO L439 ceAbstractionStarter]: At program point L2418(line 2418) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (and (not (= 1 ~pended~0)) (= 0 ~routine~0) (<= 259 DiskPerfForwardIrpSynchronous_~status~4) (<= DiskPerfForwardIrpSynchronous_~status~4 259) (= ~MPR3~0 ~s~0) (= 1 ~compRegistered~0) (= ~setEventCalled~0 1))) [2019-10-02 11:49:30,388 INFO L439 ceAbstractionStarter]: At program point L2387(line 2387) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0))) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,388 INFO L443 ceAbstractionStarter]: For program point L2416(lines 2416 2423) no Hoare annotation was computed. [2019-10-02 11:49:30,388 INFO L443 ceAbstractionStarter]: For program point L2418-1(line 2418) no Hoare annotation was computed. [2019-10-02 11:49:30,388 INFO L439 ceAbstractionStarter]: At program point L2414(line 2414) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (and (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0)) (= 1 ~compRegistered~0)) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,389 INFO L443 ceAbstractionStarter]: For program point L2416-2(lines 2416 2423) no Hoare annotation was computed. [2019-10-02 11:49:30,389 INFO L443 ceAbstractionStarter]: For program point L2414-1(line 2414) no Hoare annotation was computed. [2019-10-02 11:49:30,389 INFO L439 ceAbstractionStarter]: At program point L2398(line 2398) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0)) [2019-10-02 11:49:30,389 INFO L443 ceAbstractionStarter]: For program point L2396(lines 2396 2404) no Hoare annotation was computed. [2019-10-02 11:49:30,389 INFO L443 ceAbstractionStarter]: For program point L2396-1(lines 2391 2405) no Hoare annotation was computed. [2019-10-02 11:49:30,389 INFO L443 ceAbstractionStarter]: For program point L2388(line 2388) no Hoare annotation was computed. [2019-10-02 11:49:30,389 INFO L439 ceAbstractionStarter]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 2373 2426) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 ~routine~0) (not (= 1 ~pended~0))) (= ~SKIP1~0 ~MPR1~0) (= 1 |old(~pended~0)|) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~SKIP2~0 ~IPC~0) (= ~NP~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0))) [2019-10-02 11:49:30,389 INFO L443 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 2373 2426) no Hoare annotation was computed. [2019-10-02 11:49:30,389 INFO L443 ceAbstractionStarter]: For program point L2785-1(line 2785) no Hoare annotation was computed. [2019-10-02 11:49:30,390 INFO L439 ceAbstractionStarter]: At program point L2785(line 2785) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 |old(~s~0)|) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,390 INFO L443 ceAbstractionStarter]: For program point L2942(lines 2942 2962) no Hoare annotation was computed. [2019-10-02 11:49:30,390 INFO L439 ceAbstractionStarter]: At program point L2876(line 2876) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,390 INFO L443 ceAbstractionStarter]: For program point L2909-1(line 2909) no Hoare annotation was computed. [2019-10-02 11:49:30,390 INFO L439 ceAbstractionStarter]: At program point L2909(line 2909) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,390 INFO L439 ceAbstractionStarter]: At program point L2942-1(lines 2802 2964) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,390 INFO L443 ceAbstractionStarter]: For program point L2876-1(line 2876) no Hoare annotation was computed. [2019-10-02 11:49:30,391 INFO L443 ceAbstractionStarter]: For program point L2835-1(line 2835) no Hoare annotation was computed. [2019-10-02 11:49:30,391 INFO L439 ceAbstractionStarter]: At program point L2835(line 2835) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,391 INFO L443 ceAbstractionStarter]: For program point L2794(lines 2794 2801) no Hoare annotation was computed. [2019-10-02 11:49:30,391 INFO L443 ceAbstractionStarter]: For program point L2794-2(lines 2774 2976) no Hoare annotation was computed. [2019-10-02 11:49:30,391 INFO L443 ceAbstractionStarter]: For program point L2852(lines 2812 2964) no Hoare annotation was computed. [2019-10-02 11:49:30,391 INFO L443 ceAbstractionStarter]: For program point L2885(lines 2885 2892) no Hoare annotation was computed. [2019-10-02 11:49:30,391 INFO L439 ceAbstractionStarter]: At program point L2910(line 2910) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,392 INFO L439 ceAbstractionStarter]: At program point L2943(lines 2939 2963) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,392 INFO L443 ceAbstractionStarter]: For program point L2844(lines 2844 2851) no Hoare annotation was computed. [2019-10-02 11:49:30,392 INFO L443 ceAbstractionStarter]: For program point L2910-1(line 2910) no Hoare annotation was computed. [2019-10-02 11:49:30,392 INFO L443 ceAbstractionStarter]: For program point L2844-2(lines 2812 2964) no Hoare annotation was computed. [2019-10-02 11:49:30,392 INFO L443 ceAbstractionStarter]: For program point L2968(lines 2968 2974) no Hoare annotation was computed. [2019-10-02 11:49:30,392 INFO L443 ceAbstractionStarter]: For program point L2968-1(lines 2968 2974) no Hoare annotation was computed. [2019-10-02 11:49:30,392 INFO L443 ceAbstractionStarter]: For program point L2869-1(lines 2869 2871) no Hoare annotation was computed. [2019-10-02 11:49:30,392 INFO L439 ceAbstractionStarter]: At program point L2869(lines 2869 2871) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,392 INFO L439 ceAbstractionStarter]: At program point L2828(lines 2828 2830) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,393 INFO L443 ceAbstractionStarter]: For program point L2861-1(line 2861) no Hoare annotation was computed. [2019-10-02 11:49:30,393 INFO L439 ceAbstractionStarter]: At program point L2861(line 2861) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,393 INFO L443 ceAbstractionStarter]: For program point L2828-1(lines 2828 2830) no Hoare annotation was computed. [2019-10-02 11:49:30,393 INFO L439 ceAbstractionStarter]: At program point L2820(line 2820) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,393 INFO L443 ceAbstractionStarter]: For program point L2820-1(line 2820) no Hoare annotation was computed. [2019-10-02 11:49:30,393 INFO L443 ceAbstractionStarter]: For program point L2779-1(lines 2779 2781) no Hoare annotation was computed. [2019-10-02 11:49:30,393 INFO L439 ceAbstractionStarter]: At program point L2779(lines 2779 2781) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 |old(~s~0)|) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,394 INFO L439 ceAbstractionStarter]: At program point L2796(line 2796) the Hoare annotation is: (let ((.cse0 (not (= 1 ~pended~0))) (.cse2 (= ~setEventCalled~0 1)) (.cse1 (= DiskPerfRegisterDevice_~status~7 259))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 |old(~s~0)|) .cse0 .cse1 .cse2) (and (and .cse0 (= ~MPR3~0 ~s~0) .cse2) .cse1))) [2019-10-02 11:49:30,394 INFO L443 ceAbstractionStarter]: For program point L2796-1(line 2796) no Hoare annotation was computed. [2019-10-02 11:49:30,394 INFO L443 ceAbstractionStarter]: For program point L2920(lines 2920 2927) no Hoare annotation was computed. [2019-10-02 11:49:30,394 INFO L443 ceAbstractionStarter]: For program point L2887-1(line 2887) no Hoare annotation was computed. [2019-10-02 11:49:30,394 INFO L439 ceAbstractionStarter]: At program point L2887(line 2887) the Hoare annotation is: (let ((.cse0 (not (= 1 ~pended~0))) (.cse1 (= DiskPerfRegisterDevice_~status~7 259)) (.cse2 (= ~setEventCalled~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and .cse0 (= ~MPR3~0 ~s~0) .cse1 .cse2) (and (= ~s~0 |old(~s~0)|) .cse0 .cse1 .cse2))) [2019-10-02 11:49:30,394 INFO L439 ceAbstractionStarter]: At program point L2945(line 2945) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,394 INFO L439 ceAbstractionStarter]: At program point L2846(line 2846) the Hoare annotation is: (let ((.cse0 (not (= 1 ~pended~0))) (.cse1 (= DiskPerfRegisterDevice_~status~7 259)) (.cse2 (= ~setEventCalled~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and .cse0 (= ~MPR3~0 ~s~0) .cse1 .cse2) (and (= ~s~0 |old(~s~0)|) .cse0 .cse1 .cse2))) [2019-10-02 11:49:30,394 INFO L443 ceAbstractionStarter]: For program point L2846-1(line 2846) no Hoare annotation was computed. [2019-10-02 11:49:30,394 INFO L439 ceAbstractionStarter]: At program point L2970(line 2970) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,394 INFO L443 ceAbstractionStarter]: For program point L2929-1(line 2929) no Hoare annotation was computed. [2019-10-02 11:49:30,394 INFO L439 ceAbstractionStarter]: At program point L2929(line 2929) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,395 INFO L443 ceAbstractionStarter]: For program point L2946(lines 2946 2947) no Hoare annotation was computed. [2019-10-02 11:49:30,395 INFO L439 ceAbstractionStarter]: At program point DiskPerfRegisterDeviceENTRY(lines 2760 2977) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 |old(~s~0)|) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,395 INFO L439 ceAbstractionStarter]: At program point L2922(line 2922) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,395 INFO L439 ceAbstractionStarter]: At program point L2856(line 2856) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,395 INFO L443 ceAbstractionStarter]: For program point L2922-1(line 2922) no Hoare annotation was computed. [2019-10-02 11:49:30,395 INFO L443 ceAbstractionStarter]: For program point L2856-1(line 2856) no Hoare annotation was computed. [2019-10-02 11:49:30,395 INFO L439 ceAbstractionStarter]: At program point L2914(line 2914) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,395 INFO L443 ceAbstractionStarter]: For program point L2914-1(line 2914) no Hoare annotation was computed. [2019-10-02 11:49:30,395 INFO L443 ceAbstractionStarter]: For program point L2815-1(line 2815) no Hoare annotation was computed. [2019-10-02 11:49:30,395 INFO L439 ceAbstractionStarter]: At program point L2815(line 2815) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,395 INFO L443 ceAbstractionStarter]: For program point L2873(lines 2873 2881) no Hoare annotation was computed. [2019-10-02 11:49:30,395 INFO L443 ceAbstractionStarter]: For program point L2931(lines 2931 2938) no Hoare annotation was computed. [2019-10-02 11:49:30,395 INFO L443 ceAbstractionStarter]: For program point L2832(lines 2832 2840) no Hoare annotation was computed. [2019-10-02 11:49:30,396 INFO L443 ceAbstractionStarter]: For program point L2931-2(lines 2812 2964) no Hoare annotation was computed. [2019-10-02 11:49:30,396 INFO L439 ceAbstractionStarter]: At program point L2956(lines 2956 2957) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,396 INFO L439 ceAbstractionStarter]: At program point L2956-1(lines 2956 2957) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,396 INFO L443 ceAbstractionStarter]: For program point L2783(lines 2783 2790) no Hoare annotation was computed. [2019-10-02 11:49:30,396 INFO L439 ceAbstractionStarter]: At program point L2808(line 2808) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,396 INFO L439 ceAbstractionStarter]: At program point L2808-1(line 2808) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,396 INFO L443 ceAbstractionStarter]: For program point L2899-1(line 2899) no Hoare annotation was computed. [2019-10-02 11:49:30,396 INFO L439 ceAbstractionStarter]: At program point L2899(line 2899) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,396 INFO L439 ceAbstractionStarter]: At program point L2792(line 2792) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 |old(~s~0)|) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,396 INFO L443 ceAbstractionStarter]: For program point L2792-1(line 2792) no Hoare annotation was computed. [2019-10-02 11:49:30,396 INFO L439 ceAbstractionStarter]: At program point L2916(lines 2916 2918) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,397 INFO L443 ceAbstractionStarter]: For program point L2949(lines 2949 2953) no Hoare annotation was computed. [2019-10-02 11:49:30,397 INFO L443 ceAbstractionStarter]: For program point L2883-1(line 2883) no Hoare annotation was computed. [2019-10-02 11:49:30,397 INFO L439 ceAbstractionStarter]: At program point L2883(line 2883) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,397 INFO L443 ceAbstractionStarter]: For program point L2916-1(lines 2916 2918) no Hoare annotation was computed. [2019-10-02 11:49:30,397 INFO L439 ceAbstractionStarter]: At program point L2842(line 2842) the Hoare annotation is: (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)))) [2019-10-02 11:49:30,397 INFO L443 ceAbstractionStarter]: For program point L2809(lines 2809 2810) no Hoare annotation was computed. [2019-10-02 11:49:30,397 INFO L443 ceAbstractionStarter]: For program point L2842-1(line 2842) no Hoare annotation was computed. [2019-10-02 11:49:30,397 INFO L443 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 2760 2977) no Hoare annotation was computed. [2019-10-02 11:49:30,397 INFO L443 ceAbstractionStarter]: For program point L2966(line 2966) no Hoare annotation was computed. [2019-10-02 11:49:30,397 INFO L443 ceAbstractionStarter]: For program point L2933-1(line 2933) no Hoare annotation was computed. [2019-10-02 11:49:30,397 INFO L439 ceAbstractionStarter]: At program point L2933(line 2933) the Hoare annotation is: (let ((.cse0 (not (= 1 ~pended~0))) (.cse1 (= DiskPerfRegisterDevice_~status~7 259)) (.cse2 (= ~setEventCalled~0 1))) (or (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (= ~SKIP2~0 ~IPC~0) (= 1 |old(~pended~0)|) (= ~SKIP2~0 ~DC~0)) (not (= |old(~s~0)| ~NP~0)) (= ~myStatus~0 259) (= ~NP~0 ~MPR3~0) (= ~NP~0 ~MPR1~0)) (and .cse0 (= ~MPR3~0 ~s~0) .cse1 .cse2) (and (= ~s~0 |old(~s~0)|) .cse0 .cse1 .cse2))) [2019-10-02 11:49:30,397 INFO L443 ceAbstractionStarter]: For program point L2958(lines 2958 2959) no Hoare annotation was computed. [2019-10-02 11:49:30,397 INFO L443 ceAbstractionStarter]: For program point L2859(lines 2859 2866) no Hoare annotation was computed. [2019-10-02 11:49:30,397 INFO L443 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 2760 2977) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L2818(lines 2818 2825) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point RtlQueryRegistryValuesEXIT(lines 4676 4698) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point RtlQueryRegistryValuesENTRY(lines 4676 4698) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L4693(lines 4676 4698) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L4686(lines 4685 4695) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L4683(lines 4682 4696) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L4682(lines 4682 4696) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L2562-1(lines 2562 2566) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 2528 2595) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L2581(lines 2581 2592) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L2581-2(lines 2581 2592) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L2544(lines 2544 2548) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L2567(lines 2567 2575) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L2567-2(lines 2567 2575) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L443 ceAbstractionStarter]: For program point L2557-1(line 2557) no Hoare annotation was computed. [2019-10-02 11:49:30,398 INFO L446 ceAbstractionStarter]: At program point L2557(line 2557) the Hoare annotation is: true [2019-10-02 11:49:30,399 INFO L446 ceAbstractionStarter]: At program point L2586(line 2586) the Hoare annotation is: true [2019-10-02 11:49:30,399 INFO L443 ceAbstractionStarter]: For program point L2555(lines 2555 2561) no Hoare annotation was computed. [2019-10-02 11:49:30,399 INFO L443 ceAbstractionStarter]: For program point L2553-1(line 2553) no Hoare annotation was computed. [2019-10-02 11:49:30,399 INFO L446 ceAbstractionStarter]: At program point L2553(line 2553) the Hoare annotation is: true [2019-10-02 11:49:30,399 INFO L443 ceAbstractionStarter]: For program point L2555-2(lines 2537 2594) no Hoare annotation was computed. [2019-10-02 11:49:30,399 INFO L443 ceAbstractionStarter]: For program point L2586-1(lines 2582 2588) no Hoare annotation was computed. [2019-10-02 11:49:30,399 INFO L443 ceAbstractionStarter]: For program point L2551-1(line 2551) no Hoare annotation was computed. [2019-10-02 11:49:30,399 INFO L443 ceAbstractionStarter]: For program point L2582(lines 2582 2588) no Hoare annotation was computed. [2019-10-02 11:49:30,399 INFO L446 ceAbstractionStarter]: At program point L2551(line 2551) the Hoare annotation is: true [2019-10-02 11:49:30,399 INFO L443 ceAbstractionStarter]: For program point L2576(lines 2576 2580) no Hoare annotation was computed. [2019-10-02 11:49:30,399 INFO L443 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 2528 2595) no Hoare annotation was computed. [2019-10-02 11:49:30,399 INFO L443 ceAbstractionStarter]: For program point L2576-2(lines 2576 2580) no Hoare annotation was computed. [2019-10-02 11:49:30,399 INFO L446 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 2528 2595) the Hoare annotation is: true [2019-10-02 11:49:30,399 INFO L443 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-10-02 11:49:30,399 INFO L443 ceAbstractionStarter]: For program point memcpy_guardEXIT(lines 11 16) no Hoare annotation was computed. [2019-10-02 11:49:30,399 INFO L446 ceAbstractionStarter]: At program point memcpy_guardENTRY(lines 11 16) the Hoare annotation is: true [2019-10-02 11:49:30,400 INFO L443 ceAbstractionStarter]: For program point memcpy_guardFINAL(lines 11 16) no Hoare annotation was computed. [2019-10-02 11:49:30,400 INFO L443 ceAbstractionStarter]: For program point ExAllocatePoolWithTagFINAL(lines 3645 3657) no Hoare annotation was computed. [2019-10-02 11:49:30,400 INFO L443 ceAbstractionStarter]: For program point ExAllocatePoolWithTagEXIT(lines 3645 3657) no Hoare annotation was computed. [2019-10-02 11:49:30,400 INFO L446 ceAbstractionStarter]: At program point ExAllocatePoolWithTagENTRY(lines 3645 3657) the Hoare annotation is: true [2019-10-02 11:49:30,400 INFO L443 ceAbstractionStarter]: For program point IoWriteErrorLogEntryEXIT(line 1676) no Hoare annotation was computed. [2019-10-02 11:49:30,400 INFO L446 ceAbstractionStarter]: At program point IoWriteErrorLogEntryENTRY(line 1676) the Hoare annotation is: true [2019-10-02 11:49:30,400 INFO L443 ceAbstractionStarter]: For program point IoWriteErrorLogEntryFINAL(line 1676) no Hoare annotation was computed. [2019-10-02 11:49:30,400 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:49:30,400 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= 0 ~routine~0) (= ~s~0 ~DC~0) (= ~MPR1~0 ~NP~0) (= ~MPR3~0 ~s~0) (= ~SKIP1~0 ~NP~0) (not (= 259 ~myStatus~0)) (= ~IPC~0 ~s~0) (= ~SKIP1~0 ~s~0)) [2019-10-02 11:49:30,400 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:49:30,400 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:49:30,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:49:30 BoogieIcfgContainer [2019-10-02 11:49:30,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:49:30,455 INFO L168 Benchmark]: Toolchain (without parser) took 413311.29 ms. Allocated memory was 137.9 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 79.0 MB in the beginning and 546.6 MB in the end (delta: -467.6 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 11:49:30,456 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:49:30,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1704.12 ms. Allocated memory was 137.9 MB in the beginning and 215.0 MB in the end (delta: 77.1 MB). Free memory was 78.7 MB in the beginning and 78.7 MB in the end (delta: 53.0 kB). Peak memory consumption was 91.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:49:30,457 INFO L168 Benchmark]: Boogie Preprocessor took 419.08 ms. Allocated memory was 215.0 MB in the beginning and 272.6 MB in the end (delta: 57.7 MB). Free memory was 78.7 MB in the beginning and 167.1 MB in the end (delta: -88.4 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. [2019-10-02 11:49:30,458 INFO L168 Benchmark]: RCFGBuilder took 103831.19 ms. Allocated memory was 272.6 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 167.1 MB in the beginning and 77.4 MB in the end (delta: 89.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-10-02 11:49:30,458 INFO L168 Benchmark]: TraceAbstraction took 307352.18 ms. Allocated memory was 1.6 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 77.4 MB in the beginning and 546.6 MB in the end (delta: -469.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-10-02 11:49:30,461 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1704.12 ms. Allocated memory was 137.9 MB in the beginning and 215.0 MB in the end (delta: 77.1 MB). Free memory was 78.7 MB in the beginning and 78.7 MB in the end (delta: 53.0 kB). Peak memory consumption was 91.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 419.08 ms. Allocated memory was 215.0 MB in the beginning and 272.6 MB in the end (delta: 57.7 MB). Free memory was 78.7 MB in the beginning and 167.1 MB in the end (delta: -88.4 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 103831.19 ms. Allocated memory was 272.6 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 167.1 MB in the beginning and 77.4 MB in the end (delta: 89.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * TraceAbstraction took 307352.18 ms. Allocated memory was 1.6 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 77.4 MB in the beginning and 546.6 MB in the end (delta: -469.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2039]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3554]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(1 == pended) && !(status == 259)) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) || 1 == \old(pended)) || s == UNLOADED) || !(\old(SKIP2) == \old(s))) || (((((lowerDriverReturn == status && !(SKIP2 == DC)) && !(IPC == DC)) && !(1 == pended)) && !(SKIP2 == s)) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(SKIP1) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((((((lowerDriverReturn == status && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && !(1 == pended)) && !(SKIP2 == IPC)) && SKIP2 == s) && !(SKIP1 == NP)) - InvariantResult [Line: 3496]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(SKIP1) == \old(NP))) || ((((((((((((i_1 <= 4 && !(MPR1 == SKIP1)) && !(SKIP2 == IPC)) && s == NP) && 0 == compRegistered) && 0 == routine) && !(259 == myStatus)) && !(MPR1 == NP)) && !(SKIP2 == DC)) && !(IPC == DC)) && !(1 == pended)) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: ((((((((DC == IPC || SKIP1 == MPR1) || (!(1 == pended) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) && ((((((((((!(SKIP2 == DC) && !(IPC == DC)) && !(SKIP2 == IPC)) && !(1 == pended)) && 259 == returnVal2) && MPR1 == s) && setEventCalled == 1) && 0 == compRetStatus + 1073741802) || (((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || (((((((!(SKIP2 == DC) && !(IPC == DC)) && !(SKIP2 == IPC)) && !(1 == pended)) && MPR1 == s) && 0 == returnVal2) && setEventCalled == 1) && 0 == compRetStatus + 1073741802) || (((((((!(SKIP2 == DC) && !(IPC == DC)) && !(SKIP2 == IPC)) && !(1 == pended)) && returnVal2 + 1073741823 <= 0) && MPR1 == s) && setEventCalled == 1) && 0 == compRetStatus + 1073741802))) && ((((((DC == IPC || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) || (!(1 == pended) && s == NP)) - InvariantResult [Line: 2634]: Loop Invariant Derived loop invariant: ((((((!(1 == pended) && s == NP) || DC == IPC) || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC - InvariantResult [Line: 4435]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(1 == pended) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC - InvariantResult [Line: 2635]: Loop Invariant Derived loop invariant: ((((((!(1 == pended) && s == NP) || DC == IPC) || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC - InvariantResult [Line: 2251]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == MPR1 || 1 == \old(pended)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || NP == MPR3) || !(\old(compRegistered) == 0)) || ((!(1 == pended) && 0 == compRegistered) && s == \old(s)) - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3505]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2248]: Loop Invariant Derived loop invariant: (((((((((((((((0 == compRegistered && s == \old(s)) && 0 == routine) && !(1 == pended)) && myStatus == \old(myStatus)) || SKIP1 == MPR1) || 1 == \old(pended)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || NP == MPR3) || !(\old(compRegistered) == 0) - InvariantResult [Line: 4112]: Loop Invariant Derived loop invariant: ((((((((DC == IPC || SKIP1 == MPR1) || (!(1 == pended) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) && ((((((DC == IPC || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) || (!(1 == pended) && s == NP))) && ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || (((!(1 == pended) && MPR1 == s) && setEventCalled == 1) && 0 == compRetStatus + 1073741802)) - InvariantResult [Line: 3490]: Loop Invariant Derived loop invariant: (((((((((((((((!(SKIP2 == DC) && !(IPC == DC)) && !(1 == pended)) && s == NP) && 0 == compRegistered) || 1 == \old(pended)) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(SKIP1) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4299]: Loop Invariant Derived loop invariant: ((((((((!(\old(setEventCalled) == 1) || s == NP) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || NP == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || (SKIP1 == NP || SKIP1 == MPR1) || ((DC == IPC || 1 == pended) || SKIP2 == DC) || SKIP2 == IPC) && (((((((((((((!(\old(setEventCalled) == 1) || SKIP1 == MPR1) || 1 == pended) || NP == MPR1) || SKIP2 == DC) || (s == \old(s) && setEventCalled == 1)) || DC == IPC) || SKIP1 == NP) || !(0 == routine)) || !(\old(s) == NP)) || myStatus == 259) || !(compRegistered == 1)) || SKIP2 == IPC) || NP == MPR3) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3499]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || !(\old(SKIP2) == \old(s))) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && !(1 == pended)) && !(SKIP2 == IPC)) && s == NP) && 0 == compRegistered) && !(SKIP1 == NP))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(SKIP1) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 4462]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(1 == pended) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC - InvariantResult [Line: 4118]: Loop Invariant Derived loop invariant: ((((((((DC == IPC || SKIP1 == MPR1) || (!(1 == pended) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) && ((((((DC == IPC || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) || (!(1 == pended) && s == NP))) && ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || (((!(1 == pended) && MPR1 == s) && setEventCalled == 1) && 0 == compRetStatus + 1073741802)) - InvariantResult [Line: 2939]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || myStatus == 259) || NP == MPR3) || NP == MPR1) || (s == NP && !(1 == pended)) - InvariantResult [Line: 3330]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(SKIP1) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((((((((((((i_1 <= 3 && 0 == compRegistered) && s == UNLOADED) && SKIP2 == s) && 0 == routine) && s == DC) && IPC == s) && !(1 == pended)) && MPR1 == NP) && MPR3 == s) && SKIP1 == NP) && NP == \old(s)) && myStatus == \old(myStatus)) && SKIP1 == s) - InvariantResult [Line: 3804]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3562]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(1 == pended) && !(status == 259)) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) || 1 == \old(pended)) || s == UNLOADED) || !(\old(SKIP2) == \old(s))) || (((((lowerDriverReturn == status && !(SKIP2 == DC)) && !(IPC == DC)) && !(1 == pended)) && !(SKIP2 == s)) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(SKIP1) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((((((lowerDriverReturn == status && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && !(1 == pended)) && !(SKIP2 == IPC)) && SKIP2 == s) && !(SKIP1 == NP)) - InvariantResult [Line: 3493]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((!(SKIP2 == DC) && !(IPC == DC)) && !(1 == pended)) && !(SKIP2 == IPC)) && s == NP) && 0 == compRegistered)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(SKIP1) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 4274]: Loop Invariant Derived loop invariant: (((((((!(\old(setEventCalled) == 1) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || NP == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || (SKIP1 == NP || SKIP1 == MPR1) || ((DC == IPC || 1 == pended) || SKIP2 == DC) || SKIP2 == IPC) && (((((((((((((!(\old(setEventCalled) == 1) || SKIP1 == MPR1) || (s == \old(s) && setEventCalled == 1)) || 1 == pended) || NP == MPR1) || SKIP2 == DC) || DC == IPC) || SKIP1 == NP) || !(0 == routine)) || !(\old(s) == NP)) || myStatus == 259) || !(compRegistered == 1)) || SKIP2 == IPC) || NP == MPR3) - InvariantResult [Line: 4468]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(1 == pended) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2253]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == MPR1 || 1 == \old(pended)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || NP == MPR3) || !(\old(compRegistered) == 0)) || ((((!(status == 259) && 0 == routine) && s == DC) && !(1 == pended)) && 1 == compRegistered) - InvariantResult [Line: 3466]: Loop Invariant Derived loop invariant: (((((((((((((((((!(1 == pended) && !(status == 259)) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) || 1 == \old(pended)) || !(\old(SKIP2) == \old(s))) || (((((lowerDriverReturn == status && !(SKIP2 == DC)) && !(IPC == DC)) && !(1 == pended)) && !(SKIP2 == s)) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(SKIP1) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || (((((((lowerDriverReturn == status && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && !(SKIP2 == IPC)) && !(1 == pended)) && SKIP2 == s) && !(SKIP1 == NP))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3576]: Loop Invariant Derived loop invariant: (((((((((((((((((!(MPR1 == SKIP1) && (((((!(1 == pended) && !(SKIP2 == IPC)) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) || (lowerDriverReturn == status && ((!(SKIP2 == DC) && !(IPC == DC)) && !(SKIP2 == IPC)) && !(1 == pended)))) && SKIP2 == s) && !(SKIP1 == NP)) || ((((!(1 == pended) && !(status == 259)) && !(SKIP2 == s)) && s == DC) && !(IPC == s))) || 1 == \old(pended)) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(SKIP1) == \old(NP))) || ((lowerDriverReturn == status && ((!(SKIP2 == DC) && !(IPC == DC)) && !(SKIP2 == IPC)) && !(1 == pended)) && IPC == s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (!(status == 259) && (((((!(MPR1 == SKIP1) && (((((!(1 == pended) && !(SKIP2 == IPC)) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) || (lowerDriverReturn == status && ((!(SKIP2 == DC) && !(IPC == DC)) && !(SKIP2 == IPC)) && !(1 == pended)))) && 0 == routine) && 1 == compRegistered) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR1 == NP)) - InvariantResult [Line: 4465]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || (!(1 == pended) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC - InvariantResult [Line: 3502]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((!(SKIP2 == DC) && !(IPC == DC)) && !(1 == pended)) && !(SKIP2 == IPC)) && s == NP) && 0 == compRegistered)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(SKIP1) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: 2245]: Loop Invariant Derived loop invariant: (((((((((((((((0 == compRegistered && s == \old(s)) && 0 == routine) && !(1 == pended)) && myStatus == \old(myStatus)) || SKIP1 == MPR1) || 1 == \old(pended)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(0 == \old(routine))) || !(\old(s) == NP)) || \old(myStatus) == 259) || SKIP2 == IPC) || NP == MPR3) || !(\old(compRegistered) == 0) - InvariantResult [Line: 4115]: Loop Invariant Derived loop invariant: ((((((((DC == IPC || SKIP1 == MPR1) || (!(1 == pended) && SKIP1 == s)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 == DC) && ((((((DC == IPC || !(\old(s) == NP)) || SKIP2 == IPC) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 == DC) || (!(1 == pended) && s == NP))) && ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == routine)) || !(compRegistered == 1)) || SKIP2 == IPC) || 1 == \old(pended)) || SKIP2 == DC) || !(\old(s) == NP)) || NP == MPR3) || NP == MPR1) || myStatus == 259) || (((!(1 == pended) && MPR1 == s) && setEventCalled == 1) && 0 == compRetStatus + 1073741802)) - InvariantResult [Line: 4296]: Loop Invariant Derived loop invariant: ((((((((!(\old(setEventCalled) == 1) || s == NP) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || NP == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || (SKIP1 == NP || SKIP1 == MPR1) || ((DC == IPC || 1 == pended) || SKIP2 == DC) || SKIP2 == IPC) && (((((((((((((!(\old(setEventCalled) == 1) || SKIP1 == MPR1) || 1 == pended) || NP == MPR1) || SKIP2 == DC) || (s == \old(s) && setEventCalled == 1)) || DC == IPC) || SKIP1 == NP) || !(0 == routine)) || !(\old(s) == NP)) || myStatus == 259) || !(compRegistered == 1)) || SKIP2 == IPC) || NP == MPR3) - InvariantResult [Line: 3256]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || ((((((((((((0 == compRegistered && s == UNLOADED) && SKIP2 == s) && 0 == routine) && s == DC) && IPC == s) && !(1 == pended)) && SKIP1 == NP) && NP == \old(s)) && SKIP1 == s) && MPR1 == NP) && MPR3 == s) && myStatus == \old(myStatus))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || !(\old(SKIP1) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 101 procedures, 777 locations, 1 error locations. SAFE Result, 307.2s OverallTime, 50 OverallIterations, 6 TraceHistogramMax, 188.1s AutomataDifference, 0.0s DeadEndRemovalTime, 27.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 22809 SDtfs, 12378 SDslu, 56652 SDs, 0 SdLazy, 14674 SolverSat, 2961 SolverUnsat, 74 SolverUnknown, 0 SolverNotchecked, 177.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1302 GetRequests, 997 SyntacticMatches, 2 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3308occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 50 MinimizatonAttempts, 5912 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 166 LocationsWithAnnotation, 15154 PreInvPairs, 17669 NumberOfFragments, 7599 HoareAnnotationTreeSize, 15154 FomulaSimplifications, 85198616 FormulaSimplificationTreeSizeReduction, 6.5s HoareSimplificationTime, 166 FomulaSimplificationsInter, 200418 FormulaSimplificationTreeSizeReductionInter, 20.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 5.0s SsaConstructionTime, 62.8s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 5946 NumberOfCodeBlocks, 5917 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 5890 ConstructedInterpolants, 0 QuantifiedInterpolants, 1034485 SizeOfPredicates, 7 NumberOfNonLiveVariables, 36068 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 56 InterpolantComputations, 46 PerfectInterpolantSequences, 1890/1962 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...