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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:52:06,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:52:06,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:52:06,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:52:06,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:52:06,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:52:06,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:52:06,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:52:06,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:52:06,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:52:06,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:52:06,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:52:06,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:52:06,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:52:06,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:52:06,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:52:06,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:52:06,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:52:06,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:52:06,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:52:06,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:52:06,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:52:06,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:52:06,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:52:06,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:52:06,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:52:06,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:52:06,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:52:06,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:52:06,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:52:06,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:52:06,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:52:06,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:52:06,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:52:06,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:52:06,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:52:06,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:52:06,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:52:06,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:52:06,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:52:06,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:52:06,298 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:52:06,312 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:52:06,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:52:06,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:52:06,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:52:06,314 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:52:06,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:52:06,314 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:52:06,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:52:06,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:52:06,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:52:06,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:52:06,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:52:06,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:52:06,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:52:06,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:52:06,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:52:06,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:52:06,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:52:06,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:52:06,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:52:06,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:52:06,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:52:06,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:52:06,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:52:06,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:52:06,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:52:06,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:52:06,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:52:06,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:52:06,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:52:06,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:52:06,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:52:06,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:52:06,624 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:52:06,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c [2019-10-07 13:52:06,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538842a9e/b0017fb0f23645789932e56feba4f3b4/FLAGfeba20cc6 [2019-10-07 13:52:07,400 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:52:07,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c [2019-10-07 13:52:07,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538842a9e/b0017fb0f23645789932e56feba4f3b4/FLAGfeba20cc6 [2019-10-07 13:52:07,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538842a9e/b0017fb0f23645789932e56feba4f3b4 [2019-10-07 13:52:07,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:52:07,961 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:52:07,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:52:07,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:52:07,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:52:07,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:52:07" (1/1) ... [2019-10-07 13:52:07,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bf5a4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:52:07, skipping insertion in model container [2019-10-07 13:52:07,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:52:07" (1/1) ... [2019-10-07 13:52:07,981 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:52:08,151 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:52:09,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:52:10,038 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:52:10,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:52:10,881 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:52:10,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:52:10 WrapperNode [2019-10-07 13:52:10,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:52:10,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:52:10,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:52:10,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:52:10,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:52:10" (1/1) ... [2019-10-07 13:52:10,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:52:10" (1/1) ... [2019-10-07 13:52:11,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:52:10" (1/1) ... [2019-10-07 13:52:11,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:52:10" (1/1) ... [2019-10-07 13:52:11,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:52:10" (1/1) ... [2019-10-07 13:52:11,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:52:10" (1/1) ... [2019-10-07 13:52:11,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:52:10" (1/1) ... [2019-10-07 13:52:11,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:52:11,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:52:11,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:52:11,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:52:11,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:52:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:52:11,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:52:11,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:52:11,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2019-10-07 13:52:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2019-10-07 13:52:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~TO~VOID [2019-10-07 13:52:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2019-10-07 13:52:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlIntegerToUnicodeString [2019-10-07 13:52:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlUnicodeStringToInteger [2019-10-07 13:52:11,553 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareUnicodeString [2019-10-07 13:52:11,553 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAppendUnicodeStringToString [2019-10-07 13:52:11,553 INFO L138 BoogieDeclarations]: Found implementation of procedure READ_PORT_UCHAR [2019-10-07 13:52:11,553 INFO L138 BoogieDeclarations]: Found implementation of procedure WRITE_PORT_UCHAR [2019-10-07 13:52:11,553 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2019-10-07 13:52:11,553 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2019-10-07 13:52:11,554 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2019-10-07 13:52:11,554 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeDpc [2019-10-07 13:52:11,555 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInsertQueueDpc [2019-10-07 13:52:11,555 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSynchronizeExecution [2019-10-07 13:52:11,556 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTimeIncrement [2019-10-07 13:52:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireCancelSpinLock [2019-10-07 13:52:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateErrorLogEntry [2019-10-07 13:52:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure IoConnectInterrupt [2019-10-07 13:52:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReportResourceUsage [2019-10-07 13:52:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure IoInitializeRemoveLockEx [2019-10-07 13:52:11,559 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockEx [2019-10-07 13:52:11,559 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockAndWaitEx [2019-10-07 13:52:11,559 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWriteErrorLogEntry [2019-10-07 13:52:11,559 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2019-10-07 13:52:11,559 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2019-10-07 13:52:11,559 INFO L138 BoogieDeclarations]: Found implementation of procedure KeStallExecutionProcessor [2019-10-07 13:52:11,560 INFO L138 BoogieDeclarations]: Found implementation of procedure PoRequestPowerIrp [2019-10-07 13:52:11,560 INFO L138 BoogieDeclarations]: Found implementation of procedure PoSetPowerState [2019-10-07 13:52:11,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfReferenceObject [2019-10-07 13:52:11,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwQueryValueKey [2019-10-07 13:52:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwSetValueKey [2019-10-07 13:52:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiCompleteRequest [2019-10-07 13:52:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-07 13:52:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCleanup [2019-10-07 13:52:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpPnpIrpInfo [2019-10-07 13:52:11,561 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLock [2019-10-07 13:52:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLock [2019-10-07 13:52:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLockAndWait [2019-10-07 13:52:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceList [2019-10-07 13:52:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceRequirementsList [2019-10-07 13:52:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLogError [2019-10-07 13:52:11,562 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2019-10-07 13:52:11,563 INFO L138 BoogieDeclarations]: Found implementation of procedure PptUnload [2019-10-07 13:52:11,563 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCleanRemovalRelationsList [2019-10-07 13:52:11,563 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAddPptRemovalRelation [2019-10-07 13:52:11,563 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRemovePptRemovalRelation [2019-10-07 13:52:11,563 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpRemovalRelationsList [2019-10-07 13:52:11,563 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpPptRemovalRelationsStruct [2019-10-07 13:52:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchInternalDeviceControl [2019-10-07 13:52:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsNecR98Machine [2019-10-07 13:52:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCreate [2019-10-07 13:52:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchClose [2019-10-07 13:52:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitiate1284_3 [2019-10-07 13:52:11,564 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectDevice [2019-10-07 13:52:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectDevice [2019-10-07 13:52:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure Ppt1284_3AssignAddress [2019-10-07 13:52:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfNon1284_3Present [2019-10-07 13:52:11,565 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStl1284_3 [2019-10-07 13:52:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStlProductId [2019-10-07 13:52:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSend1284_3Command [2019-10-07 13:52:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectChipFilter [2019-10-07 13:52:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortType [2019-10-07 13:52:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortCapabilities [2019-10-07 13:52:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEcpPort [2019-10-07 13:52:11,566 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfDot3DevicePresent [2019-10-07 13:52:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfUserRequested [2019-10-07 13:52:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPort [2019-10-07 13:52:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectBytePort [2019-10-07 13:52:11,567 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoDepth [2019-10-07 13:52:11,568 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoWidth [2019-10-07 13:52:11,568 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetChipMode [2019-10-07 13:52:11,569 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearChipMode [2019-10-07 13:52:11,569 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrSetMode [2019-10-07 13:52:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetByteMode [2019-10-07 13:52:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearByteMode [2019-10-07 13:52:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckByteMode [2019-10-07 13:52:11,570 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrClearMode [2019-10-07 13:52:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFindNatChip [2019-10-07 13:52:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildResourceList [2019-10-07 13:52:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBuildRemovalRelations [2019-10-07 13:52:11,571 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanPciCardCmResourceList [2019-10-07 13:52:11,572 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsPci [2019-10-07 13:52:11,572 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCompleteRequest [2019-10-07 13:52:11,572 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpInitDispatchFunctionTable [2019-10-07 13:52:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpAddDevice [2019-10-07 13:52:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPnp [2019-10-07 13:52:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartDevice [2019-10-07 13:52:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanCmResourceList [2019-10-07 13:52:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartValidateResources [2019-10-07 13:52:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterResourceRequirements [2019-10-07 13:52:11,573 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterExistsNonIrqResourceList [2019-10-07 13:52:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterRemoveIrqResourceLists [2019-10-07 13:52:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterGetEndOfResourceRequirementsList [2019-10-07 13:52:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2019-10-07 13:52:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptors [2019-10-07 13:52:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryDeviceRelations [2019-10-07 13:52:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryStopDevice [2019-10-07 13:52:11,574 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelStopDevice [2019-10-07 13:52:11,575 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStopDevice [2019-10-07 13:52:11,575 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryRemoveDevice [2019-10-07 13:52:11,575 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelRemoveDevice [2019-10-07 13:52:11,575 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpRemoveDevice [2019-10-07 13:52:11,575 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpSurpriseRemoval [2019-10-07 13:52:11,575 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpListContainsIrqResourceDescriptor [2019-10-07 13:52:11,575 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBounceAndCatchPnpIrp [2019-10-07 13:52:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2019-10-07 13:52:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpUnhandledIrp [2019-10-07 13:52:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPowerComplete [2019-10-07 13:52:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure InitNEC_98 [2019-10-07 13:52:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPower [2019-10-07 13:52:11,576 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockDiskModeByte [2019-10-07 13:52:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockPrtModeByte [2019-10-07 13:52:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipSetDiskMode [2019-10-07 13:52:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipCheckDevice [2019-10-07 13:52:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectLegacyZip [2019-10-07 13:52:11,577 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectLegacyZip [2019-10-07 13:52:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegInitDriverSettings [2019-10-07 13:52:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegGetDeviceParameterDword [2019-10-07 13:52:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegSetDeviceParameterDword [2019-10-07 13:52:11,578 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFailRequest [2019-10-07 13:52:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLockOrFailIrp [2019-10-07 13:52:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPreProcessIrp [2019-10-07 13:52:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPostProcessIrp [2019-10-07 13:52:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchCompletionRoutine [2019-10-07 13:52:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure PptGetPortNameFromPhysicalDeviceObject [2019-10-07 13:52:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure PptConnectInterrupt [2019-10-07 13:52:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDisconnectInterrupt [2019-10-07 13:52:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedIncrement [2019-10-07 13:52:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDecrement [2019-10-07 13:52:11,581 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedRead [2019-10-07 13:52:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedQueue [2019-10-07 13:52:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDisconnect [2019-10-07 13:52:11,584 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCancelRoutine [2019-10-07 13:52:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePortDpc [2019-10-07 13:52:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTryAllocatePortAtInterruptLevel [2019-10-07 13:52:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePortFromInterruptLevel [2019-10-07 13:52:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInterruptService [2019-10-07 13:52:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTryAllocatePort [2019-10-07 13:52:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTraversePortCheckList [2019-10-07 13:52:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePort [2019-10-07 13:52:11,593 INFO L138 BoogieDeclarations]: Found implementation of procedure PptQueryNumWaiters [2019-10-07 13:52:11,593 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetCancelRoutine [2019-10-07 13:52:11,593 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTickCount [2019-10-07 13:52:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure CheckPort [2019-10-07 13:52:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildParallelPortDeviceName [2019-10-07 13:52:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitializeDeviceExtension [2019-10-07 13:52:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure PptGetPortNumberFromLptName [2019-10-07 13:52:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildDeviceObject [2019-10-07 13:52:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiInitWmi [2019-10-07 13:52:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchSystemControl [2019-10-07 13:52:11,594 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiQueryWmiRegInfo [2019-10-07 13:52:11,595 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiQueryWmiDataBlock [2019-10-07 13:52:11,595 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-07 13:52:11,595 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-07 13:52:11,595 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:52:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2019-10-07 13:52:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2019-10-07 13:52:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2019-10-07 13:52:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2019-10-07 13:52:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2019-10-07 13:52:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2019-10-07 13:52:11,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2019-10-07 13:52:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2019-10-07 13:52:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2019-10-07 13:52:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2019-10-07 13:52:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-07 13:52:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2019-10-07 13:52:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2019-10-07 13:52:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2019-10-07 13:52:11,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-07 13:52:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2019-10-07 13:52:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2019-10-07 13:52:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2019-10-07 13:52:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2019-10-07 13:52:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-07 13:52:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-07 13:52:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2019-10-07 13:52:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-07 13:52:11,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2019-10-07 13:52:11,599 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-07 13:52:11,599 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-07 13:52:11,599 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-07 13:52:11,599 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2019-10-07 13:52:11,599 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2019-10-07 13:52:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2019-10-07 13:52:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2019-10-07 13:52:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2019-10-07 13:52:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2019-10-07 13:52:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2019-10-07 13:52:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-07 13:52:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-07 13:52:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2019-10-07 13:52:11,600 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2019-10-07 13:52:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2019-10-07 13:52:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2019-10-07 13:52:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2019-10-07 13:52:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2019-10-07 13:52:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-07 13:52:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2019-10-07 13:52:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-07 13:52:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2019-10-07 13:52:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-07 13:52:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2019-10-07 13:52:11,603 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2019-10-07 13:52:11,604 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2019-10-07 13:52:11,604 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2019-10-07 13:52:11,604 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2019-10-07 13:52:11,604 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2019-10-07 13:52:11,605 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2019-10-07 13:52:11,605 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2019-10-07 13:52:11,605 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2019-10-07 13:52:11,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-07 13:52:11,605 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiSystemControl [2019-10-07 13:52:11,605 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireRemoveLockEx [2019-10-07 13:52:11,605 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-07 13:52:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-07 13:52:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-10-07 13:52:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:52:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:52:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-07 13:52:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 13:52:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:52:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-07 13:52:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-07 13:52:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 13:52:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 13:52:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2019-10-07 13:52:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 13:52:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-07 13:52:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-07 13:52:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-10-07 13:52:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2019-10-07 13:52:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2019-10-07 13:52:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure RtlIntegerToUnicodeString [2019-10-07 13:52:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:52:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure RtlUnicodeStringToInteger [2019-10-07 13:52:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:52:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2019-10-07 13:52:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2019-10-07 13:52:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2019-10-07 13:52:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareUnicodeString [2019-10-07 13:52:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2019-10-07 13:52:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAppendUnicodeStringToString [2019-10-07 13:52:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2019-10-07 13:52:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2019-10-07 13:52:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure READ_PORT_UCHAR [2019-10-07 13:52:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure WRITE_PORT_UCHAR [2019-10-07 13:52:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2019-10-07 13:52:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2019-10-07 13:52:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2019-10-07 13:52:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeDpc [2019-10-07 13:52:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure KeInsertQueueDpc [2019-10-07 13:52:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 13:52:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure KeSynchronizeExecution [2019-10-07 13:52:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2019-10-07 13:52:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-07 13:52:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2019-10-07 13:52:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2019-10-07 13:52:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2019-10-07 13:52:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-07 13:52:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2019-10-07 13:52:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2019-10-07 13:52:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTimeIncrement [2019-10-07 13:52:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2019-10-07 13:52:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2019-10-07 13:52:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2019-10-07 13:52:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2019-10-07 13:52:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2019-10-07 13:52:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2019-10-07 13:52:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2019-10-07 13:52:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2019-10-07 13:52:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2019-10-07 13:52:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2019-10-07 13:52:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2019-10-07 13:52:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2019-10-07 13:52:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2019-10-07 13:52:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-07 13:52:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2019-10-07 13:52:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireCancelSpinLock [2019-10-07 13:52:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateErrorLogEntry [2019-10-07 13:52:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 13:52:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2019-10-07 13:52:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2019-10-07 13:52:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2019-10-07 13:52:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-07 13:52:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-07 13:52:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-07 13:52:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure IoConnectInterrupt [2019-10-07 13:52:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2019-10-07 13:52:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2019-10-07 13:52:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2019-10-07 13:52:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2019-10-07 13:52:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-07 13:52:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2019-10-07 13:52:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2019-10-07 13:52:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2019-10-07 13:52:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2019-10-07 13:52:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-07 13:52:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2019-10-07 13:52:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure IoReportResourceUsage [2019-10-07 13:52:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2019-10-07 13:52:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure IoInitializeRemoveLockEx [2019-10-07 13:52:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireRemoveLockEx [2019-10-07 13:52:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockEx [2019-10-07 13:52:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockAndWaitEx [2019-10-07 13:52:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure IoWriteErrorLogEntry [2019-10-07 13:52:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2019-10-07 13:52:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2019-10-07 13:52:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-07 13:52:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-07 13:52:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure KeStallExecutionProcessor [2019-10-07 13:52:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure PoRequestPowerIrp [2019-10-07 13:52:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure PoSetPowerState [2019-10-07 13:52:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:52:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:52:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-07 13:52:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2019-10-07 13:52:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-07 13:52:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ObfReferenceObject [2019-10-07 13:52:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2019-10-07 13:52:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-07 13:52:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ZwQueryValueKey [2019-10-07 13:52:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ZwSetValueKey [2019-10-07 13:52:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure WmiCompleteRequest [2019-10-07 13:52:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure WmiSystemControl [2019-10-07 13:52:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure PptCompleteRequest [2019-10-07 13:52:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-07 13:52:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiInitWmi [2019-10-07 13:52:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchSystemControl [2019-10-07 13:52:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpInitDispatchFunctionTable [2019-10-07 13:52:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpAddDevice [2019-10-07 13:52:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPnp [2019-10-07 13:52:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure PptFailRequest [2019-10-07 13:52:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPreProcessIrp [2019-10-07 13:52:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPostProcessIrp [2019-10-07 13:52:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2019-10-07 13:52:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure PptUnload [2019-10-07 13:52:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchCompletionRoutine [2019-10-07 13:52:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure PptLogError [2019-10-07 13:52:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure PptConnectInterrupt [2019-10-07 13:52:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure PptDisconnectInterrupt [2019-10-07 13:52:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCreate [2019-10-07 13:52:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchClose [2019-10-07 13:52:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedIncrement [2019-10-07 13:52:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDecrement [2019-10-07 13:52:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedRead [2019-10-07 13:52:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedQueue [2019-10-07 13:52:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDisconnect [2019-10-07 13:52:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure PptCancelRoutine [2019-10-07 13:52:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePortDpc [2019-10-07 13:52:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure PptTryAllocatePortAtInterruptLevel [2019-10-07 13:52:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePortFromInterruptLevel [2019-10-07 13:52:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure PptInterruptService [2019-10-07 13:52:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure PptTryAllocatePort [2019-10-07 13:52:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure PptTraversePortCheckList [2019-10-07 13:52:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePort [2019-10-07 13:52:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure PptQueryNumWaiters [2019-10-07 13:52:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchInternalDeviceControl [2019-10-07 13:52:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCleanup [2019-10-07 13:52:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsNecR98Machine [2019-10-07 13:52:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPower [2019-10-07 13:52:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegInitDriverSettings [2019-10-07 13:52:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure PptGetPortNameFromPhysicalDeviceObject [2019-10-07 13:52:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetCancelRoutine [2019-10-07 13:52:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLockOrFailIrp [2019-10-07 13:52:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpPnpIrpInfo [2019-10-07 13:52:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLock [2019-10-07 13:52:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLock [2019-10-07 13:52:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLockAndWait [2019-10-07 13:52:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceList [2019-10-07 13:52:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceRequirementsList [2019-10-07 13:52:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectChipFilter [2019-10-07 13:52:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortType [2019-10-07 13:52:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetChipMode [2019-10-07 13:52:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearChipMode [2019-10-07 13:52:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitiate1284_3 [2019-10-07 13:52:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectDevice [2019-10-07 13:52:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectDevice [2019-10-07 13:52:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure Ppt1284_3AssignAddress [2019-10-07 13:52:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure PptSend1284_3Command [2019-10-07 13:52:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectLegacyZip [2019-10-07 13:52:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectLegacyZip [2019-10-07 13:52:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpRemovalRelationsList [2019-10-07 13:52:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegGetDeviceParameterDword [2019-10-07 13:52:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegSetDeviceParameterDword [2019-10-07 13:52:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildParallelPortDeviceName [2019-10-07 13:52:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitializeDeviceExtension [2019-10-07 13:52:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure PptGetPortNumberFromLptName [2019-10-07 13:52:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildDeviceObject [2019-10-07 13:52:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPort [2019-10-07 13:52:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure PptCleanRemovalRelationsList [2019-10-07 13:52:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure CheckPort [2019-10-07 13:52:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 13:52:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-10-07 13:52:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-07 13:52:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-07 13:52:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure PptAddPptRemovalRelation [2019-10-07 13:52:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure PptRemovePptRemovalRelation [2019-10-07 13:52:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpPptRemovalRelationsStruct [2019-10-07 13:52:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStl1284_3 [2019-10-07 13:52:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfNon1284_3Present [2019-10-07 13:52:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStlProductId [2019-10-07 13:52:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortCapabilities [2019-10-07 13:52:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEcpPort [2019-10-07 13:52:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfDot3DevicePresent [2019-10-07 13:52:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfUserRequested [2019-10-07 13:52:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectBytePort [2019-10-07 13:52:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoDepth [2019-10-07 13:52:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoWidth [2019-10-07 13:52:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrSetMode [2019-10-07 13:52:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrClearMode [2019-10-07 13:52:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure PptFindNatChip [2019-10-07 13:52:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildResourceList [2019-10-07 13:52:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetByteMode [2019-10-07 13:52:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearByteMode [2019-10-07 13:52:11,636 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckByteMode [2019-10-07 13:52:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2019-10-07 13:52:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterResourceRequirements [2019-10-07 13:52:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryDeviceRelations [2019-10-07 13:52:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryStopDevice [2019-10-07 13:52:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelStopDevice [2019-10-07 13:52:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStopDevice [2019-10-07 13:52:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryRemoveDevice [2019-10-07 13:52:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelRemoveDevice [2019-10-07 13:52:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpRemoveDevice [2019-10-07 13:52:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpSurpriseRemoval [2019-10-07 13:52:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpUnhandledIrp [2019-10-07 13:52:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartDevice [2019-10-07 13:52:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartValidateResources [2019-10-07 13:52:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanCmResourceList [2019-10-07 13:52:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2019-10-07 13:52:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptors [2019-10-07 13:52:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2019-10-07 13:52:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterExistsNonIrqResourceList [2019-10-07 13:52:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterGetEndOfResourceRequirementsList [2019-10-07 13:52:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpListContainsIrqResourceDescriptor [2019-10-07 13:52:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterRemoveIrqResourceLists [2019-10-07 13:52:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBounceAndCatchPnpIrp [2019-10-07 13:52:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBuildRemovalRelations [2019-10-07 13:52:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanPciCardCmResourceList [2019-10-07 13:52:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsPci [2019-10-07 13:52:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure PptPowerComplete [2019-10-07 13:52:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure InitNEC_98 [2019-10-07 13:52:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockDiskModeByte [2019-10-07 13:52:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockPrtModeByte [2019-10-07 13:52:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipSetDiskMode [2019-10-07 13:52:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipCheckDevice [2019-10-07 13:52:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~TO~VOID [2019-10-07 13:52:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTickCount [2019-10-07 13:52:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiQueryWmiRegInfo [2019-10-07 13:52:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiQueryWmiDataBlock [2019-10-07 13:52:11,640 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-07 13:52:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-07 13:52:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:52:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-07 13:52:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2019-10-07 13:52:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:52:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-07 13:52:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 13:52:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:52:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-07 13:52:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-07 13:52:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-07 13:52:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-07 13:52:13,030 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:13,080 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:13,080 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:13,342 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:25,010 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !false; [2019-10-07 13:52:25,010 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume false; [2019-10-07 13:52:25,047 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:30,542 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-07 13:52:30,543 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-07 13:52:30,543 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:30,559 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:30,559 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:30,671 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:30,727 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-07 13:52:30,727 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-07 13:52:30,728 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:30,740 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:30,740 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:31,016 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:31,039 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:31,039 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:31,185 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:31,252 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-07 13:52:31,252 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-07 13:52:31,469 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:33,676 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2019-10-07 13:52:33,677 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2019-10-07 13:52:33,678 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:33,717 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-07 13:52:33,717 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-07 13:52:33,759 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:33,775 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:33,775 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:34,019 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:40,456 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2019-10-07 13:52:40,457 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2019-10-07 13:52:42,578 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:42,586 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:42,586 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:42,701 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:42,701 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:49,044 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-07 13:52:49,044 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2019-10-07 13:52:49,044 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-07 13:52:49,044 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2019-10-07 13:52:49,341 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:49,350 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:49,350 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:54,308 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:54,318 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:54,319 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:54,852 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:54,864 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:54,864 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:54,864 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:54,873 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:54,873 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:54,906 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:54,917 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:54,917 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:54,917 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:54,925 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:54,925 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:54,925 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:54,935 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:54,936 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:55,146 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:55,153 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:55,153 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:55,166 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:55,173 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:55,174 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:55,315 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:55,325 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:55,326 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:55,352 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:55,360 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:55,360 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:55,997 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:52:56,037 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:52:56,038 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:52:56,051 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:53:01,090 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-07 13:53:01,091 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-07 13:53:01,097 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:53:01,293 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2019-10-07 13:53:01,294 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2019-10-07 13:53:01,614 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:53:01,641 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:53:01,642 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:53:01,817 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:53:01,928 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-07 13:53:01,928 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-07 13:53:02,038 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:53:12,625 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2019-10-07 13:53:12,625 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2019-10-07 13:53:12,679 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:53:17,513 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-07 13:53:17,513 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-07 13:53:17,514 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:53:17,549 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-07 13:53:17,549 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-07 13:53:19,703 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:53:19,725 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-07 13:53:19,726 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-07 13:53:21,964 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:53:21,972 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:53:21,972 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:53:22,213 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:53:27,099 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-07 13:53:27,099 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-07 13:54:44,130 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:54:44,130 INFO L284 CfgBuilder]: Removed 37 assume(true) statements. [2019-10-07 13:54:44,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:54:44 BoogieIcfgContainer [2019-10-07 13:54:44,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:54:44,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:54:44,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:54:44,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:54:44,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:52:07" (1/3) ... [2019-10-07 13:54:44,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf07a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:54:44, skipping insertion in model container [2019-10-07 13:54:44,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:52:10" (2/3) ... [2019-10-07 13:54:44,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf07a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:54:44, skipping insertion in model container [2019-10-07 13:54:44,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:54:44" (3/3) ... [2019-10-07 13:54:44,140 INFO L109 eAbstractionObserver]: Analyzing ICFG parport.i.cil-2.c [2019-10-07 13:54:44,149 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:54:44,160 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:54:44,172 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:54:44,207 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:54:44,208 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:54:44,208 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:54:44,208 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:54:44,208 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:54:44,208 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:54:44,208 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:54:44,208 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:54:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states. [2019-10-07 13:54:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:54:44,264 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:44,265 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:54:44,267 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:44,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:44,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1366339019, now seen corresponding path program 1 times [2019-10-07 13:54:44,282 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:44,282 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:44,283 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:44,283 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:44,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:54:44,870 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:44,871 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:44,871 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:54:44,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:54:44,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:54:44,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:54:44,891 INFO L87 Difference]: Start difference. First operand 1826 states. Second operand 3 states. [2019-10-07 13:54:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:45,304 INFO L93 Difference]: Finished difference Result 3156 states and 4780 transitions. [2019-10-07 13:54:45,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:54:45,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-07 13:54:45,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:45,344 INFO L225 Difference]: With dead ends: 3156 [2019-10-07 13:54:45,344 INFO L226 Difference]: Without dead ends: 1617 [2019-10-07 13:54:45,358 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:54:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-10-07 13:54:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2019-10-07 13:54:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2019-10-07 13:54:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2331 transitions. [2019-10-07 13:54:45,569 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2331 transitions. Word has length 18 [2019-10-07 13:54:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:45,569 INFO L462 AbstractCegarLoop]: Abstraction has 1617 states and 2331 transitions. [2019-10-07 13:54:45,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:54:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2331 transitions. [2019-10-07 13:54:45,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 13:54:45,572 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:45,572 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:54:45,573 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:45,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1314973835, now seen corresponding path program 1 times [2019-10-07 13:54:45,574 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:45,574 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:45,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:45,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:45,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:54:45,813 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:45,813 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:45,813 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:54:45,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:54:45,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:54:45,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:54:45,816 INFO L87 Difference]: Start difference. First operand 1617 states and 2331 transitions. Second operand 3 states. [2019-10-07 13:54:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:46,309 INFO L93 Difference]: Finished difference Result 4036 states and 5897 transitions. [2019-10-07 13:54:46,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:54:46,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-07 13:54:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:46,330 INFO L225 Difference]: With dead ends: 4036 [2019-10-07 13:54:46,330 INFO L226 Difference]: Without dead ends: 2963 [2019-10-07 13:54:46,337 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:54:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2019-10-07 13:54:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2943. [2019-10-07 13:54:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2943 states. [2019-10-07 13:54:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 4293 transitions. [2019-10-07 13:54:46,500 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 4293 transitions. Word has length 26 [2019-10-07 13:54:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:46,501 INFO L462 AbstractCegarLoop]: Abstraction has 2943 states and 4293 transitions. [2019-10-07 13:54:46,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:54:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 4293 transitions. [2019-10-07 13:54:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-07 13:54:46,506 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:46,507 INFO L385 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] [2019-10-07 13:54:46,507 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:46,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:46,507 INFO L82 PathProgramCache]: Analyzing trace with hash -945147730, now seen corresponding path program 1 times [2019-10-07 13:54:46,507 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:46,508 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:46,508 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:46,508 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:46,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:54:46,682 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:46,682 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:46,682 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:54:46,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:54:46,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:54:46,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:54:46,683 INFO L87 Difference]: Start difference. First operand 2943 states and 4293 transitions. Second operand 3 states. [2019-10-07 13:54:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:46,899 INFO L93 Difference]: Finished difference Result 2952 states and 4303 transitions. [2019-10-07 13:54:46,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:54:46,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-07 13:54:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:46,933 INFO L225 Difference]: With dead ends: 2952 [2019-10-07 13:54:46,933 INFO L226 Difference]: Without dead ends: 2949 [2019-10-07 13:54:46,936 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:54:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-10-07 13:54:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2947. [2019-10-07 13:54:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2947 states. [2019-10-07 13:54:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4299 transitions. [2019-10-07 13:54:47,092 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4299 transitions. Word has length 39 [2019-10-07 13:54:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:47,092 INFO L462 AbstractCegarLoop]: Abstraction has 2947 states and 4299 transitions. [2019-10-07 13:54:47,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:54:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4299 transitions. [2019-10-07 13:54:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-07 13:54:47,096 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:47,096 INFO L385 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] [2019-10-07 13:54:47,096 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:47,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2139474432, now seen corresponding path program 1 times [2019-10-07 13:54:47,097 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:47,097 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:47,097 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:47,097 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:47,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:54:47,338 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:47,338 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:47,339 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:54:47,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:54:47,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:54:47,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:54:47,340 INFO L87 Difference]: Start difference. First operand 2947 states and 4299 transitions. Second operand 3 states. [2019-10-07 13:54:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:47,542 INFO L93 Difference]: Finished difference Result 5160 states and 7535 transitions. [2019-10-07 13:54:47,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:54:47,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-07 13:54:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:47,577 INFO L225 Difference]: With dead ends: 5160 [2019-10-07 13:54:47,577 INFO L226 Difference]: Without dead ends: 4955 [2019-10-07 13:54:47,582 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:54:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2019-10-07 13:54:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 4933. [2019-10-07 13:54:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4933 states. [2019-10-07 13:54:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4933 states to 4933 states and 7223 transitions. [2019-10-07 13:54:47,877 INFO L78 Accepts]: Start accepts. Automaton has 4933 states and 7223 transitions. Word has length 40 [2019-10-07 13:54:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:47,879 INFO L462 AbstractCegarLoop]: Abstraction has 4933 states and 7223 transitions. [2019-10-07 13:54:47,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:54:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 4933 states and 7223 transitions. [2019-10-07 13:54:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:54:47,888 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:47,888 INFO L385 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] [2019-10-07 13:54:47,888 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:47,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1827044723, now seen corresponding path program 1 times [2019-10-07 13:54:47,890 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:47,890 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:47,890 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:47,890 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:47,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:54:48,158 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:48,158 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:48,158 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:54:48,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:54:48,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:54:48,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:54:48,159 INFO L87 Difference]: Start difference. First operand 4933 states and 7223 transitions. Second operand 6 states. [2019-10-07 13:54:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:50,657 INFO L93 Difference]: Finished difference Result 9096 states and 13293 transitions. [2019-10-07 13:54:50,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:54:50,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-07 13:54:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:50,689 INFO L225 Difference]: With dead ends: 9096 [2019-10-07 13:54:50,689 INFO L226 Difference]: Without dead ends: 4852 [2019-10-07 13:54:50,706 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:54:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4852 states. [2019-10-07 13:54:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4852 to 4850. [2019-10-07 13:54:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4850 states. [2019-10-07 13:54:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 7079 transitions. [2019-10-07 13:54:50,980 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 7079 transitions. Word has length 54 [2019-10-07 13:54:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:50,981 INFO L462 AbstractCegarLoop]: Abstraction has 4850 states and 7079 transitions. [2019-10-07 13:54:50,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:54:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 7079 transitions. [2019-10-07 13:54:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 13:54:50,983 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:50,983 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:54:50,983 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:50,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:50,984 INFO L82 PathProgramCache]: Analyzing trace with hash 319460675, now seen corresponding path program 1 times [2019-10-07 13:54:50,984 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:50,984 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:50,984 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:50,984 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:54:51,156 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:51,157 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:51,157 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:54:51,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:54:51,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:54:51,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:54:51,158 INFO L87 Difference]: Start difference. First operand 4850 states and 7079 transitions. Second operand 5 states. [2019-10-07 13:54:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:54:56,387 INFO L93 Difference]: Finished difference Result 5510 states and 8035 transitions. [2019-10-07 13:54:56,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:54:56,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-07 13:54:56,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:54:56,422 INFO L225 Difference]: With dead ends: 5510 [2019-10-07 13:54:56,422 INFO L226 Difference]: Without dead ends: 5499 [2019-10-07 13:54:56,426 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:54:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2019-10-07 13:54:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 5459. [2019-10-07 13:54:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5459 states. [2019-10-07 13:54:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5459 states to 5459 states and 7974 transitions. [2019-10-07 13:54:56,714 INFO L78 Accepts]: Start accepts. Automaton has 5459 states and 7974 transitions. Word has length 45 [2019-10-07 13:54:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:54:56,716 INFO L462 AbstractCegarLoop]: Abstraction has 5459 states and 7974 transitions. [2019-10-07 13:54:56,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:54:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5459 states and 7974 transitions. [2019-10-07 13:54:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-07 13:54:56,719 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:54:56,719 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:54:56,719 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:54:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:54:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash 875332201, now seen corresponding path program 1 times [2019-10-07 13:54:56,720 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:54:56,720 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:56,720 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:56,720 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:54:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:54:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:54:56,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:54:56,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:54:56,915 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:54:56,915 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:54:56,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:54:56,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:54:56,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:54:56,916 INFO L87 Difference]: Start difference. First operand 5459 states and 7974 transitions. Second operand 5 states. [2019-10-07 13:55:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:02,159 INFO L93 Difference]: Finished difference Result 5480 states and 7995 transitions. [2019-10-07 13:55:02,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:55:02,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-07 13:55:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:02,194 INFO L225 Difference]: With dead ends: 5480 [2019-10-07 13:55:02,194 INFO L226 Difference]: Without dead ends: 5472 [2019-10-07 13:55:02,197 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:55:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2019-10-07 13:55:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 5459. [2019-10-07 13:55:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5459 states. [2019-10-07 13:55:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5459 states to 5459 states and 7973 transitions. [2019-10-07 13:55:02,509 INFO L78 Accepts]: Start accepts. Automaton has 5459 states and 7973 transitions. Word has length 46 [2019-10-07 13:55:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:02,511 INFO L462 AbstractCegarLoop]: Abstraction has 5459 states and 7973 transitions. [2019-10-07 13:55:02,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:55:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 5459 states and 7973 transitions. [2019-10-07 13:55:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:55:02,513 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:02,513 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:02,513 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:02,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1246001442, now seen corresponding path program 1 times [2019-10-07 13:55:02,514 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:02,514 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:02,514 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:02,515 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:02,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:02,718 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:02,719 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:02,719 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:55:02,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:55:02,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:55:02,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:55:02,720 INFO L87 Difference]: Start difference. First operand 5459 states and 7973 transitions. Second operand 6 states. [2019-10-07 13:55:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:41,869 INFO L93 Difference]: Finished difference Result 5501 states and 8023 transitions. [2019-10-07 13:55:41,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:55:41,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-10-07 13:55:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:41,899 INFO L225 Difference]: With dead ends: 5501 [2019-10-07 13:55:41,900 INFO L226 Difference]: Without dead ends: 5491 [2019-10-07 13:55:41,902 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:55:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5491 states. [2019-10-07 13:55:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5491 to 5464. [2019-10-07 13:55:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5464 states. [2019-10-07 13:55:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5464 states to 5464 states and 7979 transitions. [2019-10-07 13:55:42,231 INFO L78 Accepts]: Start accepts. Automaton has 5464 states and 7979 transitions. Word has length 41 [2019-10-07 13:55:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:42,232 INFO L462 AbstractCegarLoop]: Abstraction has 5464 states and 7979 transitions. [2019-10-07 13:55:42,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:55:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 5464 states and 7979 transitions. [2019-10-07 13:55:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:55:42,234 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:42,234 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:42,234 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:42,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1260346351, now seen corresponding path program 1 times [2019-10-07 13:55:42,235 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:42,235 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:42,235 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:42,235 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:42,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:42,377 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:42,377 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:42,377 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:55:42,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:55:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:55:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:55:42,378 INFO L87 Difference]: Start difference. First operand 5464 states and 7979 transitions. Second operand 6 states. [2019-10-07 13:55:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:42,598 INFO L93 Difference]: Finished difference Result 5504 states and 8028 transitions. [2019-10-07 13:55:42,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:55:42,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-10-07 13:55:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:42,621 INFO L225 Difference]: With dead ends: 5504 [2019-10-07 13:55:42,621 INFO L226 Difference]: Without dead ends: 5463 [2019-10-07 13:55:42,625 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:55:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2019-10-07 13:55:42,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 5461. [2019-10-07 13:55:42,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5461 states. [2019-10-07 13:55:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5461 states to 5461 states and 7975 transitions. [2019-10-07 13:55:42,908 INFO L78 Accepts]: Start accepts. Automaton has 5461 states and 7975 transitions. Word has length 41 [2019-10-07 13:55:42,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:42,909 INFO L462 AbstractCegarLoop]: Abstraction has 5461 states and 7975 transitions. [2019-10-07 13:55:42,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:55:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 5461 states and 7975 transitions. [2019-10-07 13:55:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 13:55:42,911 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:42,911 INFO L385 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] [2019-10-07 13:55:42,911 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:42,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:42,912 INFO L82 PathProgramCache]: Analyzing trace with hash 682155477, now seen corresponding path program 1 times [2019-10-07 13:55:42,912 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:42,912 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:42,912 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:42,912 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:42,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:43,017 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:43,017 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:43,017 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:55:43,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:55:43,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:55:43,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:43,018 INFO L87 Difference]: Start difference. First operand 5461 states and 7975 transitions. Second operand 3 states. [2019-10-07 13:55:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:43,300 INFO L93 Difference]: Finished difference Result 5575 states and 8111 transitions. [2019-10-07 13:55:43,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:55:43,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-07 13:55:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:43,326 INFO L225 Difference]: With dead ends: 5575 [2019-10-07 13:55:43,327 INFO L226 Difference]: Without dead ends: 5542 [2019-10-07 13:55:43,330 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:55:43,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5542 states. [2019-10-07 13:55:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5542 to 5538. [2019-10-07 13:55:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5538 states. [2019-10-07 13:55:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5538 states to 5538 states and 8061 transitions. [2019-10-07 13:55:43,663 INFO L78 Accepts]: Start accepts. Automaton has 5538 states and 8061 transitions. Word has length 44 [2019-10-07 13:55:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:43,664 INFO L462 AbstractCegarLoop]: Abstraction has 5538 states and 8061 transitions. [2019-10-07 13:55:43,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:55:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5538 states and 8061 transitions. [2019-10-07 13:55:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 13:55:43,666 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:43,666 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:43,666 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:43,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:43,666 INFO L82 PathProgramCache]: Analyzing trace with hash -362145167, now seen corresponding path program 1 times [2019-10-07 13:55:43,667 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:43,667 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:43,667 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:43,667 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:43,798 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:43,798 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:43,798 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:55:43,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:55:43,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:55:43,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:55:43,799 INFO L87 Difference]: Start difference. First operand 5538 states and 8061 transitions. Second operand 5 states. [2019-10-07 13:55:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:44,112 INFO L93 Difference]: Finished difference Result 5553 states and 8077 transitions. [2019-10-07 13:55:44,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:55:44,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-07 13:55:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:44,137 INFO L225 Difference]: With dead ends: 5553 [2019-10-07 13:55:44,137 INFO L226 Difference]: Without dead ends: 5535 [2019-10-07 13:55:44,143 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:55:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-10-07 13:55:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5535. [2019-10-07 13:55:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5535 states. [2019-10-07 13:55:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 8056 transitions. [2019-10-07 13:55:44,500 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 8056 transitions. Word has length 48 [2019-10-07 13:55:44,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:44,500 INFO L462 AbstractCegarLoop]: Abstraction has 5535 states and 8056 transitions. [2019-10-07 13:55:44,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:55:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 8056 transitions. [2019-10-07 13:55:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 13:55:44,502 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:44,503 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:44,505 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:44,505 INFO L82 PathProgramCache]: Analyzing trace with hash -321448138, now seen corresponding path program 1 times [2019-10-07 13:55:44,505 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:44,505 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:44,505 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:44,506 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:44,649 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:44,649 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:44,649 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:55:44,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:55:44,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:55:44,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:55:44,650 INFO L87 Difference]: Start difference. First operand 5535 states and 8056 transitions. Second operand 5 states. [2019-10-07 13:55:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:44,868 INFO L93 Difference]: Finished difference Result 5550 states and 8072 transitions. [2019-10-07 13:55:44,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:55:44,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-07 13:55:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:44,887 INFO L225 Difference]: With dead ends: 5550 [2019-10-07 13:55:44,887 INFO L226 Difference]: Without dead ends: 5529 [2019-10-07 13:55:44,891 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:55:44,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5529 states. [2019-10-07 13:55:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5529 to 5529. [2019-10-07 13:55:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5529 states. [2019-10-07 13:55:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 8048 transitions. [2019-10-07 13:55:45,248 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 8048 transitions. Word has length 45 [2019-10-07 13:55:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:45,249 INFO L462 AbstractCegarLoop]: Abstraction has 5529 states and 8048 transitions. [2019-10-07 13:55:45,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:55:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 8048 transitions. [2019-10-07 13:55:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 13:55:45,251 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:45,251 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:45,251 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash -508051578, now seen corresponding path program 1 times [2019-10-07 13:55:45,252 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:45,252 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:45,252 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:45,252 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:45,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:45,415 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:45,415 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:45,415 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:55:45,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:55:45,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:55:45,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:55:45,416 INFO L87 Difference]: Start difference. First operand 5529 states and 8048 transitions. Second operand 6 states. [2019-10-07 13:55:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:48,491 INFO L93 Difference]: Finished difference Result 5564 states and 8089 transitions. [2019-10-07 13:55:48,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:55:48,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-10-07 13:55:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:48,509 INFO L225 Difference]: With dead ends: 5564 [2019-10-07 13:55:48,509 INFO L226 Difference]: Without dead ends: 5526 [2019-10-07 13:55:48,514 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:55:48,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2019-10-07 13:55:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5526. [2019-10-07 13:55:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5526 states. [2019-10-07 13:55:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5526 states to 5526 states and 8044 transitions. [2019-10-07 13:55:48,877 INFO L78 Accepts]: Start accepts. Automaton has 5526 states and 8044 transitions. Word has length 45 [2019-10-07 13:55:48,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:48,879 INFO L462 AbstractCegarLoop]: Abstraction has 5526 states and 8044 transitions. [2019-10-07 13:55:48,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:55:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5526 states and 8044 transitions. [2019-10-07 13:55:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:55:48,882 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:48,882 INFO L385 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] [2019-10-07 13:55:48,882 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:48,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:48,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1998899078, now seen corresponding path program 1 times [2019-10-07 13:55:48,883 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:48,883 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:48,884 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:48,884 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:49,177 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:49,178 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:49,178 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:55:49,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:55:49,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:55:49,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:55:49,179 INFO L87 Difference]: Start difference. First operand 5526 states and 8044 transitions. Second operand 8 states. [2019-10-07 13:55:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:49,446 INFO L93 Difference]: Finished difference Result 5541 states and 8060 transitions. [2019-10-07 13:55:49,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:55:49,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-10-07 13:55:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:49,471 INFO L225 Difference]: With dead ends: 5541 [2019-10-07 13:55:49,471 INFO L226 Difference]: Without dead ends: 5522 [2019-10-07 13:55:49,477 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:55:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2019-10-07 13:55:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5522. [2019-10-07 13:55:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-10-07 13:55:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 8037 transitions. [2019-10-07 13:55:49,969 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 8037 transitions. Word has length 42 [2019-10-07 13:55:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:49,970 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 8037 transitions. [2019-10-07 13:55:49,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:55:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 8037 transitions. [2019-10-07 13:55:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 13:55:49,973 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:49,974 INFO L385 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] [2019-10-07 13:55:49,974 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:49,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:49,975 INFO L82 PathProgramCache]: Analyzing trace with hash -290170922, now seen corresponding path program 1 times [2019-10-07 13:55:49,975 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:49,975 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:49,975 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:49,976 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:49,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:50,195 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:50,195 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:50,195 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:55:50,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:55:50,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:55:50,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:55:50,196 INFO L87 Difference]: Start difference. First operand 5522 states and 8037 transitions. Second operand 5 states. [2019-10-07 13:55:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:50,388 INFO L93 Difference]: Finished difference Result 5537 states and 8053 transitions. [2019-10-07 13:55:50,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:55:50,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-07 13:55:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:50,404 INFO L225 Difference]: With dead ends: 5537 [2019-10-07 13:55:50,405 INFO L226 Difference]: Without dead ends: 5497 [2019-10-07 13:55:50,411 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:55:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2019-10-07 13:55:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 5497. [2019-10-07 13:55:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5497 states. [2019-10-07 13:55:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 8001 transitions. [2019-10-07 13:55:50,827 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 8001 transitions. Word has length 44 [2019-10-07 13:55:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:50,827 INFO L462 AbstractCegarLoop]: Abstraction has 5497 states and 8001 transitions. [2019-10-07 13:55:50,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:55:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 8001 transitions. [2019-10-07 13:55:50,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:55:50,830 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:50,830 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:50,830 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:50,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:50,830 INFO L82 PathProgramCache]: Analyzing trace with hash -427871585, now seen corresponding path program 1 times [2019-10-07 13:55:50,830 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:50,831 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:50,831 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:50,831 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:50,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:51,024 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:51,024 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:51,024 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:55:51,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:55:51,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:55:51,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:55:51,028 INFO L87 Difference]: Start difference. First operand 5497 states and 8001 transitions. Second operand 8 states. [2019-10-07 13:55:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:51,353 INFO L93 Difference]: Finished difference Result 5515 states and 8020 transitions. [2019-10-07 13:55:51,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:55:51,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-07 13:55:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:51,370 INFO L225 Difference]: With dead ends: 5515 [2019-10-07 13:55:51,371 INFO L226 Difference]: Without dead ends: 5495 [2019-10-07 13:55:51,375 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:55:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5495 states. [2019-10-07 13:55:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5495 to 5495. [2019-10-07 13:55:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5495 states. [2019-10-07 13:55:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5495 states to 5495 states and 7996 transitions. [2019-10-07 13:55:51,617 INFO L78 Accepts]: Start accepts. Automaton has 5495 states and 7996 transitions. Word has length 47 [2019-10-07 13:55:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:51,617 INFO L462 AbstractCegarLoop]: Abstraction has 5495 states and 7996 transitions. [2019-10-07 13:55:51,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:55:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5495 states and 7996 transitions. [2019-10-07 13:55:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:55:51,619 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:51,619 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:55:51,620 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:51,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:51,620 INFO L82 PathProgramCache]: Analyzing trace with hash -730458182, now seen corresponding path program 1 times [2019-10-07 13:55:51,620 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:51,620 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:51,620 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:51,621 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:51,757 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:51,757 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:51,758 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:55:51,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:55:51,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:55:51,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:55:51,759 INFO L87 Difference]: Start difference. First operand 5495 states and 7996 transitions. Second operand 6 states. [2019-10-07 13:55:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:55:57,500 INFO L93 Difference]: Finished difference Result 5618 states and 8150 transitions. [2019-10-07 13:55:57,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:55:57,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-07 13:55:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:55:57,519 INFO L225 Difference]: With dead ends: 5618 [2019-10-07 13:55:57,519 INFO L226 Difference]: Without dead ends: 5520 [2019-10-07 13:55:57,524 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:55:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5520 states. [2019-10-07 13:55:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5520 to 5497. [2019-10-07 13:55:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5497 states. [2019-10-07 13:55:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 7997 transitions. [2019-10-07 13:55:57,763 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 7997 transitions. Word has length 47 [2019-10-07 13:55:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:55:57,763 INFO L462 AbstractCegarLoop]: Abstraction has 5497 states and 7997 transitions. [2019-10-07 13:55:57,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:55:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 7997 transitions. [2019-10-07 13:55:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:55:57,766 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:55:57,766 INFO L385 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] [2019-10-07 13:55:57,766 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:55:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:55:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash -931695704, now seen corresponding path program 1 times [2019-10-07 13:55:57,767 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:55:57,767 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:57,767 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:57,767 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:55:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:55:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:55:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:55:57,936 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:55:57,936 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:55:57,936 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:55:57,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:55:57,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:55:57,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:55:57,937 INFO L87 Difference]: Start difference. First operand 5497 states and 7997 transitions. Second operand 6 states. [2019-10-07 13:56:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:01,019 INFO L93 Difference]: Finished difference Result 5515 states and 8016 transitions. [2019-10-07 13:56:01,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:56:01,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-07 13:56:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:01,035 INFO L225 Difference]: With dead ends: 5515 [2019-10-07 13:56:01,035 INFO L226 Difference]: Without dead ends: 5495 [2019-10-07 13:56:01,039 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:56:01,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5495 states. [2019-10-07 13:56:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5495 to 5495. [2019-10-07 13:56:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5495 states. [2019-10-07 13:56:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5495 states to 5495 states and 7993 transitions. [2019-10-07 13:56:01,286 INFO L78 Accepts]: Start accepts. Automaton has 5495 states and 7993 transitions. Word has length 54 [2019-10-07 13:56:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:01,287 INFO L462 AbstractCegarLoop]: Abstraction has 5495 states and 7993 transitions. [2019-10-07 13:56:01,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:56:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 5495 states and 7993 transitions. [2019-10-07 13:56:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 13:56:01,290 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:01,290 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:01,290 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1442994609, now seen corresponding path program 1 times [2019-10-07 13:56:01,291 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:01,291 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:01,291 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:01,291 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:01,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:01,475 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:01,475 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:01,475 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:56:01,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:56:01,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:56:01,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:56:01,476 INFO L87 Difference]: Start difference. First operand 5495 states and 7993 transitions. Second operand 8 states. [2019-10-07 13:56:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:56:01,804 INFO L93 Difference]: Finished difference Result 5513 states and 8012 transitions. [2019-10-07 13:56:01,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:56:01,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-07 13:56:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:56:01,839 INFO L225 Difference]: With dead ends: 5513 [2019-10-07 13:56:01,839 INFO L226 Difference]: Without dead ends: 5488 [2019-10-07 13:56:01,844 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:56:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2019-10-07 13:56:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5488. [2019-10-07 13:56:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2019-10-07 13:56:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 7978 transitions. [2019-10-07 13:56:02,086 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 7978 transitions. Word has length 53 [2019-10-07 13:56:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:56:02,087 INFO L462 AbstractCegarLoop]: Abstraction has 5488 states and 7978 transitions. [2019-10-07 13:56:02,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:56:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 7978 transitions. [2019-10-07 13:56:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 13:56:02,088 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:56:02,089 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:56:02,089 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:56:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:56:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash -95233240, now seen corresponding path program 1 times [2019-10-07 13:56:02,089 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:56:02,089 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:02,090 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:02,090 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:56:02,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:56:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:56:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:56:02,457 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:56:02,457 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:56:02,457 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:56:02,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:56:02,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:56:02,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:56:02,458 INFO L87 Difference]: Start difference. First operand 5488 states and 7978 transitions. Second operand 9 states. [2019-10-07 13:58:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:58:18,844 INFO L93 Difference]: Finished difference Result 5592 states and 8100 transitions. [2019-10-07 13:58:18,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 13:58:18,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-07 13:58:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:58:18,866 INFO L225 Difference]: With dead ends: 5592 [2019-10-07 13:58:18,866 INFO L226 Difference]: Without dead ends: 5494 [2019-10-07 13:58:18,872 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-10-07 13:58:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5494 states. [2019-10-07 13:58:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5494 to 5490. [2019-10-07 13:58:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5490 states. [2019-10-07 13:58:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5490 states to 5490 states and 7978 transitions. [2019-10-07 13:58:19,306 INFO L78 Accepts]: Start accepts. Automaton has 5490 states and 7978 transitions. Word has length 51 [2019-10-07 13:58:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:58:19,306 INFO L462 AbstractCegarLoop]: Abstraction has 5490 states and 7978 transitions. [2019-10-07 13:58:19,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:58:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 5490 states and 7978 transitions. [2019-10-07 13:58:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-07 13:58:19,309 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:58:19,309 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 13:58:19,309 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:58:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:58:19,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1759138569, now seen corresponding path program 1 times [2019-10-07 13:58:19,310 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:58:19,310 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:58:19,310 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:58:19,310 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:58:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:58:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:58:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:58:19,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:58:19,486 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:58:19,486 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:58:19,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:58:19,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:58:19,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:58:19,487 INFO L87 Difference]: Start difference. First operand 5490 states and 7978 transitions. Second operand 6 states. [2019-10-07 13:58:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:58:25,978 INFO L93 Difference]: Finished difference Result 5629 states and 8140 transitions. [2019-10-07 13:58:25,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:58:25,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-07 13:58:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:58:25,997 INFO L225 Difference]: With dead ends: 5629 [2019-10-07 13:58:25,997 INFO L226 Difference]: Without dead ends: 4756 [2019-10-07 13:58:26,003 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:58:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2019-10-07 13:58:26,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 4717. [2019-10-07 13:58:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4717 states. [2019-10-07 13:58:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4717 states to 4717 states and 6827 transitions. [2019-10-07 13:58:26,284 INFO L78 Accepts]: Start accepts. Automaton has 4717 states and 6827 transitions. Word has length 65 [2019-10-07 13:58:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:58:26,285 INFO L462 AbstractCegarLoop]: Abstraction has 4717 states and 6827 transitions. [2019-10-07 13:58:26,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:58:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4717 states and 6827 transitions. [2019-10-07 13:58:26,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-07 13:58:26,287 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:58:26,287 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:58:26,288 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:58:26,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:58:26,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1309040144, now seen corresponding path program 1 times [2019-10-07 13:58:26,288 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:58:26,288 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:58:26,288 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:58:26,289 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:58:26,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:58:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:58:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:58:26,449 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:58:26,449 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:58:26,449 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:58:26,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:58:26,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:58:26,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:58:26,450 INFO L87 Difference]: Start difference. First operand 4717 states and 6827 transitions. Second operand 7 states. [2019-10-07 13:59:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:33,272 INFO L93 Difference]: Finished difference Result 4815 states and 6944 transitions. [2019-10-07 13:59:33,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:59:33,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-10-07 13:59:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:33,291 INFO L225 Difference]: With dead ends: 4815 [2019-10-07 13:59:33,291 INFO L226 Difference]: Without dead ends: 4717 [2019-10-07 13:59:33,293 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:59:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4717 states. [2019-10-07 13:59:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4717 to 4717. [2019-10-07 13:59:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4717 states. [2019-10-07 13:59:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4717 states to 4717 states and 6826 transitions. [2019-10-07 13:59:33,573 INFO L78 Accepts]: Start accepts. Automaton has 4717 states and 6826 transitions. Word has length 52 [2019-10-07 13:59:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:33,573 INFO L462 AbstractCegarLoop]: Abstraction has 4717 states and 6826 transitions. [2019-10-07 13:59:33,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:59:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 4717 states and 6826 transitions. [2019-10-07 13:59:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-07 13:59:33,576 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:33,576 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 13:59:33,576 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:33,576 INFO L82 PathProgramCache]: Analyzing trace with hash -301281205, now seen corresponding path program 1 times [2019-10-07 13:59:33,577 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:33,577 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:33,577 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:33,577 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:33,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:33,724 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:33,725 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:33,725 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:59:33,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:59:33,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:59:33,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:59:33,726 INFO L87 Difference]: Start difference. First operand 4717 states and 6826 transitions. Second operand 6 states. [2019-10-07 13:59:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:34,005 INFO L93 Difference]: Finished difference Result 4766 states and 6877 transitions. [2019-10-07 13:59:34,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:59:34,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-10-07 13:59:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:34,028 INFO L225 Difference]: With dead ends: 4766 [2019-10-07 13:59:34,028 INFO L226 Difference]: Without dead ends: 4708 [2019-10-07 13:59:34,031 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:59:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4708 states. [2019-10-07 13:59:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4708 to 4708. [2019-10-07 13:59:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4708 states. [2019-10-07 13:59:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4708 states to 4708 states and 6814 transitions. [2019-10-07 13:59:34,444 INFO L78 Accepts]: Start accepts. Automaton has 4708 states and 6814 transitions. Word has length 61 [2019-10-07 13:59:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:34,444 INFO L462 AbstractCegarLoop]: Abstraction has 4708 states and 6814 transitions. [2019-10-07 13:59:34,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:59:34,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4708 states and 6814 transitions. [2019-10-07 13:59:34,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 13:59:34,447 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:34,447 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:34,447 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1713270221, now seen corresponding path program 1 times [2019-10-07 13:59:34,448 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:34,448 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:34,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:34,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:34,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:34,564 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:34,564 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:34,564 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:59:34,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:59:34,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:59:34,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:59:34,566 INFO L87 Difference]: Start difference. First operand 4708 states and 6814 transitions. Second operand 3 states. [2019-10-07 13:59:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:34,894 INFO L93 Difference]: Finished difference Result 5763 states and 8352 transitions. [2019-10-07 13:59:34,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:59:34,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-07 13:59:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:34,914 INFO L225 Difference]: With dead ends: 5763 [2019-10-07 13:59:34,914 INFO L226 Difference]: Without dead ends: 5750 [2019-10-07 13:59:34,918 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:59:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5750 states. [2019-10-07 13:59:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5750 to 4742. [2019-10-07 13:59:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4742 states. [2019-10-07 13:59:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4742 states to 4742 states and 6851 transitions. [2019-10-07 13:59:35,217 INFO L78 Accepts]: Start accepts. Automaton has 4742 states and 6851 transitions. Word has length 53 [2019-10-07 13:59:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:35,217 INFO L462 AbstractCegarLoop]: Abstraction has 4742 states and 6851 transitions. [2019-10-07 13:59:35,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:59:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4742 states and 6851 transitions. [2019-10-07 13:59:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 13:59:35,220 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:35,220 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:35,220 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:35,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1357325799, now seen corresponding path program 1 times [2019-10-07 13:59:35,221 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:35,221 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:35,221 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:35,221 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:35,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:35,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-10-07 13:59:35,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:35,905 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:35,905 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:59:35,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:59:35,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:59:35,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:59:35,906 INFO L87 Difference]: Start difference. First operand 4742 states and 6851 transitions. Second operand 3 states. [2019-10-07 13:59:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:36,192 INFO L93 Difference]: Finished difference Result 4768 states and 6878 transitions. [2019-10-07 13:59:36,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:59:36,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-07 13:59:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:36,208 INFO L225 Difference]: With dead ends: 4768 [2019-10-07 13:59:36,208 INFO L226 Difference]: Without dead ends: 4764 [2019-10-07 13:59:36,211 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:59:36,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2019-10-07 13:59:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 4740. [2019-10-07 13:59:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4740 states. [2019-10-07 13:59:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4740 states to 4740 states and 6847 transitions. [2019-10-07 13:59:36,447 INFO L78 Accepts]: Start accepts. Automaton has 4740 states and 6847 transitions. Word has length 57 [2019-10-07 13:59:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:36,448 INFO L462 AbstractCegarLoop]: Abstraction has 4740 states and 6847 transitions. [2019-10-07 13:59:36,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:59:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4740 states and 6847 transitions. [2019-10-07 13:59:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:59:36,451 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:36,451 INFO L385 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] [2019-10-07 13:59:36,452 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1989790087, now seen corresponding path program 1 times [2019-10-07 13:59:36,452 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:36,452 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:36,452 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:36,453 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:36,573 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:36,573 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:36,573 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:59:36,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:59:36,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:59:36,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:59:36,574 INFO L87 Difference]: Start difference. First operand 4740 states and 6847 transitions. Second operand 3 states. [2019-10-07 13:59:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:38,955 INFO L93 Difference]: Finished difference Result 4791 states and 6910 transitions. [2019-10-07 13:59:38,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:59:38,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-07 13:59:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:38,963 INFO L225 Difference]: With dead ends: 4791 [2019-10-07 13:59:38,963 INFO L226 Difference]: Without dead ends: 4752 [2019-10-07 13:59:38,965 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:59:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4752 states. [2019-10-07 13:59:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4752 to 4740. [2019-10-07 13:59:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4740 states. [2019-10-07 13:59:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4740 states to 4740 states and 6847 transitions. [2019-10-07 13:59:39,195 INFO L78 Accepts]: Start accepts. Automaton has 4740 states and 6847 transitions. Word has length 54 [2019-10-07 13:59:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:39,196 INFO L462 AbstractCegarLoop]: Abstraction has 4740 states and 6847 transitions. [2019-10-07 13:59:39,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:59:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4740 states and 6847 transitions. [2019-10-07 13:59:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:59:39,198 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:39,198 INFO L385 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] [2019-10-07 13:59:39,198 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:39,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:39,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2023306863, now seen corresponding path program 1 times [2019-10-07 13:59:39,198 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:39,198 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:39,198 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:39,198 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:39,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:39,440 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:39,440 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:39,440 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:59:39,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:59:39,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:59:39,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:59:39,441 INFO L87 Difference]: Start difference. First operand 4740 states and 6847 transitions. Second operand 9 states. [2019-10-07 13:59:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:42,018 INFO L93 Difference]: Finished difference Result 4758 states and 6867 transitions. [2019-10-07 13:59:42,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:59:42,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-07 13:59:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:42,028 INFO L225 Difference]: With dead ends: 4758 [2019-10-07 13:59:42,028 INFO L226 Difference]: Without dead ends: 4754 [2019-10-07 13:59:42,030 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:59:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2019-10-07 13:59:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4750. [2019-10-07 13:59:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4750 states. [2019-10-07 13:59:42,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4750 states to 4750 states and 6859 transitions. [2019-10-07 13:59:42,227 INFO L78 Accepts]: Start accepts. Automaton has 4750 states and 6859 transitions. Word has length 54 [2019-10-07 13:59:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:42,227 INFO L462 AbstractCegarLoop]: Abstraction has 4750 states and 6859 transitions. [2019-10-07 13:59:42,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:59:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4750 states and 6859 transitions. [2019-10-07 13:59:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:59:42,230 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:42,230 INFO L385 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] [2019-10-07 13:59:42,230 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:42,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:42,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2023030033, now seen corresponding path program 1 times [2019-10-07 13:59:42,230 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:42,231 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:42,231 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:42,231 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:42,378 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:42,378 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:42,378 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:59:42,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:59:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:59:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:59:42,379 INFO L87 Difference]: Start difference. First operand 4750 states and 6859 transitions. Second operand 6 states. [2019-10-07 13:59:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:47,233 INFO L93 Difference]: Finished difference Result 5756 states and 8340 transitions. [2019-10-07 13:59:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:59:47,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-07 13:59:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:47,249 INFO L225 Difference]: With dead ends: 5756 [2019-10-07 13:59:47,249 INFO L226 Difference]: Without dead ends: 5736 [2019-10-07 13:59:47,252 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:59:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5736 states. [2019-10-07 13:59:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5736 to 4738. [2019-10-07 13:59:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4738 states. [2019-10-07 13:59:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4738 states to 4738 states and 6842 transitions. [2019-10-07 13:59:47,610 INFO L78 Accepts]: Start accepts. Automaton has 4738 states and 6842 transitions. Word has length 54 [2019-10-07 13:59:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:47,611 INFO L462 AbstractCegarLoop]: Abstraction has 4738 states and 6842 transitions. [2019-10-07 13:59:47,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:59:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4738 states and 6842 transitions. [2019-10-07 13:59:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:59:47,612 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:47,612 INFO L385 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] [2019-10-07 13:59:47,613 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:47,613 INFO L82 PathProgramCache]: Analyzing trace with hash -89441171, now seen corresponding path program 1 times [2019-10-07 13:59:47,613 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:47,613 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:47,614 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:47,614 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:47,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:47,802 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:47,802 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:47,802 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:59:47,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:59:47,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:59:47,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:59:47,803 INFO L87 Difference]: Start difference. First operand 4738 states and 6842 transitions. Second operand 9 states. [2019-10-07 13:59:48,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:48,527 INFO L93 Difference]: Finished difference Result 4756 states and 6861 transitions. [2019-10-07 13:59:48,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:59:48,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-10-07 13:59:48,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:48,537 INFO L225 Difference]: With dead ends: 4756 [2019-10-07 13:59:48,537 INFO L226 Difference]: Without dead ends: 4732 [2019-10-07 13:59:48,539 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:59:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4732 states. [2019-10-07 13:59:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4732 to 4732. [2019-10-07 13:59:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4732 states. [2019-10-07 13:59:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6834 transitions. [2019-10-07 13:59:48,722 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6834 transitions. Word has length 62 [2019-10-07 13:59:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:48,722 INFO L462 AbstractCegarLoop]: Abstraction has 4732 states and 6834 transitions. [2019-10-07 13:59:48,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:59:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6834 transitions. [2019-10-07 13:59:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 13:59:48,724 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:48,724 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:48,725 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:48,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1021476981, now seen corresponding path program 1 times [2019-10-07 13:59:48,725 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:48,725 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:48,725 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:48,725 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:48,951 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:48,951 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:48,952 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:59:48,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:59:48,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:59:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:59:48,952 INFO L87 Difference]: Start difference. First operand 4732 states and 6834 transitions. Second operand 9 states. [2019-10-07 13:59:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:51,005 INFO L93 Difference]: Finished difference Result 4745 states and 6848 transitions. [2019-10-07 13:59:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:59:51,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-07 13:59:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:51,015 INFO L225 Difference]: With dead ends: 4745 [2019-10-07 13:59:51,015 INFO L226 Difference]: Without dead ends: 4715 [2019-10-07 13:59:51,017 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:59:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4715 states. [2019-10-07 13:59:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4715 to 4715. [2019-10-07 13:59:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4715 states. [2019-10-07 13:59:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4715 states to 4715 states and 6815 transitions. [2019-10-07 13:59:51,206 INFO L78 Accepts]: Start accepts. Automaton has 4715 states and 6815 transitions. Word has length 55 [2019-10-07 13:59:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:51,206 INFO L462 AbstractCegarLoop]: Abstraction has 4715 states and 6815 transitions. [2019-10-07 13:59:51,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:59:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 4715 states and 6815 transitions. [2019-10-07 13:59:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:59:51,208 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:51,208 INFO L385 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] [2019-10-07 13:59:51,208 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:51,208 INFO L82 PathProgramCache]: Analyzing trace with hash -203552043, now seen corresponding path program 1 times [2019-10-07 13:59:51,208 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:51,209 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:51,209 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:51,209 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:51,380 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:51,380 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:51,380 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:59:51,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:59:51,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:59:51,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:59:51,381 INFO L87 Difference]: Start difference. First operand 4715 states and 6815 transitions. Second operand 3 states. [2019-10-07 13:59:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:51,708 INFO L93 Difference]: Finished difference Result 6924 states and 10002 transitions. [2019-10-07 13:59:51,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:59:51,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-07 13:59:51,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:51,724 INFO L225 Difference]: With dead ends: 6924 [2019-10-07 13:59:51,724 INFO L226 Difference]: Without dead ends: 6817 [2019-10-07 13:59:51,727 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:59:51,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6817 states. [2019-10-07 13:59:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6817 to 4718. [2019-10-07 13:59:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4718 states. [2019-10-07 13:59:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 6815 transitions. [2019-10-07 13:59:51,938 INFO L78 Accepts]: Start accepts. Automaton has 4718 states and 6815 transitions. Word has length 60 [2019-10-07 13:59:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:51,939 INFO L462 AbstractCegarLoop]: Abstraction has 4718 states and 6815 transitions. [2019-10-07 13:59:51,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:59:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 6815 transitions. [2019-10-07 13:59:51,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-07 13:59:51,941 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:51,941 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:51,941 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:51,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:51,941 INFO L82 PathProgramCache]: Analyzing trace with hash -201584018, now seen corresponding path program 1 times [2019-10-07 13:59:51,941 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:51,941 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:51,942 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:51,942 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:51,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:52,119 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:52,119 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:52,119 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:59:52,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:59:52,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:59:52,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:59:52,120 INFO L87 Difference]: Start difference. First operand 4718 states and 6815 transitions. Second operand 5 states. [2019-10-07 13:59:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:55,431 INFO L93 Difference]: Finished difference Result 5482 states and 7880 transitions. [2019-10-07 13:59:55,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:59:55,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-07 13:59:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:55,439 INFO L225 Difference]: With dead ends: 5482 [2019-10-07 13:59:55,439 INFO L226 Difference]: Without dead ends: 3409 [2019-10-07 13:59:55,444 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:59:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2019-10-07 13:59:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 3310. [2019-10-07 13:59:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3310 states. [2019-10-07 13:59:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4734 transitions. [2019-10-07 13:59:55,583 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4734 transitions. Word has length 66 [2019-10-07 13:59:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:55,584 INFO L462 AbstractCegarLoop]: Abstraction has 3310 states and 4734 transitions. [2019-10-07 13:59:55,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:59:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4734 transitions. [2019-10-07 13:59:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-07 13:59:55,585 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:55,586 INFO L385 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] [2019-10-07 13:59:55,586 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:55,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1111002365, now seen corresponding path program 1 times [2019-10-07 13:59:55,586 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:55,586 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:55,586 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:55,586 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:55,740 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:55,740 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:55,740 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:59:55,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:59:55,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:59:55,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:59:55,741 INFO L87 Difference]: Start difference. First operand 3310 states and 4734 transitions. Second operand 3 states. [2019-10-07 13:59:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:55,963 INFO L93 Difference]: Finished difference Result 5442 states and 7837 transitions. [2019-10-07 13:59:55,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:59:55,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-07 13:59:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:55,975 INFO L225 Difference]: With dead ends: 5442 [2019-10-07 13:59:55,975 INFO L226 Difference]: Without dead ends: 3375 [2019-10-07 13:59:55,984 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:59:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states. [2019-10-07 13:59:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 3305. [2019-10-07 13:59:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3305 states. [2019-10-07 13:59:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4724 transitions. [2019-10-07 13:59:56,217 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4724 transitions. Word has length 67 [2019-10-07 13:59:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:56,217 INFO L462 AbstractCegarLoop]: Abstraction has 3305 states and 4724 transitions. [2019-10-07 13:59:56,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:59:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4724 transitions. [2019-10-07 13:59:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-07 13:59:56,220 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:56,220 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:56,220 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:56,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:56,221 INFO L82 PathProgramCache]: Analyzing trace with hash -496722142, now seen corresponding path program 1 times [2019-10-07 13:59:56,221 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:56,221 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:56,221 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:56,221 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:56,380 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:56,380 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:56,380 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:59:56,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:59:56,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:59:56,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:59:56,382 INFO L87 Difference]: Start difference. First operand 3305 states and 4724 transitions. Second operand 6 states. [2019-10-07 13:59:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:58,711 INFO L93 Difference]: Finished difference Result 3362 states and 4793 transitions. [2019-10-07 13:59:58,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:59:58,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-07 13:59:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:58,717 INFO L225 Difference]: With dead ends: 3362 [2019-10-07 13:59:58,717 INFO L226 Difference]: Without dead ends: 2977 [2019-10-07 13:59:58,718 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:59:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2019-10-07 13:59:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2956. [2019-10-07 13:59:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-10-07 13:59:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 4167 transitions. [2019-10-07 13:59:58,840 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 4167 transitions. Word has length 70 [2019-10-07 13:59:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:58,840 INFO L462 AbstractCegarLoop]: Abstraction has 2956 states and 4167 transitions. [2019-10-07 13:59:58,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:59:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 4167 transitions. [2019-10-07 13:59:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-07 13:59:58,842 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:58,843 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:58,843 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:58,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash -61707583, now seen corresponding path program 1 times [2019-10-07 13:59:58,843 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:58,843 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:58,844 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:58,844 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:59,071 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:59,071 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:59,071 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:59:59,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:59:59,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:59:59,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:59:59,072 INFO L87 Difference]: Start difference. First operand 2956 states and 4167 transitions. Second operand 11 states. [2019-10-07 13:59:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:59,347 INFO L93 Difference]: Finished difference Result 2971 states and 4183 transitions. [2019-10-07 13:59:59,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:59:59,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-10-07 13:59:59,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:59,355 INFO L225 Difference]: With dead ends: 2971 [2019-10-07 13:59:59,356 INFO L226 Difference]: Without dead ends: 2933 [2019-10-07 13:59:59,357 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:59:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2019-10-07 13:59:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2933. [2019-10-07 13:59:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2933 states. [2019-10-07 13:59:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 4141 transitions. [2019-10-07 13:59:59,481 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 4141 transitions. Word has length 66 [2019-10-07 13:59:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:59,481 INFO L462 AbstractCegarLoop]: Abstraction has 2933 states and 4141 transitions. [2019-10-07 13:59:59,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:59:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 4141 transitions. [2019-10-07 13:59:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-07 13:59:59,482 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:59,482 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:59,483 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:59,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1650776732, now seen corresponding path program 1 times [2019-10-07 13:59:59,483 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:59,483 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:59,483 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:59,484 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:59:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:59:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:59:59,688 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:59,688 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:59:59,689 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:59:59,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:59:59,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:59:59,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:59:59,690 INFO L87 Difference]: Start difference. First operand 2933 states and 4141 transitions. Second operand 5 states. [2019-10-07 13:59:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:59:59,807 INFO L93 Difference]: Finished difference Result 3006 states and 4225 transitions. [2019-10-07 13:59:59,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:59:59,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-07 13:59:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:59:59,814 INFO L225 Difference]: With dead ends: 3006 [2019-10-07 13:59:59,814 INFO L226 Difference]: Without dead ends: 2910 [2019-10-07 13:59:59,815 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:59:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2019-10-07 13:59:59,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2019-10-07 13:59:59,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2910 states. [2019-10-07 13:59:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4114 transitions. [2019-10-07 13:59:59,934 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4114 transitions. Word has length 66 [2019-10-07 13:59:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:59:59,935 INFO L462 AbstractCegarLoop]: Abstraction has 2910 states and 4114 transitions. [2019-10-07 13:59:59,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:59:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4114 transitions. [2019-10-07 13:59:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-07 13:59:59,937 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:59:59,937 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:59:59,938 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:59:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:59:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1514292656, now seen corresponding path program 1 times [2019-10-07 13:59:59,938 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:59:59,938 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:59:59,938 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:59,938 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:59:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:00,090 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:00,090 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:00,090 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:00:00,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:00:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:00:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:00:00,091 INFO L87 Difference]: Start difference. First operand 2910 states and 4114 transitions. Second operand 3 states. [2019-10-07 14:00:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:00,398 INFO L93 Difference]: Finished difference Result 4934 states and 7087 transitions. [2019-10-07 14:00:00,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:00:00,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-07 14:00:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:00,404 INFO L225 Difference]: With dead ends: 4934 [2019-10-07 14:00:00,404 INFO L226 Difference]: Without dead ends: 2908 [2019-10-07 14:00:00,409 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:00:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2019-10-07 14:00:00,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2019-10-07 14:00:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2908 states. [2019-10-07 14:00:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 4110 transitions. [2019-10-07 14:00:00,532 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 4110 transitions. Word has length 74 [2019-10-07 14:00:00,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:00,532 INFO L462 AbstractCegarLoop]: Abstraction has 2908 states and 4110 transitions. [2019-10-07 14:00:00,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:00:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 4110 transitions. [2019-10-07 14:00:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-07 14:00:00,534 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:00,535 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:00:00,535 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:00,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:00,535 INFO L82 PathProgramCache]: Analyzing trace with hash 903293547, now seen corresponding path program 1 times [2019-10-07 14:00:00,535 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:00,535 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:00,535 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:00,536 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:00,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:00,683 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:00,683 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:00,683 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:00:00,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:00:00,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:00:00,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:00:00,684 INFO L87 Difference]: Start difference. First operand 2908 states and 4110 transitions. Second operand 3 states. [2019-10-07 14:00:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:00,949 INFO L93 Difference]: Finished difference Result 3917 states and 5596 transitions. [2019-10-07 14:00:00,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:00:00,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-07 14:00:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:00,958 INFO L225 Difference]: With dead ends: 3917 [2019-10-07 14:00:00,958 INFO L226 Difference]: Without dead ends: 3909 [2019-10-07 14:00:00,960 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:00:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3909 states. [2019-10-07 14:00:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3909 to 2909. [2019-10-07 14:00:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2909 states. [2019-10-07 14:00:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 4111 transitions. [2019-10-07 14:00:01,098 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 4111 transitions. Word has length 70 [2019-10-07 14:00:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:01,099 INFO L462 AbstractCegarLoop]: Abstraction has 2909 states and 4111 transitions. [2019-10-07 14:00:01,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:00:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 4111 transitions. [2019-10-07 14:00:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-07 14:00:01,100 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:01,100 INFO L385 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] [2019-10-07 14:00:01,100 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1611133551, now seen corresponding path program 1 times [2019-10-07 14:00:01,101 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:01,101 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:01,101 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:01,101 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:01,274 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:01,274 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:01,274 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 14:00:01,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 14:00:01,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 14:00:01,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 14:00:01,275 INFO L87 Difference]: Start difference. First operand 2909 states and 4111 transitions. Second operand 5 states. [2019-10-07 14:00:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:05,856 INFO L93 Difference]: Finished difference Result 3915 states and 5591 transitions. [2019-10-07 14:00:05,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:00:05,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-07 14:00:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:05,866 INFO L225 Difference]: With dead ends: 3915 [2019-10-07 14:00:05,866 INFO L226 Difference]: Without dead ends: 3909 [2019-10-07 14:00:05,868 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:00:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3909 states. [2019-10-07 14:00:06,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3909 to 2909. [2019-10-07 14:00:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2909 states. [2019-10-07 14:00:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 4110 transitions. [2019-10-07 14:00:06,024 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 4110 transitions. Word has length 71 [2019-10-07 14:00:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:06,025 INFO L462 AbstractCegarLoop]: Abstraction has 2909 states and 4110 transitions. [2019-10-07 14:00:06,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 14:00:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 4110 transitions. [2019-10-07 14:00:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-07 14:00:06,026 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:06,027 INFO L385 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] [2019-10-07 14:00:06,027 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash -274276863, now seen corresponding path program 1 times [2019-10-07 14:00:06,027 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:06,028 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:06,028 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:06,028 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:06,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:06,158 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:06,158 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:06,158 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:00:06,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:00:06,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:00:06,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:00:06,159 INFO L87 Difference]: Start difference. First operand 2909 states and 4110 transitions. Second operand 6 states. [2019-10-07 14:00:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:08,373 INFO L93 Difference]: Finished difference Result 2955 states and 4162 transitions. [2019-10-07 14:00:08,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 14:00:08,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-10-07 14:00:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:08,379 INFO L225 Difference]: With dead ends: 2955 [2019-10-07 14:00:08,379 INFO L226 Difference]: Without dead ends: 2909 [2019-10-07 14:00:08,380 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:00:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2019-10-07 14:00:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2909. [2019-10-07 14:00:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2909 states. [2019-10-07 14:00:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 4106 transitions. [2019-10-07 14:00:08,626 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 4106 transitions. Word has length 68 [2019-10-07 14:00:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:08,627 INFO L462 AbstractCegarLoop]: Abstraction has 2909 states and 4106 transitions. [2019-10-07 14:00:08,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:00:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 4106 transitions. [2019-10-07 14:00:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-07 14:00:08,629 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:08,629 INFO L385 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] [2019-10-07 14:00:08,629 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash -8595125, now seen corresponding path program 1 times [2019-10-07 14:00:08,629 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:08,630 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:08,630 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:08,630 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:08,765 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:08,765 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:08,765 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:00:08,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:00:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:00:08,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:00:08,766 INFO L87 Difference]: Start difference. First operand 2909 states and 4106 transitions. Second operand 6 states. [2019-10-07 14:00:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:10,993 INFO L93 Difference]: Finished difference Result 2953 states and 4156 transitions. [2019-10-07 14:00:10,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:00:10,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-10-07 14:00:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:10,999 INFO L225 Difference]: With dead ends: 2953 [2019-10-07 14:00:10,999 INFO L226 Difference]: Without dead ends: 2909 [2019-10-07 14:00:11,000 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:00:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2019-10-07 14:00:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2909. [2019-10-07 14:00:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2909 states. [2019-10-07 14:00:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 4104 transitions. [2019-10-07 14:00:11,133 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 4104 transitions. Word has length 68 [2019-10-07 14:00:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:11,133 INFO L462 AbstractCegarLoop]: Abstraction has 2909 states and 4104 transitions. [2019-10-07 14:00:11,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:00:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 4104 transitions. [2019-10-07 14:00:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 14:00:11,135 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:11,135 INFO L385 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] [2019-10-07 14:00:11,135 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1440806761, now seen corresponding path program 1 times [2019-10-07 14:00:11,135 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:11,135 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:11,135 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:11,136 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:11,259 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:11,259 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:11,259 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:00:11,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:00:11,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:00:11,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:00:11,260 INFO L87 Difference]: Start difference. First operand 2909 states and 4104 transitions. Second operand 3 states. [2019-10-07 14:00:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:11,540 INFO L93 Difference]: Finished difference Result 2916 states and 4111 transitions. [2019-10-07 14:00:11,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:00:11,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-07 14:00:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:11,547 INFO L225 Difference]: With dead ends: 2916 [2019-10-07 14:00:11,547 INFO L226 Difference]: Without dead ends: 2913 [2019-10-07 14:00:11,548 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:00:11,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-10-07 14:00:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2911. [2019-10-07 14:00:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2019-10-07 14:00:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4107 transitions. [2019-10-07 14:00:11,678 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4107 transitions. Word has length 76 [2019-10-07 14:00:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:11,679 INFO L462 AbstractCegarLoop]: Abstraction has 2911 states and 4107 transitions. [2019-10-07 14:00:11,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:00:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4107 transitions. [2019-10-07 14:00:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 14:00:11,680 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:11,680 INFO L385 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] [2019-10-07 14:00:11,681 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:11,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash 695569717, now seen corresponding path program 1 times [2019-10-07 14:00:11,681 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:11,681 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:11,681 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:11,681 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:11,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:11,868 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:11,868 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:11,869 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:00:11,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:00:11,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:00:11,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:00:11,870 INFO L87 Difference]: Start difference. First operand 2911 states and 4107 transitions. Second operand 9 states. [2019-10-07 14:00:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:15,604 INFO L93 Difference]: Finished difference Result 2932 states and 4131 transitions. [2019-10-07 14:00:15,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 14:00:15,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-10-07 14:00:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:15,610 INFO L225 Difference]: With dead ends: 2932 [2019-10-07 14:00:15,610 INFO L226 Difference]: Without dead ends: 2928 [2019-10-07 14:00:15,611 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 14:00:15,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2019-10-07 14:00:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2924. [2019-10-07 14:00:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2924 states. [2019-10-07 14:00:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 4123 transitions. [2019-10-07 14:00:15,744 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 4123 transitions. Word has length 72 [2019-10-07 14:00:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:15,745 INFO L462 AbstractCegarLoop]: Abstraction has 2924 states and 4123 transitions. [2019-10-07 14:00:15,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:00:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 4123 transitions. [2019-10-07 14:00:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 14:00:15,747 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:15,747 INFO L385 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] [2019-10-07 14:00:15,747 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:15,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash 695292887, now seen corresponding path program 1 times [2019-10-07 14:00:15,748 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:15,748 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:15,748 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:15,748 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:15,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:15,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-10-07 14:00:15,883 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:15,884 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:15,884 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 14:00:15,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 14:00:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 14:00:15,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 14:00:15,885 INFO L87 Difference]: Start difference. First operand 2924 states and 4123 transitions. Second operand 5 states. [2019-10-07 14:00:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:20,507 INFO L93 Difference]: Finished difference Result 3930 states and 5604 transitions. [2019-10-07 14:00:20,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:00:20,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-10-07 14:00:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:20,516 INFO L225 Difference]: With dead ends: 3930 [2019-10-07 14:00:20,516 INFO L226 Difference]: Without dead ends: 3903 [2019-10-07 14:00:20,517 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:00:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3903 states. [2019-10-07 14:00:20,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3903 to 2901. [2019-10-07 14:00:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2901 states. [2019-10-07 14:00:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 4095 transitions. [2019-10-07 14:00:20,665 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 4095 transitions. Word has length 72 [2019-10-07 14:00:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:20,666 INFO L462 AbstractCegarLoop]: Abstraction has 2901 states and 4095 transitions. [2019-10-07 14:00:20,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 14:00:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 4095 transitions. [2019-10-07 14:00:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-07 14:00:20,667 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:20,667 INFO L385 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] [2019-10-07 14:00:20,668 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:20,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:20,668 INFO L82 PathProgramCache]: Analyzing trace with hash 194167454, now seen corresponding path program 1 times [2019-10-07 14:00:20,668 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:20,668 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:20,668 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:20,668 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:20,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:20,776 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:20,777 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:20,777 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:00:20,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:00:20,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:00:20,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:00:20,777 INFO L87 Difference]: Start difference. First operand 2901 states and 4095 transitions. Second operand 3 states. [2019-10-07 14:00:20,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:20,905 INFO L93 Difference]: Finished difference Result 2962 states and 4163 transitions. [2019-10-07 14:00:20,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:00:20,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-07 14:00:20,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:20,910 INFO L225 Difference]: With dead ends: 2962 [2019-10-07 14:00:20,911 INFO L226 Difference]: Without dead ends: 2912 [2019-10-07 14:00:20,911 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:00:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2019-10-07 14:00:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 2906. [2019-10-07 14:00:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2906 states. [2019-10-07 14:00:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 4102 transitions. [2019-10-07 14:00:21,045 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 4102 transitions. Word has length 73 [2019-10-07 14:00:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:21,045 INFO L462 AbstractCegarLoop]: Abstraction has 2906 states and 4102 transitions. [2019-10-07 14:00:21,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:00:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 4102 transitions. [2019-10-07 14:00:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-07 14:00:21,047 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:21,047 INFO L385 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] [2019-10-07 14:00:21,047 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:21,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash 403926739, now seen corresponding path program 1 times [2019-10-07 14:00:21,048 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:21,048 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:21,048 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:21,048 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:21,138 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:21,138 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:21,139 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:00:21,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:00:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:00:21,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:00:21,139 INFO L87 Difference]: Start difference. First operand 2906 states and 4102 transitions. Second operand 3 states. [2019-10-07 14:00:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:21,338 INFO L93 Difference]: Finished difference Result 2947 states and 4147 transitions. [2019-10-07 14:00:21,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:00:21,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-07 14:00:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:21,344 INFO L225 Difference]: With dead ends: 2947 [2019-10-07 14:00:21,344 INFO L226 Difference]: Without dead ends: 2908 [2019-10-07 14:00:21,345 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:00:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2019-10-07 14:00:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2906. [2019-10-07 14:00:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2906 states. [2019-10-07 14:00:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 4101 transitions. [2019-10-07 14:00:21,479 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 4101 transitions. Word has length 71 [2019-10-07 14:00:21,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:21,479 INFO L462 AbstractCegarLoop]: Abstraction has 2906 states and 4101 transitions. [2019-10-07 14:00:21,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:00:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 4101 transitions. [2019-10-07 14:00:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-07 14:00:21,481 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:21,481 INFO L385 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] [2019-10-07 14:00:21,481 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:21,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash 863310237, now seen corresponding path program 1 times [2019-10-07 14:00:21,482 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:21,482 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:21,482 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:21,482 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:21,634 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:21,634 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:21,634 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 14:00:21,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 14:00:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 14:00:21,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 14:00:21,635 INFO L87 Difference]: Start difference. First operand 2906 states and 4101 transitions. Second operand 5 states. [2019-10-07 14:00:28,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:28,190 INFO L93 Difference]: Finished difference Result 5922 states and 8538 transitions. [2019-10-07 14:00:28,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:00:28,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-07 14:00:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:28,200 INFO L225 Difference]: With dead ends: 5922 [2019-10-07 14:00:28,200 INFO L226 Difference]: Without dead ends: 3904 [2019-10-07 14:00:28,205 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:00:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2019-10-07 14:00:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 2916. [2019-10-07 14:00:28,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2916 states. [2019-10-07 14:00:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4113 transitions. [2019-10-07 14:00:28,365 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4113 transitions. Word has length 78 [2019-10-07 14:00:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:28,365 INFO L462 AbstractCegarLoop]: Abstraction has 2916 states and 4113 transitions. [2019-10-07 14:00:28,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 14:00:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4113 transitions. [2019-10-07 14:00:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-07 14:00:28,367 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:28,367 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:00:28,367 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:28,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1459341498, now seen corresponding path program 1 times [2019-10-07 14:00:28,367 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:28,368 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:28,368 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:28,368 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:28,530 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:28,530 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:28,530 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:00:28,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:00:28,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:00:28,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:00:28,531 INFO L87 Difference]: Start difference. First operand 2916 states and 4113 transitions. Second operand 6 states. [2019-10-07 14:00:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:30,729 INFO L93 Difference]: Finished difference Result 3009 states and 4220 transitions. [2019-10-07 14:00:30,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:00:30,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-10-07 14:00:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:30,735 INFO L225 Difference]: With dead ends: 3009 [2019-10-07 14:00:30,735 INFO L226 Difference]: Without dead ends: 2905 [2019-10-07 14:00:30,736 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:00:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2019-10-07 14:00:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2905. [2019-10-07 14:00:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2905 states. [2019-10-07 14:00:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 4096 transitions. [2019-10-07 14:00:30,879 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 4096 transitions. Word has length 74 [2019-10-07 14:00:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:30,880 INFO L462 AbstractCegarLoop]: Abstraction has 2905 states and 4096 transitions. [2019-10-07 14:00:30,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:00:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4096 transitions. [2019-10-07 14:00:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-07 14:00:30,881 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:30,881 INFO L385 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] [2019-10-07 14:00:30,881 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:30,882 INFO L82 PathProgramCache]: Analyzing trace with hash -992835037, now seen corresponding path program 1 times [2019-10-07 14:00:30,882 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:30,882 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:30,882 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:30,882 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:30,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:31,290 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:31,290 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:31,290 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 14:00:31,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 14:00:31,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 14:00:31,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 14:00:31,291 INFO L87 Difference]: Start difference. First operand 2905 states and 4096 transitions. Second operand 14 states. [2019-10-07 14:00:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:36,601 INFO L93 Difference]: Finished difference Result 2921 states and 4113 transitions. [2019-10-07 14:00:36,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 14:00:36,601 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2019-10-07 14:00:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:36,607 INFO L225 Difference]: With dead ends: 2921 [2019-10-07 14:00:36,607 INFO L226 Difference]: Without dead ends: 2873 [2019-10-07 14:00:36,608 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-07 14:00:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2019-10-07 14:00:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2873. [2019-10-07 14:00:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2873 states. [2019-10-07 14:00:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 4054 transitions. [2019-10-07 14:00:36,751 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 4054 transitions. Word has length 81 [2019-10-07 14:00:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:36,751 INFO L462 AbstractCegarLoop]: Abstraction has 2873 states and 4054 transitions. [2019-10-07 14:00:36,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 14:00:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 4054 transitions. [2019-10-07 14:00:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-07 14:00:36,753 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:36,753 INFO L385 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] [2019-10-07 14:00:36,753 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:36,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:36,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1129019230, now seen corresponding path program 1 times [2019-10-07 14:00:36,754 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:36,754 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:36,754 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:36,754 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:36,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:37,351 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:37,351 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:37,351 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 14:00:37,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 14:00:37,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 14:00:37,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 14:00:37,352 INFO L87 Difference]: Start difference. First operand 2873 states and 4054 transitions. Second operand 14 states. [2019-10-07 14:00:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:43,401 INFO L93 Difference]: Finished difference Result 2889 states and 4071 transitions. [2019-10-07 14:00:43,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 14:00:43,402 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-10-07 14:00:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:43,407 INFO L225 Difference]: With dead ends: 2889 [2019-10-07 14:00:43,407 INFO L226 Difference]: Without dead ends: 2867 [2019-10-07 14:00:43,408 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-07 14:00:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2019-10-07 14:00:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2867. [2019-10-07 14:00:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2867 states. [2019-10-07 14:00:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2867 states and 4046 transitions. [2019-10-07 14:00:43,549 INFO L78 Accepts]: Start accepts. Automaton has 2867 states and 4046 transitions. Word has length 83 [2019-10-07 14:00:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:43,549 INFO L462 AbstractCegarLoop]: Abstraction has 2867 states and 4046 transitions. [2019-10-07 14:00:43,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 14:00:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2867 states and 4046 transitions. [2019-10-07 14:00:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-07 14:00:43,551 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:43,551 INFO L385 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] [2019-10-07 14:00:43,551 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:43,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:43,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1637937442, now seen corresponding path program 1 times [2019-10-07 14:00:43,552 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:43,552 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:43,552 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:43,552 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:43,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:45,732 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:45,732 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:45,732 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 14:00:45,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 14:00:45,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 14:00:45,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 14:00:45,733 INFO L87 Difference]: Start difference. First operand 2867 states and 4046 transitions. Second operand 14 states. [2019-10-07 14:00:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:52,034 INFO L93 Difference]: Finished difference Result 2883 states and 4063 transitions. [2019-10-07 14:00:52,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 14:00:52,034 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2019-10-07 14:00:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:52,042 INFO L225 Difference]: With dead ends: 2883 [2019-10-07 14:00:52,042 INFO L226 Difference]: Without dead ends: 2865 [2019-10-07 14:00:52,044 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-07 14:00:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-10-07 14:00:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2019-10-07 14:00:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-10-07 14:00:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4042 transitions. [2019-10-07 14:00:52,198 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4042 transitions. Word has length 75 [2019-10-07 14:00:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:52,198 INFO L462 AbstractCegarLoop]: Abstraction has 2865 states and 4042 transitions. [2019-10-07 14:00:52,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 14:00:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4042 transitions. [2019-10-07 14:00:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 14:00:52,200 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:52,200 INFO L385 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] [2019-10-07 14:00:52,201 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1877935057, now seen corresponding path program 1 times [2019-10-07 14:00:52,201 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:52,201 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:52,201 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:52,201 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:00:52,538 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:52,539 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:52,539 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 14:00:52,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 14:00:52,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 14:00:52,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 14:00:52,540 INFO L87 Difference]: Start difference. First operand 2865 states and 4042 transitions. Second operand 14 states. [2019-10-07 14:00:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:00:58,649 INFO L93 Difference]: Finished difference Result 2881 states and 4059 transitions. [2019-10-07 14:00:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 14:00:58,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2019-10-07 14:00:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:00:58,655 INFO L225 Difference]: With dead ends: 2881 [2019-10-07 14:00:58,656 INFO L226 Difference]: Without dead ends: 2859 [2019-10-07 14:00:58,656 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-07 14:00:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2019-10-07 14:00:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2859. [2019-10-07 14:00:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2859 states. [2019-10-07 14:00:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 4034 transitions. [2019-10-07 14:00:58,809 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 4034 transitions. Word has length 76 [2019-10-07 14:00:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:00:58,810 INFO L462 AbstractCegarLoop]: Abstraction has 2859 states and 4034 transitions. [2019-10-07 14:00:58,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 14:00:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4034 transitions. [2019-10-07 14:00:58,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-07 14:00:58,811 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:00:58,811 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 14:00:58,812 INFO L410 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:00:58,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:00:58,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1076914725, now seen corresponding path program 1 times [2019-10-07 14:00:58,812 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:00:58,812 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:58,812 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:58,812 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:00:58,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:00:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:00:58,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-10-07 14:00:58,923 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:00:58,924 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:00:58,924 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 14:00:58,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:00:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:00:58,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:00:58,925 INFO L87 Difference]: Start difference. First operand 2859 states and 4034 transitions. Second operand 4 states. [2019-10-07 14:01:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:00,829 INFO L93 Difference]: Finished difference Result 4044 states and 5729 transitions. [2019-10-07 14:01:00,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:01:00,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-10-07 14:01:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:00,838 INFO L225 Difference]: With dead ends: 4044 [2019-10-07 14:01:00,839 INFO L226 Difference]: Without dead ends: 2825 [2019-10-07 14:01:00,843 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:01:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2019-10-07 14:01:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2825. [2019-10-07 14:01:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2825 states. [2019-10-07 14:01:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3981 transitions. [2019-10-07 14:01:01,001 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3981 transitions. Word has length 74 [2019-10-07 14:01:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:01,001 INFO L462 AbstractCegarLoop]: Abstraction has 2825 states and 3981 transitions. [2019-10-07 14:01:01,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:01:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3981 transitions. [2019-10-07 14:01:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-07 14:01:01,003 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:01,003 INFO L385 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] [2019-10-07 14:01:01,003 INFO L410 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:01,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1688173592, now seen corresponding path program 1 times [2019-10-07 14:01:01,004 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:01,004 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:01,004 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:01,004 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:01:01,121 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:01,122 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:01,122 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:01:01,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:01:01,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:01:01,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:01:01,123 INFO L87 Difference]: Start difference. First operand 2825 states and 3981 transitions. Second operand 6 states. [2019-10-07 14:01:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:03,346 INFO L93 Difference]: Finished difference Result 2870 states and 4031 transitions. [2019-10-07 14:01:03,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:01:03,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-10-07 14:01:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:03,351 INFO L225 Difference]: With dead ends: 2870 [2019-10-07 14:01:03,351 INFO L226 Difference]: Without dead ends: 2825 [2019-10-07 14:01:03,352 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:01:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2019-10-07 14:01:03,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2825. [2019-10-07 14:01:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2825 states. [2019-10-07 14:01:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3980 transitions. [2019-10-07 14:01:03,495 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3980 transitions. Word has length 73 [2019-10-07 14:01:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:03,495 INFO L462 AbstractCegarLoop]: Abstraction has 2825 states and 3980 transitions. [2019-10-07 14:01:03,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:01:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3980 transitions. [2019-10-07 14:01:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 14:01:03,497 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:03,497 INFO L385 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] [2019-10-07 14:01:03,497 INFO L410 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2009298649, now seen corresponding path program 1 times [2019-10-07 14:01:03,497 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:03,497 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:03,498 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:03,498 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:03,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:01:03,768 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:03,768 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:03,768 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 14:01:03,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 14:01:03,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 14:01:03,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:01:03,769 INFO L87 Difference]: Start difference. First operand 2825 states and 3980 transitions. Second operand 3 states. [2019-10-07 14:01:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:04,277 INFO L93 Difference]: Finished difference Result 5829 states and 8378 transitions. [2019-10-07 14:01:04,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 14:01:04,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-07 14:01:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:04,289 INFO L225 Difference]: With dead ends: 5829 [2019-10-07 14:01:04,289 INFO L226 Difference]: Without dead ends: 3840 [2019-10-07 14:01:04,297 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 14:01:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2019-10-07 14:01:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3793. [2019-10-07 14:01:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3793 states. [2019-10-07 14:01:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3793 states to 3793 states and 5406 transitions. [2019-10-07 14:01:04,516 INFO L78 Accepts]: Start accepts. Automaton has 3793 states and 5406 transitions. Word has length 82 [2019-10-07 14:01:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:04,517 INFO L462 AbstractCegarLoop]: Abstraction has 3793 states and 5406 transitions. [2019-10-07 14:01:04,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 14:01:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 5406 transitions. [2019-10-07 14:01:04,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-07 14:01:04,518 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:04,518 INFO L385 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] [2019-10-07 14:01:04,518 INFO L410 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:04,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:04,519 INFO L82 PathProgramCache]: Analyzing trace with hash 844683203, now seen corresponding path program 1 times [2019-10-07 14:01:04,519 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:04,519 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:04,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:04,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:04,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:01:04,624 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:04,624 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:04,624 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:01:04,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:01:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:01:04,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:01:04,625 INFO L87 Difference]: Start difference. First operand 3793 states and 5406 transitions. Second operand 6 states. [2019-10-07 14:01:05,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:05,687 INFO L93 Difference]: Finished difference Result 3846 states and 5464 transitions. [2019-10-07 14:01:05,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:01:05,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-10-07 14:01:05,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:05,694 INFO L225 Difference]: With dead ends: 3846 [2019-10-07 14:01:05,695 INFO L226 Difference]: Without dead ends: 3802 [2019-10-07 14:01:05,696 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:01:05,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2019-10-07 14:01:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3793. [2019-10-07 14:01:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3793 states. [2019-10-07 14:01:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3793 states to 3793 states and 5404 transitions. [2019-10-07 14:01:05,891 INFO L78 Accepts]: Start accepts. Automaton has 3793 states and 5404 transitions. Word has length 75 [2019-10-07 14:01:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:05,891 INFO L462 AbstractCegarLoop]: Abstraction has 3793 states and 5404 transitions. [2019-10-07 14:01:05,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:01:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 5404 transitions. [2019-10-07 14:01:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-07 14:01:05,893 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:05,893 INFO L385 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] [2019-10-07 14:01:05,893 INFO L410 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2013424524, now seen corresponding path program 1 times [2019-10-07 14:01:05,894 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:05,894 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:05,894 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:05,894 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:06,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-10-07 14:01:06,073 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:06,073 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:06,073 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:01:06,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:01:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:01:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:01:06,074 INFO L87 Difference]: Start difference. First operand 3793 states and 5404 transitions. Second operand 9 states. [2019-10-07 14:01:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:08,391 INFO L93 Difference]: Finished difference Result 3811 states and 5423 transitions. [2019-10-07 14:01:08,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 14:01:08,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-10-07 14:01:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:08,399 INFO L225 Difference]: With dead ends: 3811 [2019-10-07 14:01:08,399 INFO L226 Difference]: Without dead ends: 3769 [2019-10-07 14:01:08,400 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 14:01:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3769 states. [2019-10-07 14:01:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3769 to 3769. [2019-10-07 14:01:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3769 states. [2019-10-07 14:01:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 5379 transitions. [2019-10-07 14:01:08,595 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 5379 transitions. Word has length 81 [2019-10-07 14:01:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:08,595 INFO L462 AbstractCegarLoop]: Abstraction has 3769 states and 5379 transitions. [2019-10-07 14:01:08,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:01:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 5379 transitions. [2019-10-07 14:01:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 14:01:08,597 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:08,597 INFO L385 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] [2019-10-07 14:01:08,598 INFO L410 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:08,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1582901808, now seen corresponding path program 1 times [2019-10-07 14:01:08,598 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:08,598 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:08,598 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:08,599 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:08,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:01:09,147 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:09,147 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:09,148 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 14:01:09,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 14:01:09,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 14:01:09,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 14:01:09,149 INFO L87 Difference]: Start difference. First operand 3769 states and 5379 transitions. Second operand 14 states. [2019-10-07 14:01:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:14,811 INFO L93 Difference]: Finished difference Result 3785 states and 5396 transitions. [2019-10-07 14:01:14,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 14:01:14,811 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 82 [2019-10-07 14:01:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:14,818 INFO L225 Difference]: With dead ends: 3785 [2019-10-07 14:01:14,819 INFO L226 Difference]: Without dead ends: 3763 [2019-10-07 14:01:14,820 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-07 14:01:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2019-10-07 14:01:15,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3763. [2019-10-07 14:01:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3763 states. [2019-10-07 14:01:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3763 states to 3763 states and 5371 transitions. [2019-10-07 14:01:15,024 INFO L78 Accepts]: Start accepts. Automaton has 3763 states and 5371 transitions. Word has length 82 [2019-10-07 14:01:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:15,024 INFO L462 AbstractCegarLoop]: Abstraction has 3763 states and 5371 transitions. [2019-10-07 14:01:15,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 14:01:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3763 states and 5371 transitions. [2019-10-07 14:01:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-07 14:01:15,026 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:15,026 INFO L385 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] [2019-10-07 14:01:15,026 INFO L410 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:15,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2062764699, now seen corresponding path program 1 times [2019-10-07 14:01:15,026 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:15,026 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:15,027 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:15,027 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:01:16,453 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:16,454 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:16,454 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 14:01:16,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 14:01:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 14:01:16,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 14:01:16,455 INFO L87 Difference]: Start difference. First operand 3763 states and 5371 transitions. Second operand 14 states. [2019-10-07 14:01:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:22,874 INFO L93 Difference]: Finished difference Result 3779 states and 5388 transitions. [2019-10-07 14:01:22,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 14:01:22,874 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2019-10-07 14:01:22,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:22,881 INFO L225 Difference]: With dead ends: 3779 [2019-10-07 14:01:22,881 INFO L226 Difference]: Without dead ends: 3757 [2019-10-07 14:01:22,883 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-07 14:01:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2019-10-07 14:01:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3757. [2019-10-07 14:01:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3757 states. [2019-10-07 14:01:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 5363 transitions. [2019-10-07 14:01:23,076 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 5363 transitions. Word has length 81 [2019-10-07 14:01:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:23,076 INFO L462 AbstractCegarLoop]: Abstraction has 3757 states and 5363 transitions. [2019-10-07 14:01:23,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 14:01:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 5363 transitions. [2019-10-07 14:01:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-07 14:01:23,077 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:23,078 INFO L385 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] [2019-10-07 14:01:23,078 INFO L410 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2108577345, now seen corresponding path program 1 times [2019-10-07 14:01:23,078 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:23,078 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:23,078 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:23,078 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:23,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:01:24,024 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:24,025 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:24,026 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 14:01:24,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 14:01:24,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 14:01:24,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 14:01:24,030 INFO L87 Difference]: Start difference. First operand 3757 states and 5363 transitions. Second operand 14 states. [2019-10-07 14:01:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:29,878 INFO L93 Difference]: Finished difference Result 3773 states and 5380 transitions. [2019-10-07 14:01:29,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 14:01:29,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-10-07 14:01:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:29,886 INFO L225 Difference]: With dead ends: 3773 [2019-10-07 14:01:29,886 INFO L226 Difference]: Without dead ends: 3749 [2019-10-07 14:01:29,887 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-07 14:01:29,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2019-10-07 14:01:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 3749. [2019-10-07 14:01:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3749 states. [2019-10-07 14:01:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3749 states to 3749 states and 5352 transitions. [2019-10-07 14:01:30,079 INFO L78 Accepts]: Start accepts. Automaton has 3749 states and 5352 transitions. Word has length 89 [2019-10-07 14:01:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:30,079 INFO L462 AbstractCegarLoop]: Abstraction has 3749 states and 5352 transitions. [2019-10-07 14:01:30,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 14:01:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3749 states and 5352 transitions. [2019-10-07 14:01:30,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-07 14:01:30,081 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:30,081 INFO L385 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] [2019-10-07 14:01:30,081 INFO L410 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:30,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1231061550, now seen corresponding path program 1 times [2019-10-07 14:01:30,082 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:30,082 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:30,082 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:30,082 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:01:31,129 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:31,129 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:31,129 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 14:01:31,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 14:01:31,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 14:01:31,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 14:01:31,130 INFO L87 Difference]: Start difference. First operand 3749 states and 5352 transitions. Second operand 14 states. [2019-10-07 14:01:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:36,592 INFO L93 Difference]: Finished difference Result 3765 states and 5369 transitions. [2019-10-07 14:01:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 14:01:36,593 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 84 [2019-10-07 14:01:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:36,600 INFO L225 Difference]: With dead ends: 3765 [2019-10-07 14:01:36,601 INFO L226 Difference]: Without dead ends: 3743 [2019-10-07 14:01:36,602 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-07 14:01:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2019-10-07 14:01:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3743. [2019-10-07 14:01:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-10-07 14:01:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 5344 transitions. [2019-10-07 14:01:36,800 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 5344 transitions. Word has length 84 [2019-10-07 14:01:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:36,801 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 5344 transitions. [2019-10-07 14:01:36,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 14:01:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 5344 transitions. [2019-10-07 14:01:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 14:01:36,803 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:36,803 INFO L385 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] [2019-10-07 14:01:36,803 INFO L410 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:36,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1574641064, now seen corresponding path program 1 times [2019-10-07 14:01:36,804 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:36,804 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:36,804 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:36,804 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:01:37,152 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:37,152 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:37,153 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-07 14:01:37,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-07 14:01:37,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-07 14:01:37,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-07 14:01:37,153 INFO L87 Difference]: Start difference. First operand 3743 states and 5344 transitions. Second operand 15 states. [2019-10-07 14:01:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:43,626 INFO L93 Difference]: Finished difference Result 3759 states and 5361 transitions. [2019-10-07 14:01:43,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 14:01:43,626 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 82 [2019-10-07 14:01:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:43,633 INFO L225 Difference]: With dead ends: 3759 [2019-10-07 14:01:43,633 INFO L226 Difference]: Without dead ends: 3721 [2019-10-07 14:01:43,634 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-07 14:01:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2019-10-07 14:01:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3721. [2019-10-07 14:01:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2019-10-07 14:01:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5320 transitions. [2019-10-07 14:01:43,828 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5320 transitions. Word has length 82 [2019-10-07 14:01:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:43,828 INFO L462 AbstractCegarLoop]: Abstraction has 3721 states and 5320 transitions. [2019-10-07 14:01:43,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-07 14:01:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5320 transitions. [2019-10-07 14:01:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-07 14:01:43,830 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:43,830 INFO L385 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] [2019-10-07 14:01:43,830 INFO L410 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:43,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:43,830 INFO L82 PathProgramCache]: Analyzing trace with hash -622727989, now seen corresponding path program 1 times [2019-10-07 14:01:43,830 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:43,830 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:43,830 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:43,830 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:43,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:01:43,986 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:43,986 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:43,986 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 14:01:43,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 14:01:43,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 14:01:43,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:01:43,987 INFO L87 Difference]: Start difference. First operand 3721 states and 5320 transitions. Second operand 9 states. [2019-10-07 14:01:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:46,288 INFO L93 Difference]: Finished difference Result 3774 states and 5378 transitions. [2019-10-07 14:01:46,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 14:01:46,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-10-07 14:01:46,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:46,297 INFO L225 Difference]: With dead ends: 3774 [2019-10-07 14:01:46,297 INFO L226 Difference]: Without dead ends: 3727 [2019-10-07 14:01:46,298 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-07 14:01:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2019-10-07 14:01:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3721. [2019-10-07 14:01:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3721 states. [2019-10-07 14:01:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5319 transitions. [2019-10-07 14:01:46,491 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5319 transitions. Word has length 79 [2019-10-07 14:01:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:46,492 INFO L462 AbstractCegarLoop]: Abstraction has 3721 states and 5319 transitions. [2019-10-07 14:01:46,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 14:01:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5319 transitions. [2019-10-07 14:01:46,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-07 14:01:46,493 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:46,493 INFO L385 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] [2019-10-07 14:01:46,494 INFO L410 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:46,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1962097696, now seen corresponding path program 1 times [2019-10-07 14:01:46,494 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:46,494 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:46,494 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:46,495 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:46,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:01:46,591 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:46,591 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:46,591 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 14:01:46,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 14:01:46,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 14:01:46,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 14:01:46,592 INFO L87 Difference]: Start difference. First operand 3721 states and 5319 transitions. Second operand 6 states. [2019-10-07 14:01:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:48,845 INFO L93 Difference]: Finished difference Result 3779 states and 5382 transitions. [2019-10-07 14:01:48,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 14:01:48,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-10-07 14:01:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:48,853 INFO L225 Difference]: With dead ends: 3779 [2019-10-07 14:01:48,853 INFO L226 Difference]: Without dead ends: 3715 [2019-10-07 14:01:48,855 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 14:01:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2019-10-07 14:01:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3700. [2019-10-07 14:01:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3700 states. [2019-10-07 14:01:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5286 transitions. [2019-10-07 14:01:49,048 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5286 transitions. Word has length 79 [2019-10-07 14:01:49,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:49,048 INFO L462 AbstractCegarLoop]: Abstraction has 3700 states and 5286 transitions. [2019-10-07 14:01:49,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 14:01:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5286 transitions. [2019-10-07 14:01:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-07 14:01:49,050 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:49,050 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 14:01:49,051 INFO L410 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:49,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:49,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2059931757, now seen corresponding path program 1 times [2019-10-07 14:01:49,051 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:49,051 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:49,051 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:49,051 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:49,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 14:01:49,183 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:49,183 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:49,183 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 14:01:49,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 14:01:49,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 14:01:49,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:01:49,184 INFO L87 Difference]: Start difference. First operand 3700 states and 5286 transitions. Second operand 8 states. [2019-10-07 14:01:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:50,360 INFO L93 Difference]: Finished difference Result 3744 states and 5335 transitions. [2019-10-07 14:01:50,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 14:01:50,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-10-07 14:01:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:50,367 INFO L225 Difference]: With dead ends: 3744 [2019-10-07 14:01:50,367 INFO L226 Difference]: Without dead ends: 3698 [2019-10-07 14:01:50,368 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:01:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2019-10-07 14:01:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2019-10-07 14:01:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2019-10-07 14:01:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5282 transitions. [2019-10-07 14:01:50,560 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5282 transitions. Word has length 83 [2019-10-07 14:01:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:50,560 INFO L462 AbstractCegarLoop]: Abstraction has 3698 states and 5282 transitions. [2019-10-07 14:01:50,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 14:01:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5282 transitions. [2019-10-07 14:01:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 14:01:50,562 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:50,562 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 14:01:50,562 INFO L410 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:50,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:50,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1118471620, now seen corresponding path program 1 times [2019-10-07 14:01:50,562 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:50,563 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:50,563 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:50,563 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:50,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:50,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 14:01:50,714 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:50,714 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:50,714 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 14:01:50,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 14:01:50,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 14:01:50,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 14:01:50,715 INFO L87 Difference]: Start difference. First operand 3698 states and 5282 transitions. Second operand 8 states. [2019-10-07 14:01:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:52,990 INFO L93 Difference]: Finished difference Result 3742 states and 5331 transitions. [2019-10-07 14:01:52,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 14:01:52,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-10-07 14:01:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:52,997 INFO L225 Difference]: With dead ends: 3742 [2019-10-07 14:01:52,997 INFO L226 Difference]: Without dead ends: 3696 [2019-10-07 14:01:52,999 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-07 14:01:53,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2019-10-07 14:01:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 3696. [2019-10-07 14:01:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3696 states. [2019-10-07 14:01:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5278 transitions. [2019-10-07 14:01:53,192 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 5278 transitions. Word has length 82 [2019-10-07 14:01:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:53,192 INFO L462 AbstractCegarLoop]: Abstraction has 3696 states and 5278 transitions. [2019-10-07 14:01:53,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 14:01:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 5278 transitions. [2019-10-07 14:01:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-07 14:01:53,193 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:53,193 INFO L385 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] [2019-10-07 14:01:53,194 INFO L410 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:53,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:53,194 INFO L82 PathProgramCache]: Analyzing trace with hash -947870876, now seen corresponding path program 1 times [2019-10-07 14:01:53,194 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:53,194 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:53,194 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:53,194 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 14:01:53,317 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:53,317 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:53,317 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 14:01:53,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:01:53,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:01:53,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:01:53,318 INFO L87 Difference]: Start difference. First operand 3696 states and 5278 transitions. Second operand 4 states. [2019-10-07 14:01:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:53,603 INFO L93 Difference]: Finished difference Result 6790 states and 9799 transitions. [2019-10-07 14:01:53,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 14:01:53,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-07 14:01:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:53,615 INFO L225 Difference]: With dead ends: 6790 [2019-10-07 14:01:53,615 INFO L226 Difference]: Without dead ends: 3706 [2019-10-07 14:01:53,623 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 14:01:53,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2019-10-07 14:01:53,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2019-10-07 14:01:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2019-10-07 14:01:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5294 transitions. [2019-10-07 14:01:53,818 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5294 transitions. Word has length 90 [2019-10-07 14:01:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:53,818 INFO L462 AbstractCegarLoop]: Abstraction has 3706 states and 5294 transitions. [2019-10-07 14:01:53,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:01:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5294 transitions. [2019-10-07 14:01:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-07 14:01:53,820 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:53,820 INFO L385 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] [2019-10-07 14:01:53,820 INFO L410 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1262460138, now seen corresponding path program 1 times [2019-10-07 14:01:53,821 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:53,821 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:53,821 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:53,821 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:53,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 14:01:53,938 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:53,938 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 14:01:53,938 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 14:01:53,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 14:01:53,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 14:01:53,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 14:01:53,939 INFO L87 Difference]: Start difference. First operand 3706 states and 5294 transitions. Second operand 4 states. [2019-10-07 14:01:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 14:01:54,182 INFO L93 Difference]: Finished difference Result 6811 states and 9831 transitions. [2019-10-07 14:01:54,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 14:01:54,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-07 14:01:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 14:01:54,190 INFO L225 Difference]: With dead ends: 6811 [2019-10-07 14:01:54,190 INFO L226 Difference]: Without dead ends: 3719 [2019-10-07 14:01:54,197 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 14:01:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2019-10-07 14:01:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3710. [2019-10-07 14:01:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2019-10-07 14:01:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5301 transitions. [2019-10-07 14:01:54,391 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5301 transitions. Word has length 90 [2019-10-07 14:01:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 14:01:54,392 INFO L462 AbstractCegarLoop]: Abstraction has 3710 states and 5301 transitions. [2019-10-07 14:01:54,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 14:01:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5301 transitions. [2019-10-07 14:01:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 14:01:54,393 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 14:01:54,393 INFO L385 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] [2019-10-07 14:01:54,393 INFO L410 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 14:01:54,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 14:01:54,394 INFO L82 PathProgramCache]: Analyzing trace with hash 684617222, now seen corresponding path program 1 times [2019-10-07 14:01:54,394 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 14:01:54,394 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:54,394 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:54,394 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 14:01:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 14:01:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 14:01:54,511 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 14:01:54,511 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 14:01:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 14:01:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 14:01:56,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 2261 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 14:01:56,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 14:01:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 14:01:56,109 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 14:01:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 14:01:56,314 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 14:01:56,348 INFO L162 IcfgInterpreter]: Started Sifa with 91 locations of interest [2019-10-07 14:01:56,348 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 14:01:56,359 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 14:01:56,367 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 14:01:56,368 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 14:01:57,069 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 691 [2019-10-07 14:03:21,645 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 727 [2019-10-07 14:04:02,984 WARN L191 SmtUtils]: Spent 35.88 s on a formula simplification. DAG size of input: 1794 DAG size of output: 1437 [2019-10-07 14:04:03,883 WARN L191 SmtUtils]: Spent 833.00 ms on a formula simplification that was a NOOP. DAG size: 1346 [2019-10-07 14:04:04,587 WARN L191 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 1346 [2019-10-07 14:04:05,237 WARN L191 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 1346 [2019-10-07 14:04:06,297 WARN L191 SmtUtils]: Spent 1000.00 ms on a formula simplification that was a NOOP. DAG size: 1489 [2019-10-07 14:04:07,254 WARN L191 SmtUtils]: Spent 939.00 ms on a formula simplification that was a NOOP. DAG size: 1489 [2019-10-07 14:04:08,193 WARN L191 SmtUtils]: Spent 934.00 ms on a formula simplification that was a NOOP. DAG size: 1489 [2019-10-07 14:04:09,280 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 1489 [2019-10-07 14:04:11,160 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 1491 DAG size of output: 1489 [2019-10-07 14:04:12,097 WARN L191 SmtUtils]: Spent 932.00 ms on a formula simplification that was a NOOP. DAG size: 1489 [2019-10-07 14:04:13,104 WARN L191 SmtUtils]: Spent 941.00 ms on a formula simplification that was a NOOP. DAG size: 1489 [2019-10-07 14:04:14,112 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 1489 [2019-10-07 14:04:15,053 WARN L191 SmtUtils]: Spent 937.00 ms on a formula simplification that was a NOOP. DAG size: 1489 [2019-10-07 14:04:16,017 WARN L191 SmtUtils]: Spent 933.00 ms on a formula simplification that was a NOOP. DAG size: 1489 [2019-10-07 14:04:16,039 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 343 for LOIs [2019-10-07 14:04:16,326 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 878 [2019-10-07 14:04:16,479 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 878 [2019-10-07 14:04:16,855 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 1021 [2019-10-07 14:04:16,856 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1519 for LOIs [2019-10-07 14:04:17,792 WARN L191 SmtUtils]: Spent 935.00 ms on a formula simplification that was a NOOP. DAG size: 1519 [2019-10-07 14:04:18,737 WARN L191 SmtUtils]: Spent 941.00 ms on a formula simplification that was a NOOP. DAG size: 1519 [2019-10-07 14:04:19,897 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 1595 [2019-10-07 14:04:20,953 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 1571 [2019-10-07 14:04:21,922 WARN L191 SmtUtils]: Spent 963.00 ms on a formula simplification that was a NOOP. DAG size: 1571 [2019-10-07 14:04:23,146 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 1649