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-112bae1 [2019-09-07 13:05:18,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:05:18,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:05:18,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:05:18,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:05:18,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:05:18,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:05:18,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:05:18,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:05:18,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:05:18,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:05:18,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:05:18,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:05:18,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:05:18,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:05:18,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:05:18,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:05:18,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:05:18,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:05:18,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:05:18,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:05:18,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:05:18,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:05:18,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:05:18,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:05:18,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:05:18,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:05:18,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:05:18,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:05:18,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:05:18,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:05:18,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:05:18,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:05:18,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:05:18,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:05:18,689 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:05:18,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:05:18,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:05:18,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:05:18,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:05:18,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:05:18,693 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-09-07 13:05:18,707 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:05:18,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:05:18,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:05:18,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:05:18,709 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:05:18,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:05:18,709 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:05:18,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:05:18,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:05:18,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:05:18,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:05:18,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:05:18,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:05:18,711 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:05:18,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:05:18,711 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:05:18,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:05:18,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:05:18,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:05:18,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:05:18,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:05:18,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:05:18,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:05:18,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:05:18,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:05:18,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:05:18,713 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:05:18,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:05:18,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:05:18,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:05:18,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:05:18,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:05:18,757 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:05:18,758 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:05:18,758 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-09-07 13:05:18,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b1b47f3/3abc905668f14d7bb2ed5fafa8076824/FLAGa4811aac4 [2019-09-07 13:05:19,558 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:05:19,560 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/diskperf.i.cil-1.c [2019-09-07 13:05:19,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b1b47f3/3abc905668f14d7bb2ed5fafa8076824/FLAGa4811aac4 [2019-09-07 13:05:19,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b1b47f3/3abc905668f14d7bb2ed5fafa8076824 [2019-09-07 13:05:19,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:05:19,649 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:05:19,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:05:19,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:05:19,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:05:19,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:05:19" (1/1) ... [2019-09-07 13:05:19,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e291c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:19, skipping insertion in model container [2019-09-07 13:05:19,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:05:19" (1/1) ... [2019-09-07 13:05:19,669 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:05:19,777 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:05:20,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:05:21,040 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:05:21,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:05:21,498 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:05:21,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:21 WrapperNode [2019-09-07 13:05:21,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:05:21,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:05:21,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:05:21,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:05:21,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:21" (1/1) ... [2019-09-07 13:05:21,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:21" (1/1) ... [2019-09-07 13:05:21,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:21" (1/1) ... [2019-09-07 13:05:21,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:21" (1/1) ... [2019-09-07 13:05:21,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:21" (1/1) ... [2019-09-07 13:05:21,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:21" (1/1) ... [2019-09-07 13:05:21,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:21" (1/1) ... [2019-09-07 13:05:21,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:05:21,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:05:21,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:05:21,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:05:21,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:21" (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-09-07 13:05:22,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:05:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:05:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2019-09-07 13:05:22,082 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2019-09-07 13:05:22,091 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2019-09-07 13:05:22,091 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2019-09-07 13:05:22,091 INFO L138 BoogieDeclarations]: Found implementation of procedure KeGetCurrentProcessorNumber [2019-09-07 13:05:22,092 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQuerySystemTime [2019-09-07 13:05:22,093 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateErrorLogEntry [2019-09-07 13:05:22,093 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWriteErrorLogEntry [2019-09-07 13:05:22,094 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2019-09-07 13:05:22,095 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryPerformanceCounter [2019-09-07 13:05:22,095 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiCompleteRequest [2019-09-07 13:05:22,096 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-07 13:05:22,096 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-07 13:05:22,098 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2019-09-07 13:05:22,098 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-09-07 13:05:22,098 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfAddDevice [2019-09-07 13:05:22,099 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-09-07 13:05:22,102 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-09-07 13:05:22,102 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-09-07 13:05:22,103 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-09-07 13:05:22,103 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-09-07 13:05:22,103 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-09-07 13:05:22,103 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-09-07 13:05:22,104 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-09-07 13:05:22,104 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfReadWrite [2019-09-07 13:05:22,105 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-09-07 13:05:22,105 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-09-07 13:05:22,105 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfWmi [2019-09-07 13:05:22,105 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-09-07 13:05:22,106 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-09-07 13:05:22,106 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-09-07 13:05:22,106 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfLogError [2019-09-07 13:05:22,106 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskperfQueryWmiRegInfo [2019-09-07 13:05:22,107 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskperfQueryWmiDataBlock [2019-09-07 13:05:22,107 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskperfWmiFunctionControl [2019-09-07 13:05:22,107 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfAddCounters [2019-09-07 13:05:22,107 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-07 13:05:22,107 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:05:22,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2019-09-07 13:05:22,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2019-09-07 13:05:22,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2019-09-07 13:05:22,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2019-09-07 13:05:22,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2019-09-07 13:05:22,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2019-09-07 13:05:22,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2019-09-07 13:05:22,109 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2019-09-07 13:05:22,110 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2019-09-07 13:05:22,110 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2019-09-07 13:05:22,110 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-07 13:05:22,110 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2019-09-07 13:05:22,111 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2019-09-07 13:05:22,111 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2019-09-07 13:05:22,111 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-09-07 13:05:22,111 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2019-09-07 13:05:22,111 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2019-09-07 13:05:22,112 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2019-09-07 13:05:22,112 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2019-09-07 13:05:22,113 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-09-07 13:05:22,114 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-09-07 13:05:22,114 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2019-09-07 13:05:22,114 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-09-07 13:05:22,115 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2019-09-07 13:05:22,115 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-07 13:05:22,115 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-07 13:05:22,116 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-07 13:05:22,116 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2019-09-07 13:05:22,116 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2019-09-07 13:05:22,117 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2019-09-07 13:05:22,117 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2019-09-07 13:05:22,117 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2019-09-07 13:05:22,117 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2019-09-07 13:05:22,118 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2019-09-07 13:05:22,119 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-07 13:05:22,119 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-07 13:05:22,119 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2019-09-07 13:05:22,119 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2019-09-07 13:05:22,120 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2019-09-07 13:05:22,120 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2019-09-07 13:05:22,121 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2019-09-07 13:05:22,121 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2019-09-07 13:05:22,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-09-07 13:05:22,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2019-09-07 13:05:22,123 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-07 13:05:22,123 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2019-09-07 13:05:22,123 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-09-07 13:05:22,123 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2019-09-07 13:05:22,124 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2019-09-07 13:05:22,124 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2019-09-07 13:05:22,124 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2019-09-07 13:05:22,125 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2019-09-07 13:05:22,125 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2019-09-07 13:05:22,125 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2019-09-07 13:05:22,125 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2019-09-07 13:05:22,125 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2019-09-07 13:05:22,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-07 13:05:22,126 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiSystemControl [2019-09-07 13:05:22,126 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-07 13:05:22,126 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-07 13:05:22,126 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-09-07 13:05:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:05:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-07 13:05:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:05:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-07 13:05:22,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-07 13:05:22,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-07 13:05:22,128 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-07 13:05:22,128 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2019-09-07 13:05:22,128 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-07 13:05:22,128 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-09-07 13:05:22,128 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-07 13:05:22,128 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-07 13:05:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2019-09-07 13:05:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2019-09-07 13:05:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2019-09-07 13:05:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2019-09-07 13:05:22,129 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2019-09-07 13:05:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2019-09-07 13:05:22,130 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2019-09-07 13:05:22,131 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2019-09-07 13:05:22,131 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2019-09-07 13:05:22,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 13:05:22,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 13:05:22,132 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2019-09-07 13:05:22,132 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2019-09-07 13:05:22,132 INFO L130 BoogieDeclarations]: Found specification of procedure KeGetCurrentProcessorNumber [2019-09-07 13:05:22,133 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2019-09-07 13:05:22,133 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-07 13:05:22,133 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2019-09-07 13:05:22,133 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2019-09-07 13:05:22,134 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2019-09-07 13:05:22,134 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-07 13:05:22,134 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2019-09-07 13:05:22,134 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2019-09-07 13:05:22,134 INFO L130 BoogieDeclarations]: Found specification of procedure KeQuerySystemTime [2019-09-07 13:05:22,134 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2019-09-07 13:05:22,135 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2019-09-07 13:05:22,135 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2019-09-07 13:05:22,136 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2019-09-07 13:05:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2019-09-07 13:05:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2019-09-07 13:05:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2019-09-07 13:05:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2019-09-07 13:05:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2019-09-07 13:05:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2019-09-07 13:05:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2019-09-07 13:05:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2019-09-07 13:05:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2019-09-07 13:05:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-09-07 13:05:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2019-09-07 13:05:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateErrorLogEntry [2019-09-07 13:05:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-07 13:05:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2019-09-07 13:05:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2019-09-07 13:05:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2019-09-07 13:05:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-07 13:05:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-07 13:05:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-07 13:05:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2019-09-07 13:05:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2019-09-07 13:05:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2019-09-07 13:05:22,152 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-09-07 13:05:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2019-09-07 13:05:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2019-09-07 13:05:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2019-09-07 13:05:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2019-09-07 13:05:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-09-07 13:05:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2019-09-07 13:05:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2019-09-07 13:05:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure IoWriteErrorLogEntry [2019-09-07 13:05:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2019-09-07 13:05:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-09-07 13:05:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-09-07 13:05:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryPerformanceCounter [2019-09-07 13:05:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 13:05:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-07 13:05:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 13:05:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-07 13:05:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2019-09-07 13:05:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-09-07 13:05:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2019-09-07 13:05:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-07 13:05:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure swprintf [2019-09-07 13:05:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure WmiCompleteRequest [2019-09-07 13:05:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure WmiSystemControl [2019-09-07 13:05:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-07 13:05:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-07 13:05:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2019-09-07 13:05:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-09-07 13:05:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfAddDevice [2019-09-07 13:05:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-09-07 13:05:22,159 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-09-07 13:05:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-09-07 13:05:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-09-07 13:05:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-09-07 13:05:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-09-07 13:05:22,160 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfReadWrite [2019-09-07 13:05:22,161 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-09-07 13:05:22,161 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-09-07 13:05:22,161 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-09-07 13:05:22,161 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-09-07 13:05:22,161 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfWmi [2019-09-07 13:05:22,162 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfLogError [2019-09-07 13:05:22,162 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-09-07 13:05:22,163 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-09-07 13:05:22,163 INFO L130 BoogieDeclarations]: Found specification of procedure DiskperfQueryWmiRegInfo [2019-09-07 13:05:22,163 INFO L130 BoogieDeclarations]: Found specification of procedure DiskperfQueryWmiDataBlock [2019-09-07 13:05:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-09-07 13:05:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure DiskperfWmiFunctionControl [2019-09-07 13:05:22,165 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfAddCounters [2019-09-07 13:05:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-07 13:05:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-07 13:05:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-07 13:05:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-09-07 13:05:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-07 13:05:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-07 13:05:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:05:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-07 13:05:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2019-09-07 13:05:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:05:22,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-07 13:05:22,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:05:22,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-07 13:05:22,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-07 13:05:22,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-07 13:05:22,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-07 13:05:23,646 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:23,706 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:23,707 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:23,707 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:23,726 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:23,727 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:23,761 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:23,772 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:23,772 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:23,773 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:23,794 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:23,794 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:23,803 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:23,819 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:23,819 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:23,819 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:23,834 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:23,835 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:23,835 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:23,854 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:23,854 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:23,855 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:23,882 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:23,883 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:24,158 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:24,168 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:24,168 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:24,193 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:24,201 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:24,201 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:24,202 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:24,214 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:24,214 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:24,285 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:24,300 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:24,301 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:24,328 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:24,337 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:24,338 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:24,346 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:26,534 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !false; [2019-09-07 13:05:26,535 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume false; [2019-09-07 13:05:28,918 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:28,964 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-09-07 13:05:28,965 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-09-07 13:05:31,559 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:05:31,568 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:05:31,569 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:05:31,595 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:30,385 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2019-09-07 13:06:30,385 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2019-09-07 13:06:30,473 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:30,496 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:30,496 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:30,784 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:30,793 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:30,794 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:30,800 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:32,921 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-07 13:06:32,921 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-07 13:07:01,330 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:01,383 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-07 13:07:01,384 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-07 13:07:01,413 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:01,432 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-07 13:07:01,432 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-07 13:07:01,498 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:01,506 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:07:01,507 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:07:06,557 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:06,566 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:07:06,566 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:07:11,704 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:07:11,704 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-07 13:07:11,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:07:11 BoogieIcfgContainer [2019-09-07 13:07:11,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:07:11,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:07:11,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:07:11,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:07:11,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:05:19" (1/3) ... [2019-09-07 13:07:11,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c957fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:07:11, skipping insertion in model container [2019-09-07 13:07:11,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:05:21" (2/3) ... [2019-09-07 13:07:11,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c957fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:07:11, skipping insertion in model container [2019-09-07 13:07:11,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:07:11" (3/3) ... [2019-09-07 13:07:11,713 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf.i.cil-1.c [2019-09-07 13:07:11,722 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:07:11,735 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:07:11,758 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:07:11,807 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:07:11,808 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:07:11,808 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:07:11,808 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:07:11,808 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:07:11,808 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:07:11,808 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:07:11,808 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:07:11,808 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:07:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states. [2019-09-07 13:07:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-07 13:07:11,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:11,849 INFO L399 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-09-07 13:07:11,851 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:11,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:11,857 INFO L82 PathProgramCache]: Analyzing trace with hash -489655456, now seen corresponding path program 1 times [2019-09-07 13:07:11,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:11,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:11,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:11,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:11,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:12,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:12,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 13:07:12,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 13:07:12,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 13:07:12,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 13:07:12,895 INFO L87 Difference]: Start difference. First operand 533 states. Second operand 2 states. [2019-09-07 13:07:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:13,033 INFO L93 Difference]: Finished difference Result 860 states and 1247 transitions. [2019-09-07 13:07:13,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 13:07:13,034 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2019-09-07 13:07:13,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:13,063 INFO L225 Difference]: With dead ends: 860 [2019-09-07 13:07:13,063 INFO L226 Difference]: Without dead ends: 427 [2019-09-07 13:07:13,076 INFO L628 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-09-07 13:07:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-07 13:07:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-09-07 13:07:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-07 13:07:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 568 transitions. [2019-09-07 13:07:13,197 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 568 transitions. Word has length 24 [2019-09-07 13:07:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:13,198 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 568 transitions. [2019-09-07 13:07:13,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 13:07:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 568 transitions. [2019-09-07 13:07:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 13:07:13,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:13,199 INFO L399 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-09-07 13:07:13,200 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:13,200 INFO L82 PathProgramCache]: Analyzing trace with hash 871488700, now seen corresponding path program 1 times [2019-09-07 13:07:13,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:13,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:13,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:13,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:13,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:13,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:07:13,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:07:13,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:07:13,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:13,912 INFO L87 Difference]: Start difference. First operand 427 states and 568 transitions. Second operand 3 states. [2019-09-07 13:07:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:14,217 INFO L93 Difference]: Finished difference Result 447 states and 594 transitions. [2019-09-07 13:07:14,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:07:14,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-07 13:07:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:14,225 INFO L225 Difference]: With dead ends: 447 [2019-09-07 13:07:14,226 INFO L226 Difference]: Without dead ends: 427 [2019-09-07 13:07:14,227 INFO L628 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-09-07 13:07:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-07 13:07:14,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-09-07 13:07:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-07 13:07:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 567 transitions. [2019-09-07 13:07:14,257 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 567 transitions. Word has length 26 [2019-09-07 13:07:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:14,258 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 567 transitions. [2019-09-07 13:07:14,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:07:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 567 transitions. [2019-09-07 13:07:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 13:07:14,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:14,259 INFO L399 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-09-07 13:07:14,260 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:14,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash -832326001, now seen corresponding path program 1 times [2019-09-07 13:07:14,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:14,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:14,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:16,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:16,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:07:16,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:07:16,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:07:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:16,177 INFO L87 Difference]: Start difference. First operand 427 states and 567 transitions. Second operand 3 states. [2019-09-07 13:07:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:16,480 INFO L93 Difference]: Finished difference Result 977 states and 1328 transitions. [2019-09-07 13:07:16,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:07:16,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-07 13:07:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:16,488 INFO L225 Difference]: With dead ends: 977 [2019-09-07 13:07:16,488 INFO L226 Difference]: Without dead ends: 694 [2019-09-07 13:07:16,490 INFO L628 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-09-07 13:07:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-07 13:07:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 674. [2019-09-07 13:07:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-07 13:07:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 912 transitions. [2019-09-07 13:07:16,525 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 912 transitions. Word has length 31 [2019-09-07 13:07:16,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:16,525 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 912 transitions. [2019-09-07 13:07:16,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:07:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 912 transitions. [2019-09-07 13:07:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 13:07:16,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:16,529 INFO L399 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-09-07 13:07:16,529 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1703184005, now seen corresponding path program 1 times [2019-09-07 13:07:16,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:16,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:16,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:16,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:19,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:19,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:07:19,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:07:19,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:07:19,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:19,075 INFO L87 Difference]: Start difference. First operand 674 states and 912 transitions. Second operand 3 states. [2019-09-07 13:07:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:19,228 INFO L93 Difference]: Finished difference Result 1564 states and 2178 transitions. [2019-09-07 13:07:19,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:07:19,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-09-07 13:07:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:19,240 INFO L225 Difference]: With dead ends: 1564 [2019-09-07 13:07:19,240 INFO L226 Difference]: Without dead ends: 1055 [2019-09-07 13:07:19,245 INFO L628 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-09-07 13:07:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-09-07 13:07:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1019. [2019-09-07 13:07:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-09-07 13:07:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1414 transitions. [2019-09-07 13:07:19,332 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1414 transitions. Word has length 41 [2019-09-07 13:07:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:19,333 INFO L475 AbstractCegarLoop]: Abstraction has 1019 states and 1414 transitions. [2019-09-07 13:07:19,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:07:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1414 transitions. [2019-09-07 13:07:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-07 13:07:19,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:19,347 INFO L399 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-09-07 13:07:19,347 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:19,347 INFO L82 PathProgramCache]: Analyzing trace with hash -666873609, now seen corresponding path program 1 times [2019-09-07 13:07:19,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:19,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:19,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:19,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:19,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:20,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:20,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:07:20,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:07:20,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:07:20,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:20,924 INFO L87 Difference]: Start difference. First operand 1019 states and 1414 transitions. Second operand 3 states. [2019-09-07 13:07:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:21,161 INFO L93 Difference]: Finished difference Result 1033 states and 1433 transitions. [2019-09-07 13:07:21,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:07:21,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-09-07 13:07:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:21,172 INFO L225 Difference]: With dead ends: 1033 [2019-09-07 13:07:21,172 INFO L226 Difference]: Without dead ends: 1029 [2019-09-07 13:07:21,173 INFO L628 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-09-07 13:07:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-09-07 13:07:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1028. [2019-09-07 13:07:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-09-07 13:07:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1426 transitions. [2019-09-07 13:07:21,251 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1426 transitions. Word has length 41 [2019-09-07 13:07:21,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:21,254 INFO L475 AbstractCegarLoop]: Abstraction has 1028 states and 1426 transitions. [2019-09-07 13:07:21,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:07:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1426 transitions. [2019-09-07 13:07:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 13:07:21,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:21,257 INFO L399 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-09-07 13:07:21,257 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:21,257 INFO L82 PathProgramCache]: Analyzing trace with hash -251975648, now seen corresponding path program 1 times [2019-09-07 13:07:21,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:21,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:21,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:21,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:21,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:22,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:22,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:07:22,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:07:22,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:07:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:22,867 INFO L87 Difference]: Start difference. First operand 1028 states and 1426 transitions. Second operand 5 states. [2019-09-07 13:07:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:23,954 INFO L93 Difference]: Finished difference Result 1069 states and 1476 transitions. [2019-09-07 13:07:23,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:07:23,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-07 13:07:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:23,961 INFO L225 Difference]: With dead ends: 1069 [2019-09-07 13:07:23,962 INFO L226 Difference]: Without dead ends: 1058 [2019-09-07 13:07:23,963 INFO L628 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-09-07 13:07:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-09-07 13:07:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1046. [2019-09-07 13:07:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-09-07 13:07:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1449 transitions. [2019-09-07 13:07:24,011 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1449 transitions. Word has length 45 [2019-09-07 13:07:24,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:24,011 INFO L475 AbstractCegarLoop]: Abstraction has 1046 states and 1449 transitions. [2019-09-07 13:07:24,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:07:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1449 transitions. [2019-09-07 13:07:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 13:07:24,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:24,013 INFO L399 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-09-07 13:07:24,013 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:24,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:24,014 INFO L82 PathProgramCache]: Analyzing trace with hash 341959863, now seen corresponding path program 1 times [2019-09-07 13:07:24,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:24,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:24,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:24,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:24,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:25,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:25,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:07:25,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:07:25,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:07:25,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:25,445 INFO L87 Difference]: Start difference. First operand 1046 states and 1449 transitions. Second operand 5 states. [2019-09-07 13:07:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:26,652 INFO L93 Difference]: Finished difference Result 1060 states and 1461 transitions. [2019-09-07 13:07:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:07:26,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-09-07 13:07:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:26,659 INFO L225 Difference]: With dead ends: 1060 [2019-09-07 13:07:26,659 INFO L226 Difference]: Without dead ends: 1052 [2019-09-07 13:07:26,660 INFO L628 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-09-07 13:07:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-09-07 13:07:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1046. [2019-09-07 13:07:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-09-07 13:07:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1448 transitions. [2019-09-07 13:07:26,728 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1448 transitions. Word has length 46 [2019-09-07 13:07:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:26,731 INFO L475 AbstractCegarLoop]: Abstraction has 1046 states and 1448 transitions. [2019-09-07 13:07:26,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:07:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1448 transitions. [2019-09-07 13:07:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 13:07:26,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:26,733 INFO L399 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-09-07 13:07:26,734 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:26,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:26,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1743095863, now seen corresponding path program 1 times [2019-09-07 13:07:26,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:26,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:26,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:26,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:26,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:27,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:27,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:07:27,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:07:27,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:07:27,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:27,772 INFO L87 Difference]: Start difference. First operand 1046 states and 1448 transitions. Second operand 3 states. [2019-09-07 13:07:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:27,906 INFO L93 Difference]: Finished difference Result 1871 states and 2637 transitions. [2019-09-07 13:07:27,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:07:27,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-07 13:07:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:27,921 INFO L225 Difference]: With dead ends: 1871 [2019-09-07 13:07:27,921 INFO L226 Difference]: Without dead ends: 1842 [2019-09-07 13:07:27,923 INFO L628 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-09-07 13:07:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2019-09-07 13:07:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1817. [2019-09-07 13:07:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2019-09-07 13:07:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2568 transitions. [2019-09-07 13:07:28,041 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2568 transitions. Word has length 47 [2019-09-07 13:07:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:28,041 INFO L475 AbstractCegarLoop]: Abstraction has 1817 states and 2568 transitions. [2019-09-07 13:07:28,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:07:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2568 transitions. [2019-09-07 13:07:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 13:07:28,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:28,044 INFO L399 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-09-07 13:07:28,044 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:28,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:28,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1790750049, now seen corresponding path program 1 times [2019-09-07 13:07:28,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:28,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:28,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:28,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:28,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:29,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:29,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:07:29,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:07:29,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:07:29,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:29,359 INFO L87 Difference]: Start difference. First operand 1817 states and 2568 transitions. Second operand 5 states. [2019-09-07 13:07:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:31,511 INFO L93 Difference]: Finished difference Result 1831 states and 2582 transitions. [2019-09-07 13:07:31,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:07:31,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-07 13:07:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:31,527 INFO L225 Difference]: With dead ends: 1831 [2019-09-07 13:07:31,527 INFO L226 Difference]: Without dead ends: 1810 [2019-09-07 13:07:31,529 INFO L628 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-09-07 13:07:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2019-09-07 13:07:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2019-09-07 13:07:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1810 states. [2019-09-07 13:07:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2559 transitions. [2019-09-07 13:07:31,628 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2559 transitions. Word has length 48 [2019-09-07 13:07:31,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:31,629 INFO L475 AbstractCegarLoop]: Abstraction has 1810 states and 2559 transitions. [2019-09-07 13:07:31,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:07:31,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2559 transitions. [2019-09-07 13:07:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 13:07:31,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:31,630 INFO L399 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-09-07 13:07:31,631 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:31,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:31,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1650606311, now seen corresponding path program 1 times [2019-09-07 13:07:31,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:31,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:31,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:31,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:31,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:32,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:32,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:07:32,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:07:32,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:07:32,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:32,668 INFO L87 Difference]: Start difference. First operand 1810 states and 2559 transitions. Second operand 3 states. [2019-09-07 13:07:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:32,938 INFO L93 Difference]: Finished difference Result 2622 states and 3830 transitions. [2019-09-07 13:07:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:07:32,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-07 13:07:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:32,956 INFO L225 Difference]: With dead ends: 2622 [2019-09-07 13:07:32,956 INFO L226 Difference]: Without dead ends: 2614 [2019-09-07 13:07:32,961 INFO L628 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-09-07 13:07:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2019-09-07 13:07:33,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 1964. [2019-09-07 13:07:33,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-09-07 13:07:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2788 transitions. [2019-09-07 13:07:33,093 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2788 transitions. Word has length 51 [2019-09-07 13:07:33,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:33,094 INFO L475 AbstractCegarLoop]: Abstraction has 1964 states and 2788 transitions. [2019-09-07 13:07:33,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:07:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2788 transitions. [2019-09-07 13:07:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 13:07:33,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:33,095 INFO L399 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-09-07 13:07:33,096 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:33,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1062369270, now seen corresponding path program 1 times [2019-09-07 13:07:33,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:33,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:33,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:33,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:33,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:35,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:35,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:07:35,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:07:35,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:07:35,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:07:35,003 INFO L87 Difference]: Start difference. First operand 1964 states and 2788 transitions. Second operand 6 states. [2019-09-07 13:07:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:39,242 INFO L93 Difference]: Finished difference Result 1980 states and 2804 transitions. [2019-09-07 13:07:39,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:07:39,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-09-07 13:07:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:39,256 INFO L225 Difference]: With dead ends: 1980 [2019-09-07 13:07:39,256 INFO L226 Difference]: Without dead ends: 1921 [2019-09-07 13:07:39,259 INFO L628 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-09-07 13:07:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2019-09-07 13:07:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1907. [2019-09-07 13:07:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2019-09-07 13:07:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2713 transitions. [2019-09-07 13:07:39,362 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2713 transitions. Word has length 52 [2019-09-07 13:07:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:39,363 INFO L475 AbstractCegarLoop]: Abstraction has 1907 states and 2713 transitions. [2019-09-07 13:07:39,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:07:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2713 transitions. [2019-09-07 13:07:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 13:07:39,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:39,364 INFO L399 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-09-07 13:07:39,365 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash 823633966, now seen corresponding path program 1 times [2019-09-07 13:07:39,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:39,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:39,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:40,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:40,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:07:40,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:07:40,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:07:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:40,547 INFO L87 Difference]: Start difference. First operand 1907 states and 2713 transitions. Second operand 5 states. [2019-09-07 13:07:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:42,002 INFO L93 Difference]: Finished difference Result 2565 states and 3751 transitions. [2019-09-07 13:07:42,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:07:42,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-07 13:07:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:42,019 INFO L225 Difference]: With dead ends: 2565 [2019-09-07 13:07:42,020 INFO L226 Difference]: Without dead ends: 2557 [2019-09-07 13:07:42,022 INFO L628 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-09-07 13:07:42,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2019-09-07 13:07:42,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 1907. [2019-09-07 13:07:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2019-09-07 13:07:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2712 transitions. [2019-09-07 13:07:42,127 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2712 transitions. Word has length 52 [2019-09-07 13:07:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:42,128 INFO L475 AbstractCegarLoop]: Abstraction has 1907 states and 2712 transitions. [2019-09-07 13:07:42,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:07:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2712 transitions. [2019-09-07 13:07:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 13:07:42,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:42,129 INFO L399 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-09-07 13:07:42,129 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:42,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:42,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1134764093, now seen corresponding path program 1 times [2019-09-07 13:07:42,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:42,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:42,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:42,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:42,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:43,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:43,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:07:43,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:07:43,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:07:43,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:07:43,321 INFO L87 Difference]: Start difference. First operand 1907 states and 2712 transitions. Second operand 8 states. [2019-09-07 13:07:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:46,079 INFO L93 Difference]: Finished difference Result 1922 states and 2728 transitions. [2019-09-07 13:07:46,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:07:46,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-09-07 13:07:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:46,091 INFO L225 Difference]: With dead ends: 1922 [2019-09-07 13:07:46,091 INFO L226 Difference]: Without dead ends: 1918 [2019-09-07 13:07:46,093 INFO L628 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-09-07 13:07:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2019-09-07 13:07:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1914. [2019-09-07 13:07:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-09-07 13:07:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2720 transitions. [2019-09-07 13:07:46,184 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2720 transitions. Word has length 53 [2019-09-07 13:07:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:46,184 INFO L475 AbstractCegarLoop]: Abstraction has 1914 states and 2720 transitions. [2019-09-07 13:07:46,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:07:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2720 transitions. [2019-09-07 13:07:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 13:07:46,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:46,186 INFO L399 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-09-07 13:07:46,186 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:46,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:46,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1135040923, now seen corresponding path program 1 times [2019-09-07 13:07:46,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:46,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:46,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:46,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:46,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:47,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:47,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:07:47,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:07:47,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:07:47,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:47,557 INFO L87 Difference]: Start difference. First operand 1914 states and 2720 transitions. Second operand 5 states. [2019-09-07 13:07:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:48,940 INFO L93 Difference]: Finished difference Result 2566 states and 3751 transitions. [2019-09-07 13:07:48,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:07:48,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-07 13:07:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:48,959 INFO L225 Difference]: With dead ends: 2566 [2019-09-07 13:07:48,959 INFO L226 Difference]: Without dead ends: 2545 [2019-09-07 13:07:48,962 INFO L628 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-09-07 13:07:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2019-09-07 13:07:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 1901. [2019-09-07 13:07:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1901 states. [2019-09-07 13:07:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2704 transitions. [2019-09-07 13:07:49,066 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2704 transitions. Word has length 53 [2019-09-07 13:07:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:49,067 INFO L475 AbstractCegarLoop]: Abstraction has 1901 states and 2704 transitions. [2019-09-07 13:07:49,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:07:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2704 transitions. [2019-09-07 13:07:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 13:07:49,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:49,068 INFO L399 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-09-07 13:07:49,069 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:49,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1201448389, now seen corresponding path program 1 times [2019-09-07 13:07:49,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:49,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:49,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:49,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:49,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:50,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:50,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:07:50,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:07:50,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:07:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:07:50,124 INFO L87 Difference]: Start difference. First operand 1901 states and 2704 transitions. Second operand 8 states. [2019-09-07 13:07:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:52,765 INFO L93 Difference]: Finished difference Result 1914 states and 2717 transitions. [2019-09-07 13:07:52,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:07:52,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-09-07 13:07:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:52,779 INFO L225 Difference]: With dead ends: 1914 [2019-09-07 13:07:52,779 INFO L226 Difference]: Without dead ends: 1893 [2019-09-07 13:07:52,783 INFO L628 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-09-07 13:07:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2019-09-07 13:07:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1893. [2019-09-07 13:07:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-09-07 13:07:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2694 transitions. [2019-09-07 13:07:52,875 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2694 transitions. Word has length 55 [2019-09-07 13:07:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:52,875 INFO L475 AbstractCegarLoop]: Abstraction has 1893 states and 2694 transitions. [2019-09-07 13:07:52,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:07:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2694 transitions. [2019-09-07 13:07:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 13:07:52,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:52,880 INFO L399 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-09-07 13:07:52,880 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:52,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:52,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1919540531, now seen corresponding path program 1 times [2019-09-07 13:07:52,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:52,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:52,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:52,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:52,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:53,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:53,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:07:53,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:07:53,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:07:53,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:07:53,932 INFO L87 Difference]: Start difference. First operand 1893 states and 2694 transitions. Second operand 7 states. [2019-09-07 13:08:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:08,465 INFO L93 Difference]: Finished difference Result 2636 states and 4020 transitions. [2019-09-07 13:08:08,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:08:08,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-09-07 13:08:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:08,484 INFO L225 Difference]: With dead ends: 2636 [2019-09-07 13:08:08,484 INFO L226 Difference]: Without dead ends: 2593 [2019-09-07 13:08:08,486 INFO L628 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-09-07 13:08:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-09-07 13:08:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2588. [2019-09-07 13:08:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2019-09-07 13:08:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 3962 transitions. [2019-09-07 13:08:08,622 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 3962 transitions. Word has length 56 [2019-09-07 13:08:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:08,623 INFO L475 AbstractCegarLoop]: Abstraction has 2588 states and 3962 transitions. [2019-09-07 13:08:08,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:08:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 3962 transitions. [2019-09-07 13:08:08,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 13:08:08,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:08,624 INFO L399 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-09-07 13:08:08,624 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:08,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:08,625 INFO L82 PathProgramCache]: Analyzing trace with hash 72088627, now seen corresponding path program 1 times [2019-09-07 13:08:08,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:08,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:08,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:08,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:08,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:09,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:09,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:08:09,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:08:09,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:08:09,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:08:09,581 INFO L87 Difference]: Start difference. First operand 2588 states and 3962 transitions. Second operand 3 states. [2019-09-07 13:08:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:09,851 INFO L93 Difference]: Finished difference Result 3575 states and 5650 transitions. [2019-09-07 13:08:09,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:08:09,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-07 13:08:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:09,871 INFO L225 Difference]: With dead ends: 3575 [2019-09-07 13:08:09,872 INFO L226 Difference]: Without dead ends: 3562 [2019-09-07 13:08:09,875 INFO L628 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-09-07 13:08:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2019-09-07 13:08:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3308. [2019-09-07 13:08:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3308 states. [2019-09-07 13:08:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 5119 transitions. [2019-09-07 13:08:10,056 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 5119 transitions. Word has length 56 [2019-09-07 13:08:10,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:10,057 INFO L475 AbstractCegarLoop]: Abstraction has 3308 states and 5119 transitions. [2019-09-07 13:08:10,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:08:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 5119 transitions. [2019-09-07 13:08:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 13:08:10,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:10,058 INFO L399 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-09-07 13:08:10,059 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:10,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1508214174, now seen corresponding path program 1 times [2019-09-07 13:08:10,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:10,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:10,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:10,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:10,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:11,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:11,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:08:11,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:08:11,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:08:11,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:08:11,072 INFO L87 Difference]: Start difference. First operand 3308 states and 5119 transitions. Second operand 7 states. [2019-09-07 13:08:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:34,812 INFO L93 Difference]: Finished difference Result 4566 states and 7281 transitions. [2019-09-07 13:08:34,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:08:34,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-09-07 13:08:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:34,848 INFO L225 Difference]: With dead ends: 4566 [2019-09-07 13:08:34,848 INFO L226 Difference]: Without dead ends: 4536 [2019-09-07 13:08:34,853 INFO L628 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-09-07 13:08:34,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-09-07 13:08:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3007. [2019-09-07 13:08:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3007 states. [2019-09-07 13:08:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4579 transitions. [2019-09-07 13:08:35,047 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4579 transitions. Word has length 56 [2019-09-07 13:08:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:35,047 INFO L475 AbstractCegarLoop]: Abstraction has 3007 states and 4579 transitions. [2019-09-07 13:08:35,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:08:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4579 transitions. [2019-09-07 13:08:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 13:08:35,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:35,049 INFO L399 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-09-07 13:08:35,049 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:35,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:35,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1607397804, now seen corresponding path program 1 times [2019-09-07 13:08:35,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:35,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:35,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:35,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:35,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:36,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:36,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:08:36,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:08:36,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:08:36,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:08:36,295 INFO L87 Difference]: Start difference. First operand 3007 states and 4579 transitions. Second operand 8 states. [2019-09-07 13:08:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:38,974 INFO L93 Difference]: Finished difference Result 3021 states and 4594 transitions. [2019-09-07 13:08:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:08:38,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-09-07 13:08:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:38,985 INFO L225 Difference]: With dead ends: 3021 [2019-09-07 13:08:38,985 INFO L226 Difference]: Without dead ends: 3017 [2019-09-07 13:08:38,988 INFO L628 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-09-07 13:08:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2019-09-07 13:08:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 3013. [2019-09-07 13:08:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3013 states. [2019-09-07 13:08:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 4586 transitions. [2019-09-07 13:08:39,141 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 4586 transitions. Word has length 57 [2019-09-07 13:08:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:39,141 INFO L475 AbstractCegarLoop]: Abstraction has 3013 states and 4586 transitions. [2019-09-07 13:08:39,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:08:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 4586 transitions. [2019-09-07 13:08:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 13:08:39,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:39,143 INFO L399 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-09-07 13:08:39,143 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:39,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:39,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1607674634, now seen corresponding path program 1 times [2019-09-07 13:08:39,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:39,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:39,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:39,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:39,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:40,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:40,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:08:40,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:08:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:08:40,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:08:40,183 INFO L87 Difference]: Start difference. First operand 3013 states and 4586 transitions. Second operand 5 states. [2019-09-07 13:08:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:41,503 INFO L93 Difference]: Finished difference Result 3879 states and 6165 transitions. [2019-09-07 13:08:41,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:08:41,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-09-07 13:08:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:41,521 INFO L225 Difference]: With dead ends: 3879 [2019-09-07 13:08:41,521 INFO L226 Difference]: Without dead ends: 3844 [2019-09-07 13:08:41,525 INFO L628 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-09-07 13:08:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2019-09-07 13:08:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 2984. [2019-09-07 13:08:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2019-09-07 13:08:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 4552 transitions. [2019-09-07 13:08:41,702 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 4552 transitions. Word has length 57 [2019-09-07 13:08:41,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:41,702 INFO L475 AbstractCegarLoop]: Abstraction has 2984 states and 4552 transitions. [2019-09-07 13:08:41,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:08:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 4552 transitions. [2019-09-07 13:08:41,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 13:08:41,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:41,703 INFO L399 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-09-07 13:08:41,704 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:41,704 INFO L82 PathProgramCache]: Analyzing trace with hash -483045091, now seen corresponding path program 1 times [2019-09-07 13:08:41,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:41,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:41,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:41,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:41,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:42,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:42,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:08:42,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:08:42,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:08:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:08:42,679 INFO L87 Difference]: Start difference. First operand 2984 states and 4552 transitions. Second operand 4 states. [2019-09-07 13:08:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:43,258 INFO L93 Difference]: Finished difference Result 3076 states and 4656 transitions. [2019-09-07 13:08:43,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:08:43,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-07 13:08:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:43,266 INFO L225 Difference]: With dead ends: 3076 [2019-09-07 13:08:43,266 INFO L226 Difference]: Without dead ends: 1711 [2019-09-07 13:08:43,276 INFO L628 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-09-07 13:08:43,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-09-07 13:08:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1709. [2019-09-07 13:08:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1709 states. [2019-09-07 13:08:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2511 transitions. [2019-09-07 13:08:43,371 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2511 transitions. Word has length 66 [2019-09-07 13:08:43,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:43,372 INFO L475 AbstractCegarLoop]: Abstraction has 1709 states and 2511 transitions. [2019-09-07 13:08:43,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:08:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2511 transitions. [2019-09-07 13:08:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 13:08:43,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:43,373 INFO L399 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-09-07 13:08:43,373 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash -363600951, now seen corresponding path program 1 times [2019-09-07 13:08:43,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:43,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:43,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:44,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:44,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-07 13:08:44,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 13:08:44,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 13:08:44,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:08:44,537 INFO L87 Difference]: Start difference. First operand 1709 states and 2511 transitions. Second operand 10 states. [2019-09-07 13:08:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:47,288 INFO L93 Difference]: Finished difference Result 1711 states and 2512 transitions. [2019-09-07 13:08:47,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 13:08:47,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-09-07 13:08:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:47,294 INFO L225 Difference]: With dead ends: 1711 [2019-09-07 13:08:47,295 INFO L226 Difference]: Without dead ends: 1674 [2019-09-07 13:08:47,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:08:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-09-07 13:08:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1674. [2019-09-07 13:08:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2019-09-07 13:08:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2472 transitions. [2019-09-07 13:08:47,393 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2472 transitions. Word has length 63 [2019-09-07 13:08:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:47,393 INFO L475 AbstractCegarLoop]: Abstraction has 1674 states and 2472 transitions. [2019-09-07 13:08:47,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 13:08:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2472 transitions. [2019-09-07 13:08:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 13:08:47,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:47,394 INFO L399 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-09-07 13:08:47,394 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:47,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:47,395 INFO L82 PathProgramCache]: Analyzing trace with hash -613627622, now seen corresponding path program 1 times [2019-09-07 13:08:47,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:47,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:47,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:47,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:47,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:48,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:48,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:08:48,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:08:48,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:08:48,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:08:48,826 INFO L87 Difference]: Start difference. First operand 1674 states and 2472 transitions. Second operand 3 states. [2019-09-07 13:08:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:48,922 INFO L93 Difference]: Finished difference Result 2406 states and 3651 transitions. [2019-09-07 13:08:48,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:08:48,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-07 13:08:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:48,926 INFO L225 Difference]: With dead ends: 2406 [2019-09-07 13:08:48,927 INFO L226 Difference]: Without dead ends: 808 [2019-09-07 13:08:48,939 INFO L628 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-09-07 13:08:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2019-09-07 13:08:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2019-09-07 13:08:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-09-07 13:08:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1167 transitions. [2019-09-07 13:08:48,983 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1167 transitions. Word has length 70 [2019-09-07 13:08:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:48,983 INFO L475 AbstractCegarLoop]: Abstraction has 808 states and 1167 transitions. [2019-09-07 13:08:48,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:08:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1167 transitions. [2019-09-07 13:08:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 13:08:48,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:48,984 INFO L399 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-09-07 13:08:48,984 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash 97694375, now seen corresponding path program 1 times [2019-09-07 13:08:48,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:48,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:48,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:49,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:49,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:08:49,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:08:49,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:08:49,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:08:49,885 INFO L87 Difference]: Start difference. First operand 808 states and 1167 transitions. Second operand 3 states. [2019-09-07 13:08:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:50,002 INFO L93 Difference]: Finished difference Result 1517 states and 2233 transitions. [2019-09-07 13:08:50,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:08:50,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-07 13:08:50,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:50,005 INFO L225 Difference]: With dead ends: 1517 [2019-09-07 13:08:50,005 INFO L226 Difference]: Without dead ends: 807 [2019-09-07 13:08:50,009 INFO L628 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-09-07 13:08:50,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-09-07 13:08:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2019-09-07 13:08:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-09-07 13:08:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1164 transitions. [2019-09-07 13:08:50,052 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1164 transitions. Word has length 74 [2019-09-07 13:08:50,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:50,052 INFO L475 AbstractCegarLoop]: Abstraction has 807 states and 1164 transitions. [2019-09-07 13:08:50,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:08:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1164 transitions. [2019-09-07 13:08:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 13:08:50,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:50,054 INFO L399 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-09-07 13:08:50,054 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:50,054 INFO L82 PathProgramCache]: Analyzing trace with hash -62178244, now seen corresponding path program 1 times [2019-09-07 13:08:50,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:50,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:50,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:50,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:50,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:51,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:51,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:08:51,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:08:51,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:08:51,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:08:51,147 INFO L87 Difference]: Start difference. First operand 807 states and 1164 transitions. Second operand 6 states. [2019-09-07 13:08:53,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:53,289 INFO L93 Difference]: Finished difference Result 1567 states and 2344 transitions. [2019-09-07 13:08:53,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:08:53,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-07 13:08:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:53,298 INFO L225 Difference]: With dead ends: 1567 [2019-09-07 13:08:53,299 INFO L226 Difference]: Without dead ends: 838 [2019-09-07 13:08:53,303 INFO L628 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-09-07 13:08:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-09-07 13:08:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 824. [2019-09-07 13:08:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2019-09-07 13:08:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1212 transitions. [2019-09-07 13:08:53,351 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1212 transitions. Word has length 96 [2019-09-07 13:08:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:53,351 INFO L475 AbstractCegarLoop]: Abstraction has 824 states and 1212 transitions. [2019-09-07 13:08:53,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:08:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1212 transitions. [2019-09-07 13:08:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 13:08:53,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:53,353 INFO L399 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-09-07 13:08:53,353 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:53,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2013265241, now seen corresponding path program 1 times [2019-09-07 13:08:53,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:53,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:53,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:53,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:54,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:54,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:08:54,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:08:54,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:08:54,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:08:54,466 INFO L87 Difference]: Start difference. First operand 824 states and 1212 transitions. Second operand 3 states. [2019-09-07 13:08:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:54,689 INFO L93 Difference]: Finished difference Result 1385 states and 2084 transitions. [2019-09-07 13:08:54,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:08:54,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-07 13:08:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:54,695 INFO L225 Difference]: With dead ends: 1385 [2019-09-07 13:08:54,695 INFO L226 Difference]: Without dead ends: 1382 [2019-09-07 13:08:54,696 INFO L628 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-09-07 13:08:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-09-07 13:08:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 972. [2019-09-07 13:08:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-09-07 13:08:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1431 transitions. [2019-09-07 13:08:54,758 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1431 transitions. Word has length 97 [2019-09-07 13:08:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:54,759 INFO L475 AbstractCegarLoop]: Abstraction has 972 states and 1431 transitions. [2019-09-07 13:08:54,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:08:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1431 transitions. [2019-09-07 13:08:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 13:08:54,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:54,760 INFO L399 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-09-07 13:08:54,760 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:54,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash 611295629, now seen corresponding path program 1 times [2019-09-07 13:08:54,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:54,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:54,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:54,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:54,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:56,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:56,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:08:56,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:08:56,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:08:56,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:08:56,146 INFO L87 Difference]: Start difference. First operand 972 states and 1431 transitions. Second operand 4 states. [2019-09-07 13:08:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:56,371 INFO L93 Difference]: Finished difference Result 1893 states and 2887 transitions. [2019-09-07 13:08:56,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:08:56,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-07 13:08:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:56,377 INFO L225 Difference]: With dead ends: 1893 [2019-09-07 13:08:56,377 INFO L226 Difference]: Without dead ends: 989 [2019-09-07 13:08:56,382 INFO L628 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-09-07 13:08:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-09-07 13:08:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2019-09-07 13:08:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-09-07 13:08:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1459 transitions. [2019-09-07 13:08:56,440 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1459 transitions. Word has length 98 [2019-09-07 13:08:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:56,441 INFO L475 AbstractCegarLoop]: Abstraction has 989 states and 1459 transitions. [2019-09-07 13:08:56,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:08:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1459 transitions. [2019-09-07 13:08:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 13:08:56,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:56,442 INFO L399 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, 1] [2019-09-07 13:08:56,442 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:56,443 INFO L82 PathProgramCache]: Analyzing trace with hash 805846953, now seen corresponding path program 1 times [2019-09-07 13:08:56,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:56,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:56,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 13:08:57,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:57,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:08:57,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:08:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:08:57,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:08:57,566 INFO L87 Difference]: Start difference. First operand 989 states and 1459 transitions. Second operand 4 states. [2019-09-07 13:08:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:57,772 INFO L93 Difference]: Finished difference Result 1933 states and 2951 transitions. [2019-09-07 13:08:57,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:08:57,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-09-07 13:08:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:57,780 INFO L225 Difference]: With dead ends: 1933 [2019-09-07 13:08:57,781 INFO L226 Difference]: Without dead ends: 1014 [2019-09-07 13:08:57,786 INFO L628 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-09-07 13:08:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-09-07 13:08:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 994. [2019-09-07 13:08:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-09-07 13:08:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1468 transitions. [2019-09-07 13:08:57,873 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1468 transitions. Word has length 99 [2019-09-07 13:08:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:57,873 INFO L475 AbstractCegarLoop]: Abstraction has 994 states and 1468 transitions. [2019-09-07 13:08:57,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:08:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1468 transitions. [2019-09-07 13:08:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 13:08:57,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:57,876 INFO L399 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, 1, 1] [2019-09-07 13:08:57,877 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:57,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:57,877 INFO L82 PathProgramCache]: Analyzing trace with hash 222002827, now seen corresponding path program 1 times [2019-09-07 13:08:57,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:57,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:57,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:57,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:57,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 13:08:58,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:58,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:08:58,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:08:58,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:08:58,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:08:58,929 INFO L87 Difference]: Start difference. First operand 994 states and 1468 transitions. Second operand 4 states. [2019-09-07 13:08:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:59,038 INFO L93 Difference]: Finished difference Result 1986 states and 2935 transitions. [2019-09-07 13:08:59,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:08:59,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-07 13:08:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:59,045 INFO L225 Difference]: With dead ends: 1986 [2019-09-07 13:08:59,045 INFO L226 Difference]: Without dead ends: 1000 [2019-09-07 13:08:59,050 INFO L628 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-09-07 13:08:59,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-09-07 13:08:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 998. [2019-09-07 13:08:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-07 13:08:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1472 transitions. [2019-09-07 13:08:59,107 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1472 transitions. Word has length 100 [2019-09-07 13:08:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:59,108 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1472 transitions. [2019-09-07 13:08:59,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:08:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1472 transitions. [2019-09-07 13:08:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-07 13:08:59,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:59,109 INFO L399 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-09-07 13:08:59,110 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:59,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:59,110 INFO L82 PathProgramCache]: Analyzing trace with hash 928264555, now seen corresponding path program 1 times [2019-09-07 13:08:59,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:59,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:59,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:59,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:59,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 13:09:00,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:09:00,509 INFO L223 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-09-07 13:09:00,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:09:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:01,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 5704 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:09:01,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:09:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 13:09:01,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:09:01,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 13:09:01,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:09:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:09:01,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:09:01,917 INFO L87 Difference]: Start difference. First operand 998 states and 1472 transitions. Second operand 8 states. [2019-09-07 13:09:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:09:02,379 INFO L93 Difference]: Finished difference Result 2033 states and 3091 transitions. [2019-09-07 13:09:02,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:09:02,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-09-07 13:09:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:09:02,385 INFO L225 Difference]: With dead ends: 2033 [2019-09-07 13:09:02,385 INFO L226 Difference]: Without dead ends: 1041 [2019-09-07 13:09:02,393 INFO L628 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-09-07 13:09:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-09-07 13:09:02,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1007. [2019-09-07 13:09:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-09-07 13:09:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1485 transitions. [2019-09-07 13:09:02,485 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1485 transitions. Word has length 104 [2019-09-07 13:09:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:09:02,485 INFO L475 AbstractCegarLoop]: Abstraction has 1007 states and 1485 transitions. [2019-09-07 13:09:02,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:09:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1485 transitions. [2019-09-07 13:09:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 13:09:02,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:09:02,487 INFO L399 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-09-07 13:09:02,488 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:09:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:09:02,488 INFO L82 PathProgramCache]: Analyzing trace with hash -550602137, now seen corresponding path program 2 times [2019-09-07 13:09:02,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:09:02,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:09:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:02,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:09:02,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 13:09:03,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:09:03,770 INFO L223 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-09-07 13:09:03,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 13:09:05,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-07 13:09:05,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 13:09:05,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 5647 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:09:05,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:09:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 13:09:05,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:09:05,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-07 13:09:05,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:09:05,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:09:05,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:09:05,167 INFO L87 Difference]: Start difference. First operand 1007 states and 1485 transitions. Second operand 8 states. [2019-09-07 13:09:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:09:05,772 INFO L93 Difference]: Finished difference Result 2017 states and 3079 transitions. [2019-09-07 13:09:05,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 13:09:05,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2019-09-07 13:09:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:09:05,777 INFO L225 Difference]: With dead ends: 2017 [2019-09-07 13:09:05,777 INFO L226 Difference]: Without dead ends: 1061 [2019-09-07 13:09:05,786 INFO L628 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-09-07 13:09:05,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-09-07 13:09:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1017. [2019-09-07 13:09:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2019-09-07 13:09:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1499 transitions. [2019-09-07 13:09:05,861 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1499 transitions. Word has length 109 [2019-09-07 13:09:05,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:09:05,861 INFO L475 AbstractCegarLoop]: Abstraction has 1017 states and 1499 transitions. [2019-09-07 13:09:05,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:09:05,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1499 transitions. [2019-09-07 13:09:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 13:09:05,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:09:05,863 INFO L399 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-09-07 13:09:05,863 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:09:05,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:09:05,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1223995920, now seen corresponding path program 1 times [2019-09-07 13:09:05,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:09:05,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:09:05,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:05,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 13:09:05,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 13:09:06,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:09:06,962 INFO L223 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-09-07 13:09:06,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:09:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:08,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 5793 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 13:09:08,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:09:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-07 13:09:08,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:09:08,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 13:09:08,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:09:08,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:09:08,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:09:08,315 INFO L87 Difference]: Start difference. First operand 1017 states and 1499 transitions. Second operand 7 states. [2019-09-07 13:09:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:09:08,441 INFO L93 Difference]: Finished difference Result 2027 states and 2992 transitions. [2019-09-07 13:09:08,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:09:08,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2019-09-07 13:09:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:09:08,447 INFO L225 Difference]: With dead ends: 2027 [2019-09-07 13:09:08,447 INFO L226 Difference]: Without dead ends: 1022 [2019-09-07 13:09:08,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:09:08,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-09-07 13:09:08,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1021. [2019-09-07 13:09:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2019-09-07 13:09:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1503 transitions. [2019-09-07 13:09:08,527 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1503 transitions. Word has length 111 [2019-09-07 13:09:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:09:08,527 INFO L475 AbstractCegarLoop]: Abstraction has 1021 states and 1503 transitions. [2019-09-07 13:09:08,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:09:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1503 transitions. [2019-09-07 13:09:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-07 13:09:08,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:09:08,529 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 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-09-07 13:09:08,530 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:09:08,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:09:08,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1305196592, now seen corresponding path program 2 times [2019-09-07 13:09:08,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:09:08,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:09:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:08,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:09:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:09:09,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:09:09,839 INFO L223 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-09-07 13:09:09,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 13:09:11,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-07 13:09:11,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 13:09:11,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 5647 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 13:09:11,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:09:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 13:09:11,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:09:11,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-07 13:09:11,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 13:09:11,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 13:09:11,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:09:11,204 INFO L87 Difference]: Start difference. First operand 1021 states and 1503 transitions. Second operand 10 states. [2019-09-07 13:09:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:09:11,784 INFO L93 Difference]: Finished difference Result 1661 states and 2469 transitions. [2019-09-07 13:09:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 13:09:11,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2019-09-07 13:09:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:09:11,788 INFO L225 Difference]: With dead ends: 1661 [2019-09-07 13:09:11,789 INFO L226 Difference]: Without dead ends: 724 [2019-09-07 13:09:11,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:09:11,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-09-07 13:09:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 549. [2019-09-07 13:09:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-07 13:09:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 749 transitions. [2019-09-07 13:09:11,835 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 749 transitions. Word has length 115 [2019-09-07 13:09:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:09:11,835 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 749 transitions. [2019-09-07 13:09:11,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 13:09:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 749 transitions. [2019-09-07 13:09:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-07 13:09:11,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:09:11,837 INFO L399 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, 1, 1, 1, 1] [2019-09-07 13:09:11,837 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:09:11,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:09:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash -669452631, now seen corresponding path program 1 times [2019-09-07 13:09:11,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:09:11,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:09:11,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:11,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 13:09:11,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 13:09:13,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:09:13,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:09:13,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:09:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:09:13,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:09:13,076 INFO L87 Difference]: Start difference. First operand 549 states and 749 transitions. Second operand 5 states. [2019-09-07 13:09:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:09:13,818 INFO L93 Difference]: Finished difference Result 994 states and 1388 transitions. [2019-09-07 13:09:13,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:09:13,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-07 13:09:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:09:13,822 INFO L225 Difference]: With dead ends: 994 [2019-09-07 13:09:13,822 INFO L226 Difference]: Without dead ends: 544 [2019-09-07 13:09:13,824 INFO L628 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-09-07 13:09:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-07 13:09:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-09-07 13:09:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-07 13:09:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 734 transitions. [2019-09-07 13:09:13,861 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 734 transitions. Word has length 120 [2019-09-07 13:09:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:09:13,861 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 734 transitions. [2019-09-07 13:09:13,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:09:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 734 transitions. [2019-09-07 13:09:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 13:09:13,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:09:13,863 INFO L399 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, 1, 1, 1, 1, 1, 1] [2019-09-07 13:09:13,863 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:09:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:09:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1267644985, now seen corresponding path program 1 times [2019-09-07 13:09:13,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:09:13,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:09:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:13,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:09:13,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 13:09:15,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:09:15,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:09:15,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:09:15,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:09:15,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:09:15,178 INFO L87 Difference]: Start difference. First operand 544 states and 734 transitions. Second operand 3 states. [2019-09-07 13:09:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:09:15,289 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2019-09-07 13:09:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:09:15,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-07 13:09:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:09:15,293 INFO L225 Difference]: With dead ends: 995 [2019-09-07 13:09:15,293 INFO L226 Difference]: Without dead ends: 550 [2019-09-07 13:09:15,295 INFO L628 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-09-07 13:09:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-07 13:09:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 547. [2019-09-07 13:09:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-09-07 13:09:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 737 transitions. [2019-09-07 13:09:15,332 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 737 transitions. Word has length 122 [2019-09-07 13:09:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:09:15,334 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 737 transitions. [2019-09-07 13:09:15,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:09:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 737 transitions. [2019-09-07 13:09:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 13:09:15,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:09:15,336 INFO L399 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, 1, 1, 1, 1, 1, 1] [2019-09-07 13:09:15,337 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:09:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:09:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash 256527735, now seen corresponding path program 1 times [2019-09-07 13:09:15,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:09:15,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:09:15,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:15,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:09:15,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 13:09:16,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:09:16,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:09:16,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:09:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:09:16,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:09:16,538 INFO L87 Difference]: Start difference. First operand 547 states and 737 transitions. Second operand 5 states. [2019-09-07 13:09:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:09:18,060 INFO L93 Difference]: Finished difference Result 1134 states and 1563 transitions. [2019-09-07 13:09:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:09:18,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-07 13:09:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:09:18,064 INFO L225 Difference]: With dead ends: 1134 [2019-09-07 13:09:18,065 INFO L226 Difference]: Without dead ends: 711 [2019-09-07 13:09:18,067 INFO L628 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-09-07 13:09:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-07 13:09:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 544. [2019-09-07 13:09:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-07 13:09:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 730 transitions. [2019-09-07 13:09:18,114 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 730 transitions. Word has length 122 [2019-09-07 13:09:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:09:18,114 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 730 transitions. [2019-09-07 13:09:18,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:09:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 730 transitions. [2019-09-07 13:09:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 13:09:18,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:09:18,116 INFO L399 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] [2019-09-07 13:09:18,116 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:09:18,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:09:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1652858202, now seen corresponding path program 1 times [2019-09-07 13:09:18,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:09:18,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:09:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:18,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:09:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 13:09:19,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:09:19,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:09:19,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:09:19,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:09:19,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:09:19,305 INFO L87 Difference]: Start difference. First operand 544 states and 730 transitions. Second operand 3 states. [2019-09-07 13:09:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:09:19,430 INFO L93 Difference]: Finished difference Result 1175 states and 1616 transitions. [2019-09-07 13:09:19,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:09:19,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-07 13:09:19,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:09:19,434 INFO L225 Difference]: With dead ends: 1175 [2019-09-07 13:09:19,434 INFO L226 Difference]: Without dead ends: 733 [2019-09-07 13:09:19,436 INFO L628 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-09-07 13:09:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-07 13:09:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 696. [2019-09-07 13:09:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-07 13:09:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 942 transitions. [2019-09-07 13:09:19,486 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 942 transitions. Word has length 103 [2019-09-07 13:09:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:09:19,486 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 942 transitions. [2019-09-07 13:09:19,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:09:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 942 transitions. [2019-09-07 13:09:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 13:09:19,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:09:19,488 INFO L399 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:09:19,488 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:09:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:09:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash 273184833, now seen corresponding path program 1 times [2019-09-07 13:09:19,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:09:19,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:09:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:19,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:09:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 13:09:20,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:09:20,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:09:20,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:09:20,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:09:20,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:09:20,871 INFO L87 Difference]: Start difference. First operand 696 states and 942 transitions. Second operand 6 states. [2019-09-07 13:09:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:09:23,007 INFO L93 Difference]: Finished difference Result 1271 states and 1752 transitions. [2019-09-07 13:09:23,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:09:23,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-09-07 13:09:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:09:23,012 INFO L225 Difference]: With dead ends: 1271 [2019-09-07 13:09:23,013 INFO L226 Difference]: Without dead ends: 696 [2019-09-07 13:09:23,020 INFO L628 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-09-07 13:09:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-07 13:09:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2019-09-07 13:09:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-07 13:09:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 940 transitions. [2019-09-07 13:09:23,089 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 940 transitions. Word has length 123 [2019-09-07 13:09:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:09:23,090 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 940 transitions. [2019-09-07 13:09:23,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:09:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 940 transitions. [2019-09-07 13:09:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-07 13:09:23,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:09:23,093 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:09:23,094 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:09:23,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:09:23,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1908614149, now seen corresponding path program 1 times [2019-09-07 13:09:23,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:09:23,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:09:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:23,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:09:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 13:09:24,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:09:24,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:09:24,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:09:24,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:09:24,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:09:24,498 INFO L87 Difference]: Start difference. First operand 696 states and 940 transitions. Second operand 6 states. [2019-09-07 13:09:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:09:26,526 INFO L93 Difference]: Finished difference Result 1238 states and 1694 transitions. [2019-09-07 13:09:26,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:09:26,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-07 13:09:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:09:26,529 INFO L225 Difference]: With dead ends: 1238 [2019-09-07 13:09:26,529 INFO L226 Difference]: Without dead ends: 665 [2019-09-07 13:09:26,532 INFO L628 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-09-07 13:09:26,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-09-07 13:09:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 658. [2019-09-07 13:09:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-09-07 13:09:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 879 transitions. [2019-09-07 13:09:26,575 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 879 transitions. Word has length 133 [2019-09-07 13:09:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:09:26,576 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 879 transitions. [2019-09-07 13:09:26,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:09:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 879 transitions. [2019-09-07 13:09:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 13:09:26,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:09:26,577 INFO L399 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, 1, 1, 1, 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-09-07 13:09:26,577 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:09:26,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:09:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1422769358, now seen corresponding path program 1 times [2019-09-07 13:09:26,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:09:26,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:09:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:26,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:09:26,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 13:09:27,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:09:27,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-07 13:09:27,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 13:09:27,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 13:09:27,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-07 13:09:27,890 INFO L87 Difference]: Start difference. First operand 658 states and 879 transitions. Second operand 15 states. [2019-09-07 13:09:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:09:34,318 INFO L93 Difference]: Finished difference Result 1211 states and 1626 transitions. [2019-09-07 13:09:34,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:09:34,319 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 143 [2019-09-07 13:09:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:09:34,321 INFO L225 Difference]: With dead ends: 1211 [2019-09-07 13:09:34,321 INFO L226 Difference]: Without dead ends: 654 [2019-09-07 13:09:34,322 INFO L628 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-09-07 13:09:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-09-07 13:09:34,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 646. [2019-09-07 13:09:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-07 13:09:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 856 transitions. [2019-09-07 13:09:34,387 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 856 transitions. Word has length 143 [2019-09-07 13:09:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:09:34,387 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 856 transitions. [2019-09-07 13:09:34,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 13:09:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 856 transitions. [2019-09-07 13:09:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-07 13:09:34,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:09:34,392 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 13:09:34,392 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:09:34,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:09:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash 481440188, now seen corresponding path program 1 times [2019-09-07 13:09:34,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:09:34,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:09:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:34,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:09:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:09:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:09:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 13:09:35,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:09:35,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 13:09:35,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:09:35,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:09:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:09:35,807 INFO L87 Difference]: Start difference. First operand 646 states and 856 transitions. Second operand 14 states. [2019-09-07 13:10:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:10:25,224 INFO L93 Difference]: Finished difference Result 670 states and 878 transitions. [2019-09-07 13:10:25,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:10:25,224 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2019-09-07 13:10:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:10:25,228 INFO L225 Difference]: With dead ends: 670 [2019-09-07 13:10:25,228 INFO L226 Difference]: Without dead ends: 614 [2019-09-07 13:10:25,229 INFO L628 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-09-07 13:10:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-07 13:10:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2019-09-07 13:10:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-07 13:10:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 811 transitions. [2019-09-07 13:10:25,278 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 811 transitions. Word has length 153 [2019-09-07 13:10:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:10:25,278 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 811 transitions. [2019-09-07 13:10:25,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:10:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 811 transitions. [2019-09-07 13:10:25,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-07 13:10:25,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:10:25,281 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 13:10:25,281 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:10:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:10:25,281 INFO L82 PathProgramCache]: Analyzing trace with hash -695015124, now seen corresponding path program 1 times [2019-09-07 13:10:25,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:10:25,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:10:25,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:25,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:10:25,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:10:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 13:10:26,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:10:26,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:10:26,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:10:26,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:10:26,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:10:26,589 INFO L87 Difference]: Start difference. First operand 612 states and 811 transitions. Second operand 5 states. [2019-09-07 13:10:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:10:26,659 INFO L93 Difference]: Finished difference Result 797 states and 1066 transitions. [2019-09-07 13:10:26,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:10:26,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-09-07 13:10:26,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:10:26,661 INFO L225 Difference]: With dead ends: 797 [2019-09-07 13:10:26,661 INFO L226 Difference]: Without dead ends: 685 [2019-09-07 13:10:26,662 INFO L628 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-09-07 13:10:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-07 13:10:26,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 618. [2019-09-07 13:10:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-07 13:10:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 823 transitions. [2019-09-07 13:10:26,710 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 823 transitions. Word has length 155 [2019-09-07 13:10:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:10:26,711 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 823 transitions. [2019-09-07 13:10:26,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:10:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 823 transitions. [2019-09-07 13:10:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-07 13:10:26,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:10:26,713 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 13:10:26,713 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:10:26,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:10:26,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1079880917, now seen corresponding path program 1 times [2019-09-07 13:10:26,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:10:26,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:10:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:26,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:10:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:10:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 13:10:27,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:10:27,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-07 13:10:27,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 13:10:27,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 13:10:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-07 13:10:27,962 INFO L87 Difference]: Start difference. First operand 618 states and 823 transitions. Second operand 15 states. [2019-09-07 13:10:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:10:34,462 INFO L93 Difference]: Finished difference Result 646 states and 854 transitions. [2019-09-07 13:10:34,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:10:34,472 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 155 [2019-09-07 13:10:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:10:34,474 INFO L225 Difference]: With dead ends: 646 [2019-09-07 13:10:34,474 INFO L226 Difference]: Without dead ends: 616 [2019-09-07 13:10:34,475 INFO L628 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-09-07 13:10:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-07 13:10:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 610. [2019-09-07 13:10:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-07 13:10:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 808 transitions. [2019-09-07 13:10:34,527 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 808 transitions. Word has length 155 [2019-09-07 13:10:34,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:10:34,527 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 808 transitions. [2019-09-07 13:10:34,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 13:10:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 808 transitions. [2019-09-07 13:10:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-07 13:10:34,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:10:34,530 INFO L399 BasicCegarLoop]: trace histogram [4, 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, 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] [2019-09-07 13:10:34,531 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:10:34,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:10:34,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1137028468, now seen corresponding path program 1 times [2019-09-07 13:10:34,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:10:34,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:10:34,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:34,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:10:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:10:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-07 13:10:36,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:10:36,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:10:36,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:10:36,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:10:36,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:10:36,491 INFO L87 Difference]: Start difference. First operand 610 states and 808 transitions. Second operand 5 states. [2019-09-07 13:10:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:10:36,664 INFO L93 Difference]: Finished difference Result 862 states and 1154 transitions. [2019-09-07 13:10:36,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:10:36,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-09-07 13:10:36,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:10:36,675 INFO L225 Difference]: With dead ends: 862 [2019-09-07 13:10:36,675 INFO L226 Difference]: Without dead ends: 704 [2019-09-07 13:10:36,676 INFO L628 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-09-07 13:10:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-09-07 13:10:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 604. [2019-09-07 13:10:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-07 13:10:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 796 transitions. [2019-09-07 13:10:36,727 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 796 transitions. Word has length 181 [2019-09-07 13:10:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:10:36,727 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 796 transitions. [2019-09-07 13:10:36,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:10:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 796 transitions. [2019-09-07 13:10:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-07 13:10:36,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:10:36,730 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 13:10:36,730 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:10:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:10:36,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1759998329, now seen corresponding path program 1 times [2019-09-07 13:10:36,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:10:36,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:10:36,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:36,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:10:36,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:10:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 13:10:37,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:10:37,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:10:37,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:10:37,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:10:37,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:10:37,901 INFO L87 Difference]: Start difference. First operand 604 states and 796 transitions. Second operand 7 states. [2019-09-07 13:10:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:10:38,055 INFO L93 Difference]: Finished difference Result 1061 states and 1401 transitions. [2019-09-07 13:10:38,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:10:38,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-09-07 13:10:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:10:38,058 INFO L225 Difference]: With dead ends: 1061 [2019-09-07 13:10:38,058 INFO L226 Difference]: Without dead ends: 597 [2019-09-07 13:10:38,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:10:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-07 13:10:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2019-09-07 13:10:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-07 13:10:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 780 transitions. [2019-09-07 13:10:38,103 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 780 transitions. Word has length 187 [2019-09-07 13:10:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:10:38,103 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 780 transitions. [2019-09-07 13:10:38,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:10:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 780 transitions. [2019-09-07 13:10:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-07 13:10:38,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:10:38,106 INFO L399 BasicCegarLoop]: trace histogram [8, 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, 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] [2019-09-07 13:10:38,106 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:10:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:10:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1717548745, now seen corresponding path program 1 times [2019-09-07 13:10:38,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:10:38,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:10:38,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:38,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:10:38,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:10:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 13:10:39,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:10:39,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:10:39,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:10:39,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:10:39,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:10:39,536 INFO L87 Difference]: Start difference. First operand 595 states and 780 transitions. Second operand 6 states. [2019-09-07 13:10:39,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:10:39,744 INFO L93 Difference]: Finished difference Result 678 states and 882 transitions. [2019-09-07 13:10:39,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:10:39,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-09-07 13:10:39,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:10:39,748 INFO L225 Difference]: With dead ends: 678 [2019-09-07 13:10:39,748 INFO L226 Difference]: Without dead ends: 591 [2019-09-07 13:10:39,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:10:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-07 13:10:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-07 13:10:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-07 13:10:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 773 transitions. [2019-09-07 13:10:39,798 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 773 transitions. Word has length 187 [2019-09-07 13:10:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:10:39,798 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 773 transitions. [2019-09-07 13:10:39,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:10:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 773 transitions. [2019-09-07 13:10:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-07 13:10:39,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:10:39,800 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 13:10:39,800 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:10:39,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:10:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1197592097, now seen corresponding path program 1 times [2019-09-07 13:10:39,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:10:39,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:10:39,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:39,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:10:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:10:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 13:10:41,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:10:41,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 13:10:41,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:10:41,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:10:41,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:10:41,279 INFO L87 Difference]: Start difference. First operand 591 states and 773 transitions. Second operand 14 states. [2019-09-07 13:11:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:30,526 INFO L93 Difference]: Finished difference Result 600 states and 780 transitions. [2019-09-07 13:11:30,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:11:30,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 165 [2019-09-07 13:11:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:30,529 INFO L225 Difference]: With dead ends: 600 [2019-09-07 13:11:30,529 INFO L226 Difference]: Without dead ends: 432 [2019-09-07 13:11:30,531 INFO L628 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-09-07 13:11:30,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-07 13:11:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 343. [2019-09-07 13:11:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-07 13:11:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 423 transitions. [2019-09-07 13:11:30,561 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 423 transitions. Word has length 165 [2019-09-07 13:11:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:30,561 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 423 transitions. [2019-09-07 13:11:30,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:11:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 423 transitions. [2019-09-07 13:11:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-07 13:11:30,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:30,564 INFO L399 BasicCegarLoop]: trace histogram [4, 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, 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] [2019-09-07 13:11:30,564 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:30,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:30,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1433561730, now seen corresponding path program 1 times [2019-09-07 13:11:30,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:30,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:30,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:30,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:30,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-07 13:11:32,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:11:32,144 INFO L223 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-09-07 13:11:32,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:33,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 6622 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:11:33,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:11:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-07 13:11:33,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:11:33,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 13:11:33,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 13:11:33,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 13:11:33,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:11:33,717 INFO L87 Difference]: Start difference. First operand 343 states and 423 transitions. Second operand 11 states. [2019-09-07 13:11:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:33,961 INFO L93 Difference]: Finished difference Result 684 states and 850 transitions. [2019-09-07 13:11:33,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:11:33,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 215 [2019-09-07 13:11:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:33,963 INFO L225 Difference]: With dead ends: 684 [2019-09-07 13:11:33,963 INFO L226 Difference]: Without dead ends: 352 [2019-09-07 13:11:33,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 211 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-09-07 13:11:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-07 13:11:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2019-09-07 13:11:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-07 13:11:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 434 transitions. [2019-09-07 13:11:33,984 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 434 transitions. Word has length 215 [2019-09-07 13:11:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:33,984 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 434 transitions. [2019-09-07 13:11:33,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 13:11:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 434 transitions. [2019-09-07 13:11:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 13:11:33,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:33,987 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 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, 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] [2019-09-07 13:11:33,987 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:33,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:33,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1291511764, now seen corresponding path program 1 times [2019-09-07 13:11:33,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:33,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:33,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:33,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:33,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-07 13:11:35,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:35,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:11:35,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:11:35,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:11:35,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:11:35,100 INFO L87 Difference]: Start difference. First operand 351 states and 434 transitions. Second operand 6 states. [2019-09-07 13:11:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:35,200 INFO L93 Difference]: Finished difference Result 565 states and 693 transitions. [2019-09-07 13:11:35,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:11:35,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-07 13:11:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:35,202 INFO L225 Difference]: With dead ends: 565 [2019-09-07 13:11:35,202 INFO L226 Difference]: Without dead ends: 336 [2019-09-07 13:11:35,203 INFO L628 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-09-07 13:11:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-07 13:11:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-09-07 13:11:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-07 13:11:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 409 transitions. [2019-09-07 13:11:35,231 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 409 transitions. Word has length 218 [2019-09-07 13:11:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:35,231 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 409 transitions. [2019-09-07 13:11:35,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:11:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 409 transitions. [2019-09-07 13:11:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-07 13:11:35,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:35,235 INFO L399 BasicCegarLoop]: trace histogram [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, 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-09-07 13:11:35,235 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:35,235 INFO L82 PathProgramCache]: Analyzing trace with hash -705695205, now seen corresponding path program 1 times [2019-09-07 13:11:35,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:35,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:35,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:35,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:35,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-09-07 13:11:36,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:11:36,874 INFO L223 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-09-07 13:11:36,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:38,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 6898 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 13:11:38,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:11:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-09-07 13:11:38,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:11:38,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-07 13:11:38,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 13:11:38,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 13:11:38,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:11:38,583 INFO L87 Difference]: Start difference. First operand 336 states and 409 transitions. Second operand 12 states. [2019-09-07 13:11:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:39,000 INFO L93 Difference]: Finished difference Result 674 states and 828 transitions. [2019-09-07 13:11:39,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 13:11:39,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 256 [2019-09-07 13:11:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:39,003 INFO L225 Difference]: With dead ends: 674 [2019-09-07 13:11:39,003 INFO L226 Difference]: Without dead ends: 354 [2019-09-07 13:11:39,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 251 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-09-07 13:11:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-07 13:11:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 341. [2019-09-07 13:11:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-07 13:11:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 414 transitions. [2019-09-07 13:11:39,032 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 414 transitions. Word has length 256 [2019-09-07 13:11:39,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:39,032 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 414 transitions. [2019-09-07 13:11:39,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 13:11:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 414 transitions. [2019-09-07 13:11:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-07 13:11:39,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:39,035 INFO L399 BasicCegarLoop]: trace histogram [6, 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, 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-09-07 13:11:39,036 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1260571111, now seen corresponding path program 2 times [2019-09-07 13:11:39,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:39,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-09-07 13:11:40,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:40,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:11:40,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:11:40,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:11:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:11:40,231 INFO L87 Difference]: Start difference. First operand 341 states and 414 transitions. Second operand 6 states. [2019-09-07 13:11:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:40,327 INFO L93 Difference]: Finished difference Result 441 states and 536 transitions. [2019-09-07 13:11:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:11:40,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-07 13:11:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:40,329 INFO L225 Difference]: With dead ends: 441 [2019-09-07 13:11:40,329 INFO L226 Difference]: Without dead ends: 295 [2019-09-07 13:11:40,329 INFO L628 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-09-07 13:11:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-07 13:11:40,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-09-07 13:11:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-07 13:11:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 350 transitions. [2019-09-07 13:11:40,344 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 350 transitions. Word has length 259 [2019-09-07 13:11:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:40,345 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 350 transitions. [2019-09-07 13:11:40,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:11:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 350 transitions. [2019-09-07 13:11:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-07 13:11:40,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:40,348 INFO L399 BasicCegarLoop]: trace histogram [6, 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, 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-09-07 13:11:40,348 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:40,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:40,348 INFO L82 PathProgramCache]: Analyzing trace with hash -406253148, now seen corresponding path program 1 times [2019-09-07 13:11:40,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:40,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:40,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:40,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 13:11:40,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 13:11:41,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:41,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:11:41,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:11:41,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:11:41,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:11:41,606 INFO L87 Difference]: Start difference. First operand 295 states and 350 transitions. Second operand 6 states. [2019-09-07 13:11:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:41,682 INFO L93 Difference]: Finished difference Result 295 states and 350 transitions. [2019-09-07 13:11:41,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:11:41,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 281 [2019-09-07 13:11:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:41,684 INFO L225 Difference]: With dead ends: 295 [2019-09-07 13:11:41,685 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:11:41,688 INFO L628 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-09-07 13:11:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:11:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:11:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:11:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:11:41,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2019-09-07 13:11:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:41,690 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:11:41,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:11:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:11:41,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:11:41,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:11:47,013 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 99 [2019-09-07 13:11:48,408 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:11:48,741 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2019-09-07 13:11:49,030 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-09-07 13:11:49,218 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-07 13:11:49,413 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:11:49,657 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-07 13:11:50,024 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 37 [2019-09-07 13:11:50,164 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-07 13:11:50,312 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-07 13:11:50,596 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-07 13:11:50,757 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:11:50,909 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:11:51,260 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2019-09-07 13:11:51,414 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:11:51,961 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-07 13:11:52,349 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-07 13:11:52,574 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-07 13:11:52,862 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-09-07 13:11:53,057 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-07 13:11:53,307 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:11:53,461 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-07 13:11:53,930 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-07 13:11:54,290 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:11:54,448 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-07 13:11:54,665 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-07 13:11:54,826 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-07 13:11:54,981 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:11:55,149 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-07 13:11:55,284 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-07 13:11:55,444 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-07 13:11:55,953 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2019-09-07 13:11:56,072 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 1 [2019-09-07 13:11:56,359 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-09-07 13:11:56,729 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 47 [2019-09-07 13:11:56,922 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-07 13:11:57,246 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2019-09-07 13:11:57,462 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:11:57,787 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-09-07 13:11:58,220 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-07 13:11:58,370 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-09-07 13:11:58,708 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-09-07 13:11:58,867 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-07 13:11:59,015 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:11:59,411 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2019-09-07 13:11:59,793 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 47 [2019-09-07 13:11:59,900 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-07 13:12:00,140 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-09-07 13:12:00,337 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:12:00,655 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-07 13:12:00,977 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2019-09-07 13:12:01,100 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-07 13:12:01,255 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:12:01,501 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-09-07 13:12:01,797 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-07 13:12:01,948 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:12:02,096 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-07 13:12:02,223 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 1 [2019-09-07 13:12:02,453 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-07 13:12:02,738 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-07 13:12:02,972 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-07 13:12:03,209 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-09-07 13:12:03,441 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-07 13:12:03,652 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-07 13:12:03,774 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-07 13:12:04,148 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-09-07 13:12:04,410 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-07 13:12:04,548 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-09-07 13:12:04,983 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-07 13:12:05,135 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:12:05,389 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-09-07 13:12:05,764 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2019-09-07 13:12:06,007 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-09-07 13:12:06,759 WARN L188 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-09-07 13:12:07,040 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-07 13:12:07,165 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-07 13:12:07,315 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:12:07,534 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-07 13:12:08,134 WARN L188 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 1 [2019-09-07 13:12:08,250 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 1 [2019-09-07 13:12:08,504 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:12:08,646 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:12:08,926 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:12:09,121 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:12:09,366 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-07 13:12:09,690 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2019-09-07 13:12:09,853 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-07 13:12:10,157 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-09-07 13:12:10,358 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-07 13:12:10,488 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-07 13:12:10,840 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-07 13:12:10,963 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-07 13:12:11,026 INFO L443 ceAbstractionStarter]: For program point L3713(lines 3712 3725) no Hoare annotation was computed. [2019-09-07 13:12:11,026 INFO L443 ceAbstractionStarter]: For program point L3710(lines 3709 3726) no Hoare annotation was computed. [2019-09-07 13:12:11,026 INFO L443 ceAbstractionStarter]: For program point L3709(lines 3709 3726) no Hoare annotation was computed. [2019-09-07 13:12:11,027 INFO L443 ceAbstractionStarter]: For program point IoAllocateMdlEXIT(lines 3703 3728) no Hoare annotation was computed. [2019-09-07 13:12:11,027 INFO L443 ceAbstractionStarter]: For program point IoAllocateMdlENTRY(lines 3703 3728) no Hoare annotation was computed. [2019-09-07 13:12:11,027 INFO L443 ceAbstractionStarter]: For program point L3723(lines 3703 3728) no Hoare annotation was computed. [2019-09-07 13:12:11,027 INFO L443 ceAbstractionStarter]: For program point IoAttachDeviceToDeviceStackENTRY(lines 3731 3751) no Hoare annotation was computed. [2019-09-07 13:12:11,027 INFO L443 ceAbstractionStarter]: For program point IoAttachDeviceToDeviceStackEXIT(lines 3731 3751) no Hoare annotation was computed. [2019-09-07 13:12:11,027 INFO L443 ceAbstractionStarter]: For program point L3739(lines 3738 3748) no Hoare annotation was computed. [2019-09-07 13:12:11,027 INFO L443 ceAbstractionStarter]: For program point L3736(lines 3735 3749) no Hoare annotation was computed. [2019-09-07 13:12:11,027 INFO L443 ceAbstractionStarter]: For program point L3735(lines 3735 3749) no Hoare annotation was computed. [2019-09-07 13:12:11,027 INFO L443 ceAbstractionStarter]: For program point L3746(lines 3731 3751) no Hoare annotation was computed. [2019-09-07 13:12:11,027 INFO L443 ceAbstractionStarter]: For program point IoGetConfigurationInformationFINAL(lines 3935 3944) no Hoare annotation was computed. [2019-09-07 13:12:11,027 INFO L443 ceAbstractionStarter]: For program point IoGetConfigurationInformationENTRY(lines 3935 3944) no Hoare annotation was computed. [2019-09-07 13:12:11,028 INFO L443 ceAbstractionStarter]: For program point IoGetConfigurationInformationEXIT(lines 3935 3944) no Hoare annotation was computed. [2019-09-07 13:12:11,028 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 2059 2080) no Hoare annotation was computed. [2019-09-07 13:12:11,028 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-09-07 13:12:11,028 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 2059 2080) no Hoare annotation was computed. [2019-09-07 13:12:11,029 INFO L446 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 2156 2166) the Hoare annotation is: true [2019-09-07 13:12:11,029 INFO L443 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 2156 2166) no Hoare annotation was computed. [2019-09-07 13:12:11,029 INFO L443 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 2156 2166) no Hoare annotation was computed. [2019-09-07 13:12:11,029 INFO L443 ceAbstractionStarter]: For program point KeDelayExecutionThreadEXIT(lines 4189 4209) no Hoare annotation was computed. [2019-09-07 13:12:11,029 INFO L443 ceAbstractionStarter]: For program point L4193(lines 4193 4207) no Hoare annotation was computed. [2019-09-07 13:12:11,029 INFO L443 ceAbstractionStarter]: For program point KeDelayExecutionThreadENTRY(lines 4189 4209) no Hoare annotation was computed. [2019-09-07 13:12:11,029 INFO L443 ceAbstractionStarter]: For program point L4204(lines 4189 4209) no Hoare annotation was computed. [2019-09-07 13:12:11,029 INFO L443 ceAbstractionStarter]: For program point L4197(lines 4196 4206) no Hoare annotation was computed. [2019-09-07 13:12:11,030 INFO L443 ceAbstractionStarter]: For program point L4194(lines 4193 4207) no Hoare annotation was computed. [2019-09-07 13:12:11,030 INFO L443 ceAbstractionStarter]: For program point L3770(lines 3769 3782) no Hoare annotation was computed. [2019-09-07 13:12:11,030 INFO L443 ceAbstractionStarter]: For program point L3766(lines 3766 3783) no Hoare annotation was computed. [2019-09-07 13:12:11,030 INFO L443 ceAbstractionStarter]: For program point L3767(lines 3766 3783) no Hoare annotation was computed. [2019-09-07 13:12:11,030 INFO L443 ceAbstractionStarter]: For program point IoBuildAsynchronousFsdRequestENTRY(lines 3758 3785) no Hoare annotation was computed. [2019-09-07 13:12:11,030 INFO L443 ceAbstractionStarter]: For program point L3780(lines 3758 3785) no Hoare annotation was computed. [2019-09-07 13:12:11,030 INFO L443 ceAbstractionStarter]: For program point IoBuildAsynchronousFsdRequestEXIT(lines 3758 3785) no Hoare annotation was computed. [2019-09-07 13:12:11,030 INFO L443 ceAbstractionStarter]: For program point RtlInitStringENTRY(lines 4654 4660) no Hoare annotation was computed. [2019-09-07 13:12:11,030 INFO L443 ceAbstractionStarter]: For program point RtlInitStringFINAL(lines 4654 4660) no Hoare annotation was computed. [2019-09-07 13:12:11,031 INFO L443 ceAbstractionStarter]: For program point RtlInitStringEXIT(lines 4654 4660) no Hoare annotation was computed. [2019-09-07 13:12:11,031 INFO L443 ceAbstractionStarter]: For program point RtlInitUnicodeStringFINAL(lines 4663 4670) no Hoare annotation was computed. [2019-09-07 13:12:11,031 INFO L443 ceAbstractionStarter]: For program point RtlInitUnicodeStringENTRY(lines 4663 4670) no Hoare annotation was computed. [2019-09-07 13:12:11,031 INFO L443 ceAbstractionStarter]: For program point RtlInitUnicodeStringEXIT(lines 4663 4670) no Hoare annotation was computed. [2019-09-07 13:12:11,031 INFO L443 ceAbstractionStarter]: For program point L4544(lines 4527 4549) no Hoare annotation was computed. [2019-09-07 13:12:11,031 INFO L443 ceAbstractionStarter]: For program point L4534(lines 4533 4547) no Hoare annotation was computed. [2019-09-07 13:12:11,031 INFO L443 ceAbstractionStarter]: For program point L4537(lines 4536 4546) no Hoare annotation was computed. [2019-09-07 13:12:11,031 INFO L443 ceAbstractionStarter]: For program point L4533(lines 4533 4547) no Hoare annotation was computed. [2019-09-07 13:12:11,031 INFO L443 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 4527 4549) no Hoare annotation was computed. [2019-09-07 13:12:11,031 INFO L443 ceAbstractionStarter]: For program point PsCreateSystemThreadENTRY(lines 4527 4549) no Hoare annotation was computed. [2019-09-07 13:12:11,032 INFO L443 ceAbstractionStarter]: For program point L4411(lines 4395 4416) no Hoare annotation was computed. [2019-09-07 13:12:11,032 INFO L443 ceAbstractionStarter]: For program point L4404(lines 4403 4413) no Hoare annotation was computed. [2019-09-07 13:12:11,032 INFO L443 ceAbstractionStarter]: For program point L4401(lines 4400 4414) no Hoare annotation was computed. [2019-09-07 13:12:11,032 INFO L443 ceAbstractionStarter]: For program point L4400(lines 4400 4414) no Hoare annotation was computed. [2019-09-07 13:12:11,032 INFO L443 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 4395 4416) no Hoare annotation was computed. [2019-09-07 13:12:11,032 INFO L443 ceAbstractionStarter]: For program point ObReferenceObjectByHandleENTRY(lines 4395 4416) no Hoare annotation was computed. [2019-09-07 13:12:11,032 INFO L446 ceAbstractionStarter]: At program point L3808(lines 3807 3820) the Hoare annotation is: true [2019-09-07 13:12:11,032 INFO L443 ceAbstractionStarter]: For program point L3804(lines 3804 3821) no Hoare annotation was computed. [2019-09-07 13:12:11,032 INFO L446 ceAbstractionStarter]: At program point L3805(lines 3804 3821) the Hoare annotation is: true [2019-09-07 13:12:11,032 INFO L446 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 3795 3823) the Hoare annotation is: true [2019-09-07 13:12:11,032 INFO L443 ceAbstractionStarter]: For program point L3818(lines 3795 3823) no Hoare annotation was computed. [2019-09-07 13:12:11,032 INFO L443 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 3795 3823) no Hoare annotation was computed. [2019-09-07 13:12:11,032 INFO L443 ceAbstractionStarter]: For program point L3840(lines 3839 3853) no Hoare annotation was computed. [2019-09-07 13:12:11,033 INFO L443 ceAbstractionStarter]: For program point L3836(lines 3836 3854) no Hoare annotation was computed. [2019-09-07 13:12:11,033 INFO L443 ceAbstractionStarter]: For program point L3837(lines 3836 3854) no Hoare annotation was computed. [2019-09-07 13:12:11,033 INFO L443 ceAbstractionStarter]: For program point IoCreateDeviceENTRY(lines 3829 3856) no Hoare annotation was computed. [2019-09-07 13:12:11,033 INFO L443 ceAbstractionStarter]: For program point L3851(lines 3829 3856) no Hoare annotation was computed. [2019-09-07 13:12:11,033 INFO L443 ceAbstractionStarter]: For program point IoCreateDeviceEXIT(lines 3829 3856) no Hoare annotation was computed. [2019-09-07 13:12:11,033 INFO L443 ceAbstractionStarter]: For program point L2337-1(lines 2333 2339) no Hoare annotation was computed. [2019-09-07 13:12:11,033 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-09-07 13:12:11,033 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-09-07 13:12:11,033 INFO L443 ceAbstractionStarter]: For program point L2333(lines 2333 2339) no Hoare annotation was computed. [2019-09-07 13:12:11,033 INFO L443 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 2328 2348) no Hoare annotation was computed. [2019-09-07 13:12:11,034 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-09-07 13:12:11,034 INFO L443 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 2328 2348) no Hoare annotation was computed. [2019-09-07 13:12:11,034 INFO L443 ceAbstractionStarter]: For program point L2344-1(line 2344) no Hoare annotation was computed. [2019-09-07 13:12:11,034 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 2035 2041) the Hoare annotation is: true [2019-09-07 13:12:11,034 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 2035 2041) no Hoare annotation was computed. [2019-09-07 13:12:11,034 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 2035 2041) no Hoare annotation was computed. [2019-09-07 13:12:11,034 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2039) no Hoare annotation was computed. [2019-09-07 13:12:11,034 INFO L443 ceAbstractionStarter]: For program point L2434-1(line 2434) no Hoare annotation was computed. [2019-09-07 13:12:11,035 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-09-07 13:12:11,035 INFO L443 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 2427 2438) no Hoare annotation was computed. [2019-09-07 13:12:11,035 INFO L443 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 2427 2438) no Hoare annotation was computed. [2019-09-07 13:12:11,035 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-09-07 13:12:11,035 INFO L443 ceAbstractionStarter]: For program point L3184(lines 3184 3192) no Hoare annotation was computed. [2019-09-07 13:12:11,035 INFO L443 ceAbstractionStarter]: For program point L3184-2(lines 3184 3192) no Hoare annotation was computed. [2019-09-07 13:12:11,035 INFO L446 ceAbstractionStarter]: At program point DiskPerfAddCountersENTRY(lines 3174 3195) the Hoare annotation is: true [2019-09-07 13:12:11,035 INFO L443 ceAbstractionStarter]: For program point DiskPerfAddCountersFINAL(lines 3174 3195) no Hoare annotation was computed. [2019-09-07 13:12:11,035 INFO L443 ceAbstractionStarter]: For program point DiskPerfAddCountersEXIT(lines 3174 3195) no Hoare annotation was computed. [2019-09-07 13:12:11,035 INFO L446 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2019-09-07 13:12:11,035 INFO L446 ceAbstractionStarter]: At program point L-1-3(line -1) the Hoare annotation is: true [2019-09-07 13:12:11,035 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:12:11,035 INFO L446 ceAbstractionStarter]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:12:11,035 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:12:11,036 INFO L443 ceAbstractionStarter]: For program point IoReleaseCancelSpinLockENTRY(lines 4026 4032) no Hoare annotation was computed. [2019-09-07 13:12:11,036 INFO L443 ceAbstractionStarter]: For program point IoReleaseCancelSpinLockFINAL(lines 4026 4032) no Hoare annotation was computed. [2019-09-07 13:12:11,036 INFO L443 ceAbstractionStarter]: For program point IoReleaseCancelSpinLockEXIT(lines 4026 4032) no Hoare annotation was computed. [2019-09-07 13:12:11,036 INFO L443 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceEXIT(lines 4057 4063) no Hoare annotation was computed. [2019-09-07 13:12:11,036 INFO L443 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceENTRY(lines 4057 4063) no Hoare annotation was computed. [2019-09-07 13:12:11,036 INFO L443 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceFINAL(lines 4057 4063) no Hoare annotation was computed. [2019-09-07 13:12:11,036 INFO L446 ceAbstractionStarter]: At program point InterlockedDecrementENTRY(lines 1530 1532) the Hoare annotation is: true [2019-09-07 13:12:11,036 INFO L443 ceAbstractionStarter]: For program point InterlockedDecrementEXIT(lines 1530 1532) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point InterlockedDecrementFINAL(lines 1530 1532) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point IoDetachDeviceEXIT(lines 3911 3917) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point IoDetachDeviceFINAL(lines 3911 3917) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point IoDetachDeviceENTRY(lines 3911 3917) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point RtlAnsiStringToUnicodeStringEXIT(lines 4575 4597) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point L4592(lines 4575 4597) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point RtlAnsiStringToUnicodeStringENTRY(lines 4575 4597) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point L4582(lines 4581 4595) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point L4585(lines 4584 4594) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point L4581(lines 4581 4595) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiRegInfoEXIT(lines 3004 3029) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point L3019(lines 3019 3026) no Hoare annotation was computed. [2019-09-07 13:12:11,037 INFO L443 ceAbstractionStarter]: For program point L3016(line 3016) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point L3019-2(lines 3019 3026) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point L3016-1(line 3016) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiRegInfoENTRY(lines 3004 3029) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiRegInfoFINAL(lines 3004 3029) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point L3904(lines 3889 3909) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point L3897(lines 3896 3906) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point L3894(lines 3893 3907) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point L3893(lines 3893 3907) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkENTRY(lines 3889 3909) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 3889 3909) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 3963 3996) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point L3991(lines 3963 3996) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionENTRY(lines 3963 3996) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point L3984(lines 3983 3993) no Hoare annotation was computed. [2019-09-07 13:12:11,038 INFO L443 ceAbstractionStarter]: For program point L3980(lines 3980 3994) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point L3981(lines 3980 3994) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point L4320(lines 4320 4338) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point L4335(line 4335) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point MmAllocateContiguousMemoryFINAL(lines 4315 4341) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point L4327(lines 4320 4338) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point L4326(lines 4326 4336) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point MmAllocateContiguousMemoryENTRY(lines 4315 4341) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point L4323(lines 4323 4337) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point L4324(lines 4323 4337) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point MmAllocateContiguousMemoryEXIT(lines 4315 4341) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point MmResetDriverPagingFINAL(lines 4374 4380) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point MmResetDriverPagingEXIT(lines 4374 4380) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point MmResetDriverPagingENTRY(lines 4374 4380) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point MmUnlockPagesENTRY(lines 4382 4388) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point MmUnlockPagesFINAL(lines 4382 4388) no Hoare annotation was computed. [2019-09-07 13:12:11,039 INFO L443 ceAbstractionStarter]: For program point MmUnlockPagesEXIT(lines 4382 4388) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 4001 4024) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceENTRY(lines 4001 4024) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point L4019(lines 4001 4024) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point L4012(lines 4011 4021) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point L4008(lines 4008 4022) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point L4009(lines 4008 4022) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point IoWMIRegistrationControlEXIT(lines 1677 1695) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point IoWMIRegistrationControlFINAL(lines 1677 1695) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L446 ceAbstractionStarter]: At program point IoWMIRegistrationControlENTRY(lines 1677 1695) the Hoare annotation is: true [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point L1690(lines 1690 1694) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point L1688(lines 1688 1694) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1694) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point L1684(lines 1684 1694) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 1694) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point L1680(lines 1680 1694) no Hoare annotation was computed. [2019-09-07 13:12:11,040 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1694) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point L4050(lines 4035 4055) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 4035 4055) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point L4043(lines 4042 4052) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point L4040(lines 4039 4053) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point L4039(lines 4039 4053) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateENTRY(lines 4035 4055) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point KeInitializeEventEXIT(lines 4212 4218) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point KeInitializeEventENTRY(lines 4212 4218) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point KeInitializeEventFINAL(lines 4212 4218) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListEXIT(lines 3692 3699) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListENTRY(lines 3692 3699) no Hoare annotation was computed. [2019-09-07 13:12:11,041 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListFINAL(lines 3692 3699) no Hoare annotation was computed. [2019-09-07 13:12:11,042 INFO L443 ceAbstractionStarter]: For program point L2713(lines 2712 2734) no Hoare annotation was computed. [2019-09-07 13:12:11,042 INFO L443 ceAbstractionStarter]: For program point L2709(lines 2709 2735) no Hoare annotation was computed. [2019-09-07 13:12:11,042 INFO L443 ceAbstractionStarter]: For program point DiskPerfWmiENTRY(lines 2686 2738) no Hoare annotation was computed. [2019-09-07 13:12:11,042 INFO L443 ceAbstractionStarter]: For program point L2699-1(line 2699) no Hoare annotation was computed. [2019-09-07 13:12:11,042 INFO L443 ceAbstractionStarter]: For program point L2699(line 2699) no Hoare annotation was computed. [2019-09-07 13:12:11,042 INFO L443 ceAbstractionStarter]: For program point L2697(lines 2697 2704) no Hoare annotation was computed. [2019-09-07 13:12:11,042 INFO L443 ceAbstractionStarter]: For program point DiskPerfWmiFINAL(lines 2686 2738) no Hoare annotation was computed. [2019-09-07 13:12:11,042 INFO L443 ceAbstractionStarter]: For program point L2716(lines 2715 2733) no Hoare annotation was computed. [2019-09-07 13:12:11,043 INFO L443 ceAbstractionStarter]: For program point L2712(lines 2712 2734) no Hoare annotation was computed. [2019-09-07 13:12:11,043 INFO L443 ceAbstractionStarter]: For program point DiskPerfWmiEXIT(lines 2686 2738) no Hoare annotation was computed. [2019-09-07 13:12:11,043 INFO L443 ceAbstractionStarter]: For program point L2731(lines 2709 2735) no Hoare annotation was computed. [2019-09-07 13:12:11,043 INFO L443 ceAbstractionStarter]: For program point L2727(line 2727) no Hoare annotation was computed. [2019-09-07 13:12:11,043 INFO L443 ceAbstractionStarter]: For program point IoFreeIrpEXIT(lines 3919 3925) no Hoare annotation was computed. [2019-09-07 13:12:11,043 INFO L443 ceAbstractionStarter]: For program point IoFreeIrpENTRY(lines 3919 3925) no Hoare annotation was computed. [2019-09-07 13:12:11,043 INFO L443 ceAbstractionStarter]: For program point IoFreeIrpFINAL(lines 3919 3925) no Hoare annotation was computed. [2019-09-07 13:12:11,043 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-09-07 13:12:11,043 INFO L443 ceAbstractionStarter]: For program point L4172-1(lines 4164 4177) no Hoare annotation was computed. [2019-09-07 13:12:11,044 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-09-07 13:12:11,044 INFO L443 ceAbstractionStarter]: For program point L4168(lines 4168 4174) no Hoare annotation was computed. [2019-09-07 13:12:11,044 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 4164 4177) no Hoare annotation was computed. [2019-09-07 13:12:11,044 INFO L446 ceAbstractionStarter]: At program point InterlockedExchangeENTRY(lines 1533 1537) the Hoare annotation is: true [2019-09-07 13:12:11,044 INFO L443 ceAbstractionStarter]: For program point InterlockedExchangeFINAL(lines 1533 1537) no Hoare annotation was computed. [2019-09-07 13:12:11,044 INFO L443 ceAbstractionStarter]: For program point InterlockedExchangeEXIT(lines 1533 1537) no Hoare annotation was computed. [2019-09-07 13:12:11,044 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertHeadListEXIT(lines 3669 3677) no Hoare annotation was computed. [2019-09-07 13:12:11,044 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertHeadListENTRY(lines 3669 3677) no Hoare annotation was computed. [2019-09-07 13:12:11,045 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertHeadListFINAL(lines 3669 3677) no Hoare annotation was computed. [2019-09-07 13:12:11,045 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:12:11,045 INFO L446 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2019-09-07 13:12:11,045 INFO L446 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:12:11,045 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:12:11,045 INFO L443 ceAbstractionStarter]: For program point IoDeleteDeviceEXIT(lines 3881 3887) no Hoare annotation was computed. [2019-09-07 13:12:11,045 INFO L443 ceAbstractionStarter]: For program point IoDeleteDeviceFINAL(lines 3881 3887) no Hoare annotation was computed. [2019-09-07 13:12:11,045 INFO L443 ceAbstractionStarter]: For program point IoDeleteDeviceENTRY(lines 3881 3887) no Hoare annotation was computed. [2019-09-07 13:12:11,045 INFO L443 ceAbstractionStarter]: For program point ExAcquireFastMutexEXIT(lines 3627 3633) no Hoare annotation was computed. [2019-09-07 13:12:11,045 INFO L443 ceAbstractionStarter]: For program point ExAcquireFastMutexENTRY(lines 3627 3633) no Hoare annotation was computed. [2019-09-07 13:12:11,045 INFO L443 ceAbstractionStarter]: For program point ExAcquireFastMutexFINAL(lines 3627 3633) no Hoare annotation was computed. [2019-09-07 13:12:11,045 INFO L443 ceAbstractionStarter]: For program point L2301-1(line 2301) no Hoare annotation was computed. [2019-09-07 13:12:11,045 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-09-07 13:12:11,046 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-09-07 13:12:11,046 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-09-07 13:12:11,046 INFO L443 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 2289 2305) no Hoare annotation was computed. [2019-09-07 13:12:11,046 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-09-07 13:12:11,046 INFO L443 ceAbstractionStarter]: For program point L2297-1(line 2297) no Hoare annotation was computed. [2019-09-07 13:12:11,046 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-09-07 13:12:11,046 INFO L443 ceAbstractionStarter]: For program point L2298-1(line 2298) no Hoare annotation was computed. [2019-09-07 13:12:11,047 INFO L443 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 2289 2305) no Hoare annotation was computed. [2019-09-07 13:12:11,047 INFO L443 ceAbstractionStarter]: For program point L2296-1(line 2296) no Hoare annotation was computed. [2019-09-07 13:12:11,047 INFO L443 ceAbstractionStarter]: For program point L2653(lines 2653 2657) no Hoare annotation was computed. [2019-09-07 13:12:11,047 INFO L443 ceAbstractionStarter]: For program point L2612(lines 2612 2669) no Hoare annotation was computed. [2019-09-07 13:12:11,047 INFO L443 ceAbstractionStarter]: For program point L2612-2(lines 2612 2669) no Hoare annotation was computed. [2019-09-07 13:12:11,047 INFO L443 ceAbstractionStarter]: For program point L2637-1(lines 2637 2641) no Hoare annotation was computed. [2019-09-07 13:12:11,047 INFO L443 ceAbstractionStarter]: For program point L2637(lines 2637 2641) no Hoare annotation was computed. [2019-09-07 13:12:11,047 INFO L443 ceAbstractionStarter]: For program point L2629-1(line 2629) no Hoare annotation was computed. [2019-09-07 13:12:11,047 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-09-07 13:12:11,048 INFO L443 ceAbstractionStarter]: For program point L2621-1(line 2621) no Hoare annotation was computed. [2019-09-07 13:12:11,048 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-09-07 13:12:11,048 INFO L443 ceAbstractionStarter]: For program point L2617(lines 2617 2626) no Hoare annotation was computed. [2019-09-07 13:12:11,048 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-09-07 13:12:11,048 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-09-07 13:12:11,048 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-09-07 13:12:11,048 INFO L443 ceAbstractionStarter]: For program point L2630-1(line 2630) no Hoare annotation was computed. [2019-09-07 13:12:11,048 INFO L443 ceAbstractionStarter]: For program point L2651-1(lines 2651 2660) no Hoare annotation was computed. [2019-09-07 13:12:11,048 INFO L443 ceAbstractionStarter]: For program point L2651(lines 2651 2660) no Hoare annotation was computed. [2019-09-07 13:12:11,049 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-09-07 13:12:11,049 INFO L443 ceAbstractionStarter]: For program point L2680-1(line 2680) no Hoare annotation was computed. [2019-09-07 13:12:11,049 INFO L443 ceAbstractionStarter]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2019-09-07 13:12:11,049 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-09-07 13:12:11,049 INFO L443 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 2596 2685) no Hoare annotation was computed. [2019-09-07 13:12:11,049 INFO L443 ceAbstractionStarter]: For program point L2664(lines 2664 2665) no Hoare annotation was computed. [2019-09-07 13:12:11,049 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-09-07 13:12:11,049 INFO L443 ceAbstractionStarter]: For program point L2631-1(line 2631) no Hoare annotation was computed. [2019-09-07 13:12:11,050 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-09-07 13:12:11,050 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-09-07 13:12:11,050 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-09-07 13:12:11,050 INFO L443 ceAbstractionStarter]: For program point L2611(lines 2611 2683) no Hoare annotation was computed. [2019-09-07 13:12:11,050 INFO L443 ceAbstractionStarter]: For program point L2673-1(line 2673) no Hoare annotation was computed. [2019-09-07 13:12:11,050 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-09-07 13:12:11,050 INFO L443 ceAbstractionStarter]: For program point L2636(line 2636) no Hoare annotation was computed. [2019-09-07 13:12:11,050 INFO L443 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 2596 2685) no Hoare annotation was computed. [2019-09-07 13:12:11,051 INFO L443 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 2306 2327) no Hoare annotation was computed. [2019-09-07 13:12:11,051 INFO L443 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 2306 2327) no Hoare annotation was computed. [2019-09-07 13:12:11,051 INFO L443 ceAbstractionStarter]: For program point L2323-1(line 2323) no Hoare annotation was computed. [2019-09-07 13:12:11,051 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-09-07 13:12:11,051 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-09-07 13:12:11,051 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-09-07 13:12:11,051 INFO L443 ceAbstractionStarter]: For program point L2317-1(line 2317) no Hoare annotation was computed. [2019-09-07 13:12:11,052 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-09-07 13:12:11,052 INFO L443 ceAbstractionStarter]: For program point L2318-1(line 2318) no Hoare annotation was computed. [2019-09-07 13:12:11,052 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-09-07 13:12:11,052 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-09-07 13:12:11,052 INFO L443 ceAbstractionStarter]: For program point L2316-1(line 2316) no Hoare annotation was computed. [2019-09-07 13:12:11,052 INFO L443 ceAbstractionStarter]: For program point L2314-1(line 2314) no Hoare annotation was computed. [2019-09-07 13:12:11,052 INFO L443 ceAbstractionStarter]: For program point L4098-1(line 4098) no Hoare annotation was computed. [2019-09-07 13:12:11,053 INFO L443 ceAbstractionStarter]: For program point L4090(lines 4090 4111) no Hoare annotation was computed. [2019-09-07 13:12:11,053 INFO L443 ceAbstractionStarter]: For program point L4090-1(lines 4089 4160) no Hoare annotation was computed. [2019-09-07 13:12:11,053 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-09-07 13:12:11,053 INFO L443 ceAbstractionStarter]: For program point L4115(lines 4115 4134) no Hoare annotation was computed. [2019-09-07 13:12:11,053 INFO L443 ceAbstractionStarter]: For program point L4140(lines 4140 4157) no Hoare annotation was computed. [2019-09-07 13:12:11,053 INFO L443 ceAbstractionStarter]: For program point L4091(lines 4091 4101) no Hoare annotation was computed. [2019-09-07 13:12:11,053 INFO L443 ceAbstractionStarter]: For program point L4091-2(lines 4090 4109) no Hoare annotation was computed. [2019-09-07 13:12:11,054 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-09-07 13:12:11,054 INFO L443 ceAbstractionStarter]: For program point L4149(lines 4149 4156) no Hoare annotation was computed. [2019-09-07 13:12:11,054 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-09-07 13:12:11,054 INFO L443 ceAbstractionStarter]: For program point L4141(lines 4141 4147) no Hoare annotation was computed. [2019-09-07 13:12:11,055 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-09-07 13:12:11,055 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 4080 4161) no Hoare annotation was computed. [2019-09-07 13:12:11,055 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-09-07 13:12:11,055 INFO L443 ceAbstractionStarter]: For program point L4154-1(lines 4136 4158) no Hoare annotation was computed. [2019-09-07 13:12:11,055 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 4080 4161) no Hoare annotation was computed. [2019-09-07 13:12:11,055 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-09-07 13:12:11,056 INFO L443 ceAbstractionStarter]: For program point L4093-1(line 4093) no Hoare annotation was computed. [2019-09-07 13:12:11,056 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-09-07 13:12:11,056 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-09-07 13:12:11,056 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-09-07 13:12:11,056 INFO L443 ceAbstractionStarter]: For program point ExReleaseFastMutexFINAL(lines 3635 3641) no Hoare annotation was computed. [2019-09-07 13:12:11,056 INFO L443 ceAbstractionStarter]: For program point ExReleaseFastMutexENTRY(lines 3635 3641) no Hoare annotation was computed. [2019-09-07 13:12:11,057 INFO L443 ceAbstractionStarter]: For program point ExReleaseFastMutexEXIT(lines 3635 3641) no Hoare annotation was computed. [2019-09-07 13:12:11,057 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:12:11,057 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-09-07 13:12:11,057 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:12:11,057 INFO L443 ceAbstractionStarter]: For program point L3074-1(line 3074) no Hoare annotation was computed. [2019-09-07 13:12:11,057 INFO L443 ceAbstractionStarter]: For program point L3103-1(line 3103) no Hoare annotation was computed. [2019-09-07 13:12:11,057 INFO L443 ceAbstractionStarter]: For program point L3103(line 3103) no Hoare annotation was computed. [2019-09-07 13:12:11,057 INFO L443 ceAbstractionStarter]: For program point L3066-2(lines 3066 3078) no Hoare annotation was computed. [2019-09-07 13:12:11,057 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiDataBlockENTRY(lines 3030 3119) no Hoare annotation was computed. [2019-09-07 13:12:11,057 INFO L443 ceAbstractionStarter]: For program point L3062(line 3062) no Hoare annotation was computed. [2019-09-07 13:12:11,058 INFO L443 ceAbstractionStarter]: For program point L3058(line 3058) no Hoare annotation was computed. [2019-09-07 13:12:11,058 INFO L443 ceAbstractionStarter]: For program point L3058-1(line 3058) no Hoare annotation was computed. [2019-09-07 13:12:11,058 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiDataBlockFINAL(lines 3030 3119) no Hoare annotation was computed. [2019-09-07 13:12:11,058 INFO L443 ceAbstractionStarter]: For program point L3079(lines 3065 3080) no Hoare annotation was computed. [2019-09-07 13:12:11,058 INFO L443 ceAbstractionStarter]: For program point L3067(line 3067) no Hoare annotation was computed. [2019-09-07 13:12:11,058 INFO L443 ceAbstractionStarter]: For program point L3096(lines 3096 3097) no Hoare annotation was computed. [2019-09-07 13:12:11,058 INFO L443 ceAbstractionStarter]: For program point L3084(lines 3084 3088) no Hoare annotation was computed. [2019-09-07 13:12:11,058 INFO L443 ceAbstractionStarter]: For program point L3068(lines 3068 3072) no Hoare annotation was computed. [2019-09-07 13:12:11,058 INFO L443 ceAbstractionStarter]: For program point L3068-1(lines 3068 3072) no Hoare annotation was computed. [2019-09-07 13:12:11,058 INFO L443 ceAbstractionStarter]: For program point L3056(lines 3056 3109) no Hoare annotation was computed. [2019-09-07 13:12:11,058 INFO L443 ceAbstractionStarter]: For program point L3102(line 3102) no Hoare annotation was computed. [2019-09-07 13:12:11,059 INFO L443 ceAbstractionStarter]: For program point L3102-1(line 3102) no Hoare annotation was computed. [2019-09-07 13:12:11,059 INFO L443 ceAbstractionStarter]: For program point L3094(lines 3094 3095) no Hoare annotation was computed. [2019-09-07 13:12:11,059 INFO L443 ceAbstractionStarter]: For program point L3061-1(line 3061) no Hoare annotation was computed. [2019-09-07 13:12:11,059 INFO L443 ceAbstractionStarter]: For program point L3061(line 3061) no Hoare annotation was computed. [2019-09-07 13:12:11,059 INFO L443 ceAbstractionStarter]: For program point L3094-1(lines 3094 3095) no Hoare annotation was computed. [2019-09-07 13:12:11,059 INFO L443 ceAbstractionStarter]: For program point L3053(lines 3053 3110) no Hoare annotation was computed. [2019-09-07 13:12:11,059 INFO L443 ceAbstractionStarter]: For program point L3082(lines 3082 3091) no Hoare annotation was computed. [2019-09-07 13:12:11,059 INFO L443 ceAbstractionStarter]: For program point DiskperfQueryWmiDataBlockEXIT(lines 3030 3119) no Hoare annotation was computed. [2019-09-07 13:12:11,059 INFO L443 ceAbstractionStarter]: For program point L3115(line 3115) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point L3049-1(lines 3049 3113) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point L3049(lines 3049 3113) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point L3082-1(lines 3082 3091) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point L3074(line 3074) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point KeGetCurrentProcessorNumberEXIT(lines 1539 1545) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point KeGetCurrentProcessorNumberENTRY(lines 1539 1545) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point KeGetCurrentProcessorNumberFINAL(lines 1539 1545) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point RtlCopyUnicodeStringEXIT(lines 4611 4618) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point RtlCopyUnicodeStringENTRY(lines 4611 4618) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point RtlCopyUnicodeStringFINAL(lines 4611 4618) no Hoare annotation was computed. [2019-09-07 13:12:11,060 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-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 2739 2752) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point L2748-1(line 2748) no Hoare annotation was computed. [2019-09-07 13:12:11,060 INFO L443 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 2739 2752) no Hoare annotation was computed. [2019-09-07 13:12:11,061 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-09-07 13:12:11,061 INFO L443 ceAbstractionStarter]: For program point KeInitializeSemaphoreFINAL(lines 4221 4227) no Hoare annotation was computed. [2019-09-07 13:12:11,061 INFO L443 ceAbstractionStarter]: For program point KeInitializeSemaphoreEXIT(lines 4221 4227) no Hoare annotation was computed. [2019-09-07 13:12:11,061 INFO L443 ceAbstractionStarter]: For program point KeInitializeSemaphoreENTRY(lines 4221 4227) no Hoare annotation was computed. [2019-09-07 13:12:11,061 INFO L443 ceAbstractionStarter]: For program point KfReleaseSpinLockENTRY(lines 4248 4254) no Hoare annotation was computed. [2019-09-07 13:12:11,061 INFO L443 ceAbstractionStarter]: For program point KfReleaseSpinLockFINAL(lines 4248 4254) no Hoare annotation was computed. [2019-09-07 13:12:11,061 INFO L443 ceAbstractionStarter]: For program point KfReleaseSpinLockEXIT(lines 4248 4254) no Hoare annotation was computed. [2019-09-07 13:12:11,061 INFO L443 ceAbstractionStarter]: For program point L4705(lines 4704 4718) no Hoare annotation was computed. [2019-09-07 13:12:11,061 INFO L443 ceAbstractionStarter]: For program point ZwCloseENTRY(lines 4700 4720) no Hoare annotation was computed. [2019-09-07 13:12:11,061 INFO L443 ceAbstractionStarter]: For program point L4704(lines 4704 4718) no Hoare annotation was computed. [2019-09-07 13:12:11,061 INFO L443 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 4700 4720) no Hoare annotation was computed. [2019-09-07 13:12:11,062 INFO L443 ceAbstractionStarter]: For program point L4715(lines 4700 4720) no Hoare annotation was computed. [2019-09-07 13:12:11,062 INFO L443 ceAbstractionStarter]: For program point L4708(lines 4707 4717) no Hoare annotation was computed. [2019-09-07 13:12:11,062 INFO L443 ceAbstractionStarter]: For program point MmMapLockedPagesSpecifyCacheEXIT(lines 4356 4364) no Hoare annotation was computed. [2019-09-07 13:12:11,062 INFO L443 ceAbstractionStarter]: For program point MmMapLockedPagesSpecifyCacheENTRY(lines 4356 4364) no Hoare annotation was computed. [2019-09-07 13:12:11,062 INFO L443 ceAbstractionStarter]: For program point MmMapLockedPagesSpecifyCacheFINAL(lines 4356 4364) no Hoare annotation was computed. [2019-09-07 13:12:11,062 INFO L443 ceAbstractionStarter]: For program point WmiSystemControlEXIT(lines 4721 4728) no Hoare annotation was computed. [2019-09-07 13:12:11,062 INFO L443 ceAbstractionStarter]: For program point WmiSystemControlENTRY(lines 4721 4728) no Hoare annotation was computed. [2019-09-07 13:12:11,062 INFO L443 ceAbstractionStarter]: For program point WmiSystemControlFINAL(lines 4721 4728) no Hoare annotation was computed. [2019-09-07 13:12:11,062 INFO L446 ceAbstractionStarter]: At program point KeQuerySystemTimeENTRY(lines 1573 1576) the Hoare annotation is: true [2019-09-07 13:12:11,063 INFO L443 ceAbstractionStarter]: For program point KeQuerySystemTimeFINAL(lines 1573 1576) no Hoare annotation was computed. [2019-09-07 13:12:11,063 INFO L443 ceAbstractionStarter]: For program point KeQuerySystemTimeEXIT(lines 1573 1576) no Hoare annotation was computed. [2019-09-07 13:12:11,063 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-09-07 13:12:11,063 INFO L443 ceAbstractionStarter]: For program point L3520(line 3520) no Hoare annotation was computed. [2019-09-07 13:12:11,063 INFO L443 ceAbstractionStarter]: For program point L3330-3(lines 3330 3335) no Hoare annotation was computed. [2019-09-07 13:12:11,063 INFO L443 ceAbstractionStarter]: For program point L3578(lines 3578 3584) no Hoare annotation was computed. [2019-09-07 13:12:11,063 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 3233 3624) no Hoare annotation was computed. [2019-09-07 13:12:11,063 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-09-07 13:12:11,063 INFO L443 ceAbstractionStarter]: For program point L3256-3(lines 3256 3261) no Hoare annotation was computed. [2019-09-07 13:12:11,063 INFO L443 ceAbstractionStarter]: For program point L3496(lines 3496 3541) no Hoare annotation was computed. [2019-09-07 13:12:11,063 INFO L443 ceAbstractionStarter]: For program point L3530(line 3530) no Hoare annotation was computed. [2019-09-07 13:12:11,064 INFO L443 ceAbstractionStarter]: For program point L3563(lines 3563 3567) no Hoare annotation was computed. [2019-09-07 13:12:11,064 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-09-07 13:12:11,064 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-09-07 13:12:11,064 INFO L443 ceAbstractionStarter]: For program point L3464-1(lines 3461 3623) no Hoare annotation was computed. [2019-09-07 13:12:11,064 INFO L443 ceAbstractionStarter]: For program point L3555(lines 3555 3559) no Hoare annotation was computed. [2019-09-07 13:12:11,064 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-09-07 13:12:11,064 INFO L446 ceAbstractionStarter]: At program point L3506(lines 3505 3538) the Hoare annotation is: true [2019-09-07 13:12:11,064 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 3233 3624) no Hoare annotation was computed. [2019-09-07 13:12:11,064 INFO L443 ceAbstractionStarter]: For program point L3333(lines 3333 3334) no Hoare annotation was computed. [2019-09-07 13:12:11,065 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-09-07 13:12:11,065 INFO L443 ceAbstractionStarter]: For program point L3490(lines 3490 3543) no Hoare annotation was computed. [2019-09-07 13:12:11,065 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-09-07 13:12:11,065 INFO L443 ceAbstractionStarter]: For program point L3259(lines 3259 3260) no Hoare annotation was computed. [2019-09-07 13:12:11,065 INFO L443 ceAbstractionStarter]: For program point L3515(line 3515) no Hoare annotation was computed. [2019-09-07 13:12:11,065 INFO L443 ceAbstractionStarter]: For program point L3573(lines 3573 3618) no Hoare annotation was computed. [2019-09-07 13:12:11,065 INFO L443 ceAbstractionStarter]: For program point L3466(lines 3461 3623) no Hoare annotation was computed. [2019-09-07 13:12:11,065 INFO L443 ceAbstractionStarter]: For program point L3499(lines 3499 3540) no Hoare annotation was computed. [2019-09-07 13:12:11,065 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-09-07 13:12:11,065 INFO L443 ceAbstractionStarter]: For program point L3483(lines 3466 3551) no Hoare annotation was computed. [2019-09-07 13:12:11,065 INFO L443 ceAbstractionStarter]: For program point L3599(lines 3599 3615) no Hoare annotation was computed. [2019-09-07 13:12:11,066 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-09-07 13:12:11,066 INFO L443 ceAbstractionStarter]: For program point L3591(lines 3591 3597) no Hoare annotation was computed. [2019-09-07 13:12:11,066 INFO L443 ceAbstractionStarter]: For program point L3525(line 3525) no Hoare annotation was computed. [2019-09-07 13:12:11,066 INFO L443 ceAbstractionStarter]: For program point L3608(lines 3608 3614) no Hoare annotation was computed. [2019-09-07 13:12:11,066 INFO L443 ceAbstractionStarter]: For program point L3608-1(lines 3554 3621) no Hoare annotation was computed. [2019-09-07 13:12:11,066 INFO L443 ceAbstractionStarter]: For program point L3476(lines 3476 3481) no Hoare annotation was computed. [2019-09-07 13:12:11,066 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-09-07 13:12:11,066 INFO L443 ceAbstractionStarter]: For program point L3600(lines 3600 3606) no Hoare annotation was computed. [2019-09-07 13:12:11,066 INFO L443 ceAbstractionStarter]: For program point L3493(lines 3493 3542) no Hoare annotation was computed. [2019-09-07 13:12:11,066 INFO L443 ceAbstractionStarter]: For program point L3576(lines 3576 3617) no Hoare annotation was computed. [2019-09-07 13:12:11,066 INFO L443 ceAbstractionStarter]: For program point L3510(line 3510) no Hoare annotation was computed. [2019-09-07 13:12:11,067 INFO L443 ceAbstractionStarter]: For program point L3502(lines 3502 3539) no Hoare annotation was computed. [2019-09-07 13:12:11,067 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-09-07 13:12:11,067 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-09-07 13:12:11,067 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-09-07 13:12:11,067 INFO L443 ceAbstractionStarter]: For program point L3577(lines 3577 3587) no Hoare annotation was computed. [2019-09-07 13:12:11,067 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-09-07 13:12:11,068 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-09-07 13:12:11,068 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-09-07 13:12:11,068 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-09-07 13:12:11,069 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-09-07 13:12:11,069 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListENTRY(lines 3681 3689) no Hoare annotation was computed. [2019-09-07 13:12:11,069 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListFINAL(lines 3681 3689) no Hoare annotation was computed. [2019-09-07 13:12:11,069 INFO L443 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListEXIT(lines 3681 3689) no Hoare annotation was computed. [2019-09-07 13:12:11,069 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-09-07 13:12:11,069 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-09-07 13:12:11,069 INFO L443 ceAbstractionStarter]: For program point L4072-1(lines 4064 4077) no Hoare annotation was computed. [2019-09-07 13:12:11,069 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 4064 4077) no Hoare annotation was computed. [2019-09-07 13:12:11,070 INFO L443 ceAbstractionStarter]: For program point PoStartNextPowerIrpENTRY(lines 4513 4519) no Hoare annotation was computed. [2019-09-07 13:12:11,070 INFO L443 ceAbstractionStarter]: For program point PoStartNextPowerIrpFINAL(lines 4513 4519) no Hoare annotation was computed. [2019-09-07 13:12:11,070 INFO L443 ceAbstractionStarter]: For program point PoStartNextPowerIrpEXIT(lines 4513 4519) no Hoare annotation was computed. [2019-09-07 13:12:11,070 INFO L443 ceAbstractionStarter]: For program point IoAllocateErrorLogEntryFINAL(lines 1613 1618) no Hoare annotation was computed. [2019-09-07 13:12:11,070 INFO L443 ceAbstractionStarter]: For program point L1614(lines 1614 1616) no Hoare annotation was computed. [2019-09-07 13:12:11,070 INFO L443 ceAbstractionStarter]: For program point IoAllocateErrorLogEntryEXIT(lines 1613 1618) no Hoare annotation was computed. [2019-09-07 13:12:11,070 INFO L446 ceAbstractionStarter]: At program point IoAllocateErrorLogEntryENTRY(lines 1613 1618) the Hoare annotation is: true [2019-09-07 13:12:11,070 INFO L443 ceAbstractionStarter]: For program point ExFreePoolENTRY(lines 3659 3665) no Hoare annotation was computed. [2019-09-07 13:12:11,070 INFO L443 ceAbstractionStarter]: For program point ExFreePoolFINAL(lines 3659 3665) no Hoare annotation was computed. [2019-09-07 13:12:11,070 INFO L443 ceAbstractionStarter]: For program point ExFreePoolEXIT(lines 3659 3665) no Hoare annotation was computed. [2019-09-07 13:12:11,071 INFO L443 ceAbstractionStarter]: For program point KeAcquireSpinLockRaiseToDpcENTRY(lines 4179 4185) no Hoare annotation was computed. [2019-09-07 13:12:11,071 INFO L443 ceAbstractionStarter]: For program point KeAcquireSpinLockRaiseToDpcFINAL(lines 4179 4185) no Hoare annotation was computed. [2019-09-07 13:12:11,071 INFO L443 ceAbstractionStarter]: For program point KeAcquireSpinLockRaiseToDpcEXIT(lines 4179 4185) no Hoare annotation was computed. [2019-09-07 13:12:11,071 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 4257 4264) the Hoare annotation is: true [2019-09-07 13:12:11,071 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 4257 4264) no Hoare annotation was computed. [2019-09-07 13:12:11,071 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 4257 4264) no Hoare annotation was computed. [2019-09-07 13:12:11,071 INFO L443 ceAbstractionStarter]: For program point L3136(lines 3136 3142) no Hoare annotation was computed. [2019-09-07 13:12:11,071 INFO L443 ceAbstractionStarter]: For program point L3138-1(line 3138) no Hoare annotation was computed. [2019-09-07 13:12:11,071 INFO L443 ceAbstractionStarter]: For program point L3169(line 3169) no Hoare annotation was computed. [2019-09-07 13:12:11,071 INFO L443 ceAbstractionStarter]: For program point DiskperfWmiFunctionControlFINAL(lines 3120 3173) no Hoare annotation was computed. [2019-09-07 13:12:11,071 INFO L443 ceAbstractionStarter]: For program point L3136-2(lines 3136 3142) no Hoare annotation was computed. [2019-09-07 13:12:11,072 INFO L443 ceAbstractionStarter]: For program point L3130(lines 3130 3163) no Hoare annotation was computed. [2019-09-07 13:12:11,072 INFO L443 ceAbstractionStarter]: For program point DiskperfWmiFunctionControlENTRY(lines 3120 3173) no Hoare annotation was computed. [2019-09-07 13:12:11,072 INFO L443 ceAbstractionStarter]: For program point L3130-1(lines 3130 3163) no Hoare annotation was computed. [2019-09-07 13:12:11,072 INFO L443 ceAbstractionStarter]: For program point L3135(lines 3135 3149) no Hoare annotation was computed. [2019-09-07 13:12:11,072 INFO L443 ceAbstractionStarter]: For program point L3133-1(line 3133) no Hoare annotation was computed. [2019-09-07 13:12:11,072 INFO L443 ceAbstractionStarter]: For program point L3133(line 3133) no Hoare annotation was computed. [2019-09-07 13:12:11,072 INFO L443 ceAbstractionStarter]: For program point DiskperfWmiFunctionControlEXIT(lines 3120 3173) no Hoare annotation was computed. [2019-09-07 13:12:11,072 INFO L443 ceAbstractionStarter]: For program point L3131(lines 3131 3160) no Hoare annotation was computed. [2019-09-07 13:12:11,072 INFO L443 ceAbstractionStarter]: For program point L3129(lines 3129 3167) no Hoare annotation was computed. [2019-09-07 13:12:11,072 INFO L443 ceAbstractionStarter]: For program point L3129-2(lines 3129 3167) no Hoare annotation was computed. [2019-09-07 13:12:11,072 INFO L443 ceAbstractionStarter]: For program point L3154(lines 3154 3159) no Hoare annotation was computed. [2019-09-07 13:12:11,073 INFO L443 ceAbstractionStarter]: For program point L3152(line 3152) no Hoare annotation was computed. [2019-09-07 13:12:11,073 INFO L443 ceAbstractionStarter]: For program point L3152-1(line 3152) no Hoare annotation was computed. [2019-09-07 13:12:11,073 INFO L443 ceAbstractionStarter]: For program point L3144(line 3144) no Hoare annotation was computed. [2019-09-07 13:12:11,073 INFO L443 ceAbstractionStarter]: For program point L3138(line 3138) no Hoare annotation was computed. [2019-09-07 13:12:11,073 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 3219 3232) no Hoare annotation was computed. [2019-09-07 13:12:11,073 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-09-07 13:12:11,073 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 3219 3232) no Hoare annotation was computed. [2019-09-07 13:12:11,073 INFO L443 ceAbstractionStarter]: For program point L3867(lines 3866 3876) no Hoare annotation was computed. [2019-09-07 13:12:11,073 INFO L443 ceAbstractionStarter]: For program point L3864(lines 3863 3877) no Hoare annotation was computed. [2019-09-07 13:12:11,074 INFO L443 ceAbstractionStarter]: For program point L3863(lines 3863 3877) no Hoare annotation was computed. [2019-09-07 13:12:11,074 INFO L443 ceAbstractionStarter]: For program point IoCreateSymbolicLinkEXIT(lines 3859 3879) no Hoare annotation was computed. [2019-09-07 13:12:11,074 INFO L443 ceAbstractionStarter]: For program point IoCreateSymbolicLinkENTRY(lines 3859 3879) no Hoare annotation was computed. [2019-09-07 13:12:11,074 INFO L443 ceAbstractionStarter]: For program point L3874(lines 3859 3879) no Hoare annotation was computed. [2019-09-07 13:12:11,074 INFO L443 ceAbstractionStarter]: For program point L2130-1(line 2130) no Hoare annotation was computed. [2019-09-07 13:12:11,074 INFO L443 ceAbstractionStarter]: For program point DriverEntryFINAL(lines 2123 2155) no Hoare annotation was computed. [2019-09-07 13:12:11,074 INFO L443 ceAbstractionStarter]: For program point DriverEntryEXIT(lines 2123 2155) no Hoare annotation was computed. [2019-09-07 13:12:11,074 INFO L443 ceAbstractionStarter]: For program point DriverEntryENTRY(lines 2123 2155) no Hoare annotation was computed. [2019-09-07 13:12:11,074 INFO L443 ceAbstractionStarter]: For program point L2133(lines 2133 2140) no Hoare annotation was computed. [2019-09-07 13:12:11,074 INFO L443 ceAbstractionStarter]: For program point L2130(line 2130) no Hoare annotation was computed. [2019-09-07 13:12:11,074 INFO L443 ceAbstractionStarter]: For program point L2133-2(lines 2133 2140) no Hoare annotation was computed. [2019-09-07 13:12:11,075 INFO L443 ceAbstractionStarter]: For program point RtlCompareMemoryEXIT(lines 4601 4608) no Hoare annotation was computed. [2019-09-07 13:12:11,075 INFO L443 ceAbstractionStarter]: For program point RtlCompareMemoryENTRY(lines 4601 4608) no Hoare annotation was computed. [2019-09-07 13:12:11,075 INFO L443 ceAbstractionStarter]: For program point RtlCompareMemoryFINAL(lines 4601 4608) no Hoare annotation was computed. [2019-09-07 13:12:11,075 INFO L443 ceAbstractionStarter]: For program point DiskPerfUnloadENTRY(lines 2753 2759) no Hoare annotation was computed. [2019-09-07 13:12:11,075 INFO L443 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 2753 2759) no Hoare annotation was computed. [2019-09-07 13:12:11,075 INFO L443 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 2753 2759) no Hoare annotation was computed. [2019-09-07 13:12:11,075 INFO L443 ceAbstractionStarter]: For program point L4566(lines 4551 4571) no Hoare annotation was computed. [2019-09-07 13:12:11,075 INFO L443 ceAbstractionStarter]: For program point L4559(lines 4558 4568) no Hoare annotation was computed. [2019-09-07 13:12:11,075 INFO L443 ceAbstractionStarter]: For program point L4555(lines 4555 4569) no Hoare annotation was computed. [2019-09-07 13:12:11,075 INFO L443 ceAbstractionStarter]: For program point L4556(lines 4555 4569) no Hoare annotation was computed. [2019-09-07 13:12:11,076 INFO L443 ceAbstractionStarter]: For program point PsTerminateSystemThreadEXIT(lines 4551 4571) no Hoare annotation was computed. [2019-09-07 13:12:11,076 INFO L443 ceAbstractionStarter]: For program point PsTerminateSystemThreadENTRY(lines 4551 4571) no Hoare annotation was computed. [2019-09-07 13:12:11,076 INFO L443 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 2278 2288) no Hoare annotation was computed. [2019-09-07 13:12:11,076 INFO L446 ceAbstractionStarter]: At program point L2284(line 2284) the Hoare annotation is: true [2019-09-07 13:12:11,076 INFO L446 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 2278 2288) the Hoare annotation is: true [2019-09-07 13:12:11,076 INFO L443 ceAbstractionStarter]: For program point L2284-1(line 2284) no Hoare annotation was computed. [2019-09-07 13:12:11,076 INFO L443 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 2278 2288) no Hoare annotation was computed. [2019-09-07 13:12:11,076 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-09-07 13:12:11,076 INFO L443 ceAbstractionStarter]: For program point L2266(line 2266) no Hoare annotation was computed. [2019-09-07 13:12:11,076 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 2238 2277) no Hoare annotation was computed. [2019-09-07 13:12:11,077 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 2238 2277) no Hoare annotation was computed. [2019-09-07 13:12:11,077 INFO L443 ceAbstractionStarter]: For program point L2261(line 2261) no Hoare annotation was computed. [2019-09-07 13:12:11,077 INFO L443 ceAbstractionStarter]: For program point L2256(line 2256) no Hoare annotation was computed. [2019-09-07 13:12:11,077 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-09-07 13:12:11,077 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-09-07 13:12:11,077 INFO L443 ceAbstractionStarter]: For program point L2248(lines 2248 2273) no Hoare annotation was computed. [2019-09-07 13:12:11,077 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-09-07 13:12:11,078 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-09-07 13:12:11,078 INFO L443 ceAbstractionStarter]: For program point L2245(lines 2245 2274) no Hoare annotation was computed. [2019-09-07 13:12:11,078 INFO L443 ceAbstractionStarter]: For program point MmFreeContiguousMemoryEXIT(lines 4343 4349) no Hoare annotation was computed. [2019-09-07 13:12:11,078 INFO L443 ceAbstractionStarter]: For program point MmFreeContiguousMemoryENTRY(lines 4343 4349) no Hoare annotation was computed. [2019-09-07 13:12:11,078 INFO L443 ceAbstractionStarter]: For program point MmFreeContiguousMemoryFINAL(lines 4343 4349) no Hoare annotation was computed. [2019-09-07 13:12:11,078 INFO L443 ceAbstractionStarter]: For program point KeInitializeSpinLockEXIT(lines 4229 4235) no Hoare annotation was computed. [2019-09-07 13:12:11,078 INFO L443 ceAbstractionStarter]: For program point KeInitializeSpinLockENTRY(lines 4229 4235) no Hoare annotation was computed. [2019-09-07 13:12:11,078 INFO L443 ceAbstractionStarter]: For program point KeInitializeSpinLockFINAL(lines 4229 4235) no Hoare annotation was computed. [2019-09-07 13:12:11,079 INFO L443 ceAbstractionStarter]: For program point L2494(lines 2494 2499) no Hoare annotation was computed. [2019-09-07 13:12:11,079 INFO L443 ceAbstractionStarter]: For program point L2492(line 2492) no Hoare annotation was computed. [2019-09-07 13:12:11,079 INFO L443 ceAbstractionStarter]: For program point L2494-2(lines 2452 2526) no Hoare annotation was computed. [2019-09-07 13:12:11,079 INFO L443 ceAbstractionStarter]: For program point L2461(lines 2461 2465) no Hoare annotation was computed. [2019-09-07 13:12:11,079 INFO L443 ceAbstractionStarter]: For program point DiskPerfReadWriteEXIT(lines 2439 2527) no Hoare annotation was computed. [2019-09-07 13:12:11,079 INFO L443 ceAbstractionStarter]: For program point L2523-1(line 2523) no Hoare annotation was computed. [2019-09-07 13:12:11,079 INFO L443 ceAbstractionStarter]: For program point L2461-2(lines 2461 2465) no Hoare annotation was computed. [2019-09-07 13:12:11,079 INFO L443 ceAbstractionStarter]: For program point L2492-1(line 2492) no Hoare annotation was computed. [2019-09-07 13:12:11,079 INFO L443 ceAbstractionStarter]: For program point L2523(line 2523) no Hoare annotation was computed. [2019-09-07 13:12:11,079 INFO L443 ceAbstractionStarter]: For program point L2480(line 2480) no Hoare annotation was computed. [2019-09-07 13:12:11,079 INFO L443 ceAbstractionStarter]: For program point L2478(lines 2478 2485) no Hoare annotation was computed. [2019-09-07 13:12:11,080 INFO L443 ceAbstractionStarter]: For program point L2480-1(line 2480) no Hoare annotation was computed. [2019-09-07 13:12:11,080 INFO L443 ceAbstractionStarter]: For program point L2474(line 2474) no Hoare annotation was computed. [2019-09-07 13:12:11,080 INFO L443 ceAbstractionStarter]: For program point L2507(line 2507) no Hoare annotation was computed. [2019-09-07 13:12:11,080 INFO L443 ceAbstractionStarter]: For program point L2472(lines 2472 2486) no Hoare annotation was computed. [2019-09-07 13:12:11,080 INFO L443 ceAbstractionStarter]: For program point L2505-1(lines 2500 2514) no Hoare annotation was computed. [2019-09-07 13:12:11,080 INFO L443 ceAbstractionStarter]: For program point L2474-1(line 2474) no Hoare annotation was computed. [2019-09-07 13:12:11,080 INFO L443 ceAbstractionStarter]: For program point L2505(lines 2505 2513) no Hoare annotation was computed. [2019-09-07 13:12:11,080 INFO L443 ceAbstractionStarter]: For program point L2468(line 2468) no Hoare annotation was computed. [2019-09-07 13:12:11,080 INFO L443 ceAbstractionStarter]: For program point L2466(lines 2466 2487) no Hoare annotation was computed. [2019-09-07 13:12:11,080 INFO L443 ceAbstractionStarter]: For program point L2468-1(line 2468) no Hoare annotation was computed. [2019-09-07 13:12:11,081 INFO L443 ceAbstractionStarter]: For program point DiskPerfReadWriteFINAL(lines 2439 2527) no Hoare annotation was computed. [2019-09-07 13:12:11,081 INFO L443 ceAbstractionStarter]: For program point L2489-1(line 2489) no Hoare annotation was computed. [2019-09-07 13:12:11,081 INFO L443 ceAbstractionStarter]: For program point L2489(line 2489) no Hoare annotation was computed. [2019-09-07 13:12:11,081 INFO L443 ceAbstractionStarter]: For program point DiskPerfReadWriteENTRY(lines 2439 2527) no Hoare annotation was computed. [2019-09-07 13:12:11,081 INFO L443 ceAbstractionStarter]: For program point L2502(line 2502) no Hoare annotation was computed. [2019-09-07 13:12:11,081 INFO L443 ceAbstractionStarter]: For program point DiskPerfLogErrorFINAL(lines 2978 3003) no Hoare annotation was computed. [2019-09-07 13:12:11,081 INFO L446 ceAbstractionStarter]: At program point L2996(line 2996) the Hoare annotation is: true [2019-09-07 13:12:11,081 INFO L443 ceAbstractionStarter]: For program point L2994(line 2994) no Hoare annotation was computed. [2019-09-07 13:12:11,081 INFO L446 ceAbstractionStarter]: At program point L2993-1(line 2993) the Hoare annotation is: true [2019-09-07 13:12:11,081 INFO L446 ceAbstractionStarter]: At program point L2993(line 2993) the Hoare annotation is: true [2019-09-07 13:12:11,082 INFO L446 ceAbstractionStarter]: At program point DiskPerfLogErrorENTRY(lines 2978 3003) the Hoare annotation is: true [2019-09-07 13:12:11,082 INFO L443 ceAbstractionStarter]: For program point L2988(lines 2988 3000) no Hoare annotation was computed. [2019-09-07 13:12:11,082 INFO L443 ceAbstractionStarter]: For program point L2988-1(lines 2988 3000) no Hoare annotation was computed. [2019-09-07 13:12:11,082 INFO L443 ceAbstractionStarter]: For program point L2985-1(line 2985) no Hoare annotation was computed. [2019-09-07 13:12:11,082 INFO L446 ceAbstractionStarter]: At program point L2985(line 2985) the Hoare annotation is: true [2019-09-07 13:12:11,082 INFO L443 ceAbstractionStarter]: For program point DiskPerfLogErrorEXIT(lines 2978 3003) no Hoare annotation was computed. [2019-09-07 13:12:11,082 INFO L446 ceAbstractionStarter]: At program point KeQueryPerformanceCounterENTRY(lines 1702 1716) the Hoare annotation is: true [2019-09-07 13:12:11,082 INFO L443 ceAbstractionStarter]: For program point KeQueryPerformanceCounterEXIT(lines 1702 1716) no Hoare annotation was computed. [2019-09-07 13:12:11,082 INFO L443 ceAbstractionStarter]: For program point L1711-1(lines 1711 1714) no Hoare annotation was computed. [2019-09-07 13:12:11,082 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1710) no Hoare annotation was computed. [2019-09-07 13:12:11,082 INFO L443 ceAbstractionStarter]: For program point L1706-2(lines 1702 1716) no Hoare annotation was computed. [2019-09-07 13:12:11,083 INFO L443 ceAbstractionStarter]: For program point KeQueryPerformanceCounterFINAL(lines 1702 1716) no Hoare annotation was computed. [2019-09-07 13:12:11,083 INFO L443 ceAbstractionStarter]: For program point ObfDereferenceObjectFINAL(lines 4418 4424) no Hoare annotation was computed. [2019-09-07 13:12:11,083 INFO L443 ceAbstractionStarter]: For program point ObfDereferenceObjectENTRY(lines 4418 4424) no Hoare annotation was computed. [2019-09-07 13:12:11,083 INFO L443 ceAbstractionStarter]: For program point ObfDereferenceObjectEXIT(lines 4418 4424) no Hoare annotation was computed. [2019-09-07 13:12:11,083 INFO L443 ceAbstractionStarter]: For program point WmiCompleteRequestENTRY(lines 2027 2032) no Hoare annotation was computed. [2019-09-07 13:12:11,083 INFO L443 ceAbstractionStarter]: For program point L2028(lines 2028 2030) no Hoare annotation was computed. [2019-09-07 13:12:11,083 INFO L443 ceAbstractionStarter]: For program point WmiCompleteRequestFINAL(lines 2027 2032) no Hoare annotation was computed. [2019-09-07 13:12:11,083 INFO L443 ceAbstractionStarter]: For program point WmiCompleteRequestEXIT(lines 2027 2032) no Hoare annotation was computed. [2019-09-07 13:12:11,083 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-09-07 13:12:11,083 INFO L443 ceAbstractionStarter]: For program point L4445-1(line 4445) no Hoare annotation was computed. [2019-09-07 13:12:11,084 INFO L443 ceAbstractionStarter]: For program point L4499(lines 4499 4506) no Hoare annotation was computed. [2019-09-07 13:12:11,084 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-09-07 13:12:11,084 INFO L443 ceAbstractionStarter]: For program point L4437(lines 4437 4451) no Hoare annotation was computed. [2019-09-07 13:12:11,084 INFO L443 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 4427 4511) no Hoare annotation was computed. [2019-09-07 13:12:11,084 INFO L443 ceAbstractionStarter]: For program point L4491(lines 4491 4497) no Hoare annotation was computed. [2019-09-07 13:12:11,084 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-09-07 13:12:11,084 INFO L443 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 4427 4511) no Hoare annotation was computed. [2019-09-07 13:12:11,084 INFO L443 ceAbstractionStarter]: For program point L4504-1(lines 4486 4508) no Hoare annotation was computed. [2019-09-07 13:12:11,084 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-09-07 13:12:11,085 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-09-07 13:12:11,085 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-09-07 13:12:11,085 INFO L443 ceAbstractionStarter]: For program point L4443(lines 4443 4450) no Hoare annotation was computed. [2019-09-07 13:12:11,085 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-09-07 13:12:11,085 INFO L443 ceAbstractionStarter]: For program point L4439-1(line 4439) no Hoare annotation was computed. [2019-09-07 13:12:11,085 INFO L443 ceAbstractionStarter]: For program point L4443-2(lines 4436 4459) no Hoare annotation was computed. [2019-09-07 13:12:11,085 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-09-07 13:12:11,085 INFO L443 ceAbstractionStarter]: For program point L4436-1(lines 4435 4510) no Hoare annotation was computed. [2019-09-07 13:12:11,085 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-09-07 13:12:11,086 INFO L443 ceAbstractionStarter]: For program point L4436(lines 4436 4461) no Hoare annotation was computed. [2019-09-07 13:12:11,086 INFO L443 ceAbstractionStarter]: For program point L4465(lines 4465 4484) no Hoare annotation was computed. [2019-09-07 13:12:11,086 INFO L443 ceAbstractionStarter]: For program point L4490(lines 4490 4507) no Hoare annotation was computed. [2019-09-07 13:12:11,086 INFO L443 ceAbstractionStarter]: For program point RtlFreeUnicodeStringFINAL(lines 4645 4651) no Hoare annotation was computed. [2019-09-07 13:12:11,086 INFO L443 ceAbstractionStarter]: For program point RtlFreeUnicodeStringEXIT(lines 4645 4651) no Hoare annotation was computed. [2019-09-07 13:12:11,086 INFO L443 ceAbstractionStarter]: For program point RtlFreeUnicodeStringENTRY(lines 4645 4651) no Hoare annotation was computed. [2019-09-07 13:12:11,086 INFO L446 ceAbstractionStarter]: At program point InterlockedIncrementENTRY(lines 1527 1529) the Hoare annotation is: true [2019-09-07 13:12:11,086 INFO L443 ceAbstractionStarter]: For program point InterlockedIncrementFINAL(lines 1527 1529) no Hoare annotation was computed. [2019-09-07 13:12:11,086 INFO L443 ceAbstractionStarter]: For program point InterlockedIncrementEXIT(lines 1527 1529) no Hoare annotation was computed. [2019-09-07 13:12:11,086 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-09-07 13:12:11,087 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 2349 2372) no Hoare annotation was computed. [2019-09-07 13:12:11,087 INFO L443 ceAbstractionStarter]: For program point L2368-1(line 2368) no Hoare annotation was computed. [2019-09-07 13:12:11,087 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-09-07 13:12:11,087 INFO L443 ceAbstractionStarter]: For program point L2361-1(lines 2357 2363) no Hoare annotation was computed. [2019-09-07 13:12:11,087 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-09-07 13:12:11,087 INFO L443 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 2349 2372) no Hoare annotation was computed. [2019-09-07 13:12:11,087 INFO L443 ceAbstractionStarter]: For program point L2357(lines 2357 2363) no Hoare annotation was computed. [2019-09-07 13:12:11,087 INFO L443 ceAbstractionStarter]: For program point KeReleaseSemaphoreFINAL(lines 4238 4245) no Hoare annotation was computed. [2019-09-07 13:12:11,087 INFO L443 ceAbstractionStarter]: For program point KeReleaseSemaphoreENTRY(lines 4238 4245) no Hoare annotation was computed. [2019-09-07 13:12:11,088 INFO L443 ceAbstractionStarter]: For program point KeReleaseSemaphoreEXIT(lines 4238 4245) no Hoare annotation was computed. [2019-09-07 13:12:11,088 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-09-07 13:12:11,088 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 4269 4312) no Hoare annotation was computed. [2019-09-07 13:12:11,088 INFO L443 ceAbstractionStarter]: For program point L4307(lines 4269 4312) no Hoare annotation was computed. [2019-09-07 13:12:11,088 INFO L443 ceAbstractionStarter]: For program point L4274(lines 4274 4295) no Hoare annotation was computed. [2019-09-07 13:12:11,088 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-09-07 13:12:11,088 INFO L443 ceAbstractionStarter]: For program point L4287(lines 4287 4293) no Hoare annotation was computed. [2019-09-07 13:12:11,088 INFO L443 ceAbstractionStarter]: For program point L4287-1(lines 4273 4311) no Hoare annotation was computed. [2019-09-07 13:12:11,089 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-09-07 13:12:11,089 INFO L443 ceAbstractionStarter]: For program point L4275(lines 4275 4280) no Hoare annotation was computed. [2019-09-07 13:12:11,089 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-09-07 13:12:11,089 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-09-07 13:12:11,089 INFO L446 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2019-09-07 13:12:11,089 INFO L446 ceAbstractionStarter]: At program point #Ultimate.C_memmoveENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:12:11,090 INFO L446 ceAbstractionStarter]: At program point L-1-3(line -1) the Hoare annotation is: true [2019-09-07 13:12:11,090 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memmoveFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:12:11,090 INFO L443 ceAbstractionStarter]: For program point #Ultimate.C_memmoveEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:12:11,090 INFO L443 ceAbstractionStarter]: For program point MmPageEntireDriverEXIT(lines 4366 4372) no Hoare annotation was computed. [2019-09-07 13:12:11,090 INFO L443 ceAbstractionStarter]: For program point MmPageEntireDriverENTRY(lines 4366 4372) no Hoare annotation was computed. [2019-09-07 13:12:11,090 INFO L443 ceAbstractionStarter]: For program point MmPageEntireDriverFINAL(lines 4366 4372) no Hoare annotation was computed. [2019-09-07 13:12:11,090 INFO L443 ceAbstractionStarter]: For program point L4638(lines 4622 4643) no Hoare annotation was computed. [2019-09-07 13:12:11,090 INFO L443 ceAbstractionStarter]: For program point L4631(lines 4630 4640) no Hoare annotation was computed. [2019-09-07 13:12:11,090 INFO L443 ceAbstractionStarter]: For program point L4627(lines 4627 4641) no Hoare annotation was computed. [2019-09-07 13:12:11,091 INFO L443 ceAbstractionStarter]: For program point L4628(lines 4627 4641) no Hoare annotation was computed. [2019-09-07 13:12:11,091 INFO L443 ceAbstractionStarter]: For program point RtlDeleteRegistryValueEXIT(lines 4622 4643) no Hoare annotation was computed. [2019-09-07 13:12:11,091 INFO L443 ceAbstractionStarter]: For program point RtlDeleteRegistryValueENTRY(lines 4622 4643) no Hoare annotation was computed. [2019-09-07 13:12:11,091 INFO L443 ceAbstractionStarter]: For program point DiskPerfAddDeviceEXIT(lines 2167 2237) no Hoare annotation was computed. [2019-09-07 13:12:11,091 INFO L443 ceAbstractionStarter]: For program point L2205-1(line 2205) no Hoare annotation was computed. [2019-09-07 13:12:11,091 INFO L443 ceAbstractionStarter]: For program point L2205(line 2205) no Hoare annotation was computed. [2019-09-07 13:12:11,091 INFO L443 ceAbstractionStarter]: For program point L2195-1(line 2195) no Hoare annotation was computed. [2019-09-07 13:12:11,091 INFO L443 ceAbstractionStarter]: For program point L2226(line 2226) no Hoare annotation was computed. [2019-09-07 13:12:11,091 INFO L443 ceAbstractionStarter]: For program point L2195(line 2195) no Hoare annotation was computed. [2019-09-07 13:12:11,092 INFO L443 ceAbstractionStarter]: For program point L2226-1(line 2226) no Hoare annotation was computed. [2019-09-07 13:12:11,092 INFO L443 ceAbstractionStarter]: For program point L2191-1(line 2191) no Hoare annotation was computed. [2019-09-07 13:12:11,092 INFO L443 ceAbstractionStarter]: For program point L2191(line 2191) no Hoare annotation was computed. [2019-09-07 13:12:11,092 INFO L443 ceAbstractionStarter]: For program point L2183(lines 2183 2187) no Hoare annotation was computed. [2019-09-07 13:12:11,092 INFO L443 ceAbstractionStarter]: For program point DiskPerfAddDeviceENTRY(lines 2167 2237) no Hoare annotation was computed. [2019-09-07 13:12:11,092 INFO L443 ceAbstractionStarter]: For program point L2210(lines 2210 2211) no Hoare annotation was computed. [2019-09-07 13:12:11,092 INFO L443 ceAbstractionStarter]: For program point L2210-1(lines 2210 2211) no Hoare annotation was computed. [2019-09-07 13:12:11,092 INFO L443 ceAbstractionStarter]: For program point L2200(line 2200) no Hoare annotation was computed. [2019-09-07 13:12:11,092 INFO L443 ceAbstractionStarter]: For program point L2198(lines 2198 2207) no Hoare annotation was computed. [2019-09-07 13:12:11,093 INFO L443 ceAbstractionStarter]: For program point L2200-1(line 2200) no Hoare annotation was computed. [2019-09-07 13:12:11,093 INFO L443 ceAbstractionStarter]: For program point L2198-2(lines 2198 2207) no Hoare annotation was computed. [2019-09-07 13:12:11,093 INFO L443 ceAbstractionStarter]: For program point DiskPerfAddDeviceFINAL(lines 2167 2237) no Hoare annotation was computed. [2019-09-07 13:12:11,093 INFO L443 ceAbstractionStarter]: For program point L2192(line 2192) no Hoare annotation was computed. [2019-09-07 13:12:11,093 INFO L443 ceAbstractionStarter]: For program point L2192-1(line 2192) no Hoare annotation was computed. [2019-09-07 13:12:11,093 INFO L443 ceAbstractionStarter]: For program point L2180(lines 2180 2181) no Hoare annotation was computed. [2019-09-07 13:12:11,093 INFO L443 ceAbstractionStarter]: For program point L2213(lines 2213 2220) no Hoare annotation was computed. [2019-09-07 13:12:11,093 INFO L443 ceAbstractionStarter]: For program point L2180-1(lines 2180 2181) no Hoare annotation was computed. [2019-09-07 13:12:11,093 INFO L443 ceAbstractionStarter]: For program point IoFreeMdlENTRY(lines 3927 3933) no Hoare annotation was computed. [2019-09-07 13:12:11,093 INFO L443 ceAbstractionStarter]: For program point IoFreeMdlFINAL(lines 3927 3933) no Hoare annotation was computed. [2019-09-07 13:12:11,094 INFO L443 ceAbstractionStarter]: For program point IoFreeMdlEXIT(lines 3927 3933) no Hoare annotation was computed. [2019-09-07 13:12:11,094 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-09-07 13:12:11,094 INFO L443 ceAbstractionStarter]: For program point L2391(lines 2391 2405) no Hoare annotation was computed. [2019-09-07 13:12:11,094 INFO L443 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 2373 2426) no Hoare annotation was computed. [2019-09-07 13:12:11,094 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-09-07 13:12:11,094 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-09-07 13:12:11,094 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-09-07 13:12:11,095 INFO L443 ceAbstractionStarter]: For program point L2416(lines 2416 2423) no Hoare annotation was computed. [2019-09-07 13:12:11,095 INFO L443 ceAbstractionStarter]: For program point L2418-1(line 2418) no Hoare annotation was computed. [2019-09-07 13:12:11,095 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-09-07 13:12:11,095 INFO L443 ceAbstractionStarter]: For program point L2416-2(lines 2416 2423) no Hoare annotation was computed. [2019-09-07 13:12:11,095 INFO L443 ceAbstractionStarter]: For program point L2414-1(line 2414) no Hoare annotation was computed. [2019-09-07 13:12:11,095 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-09-07 13:12:11,096 INFO L443 ceAbstractionStarter]: For program point L2396(lines 2396 2404) no Hoare annotation was computed. [2019-09-07 13:12:11,096 INFO L443 ceAbstractionStarter]: For program point L2396-1(lines 2391 2405) no Hoare annotation was computed. [2019-09-07 13:12:11,096 INFO L443 ceAbstractionStarter]: For program point L2388(line 2388) no Hoare annotation was computed. [2019-09-07 13:12:11,096 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-09-07 13:12:11,096 INFO L443 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 2373 2426) no Hoare annotation was computed. [2019-09-07 13:12:11,096 INFO L443 ceAbstractionStarter]: For program point L2785-1(line 2785) no Hoare annotation was computed. [2019-09-07 13:12:11,096 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-09-07 13:12:11,096 INFO L443 ceAbstractionStarter]: For program point L2942(lines 2942 2962) no Hoare annotation was computed. [2019-09-07 13:12:11,097 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-09-07 13:12:11,097 INFO L443 ceAbstractionStarter]: For program point L2909-1(line 2909) no Hoare annotation was computed. [2019-09-07 13:12:11,097 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-09-07 13:12:11,097 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-09-07 13:12:11,097 INFO L443 ceAbstractionStarter]: For program point L2876-1(line 2876) no Hoare annotation was computed. [2019-09-07 13:12:11,097 INFO L443 ceAbstractionStarter]: For program point L2835-1(line 2835) no Hoare annotation was computed. [2019-09-07 13:12:11,097 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 (= 0 DiskPerfRegisterDevice_~output~0.base)) (not (= 1 ~pended~0)))) [2019-09-07 13:12:11,097 INFO L443 ceAbstractionStarter]: For program point L2794(lines 2794 2801) no Hoare annotation was computed. [2019-09-07 13:12:11,098 INFO L443 ceAbstractionStarter]: For program point L2794-2(lines 2774 2976) no Hoare annotation was computed. [2019-09-07 13:12:11,098 INFO L443 ceAbstractionStarter]: For program point L2852(lines 2812 2964) no Hoare annotation was computed. [2019-09-07 13:12:11,098 INFO L443 ceAbstractionStarter]: For program point L2885(lines 2885 2892) no Hoare annotation was computed. [2019-09-07 13:12:11,098 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-09-07 13:12:11,098 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-09-07 13:12:11,098 INFO L443 ceAbstractionStarter]: For program point L2844(lines 2844 2851) no Hoare annotation was computed. [2019-09-07 13:12:11,098 INFO L443 ceAbstractionStarter]: For program point L2910-1(line 2910) no Hoare annotation was computed. [2019-09-07 13:12:11,098 INFO L443 ceAbstractionStarter]: For program point L2844-2(lines 2812 2964) no Hoare annotation was computed. [2019-09-07 13:12:11,099 INFO L443 ceAbstractionStarter]: For program point L2968(lines 2968 2974) no Hoare annotation was computed. [2019-09-07 13:12:11,099 INFO L443 ceAbstractionStarter]: For program point L2968-1(lines 2968 2974) no Hoare annotation was computed. [2019-09-07 13:12:11,099 INFO L443 ceAbstractionStarter]: For program point L2869-1(lines 2869 2871) no Hoare annotation was computed. [2019-09-07 13:12:11,099 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-09-07 13:12:11,099 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 (= 0 DiskPerfRegisterDevice_~output~0.base)) (not (= 1 ~pended~0)))) [2019-09-07 13:12:11,099 INFO L443 ceAbstractionStarter]: For program point L2861-1(line 2861) no Hoare annotation was computed. [2019-09-07 13:12:11,099 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-09-07 13:12:11,100 INFO L443 ceAbstractionStarter]: For program point L2828-1(lines 2828 2830) no Hoare annotation was computed. [2019-09-07 13:12:11,100 INFO L439 ceAbstractionStarter]: At program point L2820(line 2820) the Hoare annotation is: (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)) [2019-09-07 13:12:11,100 INFO L443 ceAbstractionStarter]: For program point L2820-1(line 2820) no Hoare annotation was computed. [2019-09-07 13:12:11,100 INFO L443 ceAbstractionStarter]: For program point L2779-1(lines 2779 2781) no Hoare annotation was computed. [2019-09-07 13:12:11,100 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-09-07 13:12:11,100 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-09-07 13:12:11,100 INFO L443 ceAbstractionStarter]: For program point L2796-1(line 2796) no Hoare annotation was computed. [2019-09-07 13:12:11,100 INFO L443 ceAbstractionStarter]: For program point L2920(lines 2920 2927) no Hoare annotation was computed. [2019-09-07 13:12:11,100 INFO L443 ceAbstractionStarter]: For program point L2887-1(line 2887) no Hoare annotation was computed. [2019-09-07 13:12:11,100 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-09-07 13:12:11,100 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-09-07 13:12:11,101 INFO L439 ceAbstractionStarter]: At program point L2846(line 2846) the Hoare annotation is: (let ((.cse1 (not (= 0 DiskPerfRegisterDevice_~output~0.base))) (.cse0 (not (= 1 ~pended~0))) (.cse2 (= DiskPerfRegisterDevice_~status~7 259)) (.cse3 (= ~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 .cse1 (= ~MPR3~0 ~s~0) .cse2 .cse3) (and (= ~s~0 |old(~s~0)|) .cse1 .cse0 .cse2 .cse3))) [2019-09-07 13:12:11,101 INFO L443 ceAbstractionStarter]: For program point L2846-1(line 2846) no Hoare annotation was computed. [2019-09-07 13:12:11,101 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-09-07 13:12:11,101 INFO L443 ceAbstractionStarter]: For program point L2929-1(line 2929) no Hoare annotation was computed. [2019-09-07 13:12:11,101 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-09-07 13:12:11,101 INFO L443 ceAbstractionStarter]: For program point L2946(lines 2946 2947) no Hoare annotation was computed. [2019-09-07 13:12:11,101 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-09-07 13:12:11,101 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-09-07 13:12:11,101 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 (= 0 DiskPerfRegisterDevice_~output~0.base)) (not (= 1 ~pended~0)))) [2019-09-07 13:12:11,101 INFO L443 ceAbstractionStarter]: For program point L2922-1(line 2922) no Hoare annotation was computed. [2019-09-07 13:12:11,101 INFO L443 ceAbstractionStarter]: For program point L2856-1(line 2856) no Hoare annotation was computed. [2019-09-07 13:12:11,101 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-09-07 13:12:11,102 INFO L443 ceAbstractionStarter]: For program point L2914-1(line 2914) no Hoare annotation was computed. [2019-09-07 13:12:11,102 INFO L443 ceAbstractionStarter]: For program point L2815-1(line 2815) no Hoare annotation was computed. [2019-09-07 13:12:11,102 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-09-07 13:12:11,102 INFO L443 ceAbstractionStarter]: For program point L2873(lines 2873 2881) no Hoare annotation was computed. [2019-09-07 13:12:11,102 INFO L443 ceAbstractionStarter]: For program point L2931(lines 2931 2938) no Hoare annotation was computed. [2019-09-07 13:12:11,102 INFO L443 ceAbstractionStarter]: For program point L2832(lines 2832 2840) no Hoare annotation was computed. [2019-09-07 13:12:11,102 INFO L443 ceAbstractionStarter]: For program point L2931-2(lines 2812 2964) no Hoare annotation was computed. [2019-09-07 13:12:11,102 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-09-07 13:12:11,102 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-09-07 13:12:11,102 INFO L443 ceAbstractionStarter]: For program point L2783(lines 2783 2790) no Hoare annotation was computed. [2019-09-07 13:12:11,102 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-09-07 13:12:11,102 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-09-07 13:12:11,103 INFO L443 ceAbstractionStarter]: For program point L2899-1(line 2899) no Hoare annotation was computed. [2019-09-07 13:12:11,103 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-09-07 13:12:11,103 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-09-07 13:12:11,103 INFO L443 ceAbstractionStarter]: For program point L2792-1(line 2792) no Hoare annotation was computed. [2019-09-07 13:12:11,103 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-09-07 13:12:11,103 INFO L443 ceAbstractionStarter]: For program point L2949(lines 2949 2953) no Hoare annotation was computed. [2019-09-07 13:12:11,103 INFO L443 ceAbstractionStarter]: For program point L2883-1(line 2883) no Hoare annotation was computed. [2019-09-07 13:12:11,103 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-09-07 13:12:11,103 INFO L443 ceAbstractionStarter]: For program point L2916-1(lines 2916 2918) no Hoare annotation was computed. [2019-09-07 13:12:11,103 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 (= 0 DiskPerfRegisterDevice_~output~0.base)) (not (= 1 ~pended~0)))) [2019-09-07 13:12:11,103 INFO L443 ceAbstractionStarter]: For program point L2809(lines 2809 2810) no Hoare annotation was computed. [2019-09-07 13:12:11,103 INFO L443 ceAbstractionStarter]: For program point L2842-1(line 2842) no Hoare annotation was computed. [2019-09-07 13:12:11,103 INFO L443 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 2760 2977) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point L2966(line 2966) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point L2933-1(line 2933) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L439 ceAbstractionStarter]: At program point L2933(line 2933) the Hoare annotation is: (let ((.cse2 (not (= 1 ~pended~0))) (.cse0 (<= 259 DiskPerfRegisterDevice_~status~7)) (.cse1 (<= DiskPerfRegisterDevice_~status~7 259)) (.cse3 (= ~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 .cse1 (and .cse2 (= ~MPR3~0 ~s~0) .cse3)) (and (= ~s~0 |old(~s~0)|) .cse2 .cse0 .cse1 .cse3))) [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point L2958(lines 2958 2959) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point L2859(lines 2859 2866) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 2760 2977) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point L2818(lines 2818 2825) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point RtlQueryRegistryValuesEXIT(lines 4676 4698) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point RtlQueryRegistryValuesENTRY(lines 4676 4698) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point L4693(lines 4676 4698) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point L4686(lines 4685 4695) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point L4683(lines 4682 4696) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point L4682(lines 4682 4696) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point L2562-1(lines 2562 2566) no Hoare annotation was computed. [2019-09-07 13:12:11,104 INFO L443 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 2528 2595) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2581(lines 2581 2592) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2581-2(lines 2581 2592) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2544(lines 2544 2548) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2567(lines 2567 2575) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2567-2(lines 2567 2575) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2557-1(line 2557) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L446 ceAbstractionStarter]: At program point L2557(line 2557) the Hoare annotation is: true [2019-09-07 13:12:11,105 INFO L446 ceAbstractionStarter]: At program point L2586(line 2586) the Hoare annotation is: true [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2555(lines 2555 2561) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2553-1(line 2553) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L446 ceAbstractionStarter]: At program point L2553(line 2553) the Hoare annotation is: true [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2555-2(lines 2537 2594) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2586-1(lines 2582 2588) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2551-1(line 2551) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L443 ceAbstractionStarter]: For program point L2582(lines 2582 2588) no Hoare annotation was computed. [2019-09-07 13:12:11,105 INFO L446 ceAbstractionStarter]: At program point L2551(line 2551) the Hoare annotation is: true [2019-09-07 13:12:11,106 INFO L443 ceAbstractionStarter]: For program point L2576(lines 2576 2580) no Hoare annotation was computed. [2019-09-07 13:12:11,106 INFO L443 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 2528 2595) no Hoare annotation was computed. [2019-09-07 13:12:11,106 INFO L443 ceAbstractionStarter]: For program point L2576-2(lines 2576 2580) no Hoare annotation was computed. [2019-09-07 13:12:11,106 INFO L446 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 2528 2595) the Hoare annotation is: true [2019-09-07 13:12:11,106 INFO L443 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-09-07 13:12:11,106 INFO L443 ceAbstractionStarter]: For program point memcpy_guardEXIT(lines 11 16) no Hoare annotation was computed. [2019-09-07 13:12:11,106 INFO L446 ceAbstractionStarter]: At program point memcpy_guardENTRY(lines 11 16) the Hoare annotation is: true [2019-09-07 13:12:11,106 INFO L443 ceAbstractionStarter]: For program point memcpy_guardFINAL(lines 11 16) no Hoare annotation was computed. [2019-09-07 13:12:11,106 INFO L443 ceAbstractionStarter]: For program point ExAllocatePoolWithTagFINAL(lines 3645 3657) no Hoare annotation was computed. [2019-09-07 13:12:11,106 INFO L443 ceAbstractionStarter]: For program point ExAllocatePoolWithTagEXIT(lines 3645 3657) no Hoare annotation was computed. [2019-09-07 13:12:11,106 INFO L446 ceAbstractionStarter]: At program point ExAllocatePoolWithTagENTRY(lines 3645 3657) the Hoare annotation is: true [2019-09-07 13:12:11,106 INFO L443 ceAbstractionStarter]: For program point IoWriteErrorLogEntryEXIT(line 1676) no Hoare annotation was computed. [2019-09-07 13:12:11,106 INFO L446 ceAbstractionStarter]: At program point IoWriteErrorLogEntryENTRY(line 1676) the Hoare annotation is: true [2019-09-07 13:12:11,106 INFO L443 ceAbstractionStarter]: For program point IoWriteErrorLogEntryFINAL(line 1676) no Hoare annotation was computed. [2019-09-07 13:12:11,106 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:12:11,107 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-09-07 13:12:11,107 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:12:11,107 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:12:11,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:12:11 BoogieIcfgContainer [2019-09-07 13:12:11,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:12:11,162 INFO L168 Benchmark]: Toolchain (without parser) took 411513.31 ms. Allocated memory was 141.6 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 82.7 MB in the beginning and 1.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-09-07 13:12:11,162 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 13:12:11,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1845.63 ms. Allocated memory was 141.6 MB in the beginning and 221.8 MB in the end (delta: 80.2 MB). Free memory was 82.5 MB in the beginning and 86.5 MB in the end (delta: -4.0 MB). Peak memory consumption was 90.4 MB. Max. memory is 7.1 GB. [2019-09-07 13:12:11,164 INFO L168 Benchmark]: Boogie Preprocessor took 482.54 ms. Allocated memory was 221.8 MB in the beginning and 262.1 MB in the end (delta: 40.4 MB). Free memory was 86.5 MB in the beginning and 153.4 MB in the end (delta: -66.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. [2019-09-07 13:12:11,164 INFO L168 Benchmark]: RCFGBuilder took 109723.22 ms. Allocated memory was 262.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 153.4 MB in the beginning and 1.0 GB in the end (delta: -854.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-09-07 13:12:11,165 INFO L168 Benchmark]: TraceAbstraction took 299453.11 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -525.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-09-07 13:12:11,168 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.22 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1845.63 ms. Allocated memory was 141.6 MB in the beginning and 221.8 MB in the end (delta: 80.2 MB). Free memory was 82.5 MB in the beginning and 86.5 MB in the end (delta: -4.0 MB). Peak memory consumption was 90.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 482.54 ms. Allocated memory was 221.8 MB in the beginning and 262.1 MB in the end (delta: 40.4 MB). Free memory was 86.5 MB in the beginning and 153.4 MB in the end (delta: -66.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 109723.22 ms. Allocated memory was 262.1 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 153.4 MB in the beginning and 1.0 GB in the end (delta: -854.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * TraceAbstraction took 299453.11 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -525.9 MB). Peak memory consumption was 2.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, 299.3s OverallTime, 52 OverallIterations, 8 TraceHistogramMax, 189.7s AutomataDifference, 0.0s DeadEndRemovalTime, 29.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 23484 SDtfs, 12419 SDslu, 58306 SDs, 0 SdLazy, 14714 SolverSat, 2947 SolverUnsat, 75 SolverUnknown, 0 SolverNotchecked, 179.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1312 GetRequests, 1006 SyntacticMatches, 4 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 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: 3.7s AutomataMinimizationTime, 52 MinimizatonAttempts, 5918 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 166 LocationsWithAnnotation, 15200 PreInvPairs, 17668 NumberOfFragments, 7621 HoareAnnotationTreeSize, 15200 FomulaSimplifications, 8430217 FormulaSimplificationTreeSizeReduction, 6.4s HoareSimplificationTime, 166 FomulaSimplificationsInter, 37633 FormulaSimplificationTreeSizeReductionInter, 22.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 5.2s SsaConstructionTime, 54.8s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 6337 NumberOfCodeBlocks, 6309 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 6279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1122231 SizeOfPredicates, 7 NumberOfNonLiveVariables, 36311 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 58 InterpolantComputations, 48 PerfectInterpolantSequences, 2004/2072 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...