java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:06:09,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:06:09,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:06:09,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:06:09,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:06:09,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:06:09,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:06:09,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:06:09,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:06:09,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:06:09,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:06:09,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:06:09,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:06:09,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:06:09,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:06:09,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:06:09,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:06:09,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:06:09,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:06:09,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:06:09,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:06:09,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:06:09,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:06:09,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:06:09,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:06:09,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:06:09,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:06:09,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:06:09,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:06:09,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:06:09,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:06:09,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:06:09,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:06:09,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:06:09,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:06:09,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:06:09,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:06:09,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:06:09,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:06:09,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:06:09,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:06:09,598 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 13:06:09,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:06:09,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:06:09,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:06:09,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:06:09,626 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:06:09,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:06:09,626 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:06:09,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:06:09,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:06:09,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:06:09,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:06:09,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:06:09,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:06:09,628 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:06:09,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:06:09,628 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:06:09,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:06:09,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:06:09,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:06:09,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:06:09,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:06:09,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:06:09,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:06:09,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:06:09,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:06:09,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:06:09,630 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:06:09,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:06:09,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:06:09,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:06:09,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:06:09,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:06:09,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:06:09,683 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:06:09,684 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-09-07 13:06:09,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe6a1429/ebf65fac323b4ff28e21211da40fe6f7/FLAGe14b30fa0 [2019-09-07 13:06:10,574 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:06:10,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c [2019-09-07 13:06:10,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe6a1429/ebf65fac323b4ff28e21211da40fe6f7/FLAGe14b30fa0 [2019-09-07 13:06:11,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe6a1429/ebf65fac323b4ff28e21211da40fe6f7 [2019-09-07 13:06:11,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:06:11,067 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:06:11,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:06:11,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:06:11,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:06:11,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:06:11" (1/1) ... [2019-09-07 13:06:11,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@561fc710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:06:11, skipping insertion in model container [2019-09-07 13:06:11,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:06:11" (1/1) ... [2019-09-07 13:06:11,081 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:06:11,253 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:06:13,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:06:13,219 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:06:13,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:06:13,991 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:06:13,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:06:13 WrapperNode [2019-09-07 13:06:13,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:06:13,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:06:13,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:06:13,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:06:14,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:06:13" (1/1) ... [2019-09-07 13:06:14,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:06:13" (1/1) ... [2019-09-07 13:06:14,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:06:13" (1/1) ... [2019-09-07 13:06:14,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:06:13" (1/1) ... [2019-09-07 13:06:14,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:06:13" (1/1) ... [2019-09-07 13:06:14,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:06:13" (1/1) ... [2019-09-07 13:06:14,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:06:13" (1/1) ... [2019-09-07 13:06:14,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:06:14,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:06:14,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:06:14,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:06:14,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:06:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:06:14,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:06:14,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:06:14,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2019-09-07 13:06:14,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2019-09-07 13:06:14,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~TO~VOID [2019-09-07 13:06:14,703 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2019-09-07 13:06:14,703 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlIntegerToUnicodeString [2019-09-07 13:06:14,703 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlUnicodeStringToInteger [2019-09-07 13:06:14,703 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareUnicodeString [2019-09-07 13:06:14,703 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAppendUnicodeStringToString [2019-09-07 13:06:14,704 INFO L138 BoogieDeclarations]: Found implementation of procedure READ_PORT_UCHAR [2019-09-07 13:06:14,704 INFO L138 BoogieDeclarations]: Found implementation of procedure WRITE_PORT_UCHAR [2019-09-07 13:06:14,706 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2019-09-07 13:06:14,706 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2019-09-07 13:06:14,708 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2019-09-07 13:06:14,708 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeDpc [2019-09-07 13:06:14,709 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInsertQueueDpc [2019-09-07 13:06:14,709 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSynchronizeExecution [2019-09-07 13:06:14,709 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTimeIncrement [2019-09-07 13:06:14,710 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireCancelSpinLock [2019-09-07 13:06:14,710 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateErrorLogEntry [2019-09-07 13:06:14,710 INFO L138 BoogieDeclarations]: Found implementation of procedure IoConnectInterrupt [2019-09-07 13:06:14,710 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReportResourceUsage [2019-09-07 13:06:14,711 INFO L138 BoogieDeclarations]: Found implementation of procedure IoInitializeRemoveLockEx [2019-09-07 13:06:14,711 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockEx [2019-09-07 13:06:14,711 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockAndWaitEx [2019-09-07 13:06:14,711 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWriteErrorLogEntry [2019-09-07 13:06:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2019-09-07 13:06:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2019-09-07 13:06:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure KeStallExecutionProcessor [2019-09-07 13:06:14,712 INFO L138 BoogieDeclarations]: Found implementation of procedure PoRequestPowerIrp [2019-09-07 13:06:14,713 INFO L138 BoogieDeclarations]: Found implementation of procedure PoSetPowerState [2019-09-07 13:06:14,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfReferenceObject [2019-09-07 13:06:14,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwQueryValueKey [2019-09-07 13:06:14,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwSetValueKey [2019-09-07 13:06:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiCompleteRequest [2019-09-07 13:06:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-07 13:06:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCleanup [2019-09-07 13:06:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpPnpIrpInfo [2019-09-07 13:06:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLock [2019-09-07 13:06:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLock [2019-09-07 13:06:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLockAndWait [2019-09-07 13:06:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceList [2019-09-07 13:06:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceRequirementsList [2019-09-07 13:06:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLogError [2019-09-07 13:06:14,715 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2019-09-07 13:06:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure PptUnload [2019-09-07 13:06:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCleanRemovalRelationsList [2019-09-07 13:06:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAddPptRemovalRelation [2019-09-07 13:06:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRemovePptRemovalRelation [2019-09-07 13:06:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpRemovalRelationsList [2019-09-07 13:06:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpPptRemovalRelationsStruct [2019-09-07 13:06:14,716 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchInternalDeviceControl [2019-09-07 13:06:14,717 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsNecR98Machine [2019-09-07 13:06:14,717 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCreate [2019-09-07 13:06:14,717 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchClose [2019-09-07 13:06:14,717 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitiate1284_3 [2019-09-07 13:06:14,717 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectDevice [2019-09-07 13:06:14,717 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectDevice [2019-09-07 13:06:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure Ppt1284_3AssignAddress [2019-09-07 13:06:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfNon1284_3Present [2019-09-07 13:06:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStl1284_3 [2019-09-07 13:06:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStlProductId [2019-09-07 13:06:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSend1284_3Command [2019-09-07 13:06:14,718 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectChipFilter [2019-09-07 13:06:14,719 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortType [2019-09-07 13:06:14,719 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortCapabilities [2019-09-07 13:06:14,719 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEcpPort [2019-09-07 13:06:14,719 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfDot3DevicePresent [2019-09-07 13:06:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfUserRequested [2019-09-07 13:06:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPort [2019-09-07 13:06:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectBytePort [2019-09-07 13:06:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoDepth [2019-09-07 13:06:14,720 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoWidth [2019-09-07 13:06:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetChipMode [2019-09-07 13:06:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearChipMode [2019-09-07 13:06:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrSetMode [2019-09-07 13:06:14,721 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetByteMode [2019-09-07 13:06:14,722 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearByteMode [2019-09-07 13:06:14,722 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckByteMode [2019-09-07 13:06:14,722 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrClearMode [2019-09-07 13:06:14,722 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFindNatChip [2019-09-07 13:06:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildResourceList [2019-09-07 13:06:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBuildRemovalRelations [2019-09-07 13:06:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanPciCardCmResourceList [2019-09-07 13:06:14,723 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsPci [2019-09-07 13:06:14,724 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCompleteRequest [2019-09-07 13:06:14,724 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpInitDispatchFunctionTable [2019-09-07 13:06:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpAddDevice [2019-09-07 13:06:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPnp [2019-09-07 13:06:14,725 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartDevice [2019-09-07 13:06:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanCmResourceList [2019-09-07 13:06:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartValidateResources [2019-09-07 13:06:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterResourceRequirements [2019-09-07 13:06:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterExistsNonIrqResourceList [2019-09-07 13:06:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterRemoveIrqResourceLists [2019-09-07 13:06:14,726 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterGetEndOfResourceRequirementsList [2019-09-07 13:06:14,727 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2019-09-07 13:06:14,727 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptors [2019-09-07 13:06:14,727 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryDeviceRelations [2019-09-07 13:06:14,727 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryStopDevice [2019-09-07 13:06:14,727 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelStopDevice [2019-09-07 13:06:14,727 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStopDevice [2019-09-07 13:06:14,727 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryRemoveDevice [2019-09-07 13:06:14,728 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelRemoveDevice [2019-09-07 13:06:14,728 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpRemoveDevice [2019-09-07 13:06:14,728 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpSurpriseRemoval [2019-09-07 13:06:14,728 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpListContainsIrqResourceDescriptor [2019-09-07 13:06:14,728 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBounceAndCatchPnpIrp [2019-09-07 13:06:14,728 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2019-09-07 13:06:14,728 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpUnhandledIrp [2019-09-07 13:06:14,729 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPowerComplete [2019-09-07 13:06:14,729 INFO L138 BoogieDeclarations]: Found implementation of procedure InitNEC_98 [2019-09-07 13:06:14,729 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPower [2019-09-07 13:06:14,729 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockDiskModeByte [2019-09-07 13:06:14,729 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockPrtModeByte [2019-09-07 13:06:14,729 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipSetDiskMode [2019-09-07 13:06:14,730 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipCheckDevice [2019-09-07 13:06:14,730 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectLegacyZip [2019-09-07 13:06:14,730 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectLegacyZip [2019-09-07 13:06:14,731 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegInitDriverSettings [2019-09-07 13:06:14,731 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegGetDeviceParameterDword [2019-09-07 13:06:14,731 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegSetDeviceParameterDword [2019-09-07 13:06:14,731 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFailRequest [2019-09-07 13:06:14,732 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLockOrFailIrp [2019-09-07 13:06:14,732 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPreProcessIrp [2019-09-07 13:06:14,732 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPostProcessIrp [2019-09-07 13:06:14,732 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchCompletionRoutine [2019-09-07 13:06:14,732 INFO L138 BoogieDeclarations]: Found implementation of procedure PptGetPortNameFromPhysicalDeviceObject [2019-09-07 13:06:14,733 INFO L138 BoogieDeclarations]: Found implementation of procedure PptConnectInterrupt [2019-09-07 13:06:14,733 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDisconnectInterrupt [2019-09-07 13:06:14,733 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedIncrement [2019-09-07 13:06:14,733 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDecrement [2019-09-07 13:06:14,733 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedRead [2019-09-07 13:06:14,734 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedQueue [2019-09-07 13:06:14,734 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDisconnect [2019-09-07 13:06:14,734 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCancelRoutine [2019-09-07 13:06:14,734 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePortDpc [2019-09-07 13:06:14,735 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTryAllocatePortAtInterruptLevel [2019-09-07 13:06:14,735 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePortFromInterruptLevel [2019-09-07 13:06:14,738 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInterruptService [2019-09-07 13:06:14,739 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTryAllocatePort [2019-09-07 13:06:14,739 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTraversePortCheckList [2019-09-07 13:06:14,739 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePort [2019-09-07 13:06:14,746 INFO L138 BoogieDeclarations]: Found implementation of procedure PptQueryNumWaiters [2019-09-07 13:06:14,746 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetCancelRoutine [2019-09-07 13:06:14,746 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTickCount [2019-09-07 13:06:14,747 INFO L138 BoogieDeclarations]: Found implementation of procedure CheckPort [2019-09-07 13:06:14,747 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildParallelPortDeviceName [2019-09-07 13:06:14,747 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitializeDeviceExtension [2019-09-07 13:06:14,747 INFO L138 BoogieDeclarations]: Found implementation of procedure PptGetPortNumberFromLptName [2019-09-07 13:06:14,747 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildDeviceObject [2019-09-07 13:06:14,748 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiInitWmi [2019-09-07 13:06:14,748 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchSystemControl [2019-09-07 13:06:14,748 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiQueryWmiRegInfo [2019-09-07 13:06:14,748 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiQueryWmiDataBlock [2019-09-07 13:06:14,748 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-07 13:06:14,748 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-07 13:06:14,748 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:06:14,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2019-09-07 13:06:14,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2019-09-07 13:06:14,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2019-09-07 13:06:14,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2019-09-07 13:06:14,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2019-09-07 13:06:14,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2019-09-07 13:06:14,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2019-09-07 13:06:14,749 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2019-09-07 13:06:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2019-09-07 13:06:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2019-09-07 13:06:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-07 13:06:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2019-09-07 13:06:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2019-09-07 13:06:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2019-09-07 13:06:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-09-07 13:06:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2019-09-07 13:06:14,751 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2019-09-07 13:06:14,751 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2019-09-07 13:06:14,751 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2019-09-07 13:06:14,751 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-09-07 13:06:14,751 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-09-07 13:06:14,751 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2019-09-07 13:06:14,751 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-09-07 13:06:14,751 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2019-09-07 13:06:14,751 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-07 13:06:14,752 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-07 13:06:14,752 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-07 13:06:14,752 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2019-09-07 13:06:14,752 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2019-09-07 13:06:14,752 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2019-09-07 13:06:14,752 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2019-09-07 13:06:14,752 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2019-09-07 13:06:14,753 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2019-09-07 13:06:14,753 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2019-09-07 13:06:14,753 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-07 13:06:14,753 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-07 13:06:14,753 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2019-09-07 13:06:14,754 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2019-09-07 13:06:14,754 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2019-09-07 13:06:14,754 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2019-09-07 13:06:14,754 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2019-09-07 13:06:14,754 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2019-09-07 13:06:14,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-09-07 13:06:14,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2019-09-07 13:06:14,754 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-07 13:06:14,755 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2019-09-07 13:06:14,755 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-09-07 13:06:14,755 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2019-09-07 13:06:14,755 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2019-09-07 13:06:14,755 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2019-09-07 13:06:14,755 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2019-09-07 13:06:14,755 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2019-09-07 13:06:14,755 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2019-09-07 13:06:14,756 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2019-09-07 13:06:14,756 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2019-09-07 13:06:14,756 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2019-09-07 13:06:14,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-07 13:06:14,756 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiSystemControl [2019-09-07 13:06:14,756 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireRemoveLockEx [2019-09-07 13:06:14,757 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-07 13:06:14,757 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-07 13:06:14,757 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-09-07 13:06:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:06:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-07 13:06:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-09-07 13:06:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-07 13:06:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:06:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-07 13:06:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-07 13:06:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-07 13:06:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-07 13:06:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2019-09-07 13:06:14,758 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-07 13:06:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-07 13:06:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-07 13:06:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-09-07 13:06:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2019-09-07 13:06:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2019-09-07 13:06:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure RtlIntegerToUnicodeString [2019-09-07 13:06:14,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 13:06:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure RtlUnicodeStringToInteger [2019-09-07 13:06:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 13:06:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2019-09-07 13:06:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2019-09-07 13:06:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2019-09-07 13:06:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareUnicodeString [2019-09-07 13:06:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2019-09-07 13:06:14,760 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAppendUnicodeStringToString [2019-09-07 13:06:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2019-09-07 13:06:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2019-09-07 13:06:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure READ_PORT_UCHAR [2019-09-07 13:06:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure WRITE_PORT_UCHAR [2019-09-07 13:06:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2019-09-07 13:06:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2019-09-07 13:06:14,761 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2019-09-07 13:06:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeDpc [2019-09-07 13:06:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure KeInsertQueueDpc [2019-09-07 13:06:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-07 13:06:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure KeSynchronizeExecution [2019-09-07 13:06:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2019-09-07 13:06:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-07 13:06:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2019-09-07 13:06:14,762 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2019-09-07 13:06:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2019-09-07 13:06:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-07 13:06:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2019-09-07 13:06:14,763 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2019-09-07 13:06:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTimeIncrement [2019-09-07 13:06:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2019-09-07 13:06:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2019-09-07 13:06:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2019-09-07 13:06:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2019-09-07 13:06:14,769 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2019-09-07 13:06:14,771 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2019-09-07 13:06:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2019-09-07 13:06:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2019-09-07 13:06:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2019-09-07 13:06:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2019-09-07 13:06:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2019-09-07 13:06:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2019-09-07 13:06:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2019-09-07 13:06:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-09-07 13:06:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2019-09-07 13:06:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireCancelSpinLock [2019-09-07 13:06:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateErrorLogEntry [2019-09-07 13:06:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-07 13:06:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2019-09-07 13:06:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2019-09-07 13:06:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2019-09-07 13:06:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-07 13:06:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-07 13:06:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-07 13:06:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure IoConnectInterrupt [2019-09-07 13:06:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2019-09-07 13:06:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2019-09-07 13:06:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2019-09-07 13:06:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2019-09-07 13:06:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-09-07 13:06:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2019-09-07 13:06:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2019-09-07 13:06:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2019-09-07 13:06:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2019-09-07 13:06:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-09-07 13:06:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2019-09-07 13:06:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure IoReportResourceUsage [2019-09-07 13:06:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2019-09-07 13:06:14,776 INFO L130 BoogieDeclarations]: Found specification of procedure IoInitializeRemoveLockEx [2019-09-07 13:06:14,776 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireRemoveLockEx [2019-09-07 13:06:14,776 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockEx [2019-09-07 13:06:14,776 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockAndWaitEx [2019-09-07 13:06:14,776 INFO L130 BoogieDeclarations]: Found specification of procedure IoWriteErrorLogEntry [2019-09-07 13:06:14,776 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2019-09-07 13:06:14,776 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2019-09-07 13:06:14,776 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-09-07 13:06:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-09-07 13:06:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure KeStallExecutionProcessor [2019-09-07 13:06:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure PoRequestPowerIrp [2019-09-07 13:06:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure PoSetPowerState [2019-09-07 13:06:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 13:06:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 13:06:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-07 13:06:14,777 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2019-09-07 13:06:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-09-07 13:06:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure ObfReferenceObject [2019-09-07 13:06:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2019-09-07 13:06:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-07 13:06:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure ZwQueryValueKey [2019-09-07 13:06:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure ZwSetValueKey [2019-09-07 13:06:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure WmiCompleteRequest [2019-09-07 13:06:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure WmiSystemControl [2019-09-07 13:06:14,778 INFO L130 BoogieDeclarations]: Found specification of procedure PptCompleteRequest [2019-09-07 13:06:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-07 13:06:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiInitWmi [2019-09-07 13:06:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchSystemControl [2019-09-07 13:06:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpInitDispatchFunctionTable [2019-09-07 13:06:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpAddDevice [2019-09-07 13:06:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPnp [2019-09-07 13:06:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure PptFailRequest [2019-09-07 13:06:14,779 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPreProcessIrp [2019-09-07 13:06:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPostProcessIrp [2019-09-07 13:06:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2019-09-07 13:06:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure PptUnload [2019-09-07 13:06:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchCompletionRoutine [2019-09-07 13:06:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure PptLogError [2019-09-07 13:06:14,780 INFO L130 BoogieDeclarations]: Found specification of procedure PptConnectInterrupt [2019-09-07 13:06:14,781 INFO L130 BoogieDeclarations]: Found specification of procedure PptDisconnectInterrupt [2019-09-07 13:06:14,781 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCreate [2019-09-07 13:06:14,781 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchClose [2019-09-07 13:06:14,781 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedIncrement [2019-09-07 13:06:14,781 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDecrement [2019-09-07 13:06:14,781 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedRead [2019-09-07 13:06:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedQueue [2019-09-07 13:06:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDisconnect [2019-09-07 13:06:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure PptCancelRoutine [2019-09-07 13:06:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePortDpc [2019-09-07 13:06:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure PptTryAllocatePortAtInterruptLevel [2019-09-07 13:06:14,782 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePortFromInterruptLevel [2019-09-07 13:06:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure PptInterruptService [2019-09-07 13:06:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure PptTryAllocatePort [2019-09-07 13:06:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure PptTraversePortCheckList [2019-09-07 13:06:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePort [2019-09-07 13:06:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure PptQueryNumWaiters [2019-09-07 13:06:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchInternalDeviceControl [2019-09-07 13:06:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCleanup [2019-09-07 13:06:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsNecR98Machine [2019-09-07 13:06:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPower [2019-09-07 13:06:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegInitDriverSettings [2019-09-07 13:06:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure PptGetPortNameFromPhysicalDeviceObject [2019-09-07 13:06:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetCancelRoutine [2019-09-07 13:06:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLockOrFailIrp [2019-09-07 13:06:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpPnpIrpInfo [2019-09-07 13:06:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLock [2019-09-07 13:06:14,784 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLock [2019-09-07 13:06:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLockAndWait [2019-09-07 13:06:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceList [2019-09-07 13:06:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceRequirementsList [2019-09-07 13:06:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectChipFilter [2019-09-07 13:06:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortType [2019-09-07 13:06:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetChipMode [2019-09-07 13:06:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearChipMode [2019-09-07 13:06:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitiate1284_3 [2019-09-07 13:06:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectDevice [2019-09-07 13:06:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectDevice [2019-09-07 13:06:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure Ppt1284_3AssignAddress [2019-09-07 13:06:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure PptSend1284_3Command [2019-09-07 13:06:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectLegacyZip [2019-09-07 13:06:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectLegacyZip [2019-09-07 13:06:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpRemovalRelationsList [2019-09-07 13:06:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegGetDeviceParameterDword [2019-09-07 13:06:14,786 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegSetDeviceParameterDword [2019-09-07 13:06:14,787 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildParallelPortDeviceName [2019-09-07 13:06:14,787 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitializeDeviceExtension [2019-09-07 13:06:14,787 INFO L130 BoogieDeclarations]: Found specification of procedure PptGetPortNumberFromLptName [2019-09-07 13:06:14,787 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildDeviceObject [2019-09-07 13:06:14,787 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPort [2019-09-07 13:06:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure PptCleanRemovalRelationsList [2019-09-07 13:06:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure CheckPort [2019-09-07 13:06:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-07 13:06:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-09-07 13:06:14,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-07 13:06:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-07 13:06:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure PptAddPptRemovalRelation [2019-09-07 13:06:14,789 INFO L130 BoogieDeclarations]: Found specification of procedure PptRemovePptRemovalRelation [2019-09-07 13:06:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpPptRemovalRelationsStruct [2019-09-07 13:06:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStl1284_3 [2019-09-07 13:06:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfNon1284_3Present [2019-09-07 13:06:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStlProductId [2019-09-07 13:06:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortCapabilities [2019-09-07 13:06:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEcpPort [2019-09-07 13:06:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfDot3DevicePresent [2019-09-07 13:06:14,790 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfUserRequested [2019-09-07 13:06:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectBytePort [2019-09-07 13:06:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoDepth [2019-09-07 13:06:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoWidth [2019-09-07 13:06:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrSetMode [2019-09-07 13:06:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrClearMode [2019-09-07 13:06:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure PptFindNatChip [2019-09-07 13:06:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildResourceList [2019-09-07 13:06:14,791 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetByteMode [2019-09-07 13:06:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearByteMode [2019-09-07 13:06:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckByteMode [2019-09-07 13:06:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2019-09-07 13:06:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterResourceRequirements [2019-09-07 13:06:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryDeviceRelations [2019-09-07 13:06:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryStopDevice [2019-09-07 13:06:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelStopDevice [2019-09-07 13:06:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStopDevice [2019-09-07 13:06:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryRemoveDevice [2019-09-07 13:06:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelRemoveDevice [2019-09-07 13:06:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpRemoveDevice [2019-09-07 13:06:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpSurpriseRemoval [2019-09-07 13:06:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpUnhandledIrp [2019-09-07 13:06:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartDevice [2019-09-07 13:06:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartValidateResources [2019-09-07 13:06:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanCmResourceList [2019-09-07 13:06:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2019-09-07 13:06:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptors [2019-09-07 13:06:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2019-09-07 13:06:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterExistsNonIrqResourceList [2019-09-07 13:06:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterGetEndOfResourceRequirementsList [2019-09-07 13:06:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpListContainsIrqResourceDescriptor [2019-09-07 13:06:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterRemoveIrqResourceLists [2019-09-07 13:06:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBounceAndCatchPnpIrp [2019-09-07 13:06:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBuildRemovalRelations [2019-09-07 13:06:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanPciCardCmResourceList [2019-09-07 13:06:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsPci [2019-09-07 13:06:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure PptPowerComplete [2019-09-07 13:06:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure InitNEC_98 [2019-09-07 13:06:14,796 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockDiskModeByte [2019-09-07 13:06:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockPrtModeByte [2019-09-07 13:06:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipSetDiskMode [2019-09-07 13:06:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipCheckDevice [2019-09-07 13:06:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~TO~VOID [2019-09-07 13:06:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTickCount [2019-09-07 13:06:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiQueryWmiRegInfo [2019-09-07 13:06:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiQueryWmiDataBlock [2019-09-07 13:06:14,797 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-07 13:06:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-07 13:06:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:06:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-07 13:06:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2019-09-07 13:06:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:06:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-07 13:06:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-07 13:06:14,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:06:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-07 13:06:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-07 13:06:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-07 13:06:14,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-07 13:06:16,378 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:16,435 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:16,436 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:16,690 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:27,661 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !false; [2019-09-07 13:06:27,662 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume false; [2019-09-07 13:06:27,712 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:33,406 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-07 13:06:33,406 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-07 13:06:33,406 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:33,425 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:33,425 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:33,578 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:33,626 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-07 13:06:33,626 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-07 13:06:33,626 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:33,643 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:33,643 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:33,953 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:33,978 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:33,978 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:34,103 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:34,157 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-07 13:06:34,157 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-07 13:06:34,361 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:35,623 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2019-09-07 13:06:35,623 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2019-09-07 13:06:35,624 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:35,653 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-07 13:06:35,653 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-07 13:06:35,679 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:35,693 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:35,694 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:35,954 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:42,946 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2019-09-07 13:06:42,946 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2019-09-07 13:06:45,108 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:45,116 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:45,116 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:45,218 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:45,219 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:51,099 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-09-07 13:06:51,100 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2019-09-07 13:06:51,100 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-09-07 13:06:51,100 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2019-09-07 13:06:51,429 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:51,438 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:51,438 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:56,323 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:56,334 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:56,334 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:56,864 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:56,874 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:56,875 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:56,875 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:56,891 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:56,891 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:56,926 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:56,936 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:56,937 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:56,937 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:56,946 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:56,947 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:56,947 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:56,959 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:56,959 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:57,131 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:57,140 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:57,140 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:57,154 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:57,162 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:57,162 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:57,290 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:57,300 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:57,300 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:57,322 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:57,331 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:57,331 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:57,975 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:06:57,984 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:06:57,984 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:06:57,999 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:02,891 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-07 13:07:02,891 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-07 13:07:02,899 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:03,007 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2019-09-07 13:07:03,008 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2019-09-07 13:07:03,372 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:03,380 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:07:03,381 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:07:03,520 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:03,601 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-09-07 13:07:03,601 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-09-07 13:07:03,697 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:14,057 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2019-09-07 13:07:14,058 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2019-09-07 13:07:14,123 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:18,933 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-07 13:07:18,933 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-07 13:07:18,933 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:18,970 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-07 13:07:18,970 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-07 13:07:21,120 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:21,137 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-07 13:07:21,137 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-07 13:07:21,793 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:21,801 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:07:21,801 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:07:22,053 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:07:26,980 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-07 13:07:26,980 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-07 13:07:27,051 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:07:27,051 INFO L283 CfgBuilder]: Removed 37 assume(true) statements. [2019-09-07 13:07:27,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:07:27 BoogieIcfgContainer [2019-09-07 13:07:27,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:07:27,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:07:27,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:07:27,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:07:27,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:06:11" (1/3) ... [2019-09-07 13:07:27,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5790095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:07:27, skipping insertion in model container [2019-09-07 13:07:27,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:06:13" (2/3) ... [2019-09-07 13:07:27,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5790095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:07:27, skipping insertion in model container [2019-09-07 13:07:27,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:07:27" (3/3) ... [2019-09-07 13:07:27,062 INFO L109 eAbstractionObserver]: Analyzing ICFG parport.i.cil-2.c [2019-09-07 13:07:27,071 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:07:27,086 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:07:27,104 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:07:27,146 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:07:27,147 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:07:27,147 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:07:27,147 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:07:27,147 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:07:27,148 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:07:27,148 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:07:27,148 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:07:27,148 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:07:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states. [2019-09-07 13:07:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 13:07:27,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:27,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:27,210 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:27,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:27,215 INFO L82 PathProgramCache]: Analyzing trace with hash 300354810, now seen corresponding path program 1 times [2019-09-07 13:07:27,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:27,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:27,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:27,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:27,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:27,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:27,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:07:27,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:07:27,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:07:27,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:27,852 INFO L87 Difference]: Start difference. First operand 2173 states. Second operand 3 states. [2019-09-07 13:07:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:28,412 INFO L93 Difference]: Finished difference Result 3713 states and 5641 transitions. [2019-09-07 13:07:28,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:07:28,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 13:07:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:28,461 INFO L225 Difference]: With dead ends: 3713 [2019-09-07 13:07:28,461 INFO L226 Difference]: Without dead ends: 1907 [2019-09-07 13:07:28,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2019-09-07 13:07:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1907. [2019-09-07 13:07:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2019-09-07 13:07:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2740 transitions. [2019-09-07 13:07:28,689 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2740 transitions. Word has length 20 [2019-09-07 13:07:28,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:28,689 INFO L475 AbstractCegarLoop]: Abstraction has 1907 states and 2740 transitions. [2019-09-07 13:07:28,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:07:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2740 transitions. [2019-09-07 13:07:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 13:07:28,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:28,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:28,693 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash -227578647, now seen corresponding path program 1 times [2019-09-07 13:07:28,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:28,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:28,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:28,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:28,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:28,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:28,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:07:28,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:07:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:07:28,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:28,924 INFO L87 Difference]: Start difference. First operand 1907 states and 2740 transitions. Second operand 3 states. [2019-09-07 13:07:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:29,493 INFO L93 Difference]: Finished difference Result 4830 states and 7033 transitions. [2019-09-07 13:07:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:07:29,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 13:07:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:29,530 INFO L225 Difference]: With dead ends: 4830 [2019-09-07 13:07:29,530 INFO L226 Difference]: Without dead ends: 3581 [2019-09-07 13:07:29,540 INFO L628 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-09-07 13:07:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2019-09-07 13:07:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3560. [2019-09-07 13:07:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3560 states. [2019-09-07 13:07:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 5176 transitions. [2019-09-07 13:07:29,846 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 5176 transitions. Word has length 30 [2019-09-07 13:07:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:29,847 INFO L475 AbstractCegarLoop]: Abstraction has 3560 states and 5176 transitions. [2019-09-07 13:07:29,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:07:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 5176 transitions. [2019-09-07 13:07:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 13:07:29,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:29,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:29,861 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:29,861 INFO L82 PathProgramCache]: Analyzing trace with hash 833048032, now seen corresponding path program 1 times [2019-09-07 13:07:29,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:29,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:29,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:30,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:30,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:07:30,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:07:30,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:07:30,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:30,114 INFO L87 Difference]: Start difference. First operand 3560 states and 5176 transitions. Second operand 5 states. [2019-09-07 13:07:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:37,071 INFO L93 Difference]: Finished difference Result 4334 states and 6293 transitions. [2019-09-07 13:07:37,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:07:37,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-07 13:07:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:37,099 INFO L225 Difference]: With dead ends: 4334 [2019-09-07 13:07:37,100 INFO L226 Difference]: Without dead ends: 4323 [2019-09-07 13:07:37,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:07:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2019-09-07 13:07:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 4292. [2019-09-07 13:07:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-09-07 13:07:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 6241 transitions. [2019-09-07 13:07:37,310 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 6241 transitions. Word has length 45 [2019-09-07 13:07:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:37,311 INFO L475 AbstractCegarLoop]: Abstraction has 4292 states and 6241 transitions. [2019-09-07 13:07:37,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:07:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 6241 transitions. [2019-09-07 13:07:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 13:07:37,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:37,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:37,314 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:37,314 INFO L82 PathProgramCache]: Analyzing trace with hash -383328916, now seen corresponding path program 1 times [2019-09-07 13:07:37,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:37,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:37,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:37,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:37,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:37,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:37,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:07:37,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:07:37,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:07:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:37,517 INFO L87 Difference]: Start difference. First operand 4292 states and 6241 transitions. Second operand 5 states. [2019-09-07 13:07:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:43,429 INFO L93 Difference]: Finished difference Result 4325 states and 6278 transitions. [2019-09-07 13:07:43,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:07:43,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-09-07 13:07:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:43,458 INFO L225 Difference]: With dead ends: 4325 [2019-09-07 13:07:43,458 INFO L226 Difference]: Without dead ends: 4317 [2019-09-07 13:07:43,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:07:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2019-09-07 13:07:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 4292. [2019-09-07 13:07:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-09-07 13:07:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 6240 transitions. [2019-09-07 13:07:43,666 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 6240 transitions. Word has length 46 [2019-09-07 13:07:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:43,667 INFO L475 AbstractCegarLoop]: Abstraction has 4292 states and 6240 transitions. [2019-09-07 13:07:43,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:07:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 6240 transitions. [2019-09-07 13:07:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 13:07:43,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:43,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:43,670 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:43,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:43,670 INFO L82 PathProgramCache]: Analyzing trace with hash 238606324, now seen corresponding path program 1 times [2019-09-07 13:07:43,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:43,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:43,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:43,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:43,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:43,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:43,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:07:43,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:07:43,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:07:43,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:43,822 INFO L87 Difference]: Start difference. First operand 4292 states and 6240 transitions. Second operand 3 states. [2019-09-07 13:07:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:44,023 INFO L93 Difference]: Finished difference Result 7100 states and 10289 transitions. [2019-09-07 13:07:44,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:07:44,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-07 13:07:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:44,073 INFO L225 Difference]: With dead ends: 7100 [2019-09-07 13:07:44,073 INFO L226 Difference]: Without dead ends: 6722 [2019-09-07 13:07:44,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:44,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6722 states. [2019-09-07 13:07:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6722 to 6660. [2019-09-07 13:07:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-09-07 13:07:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9703 transitions. [2019-09-07 13:07:44,605 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9703 transitions. Word has length 47 [2019-09-07 13:07:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:44,606 INFO L475 AbstractCegarLoop]: Abstraction has 6660 states and 9703 transitions. [2019-09-07 13:07:44,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:07:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9703 transitions. [2019-09-07 13:07:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 13:07:44,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:44,608 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:44,609 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash 732695703, now seen corresponding path program 1 times [2019-09-07 13:07:44,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:44,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:44,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:44,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:44,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:44,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:44,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:07:44,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:07:44,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:07:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:44,738 INFO L87 Difference]: Start difference. First operand 6660 states and 9703 transitions. Second operand 3 states. [2019-09-07 13:07:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:44,946 INFO L93 Difference]: Finished difference Result 6785 states and 9852 transitions. [2019-09-07 13:07:44,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:07:44,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-07 13:07:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:44,993 INFO L225 Difference]: With dead ends: 6785 [2019-09-07 13:07:44,993 INFO L226 Difference]: Without dead ends: 6756 [2019-09-07 13:07:44,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2019-09-07 13:07:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 6689. [2019-09-07 13:07:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2019-09-07 13:07:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 9734 transitions. [2019-09-07 13:07:45,398 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 9734 transitions. Word has length 47 [2019-09-07 13:07:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:45,398 INFO L475 AbstractCegarLoop]: Abstraction has 6689 states and 9734 transitions. [2019-09-07 13:07:45,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:07:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 9734 transitions. [2019-09-07 13:07:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 13:07:45,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:45,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:45,405 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:45,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:45,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1153041076, now seen corresponding path program 1 times [2019-09-07 13:07:45,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:45,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:45,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:45,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:45,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:07:45,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:07:45,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:07:45,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:45,649 INFO L87 Difference]: Start difference. First operand 6689 states and 9734 transitions. Second operand 5 states. [2019-09-07 13:07:45,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:45,911 INFO L93 Difference]: Finished difference Result 12741 states and 18530 transitions. [2019-09-07 13:07:45,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:07:45,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-07 13:07:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:45,945 INFO L225 Difference]: With dead ends: 12741 [2019-09-07 13:07:45,945 INFO L226 Difference]: Without dead ends: 6696 [2019-09-07 13:07:45,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:45,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states. [2019-09-07 13:07:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6696 to 6693. [2019-09-07 13:07:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6693 states. [2019-09-07 13:07:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6693 states to 6693 states and 9739 transitions. [2019-09-07 13:07:46,286 INFO L78 Accepts]: Start accepts. Automaton has 6693 states and 9739 transitions. Word has length 64 [2019-09-07 13:07:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:46,287 INFO L475 AbstractCegarLoop]: Abstraction has 6693 states and 9739 transitions. [2019-09-07 13:07:46,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:07:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6693 states and 9739 transitions. [2019-09-07 13:07:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 13:07:46,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:46,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:46,289 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:46,289 INFO L82 PathProgramCache]: Analyzing trace with hash 958249293, now seen corresponding path program 1 times [2019-09-07 13:07:46,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:46,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:46,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:46,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:46,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:46,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:46,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:07:46,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:07:46,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:07:46,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:07:46,531 INFO L87 Difference]: Start difference. First operand 6693 states and 9739 transitions. Second operand 6 states. [2019-09-07 13:07:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:48,244 INFO L93 Difference]: Finished difference Result 11693 states and 16941 transitions. [2019-09-07 13:07:48,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:07:48,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-07 13:07:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:48,283 INFO L225 Difference]: With dead ends: 11693 [2019-09-07 13:07:48,283 INFO L226 Difference]: Without dead ends: 6538 [2019-09-07 13:07:48,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:07:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-09-07 13:07:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6532. [2019-09-07 13:07:48,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-09-07 13:07:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 9465 transitions. [2019-09-07 13:07:48,615 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 9465 transitions. Word has length 64 [2019-09-07 13:07:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:48,615 INFO L475 AbstractCegarLoop]: Abstraction has 6532 states and 9465 transitions. [2019-09-07 13:07:48,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:07:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 9465 transitions. [2019-09-07 13:07:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 13:07:48,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:48,617 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:48,618 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:48,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1147187110, now seen corresponding path program 1 times [2019-09-07 13:07:48,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:48,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:48,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:48,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:48,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:48,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:07:48,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:07:48,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:07:48,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:48,731 INFO L87 Difference]: Start difference. First operand 6532 states and 9465 transitions. Second operand 3 states. [2019-09-07 13:07:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:49,029 INFO L93 Difference]: Finished difference Result 6535 states and 9467 transitions. [2019-09-07 13:07:49,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:07:49,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-07 13:07:49,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:49,055 INFO L225 Difference]: With dead ends: 6535 [2019-09-07 13:07:49,055 INFO L226 Difference]: Without dead ends: 6532 [2019-09-07 13:07:49,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:07:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2019-09-07 13:07:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 6532. [2019-09-07 13:07:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-09-07 13:07:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 9464 transitions. [2019-09-07 13:07:49,363 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 9464 transitions. Word has length 47 [2019-09-07 13:07:49,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:49,363 INFO L475 AbstractCegarLoop]: Abstraction has 6532 states and 9464 transitions. [2019-09-07 13:07:49,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:07:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 9464 transitions. [2019-09-07 13:07:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 13:07:49,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:49,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:49,366 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:49,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1245298868, now seen corresponding path program 1 times [2019-09-07 13:07:49,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:49,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:49,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:49,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:49,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:49,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:49,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:07:49,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:07:49,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:07:49,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:49,508 INFO L87 Difference]: Start difference. First operand 6532 states and 9464 transitions. Second operand 5 states. [2019-09-07 13:07:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:49,843 INFO L93 Difference]: Finished difference Result 6547 states and 9480 transitions. [2019-09-07 13:07:49,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:07:49,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-07 13:07:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:49,866 INFO L225 Difference]: With dead ends: 6547 [2019-09-07 13:07:49,866 INFO L226 Difference]: Without dead ends: 6506 [2019-09-07 13:07:49,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6506 states. [2019-09-07 13:07:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6506 to 6506. [2019-09-07 13:07:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-09-07 13:07:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 9427 transitions. [2019-09-07 13:07:50,249 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 9427 transitions. Word has length 48 [2019-09-07 13:07:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:50,250 INFO L475 AbstractCegarLoop]: Abstraction has 6506 states and 9427 transitions. [2019-09-07 13:07:50,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:07:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 9427 transitions. [2019-09-07 13:07:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 13:07:50,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:50,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:50,253 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:50,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1265177314, now seen corresponding path program 1 times [2019-09-07 13:07:50,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:50,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:50,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:50,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:50,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:50,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:07:50,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:07:50,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:07:50,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:07:50,420 INFO L87 Difference]: Start difference. First operand 6506 states and 9427 transitions. Second operand 8 states. [2019-09-07 13:07:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:50,693 INFO L93 Difference]: Finished difference Result 6563 states and 9498 transitions. [2019-09-07 13:07:50,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:07:50,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-09-07 13:07:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:50,720 INFO L225 Difference]: With dead ends: 6563 [2019-09-07 13:07:50,720 INFO L226 Difference]: Without dead ends: 6519 [2019-09-07 13:07:50,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:07:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6519 states. [2019-09-07 13:07:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6519 to 6511. [2019-09-07 13:07:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6511 states. [2019-09-07 13:07:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6511 states to 6511 states and 9434 transitions. [2019-09-07 13:07:51,041 INFO L78 Accepts]: Start accepts. Automaton has 6511 states and 9434 transitions. Word has length 48 [2019-09-07 13:07:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:51,042 INFO L475 AbstractCegarLoop]: Abstraction has 6511 states and 9434 transitions. [2019-09-07 13:07:51,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:07:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 6511 states and 9434 transitions. [2019-09-07 13:07:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 13:07:51,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:51,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:51,044 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:51,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:51,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1785025501, now seen corresponding path program 1 times [2019-09-07 13:07:51,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:51,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:51,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:51,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:51,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:51,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:51,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:07:51,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:07:51,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:07:51,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:51,155 INFO L87 Difference]: Start difference. First operand 6511 states and 9434 transitions. Second operand 5 states. [2019-09-07 13:07:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:51,414 INFO L93 Difference]: Finished difference Result 11926 states and 17274 transitions. [2019-09-07 13:07:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:07:51,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-07 13:07:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:51,451 INFO L225 Difference]: With dead ends: 11926 [2019-09-07 13:07:51,452 INFO L226 Difference]: Without dead ends: 6503 [2019-09-07 13:07:51,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6503 states. [2019-09-07 13:07:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6503 to 6503. [2019-09-07 13:07:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2019-09-07 13:07:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 9422 transitions. [2019-09-07 13:07:51,835 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 9422 transitions. Word has length 48 [2019-09-07 13:07:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:51,835 INFO L475 AbstractCegarLoop]: Abstraction has 6503 states and 9422 transitions. [2019-09-07 13:07:51,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:07:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 9422 transitions. [2019-09-07 13:07:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 13:07:51,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:51,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:51,838 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:51,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:51,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1055190255, now seen corresponding path program 1 times [2019-09-07 13:07:51,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:51,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:51,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:51,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:51,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:07:51,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:07:51,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:07:51,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:51,994 INFO L87 Difference]: Start difference. First operand 6503 states and 9422 transitions. Second operand 5 states. [2019-09-07 13:07:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:52,170 INFO L93 Difference]: Finished difference Result 6518 states and 9438 transitions. [2019-09-07 13:07:52,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:07:52,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-07 13:07:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:52,203 INFO L225 Difference]: With dead ends: 6518 [2019-09-07 13:07:52,203 INFO L226 Difference]: Without dead ends: 6501 [2019-09-07 13:07:52,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:07:52,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6501 states. [2019-09-07 13:07:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6501 to 6501. [2019-09-07 13:07:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6501 states. [2019-09-07 13:07:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 9418 transitions. [2019-09-07 13:07:52,502 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 9418 transitions. Word has length 52 [2019-09-07 13:07:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:52,502 INFO L475 AbstractCegarLoop]: Abstraction has 6501 states and 9418 transitions. [2019-09-07 13:07:52,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:07:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 9418 transitions. [2019-09-07 13:07:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 13:07:52,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:52,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:52,505 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:52,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:52,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1500953186, now seen corresponding path program 1 times [2019-09-07 13:07:52,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:52,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:52,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:52,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:52,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:52,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:52,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:07:52,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:07:52,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:07:52,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:07:52,729 INFO L87 Difference]: Start difference. First operand 6501 states and 9418 transitions. Second operand 8 states. [2019-09-07 13:07:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:07:53,159 INFO L93 Difference]: Finished difference Result 6519 states and 9437 transitions. [2019-09-07 13:07:53,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:07:53,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-09-07 13:07:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:07:53,193 INFO L225 Difference]: With dead ends: 6519 [2019-09-07 13:07:53,193 INFO L226 Difference]: Without dead ends: 6499 [2019-09-07 13:07:53,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:07:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2019-09-07 13:07:53,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6499. [2019-09-07 13:07:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6499 states. [2019-09-07 13:07:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 9413 transitions. [2019-09-07 13:07:53,534 INFO L78 Accepts]: Start accepts. Automaton has 6499 states and 9413 transitions. Word has length 52 [2019-09-07 13:07:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:07:53,534 INFO L475 AbstractCegarLoop]: Abstraction has 6499 states and 9413 transitions. [2019-09-07 13:07:53,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:07:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 6499 states and 9413 transitions. [2019-09-07 13:07:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 13:07:53,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:07:53,543 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:07:53,543 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:07:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:07:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1349184777, now seen corresponding path program 1 times [2019-09-07 13:07:53,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:07:53,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:07:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:53,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:07:53,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:07:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:07:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:07:53,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:07:53,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:07:53,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:07:53,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:07:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:07:53,725 INFO L87 Difference]: Start difference. First operand 6499 states and 9413 transitions. Second operand 8 states. [2019-09-07 13:08:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:03,897 INFO L93 Difference]: Finished difference Result 6544 states and 9466 transitions. [2019-09-07 13:08:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:08:03,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-09-07 13:08:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:03,923 INFO L225 Difference]: With dead ends: 6544 [2019-09-07 13:08:03,923 INFO L226 Difference]: Without dead ends: 6499 [2019-09-07 13:08:03,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:08:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2019-09-07 13:08:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6499. [2019-09-07 13:08:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6499 states. [2019-09-07 13:08:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 9412 transitions. [2019-09-07 13:08:04,225 INFO L78 Accepts]: Start accepts. Automaton has 6499 states and 9412 transitions. Word has length 55 [2019-09-07 13:08:04,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:04,226 INFO L475 AbstractCegarLoop]: Abstraction has 6499 states and 9412 transitions. [2019-09-07 13:08:04,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:08:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 6499 states and 9412 transitions. [2019-09-07 13:08:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 13:08:04,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:04,229 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:08:04,229 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:04,229 INFO L82 PathProgramCache]: Analyzing trace with hash -139491608, now seen corresponding path program 1 times [2019-09-07 13:08:04,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:04,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:04,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:04,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:04,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:08:04,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:08:04,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:08:04,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:08:04,411 INFO L87 Difference]: Start difference. First operand 6499 states and 9412 transitions. Second operand 8 states. [2019-09-07 13:08:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:04,651 INFO L93 Difference]: Finished difference Result 6537 states and 9460 transitions. [2019-09-07 13:08:04,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:08:04,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-07 13:08:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:04,676 INFO L225 Difference]: With dead ends: 6537 [2019-09-07 13:08:04,676 INFO L226 Difference]: Without dead ends: 6516 [2019-09-07 13:08:04,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:08:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6516 states. [2019-09-07 13:08:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6516 to 6504. [2019-09-07 13:08:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6504 states. [2019-09-07 13:08:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 9417 transitions. [2019-09-07 13:08:04,985 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 9417 transitions. Word has length 51 [2019-09-07 13:08:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:04,985 INFO L475 AbstractCegarLoop]: Abstraction has 6504 states and 9417 transitions. [2019-09-07 13:08:04,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:08:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 9417 transitions. [2019-09-07 13:08:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 13:08:04,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:04,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:08:04,990 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:04,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:04,991 INFO L82 PathProgramCache]: Analyzing trace with hash 971259367, now seen corresponding path program 1 times [2019-09-07 13:08:04,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:04,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:04,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:04,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:04,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:05,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:05,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:08:05,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:08:05,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:08:05,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:08:05,151 INFO L87 Difference]: Start difference. First operand 6504 states and 9417 transitions. Second operand 8 states. [2019-09-07 13:08:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:05,363 INFO L93 Difference]: Finished difference Result 6531 states and 9451 transitions. [2019-09-07 13:08:05,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:08:05,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-07 13:08:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:05,380 INFO L225 Difference]: With dead ends: 6531 [2019-09-07 13:08:05,380 INFO L226 Difference]: Without dead ends: 6510 [2019-09-07 13:08:05,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:08:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-09-07 13:08:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6493. [2019-09-07 13:08:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6493 states. [2019-09-07 13:08:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6493 states to 6493 states and 9403 transitions. [2019-09-07 13:08:05,646 INFO L78 Accepts]: Start accepts. Automaton has 6493 states and 9403 transitions. Word has length 51 [2019-09-07 13:08:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:05,646 INFO L475 AbstractCegarLoop]: Abstraction has 6493 states and 9403 transitions. [2019-09-07 13:08:05,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:08:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 6493 states and 9403 transitions. [2019-09-07 13:08:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 13:08:05,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:05,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:08:05,649 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:05,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2145606927, now seen corresponding path program 1 times [2019-09-07 13:08:05,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:05,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:05,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:05,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:05,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:05,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:05,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:08:05,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:08:05,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:08:05,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:08:05,801 INFO L87 Difference]: Start difference. First operand 6493 states and 9403 transitions. Second operand 8 states. [2019-09-07 13:08:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:08,867 INFO L93 Difference]: Finished difference Result 6644 states and 9598 transitions. [2019-09-07 13:08:08,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:08:08,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-09-07 13:08:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:08,887 INFO L225 Difference]: With dead ends: 6644 [2019-09-07 13:08:08,887 INFO L226 Difference]: Without dead ends: 6532 [2019-09-07 13:08:08,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:08:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2019-09-07 13:08:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 6501. [2019-09-07 13:08:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6501 states. [2019-09-07 13:08:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 9414 transitions. [2019-09-07 13:08:09,166 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 9414 transitions. Word has length 56 [2019-09-07 13:08:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:09,167 INFO L475 AbstractCegarLoop]: Abstraction has 6501 states and 9414 transitions. [2019-09-07 13:08:09,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:08:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 9414 transitions. [2019-09-07 13:08:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 13:08:09,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:09,170 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:08:09,170 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:09,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1614623444, now seen corresponding path program 1 times [2019-09-07 13:08:09,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:09,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:09,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:09,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:09,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:09,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:09,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:08:09,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:08:09,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:08:09,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:08:09,281 INFO L87 Difference]: Start difference. First operand 6501 states and 9414 transitions. Second operand 5 states. [2019-09-07 13:08:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:09,414 INFO L93 Difference]: Finished difference Result 6516 states and 9430 transitions. [2019-09-07 13:08:09,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:08:09,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-07 13:08:09,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:09,430 INFO L225 Difference]: With dead ends: 6516 [2019-09-07 13:08:09,430 INFO L226 Difference]: Without dead ends: 6491 [2019-09-07 13:08:09,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:08:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6491 states. [2019-09-07 13:08:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6491 to 6491. [2019-09-07 13:08:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6491 states. [2019-09-07 13:08:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6491 states to 6491 states and 9401 transitions. [2019-09-07 13:08:09,715 INFO L78 Accepts]: Start accepts. Automaton has 6491 states and 9401 transitions. Word has length 55 [2019-09-07 13:08:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:09,715 INFO L475 AbstractCegarLoop]: Abstraction has 6491 states and 9401 transitions. [2019-09-07 13:08:09,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:08:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 6491 states and 9401 transitions. [2019-09-07 13:08:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 13:08:09,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:09,719 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:08:09,719 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash 801916040, now seen corresponding path program 1 times [2019-09-07 13:08:09,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:09,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:09,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:09,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:09,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:10,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:10,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:08:10,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:08:10,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:08:10,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:08:10,009 INFO L87 Difference]: Start difference. First operand 6491 states and 9401 transitions. Second operand 7 states. [2019-09-07 13:08:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:14,172 INFO L93 Difference]: Finished difference Result 6545 states and 9460 transitions. [2019-09-07 13:08:14,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:08:14,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-09-07 13:08:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:14,187 INFO L225 Difference]: With dead ends: 6545 [2019-09-07 13:08:14,187 INFO L226 Difference]: Without dead ends: 6496 [2019-09-07 13:08:14,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:08:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-09-07 13:08:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-09-07 13:08:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-09-07 13:08:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 9406 transitions. [2019-09-07 13:08:14,392 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 9406 transitions. Word has length 61 [2019-09-07 13:08:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:14,393 INFO L475 AbstractCegarLoop]: Abstraction has 6496 states and 9406 transitions. [2019-09-07 13:08:14,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:08:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 9406 transitions. [2019-09-07 13:08:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 13:08:14,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:14,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:08:14,396 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:14,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:14,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1827408039, now seen corresponding path program 1 times [2019-09-07 13:08:14,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:14,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:14,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:14,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:14,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:14,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:14,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:08:14,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:08:14,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:08:14,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:08:14,555 INFO L87 Difference]: Start difference. First operand 6496 states and 9406 transitions. Second operand 6 states. [2019-09-07 13:08:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:17,658 INFO L93 Difference]: Finished difference Result 6514 states and 9425 transitions. [2019-09-07 13:08:17,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:08:17,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-09-07 13:08:17,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:17,672 INFO L225 Difference]: With dead ends: 6514 [2019-09-07 13:08:17,673 INFO L226 Difference]: Without dead ends: 6494 [2019-09-07 13:08:17,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:08:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6494 states. [2019-09-07 13:08:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6494 to 6489. [2019-09-07 13:08:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6489 states. [2019-09-07 13:08:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6489 states to 6489 states and 9397 transitions. [2019-09-07 13:08:17,887 INFO L78 Accepts]: Start accepts. Automaton has 6489 states and 9397 transitions. Word has length 61 [2019-09-07 13:08:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:17,887 INFO L475 AbstractCegarLoop]: Abstraction has 6489 states and 9397 transitions. [2019-09-07 13:08:17,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:08:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6489 states and 9397 transitions. [2019-09-07 13:08:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 13:08:17,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:17,890 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:08:17,890 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:17,890 INFO L82 PathProgramCache]: Analyzing trace with hash -372962380, now seen corresponding path program 1 times [2019-09-07 13:08:17,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:17,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:17,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:17,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:17,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:18,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:18,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:08:18,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:08:18,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:08:18,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:08:18,052 INFO L87 Difference]: Start difference. First operand 6489 states and 9397 transitions. Second operand 8 states. [2019-09-07 13:08:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:08:18,338 INFO L93 Difference]: Finished difference Result 6507 states and 9416 transitions. [2019-09-07 13:08:18,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:08:18,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-09-07 13:08:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:08:18,365 INFO L225 Difference]: With dead ends: 6507 [2019-09-07 13:08:18,365 INFO L226 Difference]: Without dead ends: 6482 [2019-09-07 13:08:18,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:08:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2019-09-07 13:08:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 6482. [2019-09-07 13:08:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6482 states. [2019-09-07 13:08:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 9382 transitions. [2019-09-07 13:08:18,590 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 9382 transitions. Word has length 60 [2019-09-07 13:08:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:08:18,590 INFO L475 AbstractCegarLoop]: Abstraction has 6482 states and 9382 transitions. [2019-09-07 13:08:18,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:08:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 9382 transitions. [2019-09-07 13:08:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 13:08:18,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:08:18,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:08:18,594 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:08:18,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:08:18,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1233382885, now seen corresponding path program 1 times [2019-09-07 13:08:18,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:08:18,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:08:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:18,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:08:18,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:08:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:08:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:08:18,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:08:18,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:08:18,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:08:18,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:08:18,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:08:18,771 INFO L87 Difference]: Start difference. First operand 6482 states and 9382 transitions. Second operand 9 states. [2019-09-07 13:10:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:10:34,064 INFO L93 Difference]: Finished difference Result 7671 states and 11088 transitions. [2019-09-07 13:10:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:10:34,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-09-07 13:10:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:10:34,095 INFO L225 Difference]: With dead ends: 7671 [2019-09-07 13:10:34,095 INFO L226 Difference]: Without dead ends: 7548 [2019-09-07 13:10:34,099 INFO L628 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-09-07 13:10:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7548 states. [2019-09-07 13:10:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7548 to 7483. [2019-09-07 13:10:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7483 states. [2019-09-07 13:10:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7483 states to 7483 states and 10862 transitions. [2019-09-07 13:10:34,507 INFO L78 Accepts]: Start accepts. Automaton has 7483 states and 10862 transitions. Word has length 61 [2019-09-07 13:10:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:10:34,507 INFO L475 AbstractCegarLoop]: Abstraction has 7483 states and 10862 transitions. [2019-09-07 13:10:34,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:10:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 7483 states and 10862 transitions. [2019-09-07 13:10:34,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 13:10:34,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:10:34,511 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:10:34,511 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:10:34,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:10:34,512 INFO L82 PathProgramCache]: Analyzing trace with hash -351171645, now seen corresponding path program 1 times [2019-09-07 13:10:34,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:10:34,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:10:34,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:34,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:10:34,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:10:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:10:34,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:10:34,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:10:34,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:10:34,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:10:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:10:34,628 INFO L87 Difference]: Start difference. First operand 7483 states and 10862 transitions. Second operand 3 states. [2019-09-07 13:10:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:10:40,467 INFO L93 Difference]: Finished difference Result 7585 states and 10991 transitions. [2019-09-07 13:10:40,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:10:40,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-07 13:10:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:10:40,489 INFO L225 Difference]: With dead ends: 7585 [2019-09-07 13:10:40,489 INFO L226 Difference]: Without dead ends: 7506 [2019-09-07 13:10:40,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:10:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7506 states. [2019-09-07 13:10:40,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7506 to 7479. [2019-09-07 13:10:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7479 states. [2019-09-07 13:10:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7479 states to 7479 states and 10854 transitions. [2019-09-07 13:10:40,757 INFO L78 Accepts]: Start accepts. Automaton has 7479 states and 10854 transitions. Word has length 64 [2019-09-07 13:10:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:10:40,758 INFO L475 AbstractCegarLoop]: Abstraction has 7479 states and 10854 transitions. [2019-09-07 13:10:40,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:10:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 7479 states and 10854 transitions. [2019-09-07 13:10:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-07 13:10:40,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:10:40,761 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:10:40,761 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:10:40,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:10:40,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1262437008, now seen corresponding path program 1 times [2019-09-07 13:10:40,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:10:40,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:10:40,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:40,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:10:40,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:10:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:10:40,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:10:40,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:10:40,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:10:40,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:10:40,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:10:40,909 INFO L87 Difference]: Start difference. First operand 7479 states and 10854 transitions. Second operand 6 states. [2019-09-07 13:10:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:10:47,489 INFO L93 Difference]: Finished difference Result 7664 states and 11070 transitions. [2019-09-07 13:10:47,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:10:47,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-09-07 13:10:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:10:47,509 INFO L225 Difference]: With dead ends: 7664 [2019-09-07 13:10:47,509 INFO L226 Difference]: Without dead ends: 6659 [2019-09-07 13:10:47,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:10:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2019-09-07 13:10:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 6607. [2019-09-07 13:10:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6607 states. [2019-09-07 13:10:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6607 states to 6607 states and 9564 transitions. [2019-09-07 13:10:47,722 INFO L78 Accepts]: Start accepts. Automaton has 6607 states and 9564 transitions. Word has length 77 [2019-09-07 13:10:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:10:47,723 INFO L475 AbstractCegarLoop]: Abstraction has 6607 states and 9564 transitions. [2019-09-07 13:10:47,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:10:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 6607 states and 9564 transitions. [2019-09-07 13:10:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 13:10:47,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:10:47,726 INFO L399 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, 1, 1, 1, 1, 1, 1] [2019-09-07 13:10:47,726 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:10:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:10:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash 308442726, now seen corresponding path program 1 times [2019-09-07 13:10:47,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:10:47,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:10:47,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:47,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:10:47,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:10:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:10:47,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:10:47,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:10:47,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:10:47,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:10:47,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:10:47,841 INFO L87 Difference]: Start difference. First operand 6607 states and 9564 transitions. Second operand 6 states. [2019-09-07 13:10:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:10:48,021 INFO L93 Difference]: Finished difference Result 6663 states and 9623 transitions. [2019-09-07 13:10:48,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:10:48,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-07 13:10:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:10:48,036 INFO L225 Difference]: With dead ends: 6663 [2019-09-07 13:10:48,036 INFO L226 Difference]: Without dead ends: 6597 [2019-09-07 13:10:48,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:10:48,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2019-09-07 13:10:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 6597. [2019-09-07 13:10:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6597 states. [2019-09-07 13:10:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6597 states to 6597 states and 9551 transitions. [2019-09-07 13:10:48,388 INFO L78 Accepts]: Start accepts. Automaton has 6597 states and 9551 transitions. Word has length 71 [2019-09-07 13:10:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:10:48,388 INFO L475 AbstractCegarLoop]: Abstraction has 6597 states and 9551 transitions. [2019-09-07 13:10:48,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:10:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 6597 states and 9551 transitions. [2019-09-07 13:10:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 13:10:48,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:10:48,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:10:48,391 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:10:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:10:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1562784128, now seen corresponding path program 1 times [2019-09-07 13:10:48,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:10:48,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:10:48,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:48,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:10:48,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:10:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:10:48,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:10:48,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:10:48,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:10:48,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:10:48,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:10:48,476 INFO L87 Difference]: Start difference. First operand 6597 states and 9551 transitions. Second operand 3 states. [2019-09-07 13:10:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:10:48,834 INFO L93 Difference]: Finished difference Result 7899 states and 11424 transitions. [2019-09-07 13:10:48,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:10:48,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-07 13:10:48,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:10:48,858 INFO L225 Difference]: With dead ends: 7899 [2019-09-07 13:10:48,858 INFO L226 Difference]: Without dead ends: 7886 [2019-09-07 13:10:48,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:10:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7886 states. [2019-09-07 13:10:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7886 to 6723. [2019-09-07 13:10:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6723 states. [2019-09-07 13:10:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6723 states to 6723 states and 9695 transitions. [2019-09-07 13:10:49,109 INFO L78 Accepts]: Start accepts. Automaton has 6723 states and 9695 transitions. Word has length 63 [2019-09-07 13:10:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:10:49,109 INFO L475 AbstractCegarLoop]: Abstraction has 6723 states and 9695 transitions. [2019-09-07 13:10:49,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:10:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 6723 states and 9695 transitions. [2019-09-07 13:10:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 13:10:49,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:10:49,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:10:49,113 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:10:49,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:10:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1295748992, now seen corresponding path program 1 times [2019-09-07 13:10:49,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:10:49,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:10:49,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:49,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:10:49,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:10:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:10:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:10:49,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:10:49,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:10:49,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:10:49,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:10:49,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:10:49,248 INFO L87 Difference]: Start difference. First operand 6723 states and 9695 transitions. Second operand 7 states. [2019-09-07 13:11:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:45,670 INFO L93 Difference]: Finished difference Result 6806 states and 9790 transitions. [2019-09-07 13:11:45,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:11:45,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-09-07 13:11:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:45,688 INFO L225 Difference]: With dead ends: 6806 [2019-09-07 13:11:45,688 INFO L226 Difference]: Without dead ends: 6577 [2019-09-07 13:11:45,691 INFO L628 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-09-07 13:11:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2019-09-07 13:11:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 6563. [2019-09-07 13:11:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6563 states. [2019-09-07 13:11:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6563 states to 6563 states and 9505 transitions. [2019-09-07 13:11:45,902 INFO L78 Accepts]: Start accepts. Automaton has 6563 states and 9505 transitions. Word has length 63 [2019-09-07 13:11:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:45,903 INFO L475 AbstractCegarLoop]: Abstraction has 6563 states and 9505 transitions. [2019-09-07 13:11:45,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:11:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 6563 states and 9505 transitions. [2019-09-07 13:11:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-07 13:11:45,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:45,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:11:45,906 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:45,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:45,906 INFO L82 PathProgramCache]: Analyzing trace with hash 91646988, now seen corresponding path program 1 times [2019-09-07 13:11:45,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:45,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:45,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:45,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:45,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:46,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-09-07 13:11:46,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:46,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 13:11:46,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 13:11:46,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 13:11:46,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:11:46,140 INFO L87 Difference]: Start difference. First operand 6563 states and 9505 transitions. Second operand 11 states. [2019-09-07 13:11:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:48,475 INFO L93 Difference]: Finished difference Result 6582 states and 9525 transitions. [2019-09-07 13:11:48,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:11:48,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-09-07 13:11:48,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:48,499 INFO L225 Difference]: With dead ends: 6582 [2019-09-07 13:11:48,499 INFO L226 Difference]: Without dead ends: 6554 [2019-09-07 13:11:48,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:11:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6554 states. [2019-09-07 13:11:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6554 to 6554. [2019-09-07 13:11:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6554 states. [2019-09-07 13:11:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6554 states to 6554 states and 9494 transitions. [2019-09-07 13:11:48,718 INFO L78 Accepts]: Start accepts. Automaton has 6554 states and 9494 transitions. Word has length 73 [2019-09-07 13:11:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:48,718 INFO L475 AbstractCegarLoop]: Abstraction has 6554 states and 9494 transitions. [2019-09-07 13:11:48,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 13:11:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 6554 states and 9494 transitions. [2019-09-07 13:11:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 13:11:48,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:48,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:11:48,720 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1653205276, now seen corresponding path program 1 times [2019-09-07 13:11:48,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:48,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:48,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:48,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:48,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:48,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:48,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:11:48,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:11:48,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:11:48,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:11:48,880 INFO L87 Difference]: Start difference. First operand 6554 states and 9494 transitions. Second operand 9 states. [2019-09-07 13:11:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:51,078 INFO L93 Difference]: Finished difference Result 6573 states and 9515 transitions. [2019-09-07 13:11:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:11:51,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-09-07 13:11:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:51,102 INFO L225 Difference]: With dead ends: 6573 [2019-09-07 13:11:51,102 INFO L226 Difference]: Without dead ends: 6569 [2019-09-07 13:11:51,106 INFO L628 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-09-07 13:11:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6569 states. [2019-09-07 13:11:51,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6569 to 6565. [2019-09-07 13:11:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6565 states. [2019-09-07 13:11:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6565 states to 6565 states and 9507 transitions. [2019-09-07 13:11:51,601 INFO L78 Accepts]: Start accepts. Automaton has 6565 states and 9507 transitions. Word has length 64 [2019-09-07 13:11:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:51,601 INFO L475 AbstractCegarLoop]: Abstraction has 6565 states and 9507 transitions. [2019-09-07 13:11:51,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:11:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 6565 states and 9507 transitions. [2019-09-07 13:11:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 13:11:51,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:51,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:11:51,606 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:51,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1652928446, now seen corresponding path program 1 times [2019-09-07 13:11:51,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:51,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:51,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:51,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:51,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:51,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:51,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:11:51,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:11:51,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:11:51,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:11:51,743 INFO L87 Difference]: Start difference. First operand 6565 states and 9507 transitions. Second operand 6 states. [2019-09-07 13:11:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:57,020 INFO L93 Difference]: Finished difference Result 7734 states and 11224 transitions. [2019-09-07 13:11:57,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:11:57,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-07 13:11:57,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:57,046 INFO L225 Difference]: With dead ends: 7734 [2019-09-07 13:11:57,046 INFO L226 Difference]: Without dead ends: 7713 [2019-09-07 13:11:57,050 INFO L628 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-09-07 13:11:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7713 states. [2019-09-07 13:11:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7713 to 6552. [2019-09-07 13:11:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6552 states. [2019-09-07 13:11:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6552 states to 6552 states and 9489 transitions. [2019-09-07 13:11:57,435 INFO L78 Accepts]: Start accepts. Automaton has 6552 states and 9489 transitions. Word has length 64 [2019-09-07 13:11:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:57,436 INFO L475 AbstractCegarLoop]: Abstraction has 6552 states and 9489 transitions. [2019-09-07 13:11:57,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:11:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6552 states and 9489 transitions. [2019-09-07 13:11:57,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 13:11:57,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:57,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:11:57,438 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:57,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:57,438 INFO L82 PathProgramCache]: Analyzing trace with hash 610671469, now seen corresponding path program 1 times [2019-09-07 13:11:57,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:57,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:57,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:57,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:57,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:11:57,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:11:57,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:11:57,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:11:57,848 INFO L87 Difference]: Start difference. First operand 6552 states and 9489 transitions. Second operand 3 states. [2019-09-07 13:11:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:11:58,187 INFO L93 Difference]: Finished difference Result 6603 states and 9547 transitions. [2019-09-07 13:11:58,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:11:58,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-07 13:11:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:11:58,215 INFO L225 Difference]: With dead ends: 6603 [2019-09-07 13:11:58,215 INFO L226 Difference]: Without dead ends: 6599 [2019-09-07 13:11:58,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:11:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states. [2019-09-07 13:11:58,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 6550. [2019-09-07 13:11:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6550 states. [2019-09-07 13:11:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6550 states to 6550 states and 9485 transitions. [2019-09-07 13:11:58,615 INFO L78 Accepts]: Start accepts. Automaton has 6550 states and 9485 transitions. Word has length 70 [2019-09-07 13:11:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:11:58,616 INFO L475 AbstractCegarLoop]: Abstraction has 6550 states and 9485 transitions. [2019-09-07 13:11:58,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:11:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6550 states and 9485 transitions. [2019-09-07 13:11:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 13:11:58,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:11:58,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:11:58,619 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:11:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:11:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1101022210, now seen corresponding path program 1 times [2019-09-07 13:11:58,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:11:58,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:11:58,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:58,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:11:58,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:11:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:11:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:11:58,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:11:58,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:11:58,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:11:58,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:11:58,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:11:58,820 INFO L87 Difference]: Start difference. First operand 6550 states and 9485 transitions. Second operand 9 states. [2019-09-07 13:12:00,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:00,742 INFO L93 Difference]: Finished difference Result 6563 states and 9499 transitions. [2019-09-07 13:12:00,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:12:00,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-07 13:12:00,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:00,761 INFO L225 Difference]: With dead ends: 6563 [2019-09-07 13:12:00,761 INFO L226 Difference]: Without dead ends: 6528 [2019-09-07 13:12:00,766 INFO L628 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-09-07 13:12:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2019-09-07 13:12:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 6528. [2019-09-07 13:12:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6528 states. [2019-09-07 13:12:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6528 states to 6528 states and 9460 transitions. [2019-09-07 13:12:01,094 INFO L78 Accepts]: Start accepts. Automaton has 6528 states and 9460 transitions. Word has length 65 [2019-09-07 13:12:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:01,094 INFO L475 AbstractCegarLoop]: Abstraction has 6528 states and 9460 transitions. [2019-09-07 13:12:01,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:12:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 6528 states and 9460 transitions. [2019-09-07 13:12:01,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 13:12:01,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:01,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:01,096 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:01,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:01,096 INFO L82 PathProgramCache]: Analyzing trace with hash -841217434, now seen corresponding path program 1 times [2019-09-07 13:12:01,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:01,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:01,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:01,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:01,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:01,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:12:01,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:12:01,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:12:01,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:01,252 INFO L87 Difference]: Start difference. First operand 6528 states and 9460 transitions. Second operand 3 states. [2019-09-07 13:12:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:01,739 INFO L93 Difference]: Finished difference Result 10134 states and 14693 transitions. [2019-09-07 13:12:01,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:12:01,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-07 13:12:01,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:01,760 INFO L225 Difference]: With dead ends: 10134 [2019-09-07 13:12:01,760 INFO L226 Difference]: Without dead ends: 10000 [2019-09-07 13:12:01,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10000 states. [2019-09-07 13:12:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10000 to 6531. [2019-09-07 13:12:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6531 states. [2019-09-07 13:12:02,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6531 states to 6531 states and 9460 transitions. [2019-09-07 13:12:02,057 INFO L78 Accepts]: Start accepts. Automaton has 6531 states and 9460 transitions. Word has length 72 [2019-09-07 13:12:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:02,057 INFO L475 AbstractCegarLoop]: Abstraction has 6531 states and 9460 transitions. [2019-09-07 13:12:02,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:12:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6531 states and 9460 transitions. [2019-09-07 13:12:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 13:12:02,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:02,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:02,060 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:02,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1966852698, now seen corresponding path program 1 times [2019-09-07 13:12:02,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:02,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:02,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:02,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:02,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:02,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:02,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 13:12:02,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 13:12:02,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 13:12:02,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:12:02,294 INFO L87 Difference]: Start difference. First operand 6531 states and 9460 transitions. Second operand 11 states. [2019-09-07 13:12:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:02,863 INFO L93 Difference]: Finished difference Result 6546 states and 9476 transitions. [2019-09-07 13:12:02,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:12:02,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-09-07 13:12:02,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:02,891 INFO L225 Difference]: With dead ends: 6546 [2019-09-07 13:12:02,891 INFO L226 Difference]: Without dead ends: 6513 [2019-09-07 13:12:02,895 INFO L628 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-09-07 13:12:02,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2019-09-07 13:12:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 6513. [2019-09-07 13:12:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6513 states. [2019-09-07 13:12:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6513 states to 6513 states and 9438 transitions. [2019-09-07 13:12:03,204 INFO L78 Accepts]: Start accepts. Automaton has 6513 states and 9438 transitions. Word has length 75 [2019-09-07 13:12:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:03,204 INFO L475 AbstractCegarLoop]: Abstraction has 6513 states and 9438 transitions. [2019-09-07 13:12:03,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 13:12:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 6513 states and 9438 transitions. [2019-09-07 13:12:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 13:12:03,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:03,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:03,207 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash 551390113, now seen corresponding path program 1 times [2019-09-07 13:12:03,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:03,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:03,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:03,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:03,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:03,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:03,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:12:03,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:12:03,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:12:03,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:12:03,369 INFO L87 Difference]: Start difference. First operand 6513 states and 9438 transitions. Second operand 5 states. [2019-09-07 13:12:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:07,003 INFO L93 Difference]: Finished difference Result 7383 states and 10644 transitions. [2019-09-07 13:12:07,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:12:07,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-07 13:12:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:07,018 INFO L225 Difference]: With dead ends: 7383 [2019-09-07 13:12:07,018 INFO L226 Difference]: Without dead ends: 4959 [2019-09-07 13:12:07,027 INFO L628 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-09-07 13:12:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-09-07 13:12:07,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4839. [2019-09-07 13:12:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4839 states. [2019-09-07 13:12:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 6971 transitions. [2019-09-07 13:12:07,241 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 6971 transitions. Word has length 80 [2019-09-07 13:12:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:07,242 INFO L475 AbstractCegarLoop]: Abstraction has 4839 states and 6971 transitions. [2019-09-07 13:12:07,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:12:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 6971 transitions. [2019-09-07 13:12:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-07 13:12:07,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:07,245 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:07,245 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:07,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:07,246 INFO L82 PathProgramCache]: Analyzing trace with hash -348379415, now seen corresponding path program 1 times [2019-09-07 13:12:07,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:07,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:07,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:07,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:07,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:07,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:07,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:12:07,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:12:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:12:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:07,385 INFO L87 Difference]: Start difference. First operand 4839 states and 6971 transitions. Second operand 3 states. [2019-09-07 13:12:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:07,695 INFO L93 Difference]: Finished difference Result 8344 states and 12090 transitions. [2019-09-07 13:12:07,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:12:07,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-07 13:12:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:07,709 INFO L225 Difference]: With dead ends: 8344 [2019-09-07 13:12:07,709 INFO L226 Difference]: Without dead ends: 4917 [2019-09-07 13:12:07,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:07,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2019-09-07 13:12:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 4834. [2019-09-07 13:12:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4834 states. [2019-09-07 13:12:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 6961 transitions. [2019-09-07 13:12:07,948 INFO L78 Accepts]: Start accepts. Automaton has 4834 states and 6961 transitions. Word has length 81 [2019-09-07 13:12:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:07,949 INFO L475 AbstractCegarLoop]: Abstraction has 4834 states and 6961 transitions. [2019-09-07 13:12:07,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:12:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 6961 transitions. [2019-09-07 13:12:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 13:12:07,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:07,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:07,952 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:07,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:07,953 INFO L82 PathProgramCache]: Analyzing trace with hash -240651905, now seen corresponding path program 1 times [2019-09-07 13:12:07,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:07,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:07,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:07,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:07,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:08,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:08,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:12:08,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:12:08,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:12:08,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:12:08,102 INFO L87 Difference]: Start difference. First operand 4834 states and 6961 transitions. Second operand 6 states. [2019-09-07 13:12:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:09,382 INFO L93 Difference]: Finished difference Result 4899 states and 7040 transitions. [2019-09-07 13:12:09,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:12:09,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-09-07 13:12:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:09,391 INFO L225 Difference]: With dead ends: 4899 [2019-09-07 13:12:09,391 INFO L226 Difference]: Without dead ends: 4454 [2019-09-07 13:12:09,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:12:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-09-07 13:12:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4427. [2019-09-07 13:12:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4427 states. [2019-09-07 13:12:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 6324 transitions. [2019-09-07 13:12:09,558 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 6324 transitions. Word has length 82 [2019-09-07 13:12:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:09,559 INFO L475 AbstractCegarLoop]: Abstraction has 4427 states and 6324 transitions. [2019-09-07 13:12:09,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:12:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 6324 transitions. [2019-09-07 13:12:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 13:12:09,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:09,561 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:09,561 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash -245192666, now seen corresponding path program 1 times [2019-09-07 13:12:09,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:09,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:09,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:09,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:09,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:12:09,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:12:09,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:12:09,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:12:09,684 INFO L87 Difference]: Start difference. First operand 4427 states and 6324 transitions. Second operand 6 states. [2019-09-07 13:12:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:11,984 INFO L93 Difference]: Finished difference Result 4481 states and 6386 transitions. [2019-09-07 13:12:11,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:12:11,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-07 13:12:11,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:11,994 INFO L225 Difference]: With dead ends: 4481 [2019-09-07 13:12:11,994 INFO L226 Difference]: Without dead ends: 4427 [2019-09-07 13:12:11,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:12:11,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2019-09-07 13:12:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 4427. [2019-09-07 13:12:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4427 states. [2019-09-07 13:12:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 6320 transitions. [2019-09-07 13:12:12,161 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 6320 transitions. Word has length 78 [2019-09-07 13:12:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:12,161 INFO L475 AbstractCegarLoop]: Abstraction has 4427 states and 6320 transitions. [2019-09-07 13:12:12,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:12:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 6320 transitions. [2019-09-07 13:12:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 13:12:12,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:12,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:12,164 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:12,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:12,165 INFO L82 PathProgramCache]: Analyzing trace with hash -219822743, now seen corresponding path program 1 times [2019-09-07 13:12:12,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:12,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:12,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:12,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:12,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:12,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:12,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:12:12,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:12:12,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:12:12,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:12:12,374 INFO L87 Difference]: Start difference. First operand 4427 states and 6320 transitions. Second operand 5 states. [2019-09-07 13:12:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:12,529 INFO L93 Difference]: Finished difference Result 4514 states and 6420 transitions. [2019-09-07 13:12:12,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:12:12,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-07 13:12:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:12,538 INFO L225 Difference]: With dead ends: 4514 [2019-09-07 13:12:12,539 INFO L226 Difference]: Without dead ends: 4397 [2019-09-07 13:12:12,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:12:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2019-09-07 13:12:12,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 4397. [2019-09-07 13:12:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4397 states. [2019-09-07 13:12:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 6283 transitions. [2019-09-07 13:12:12,707 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 6283 transitions. Word has length 79 [2019-09-07 13:12:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:12,708 INFO L475 AbstractCegarLoop]: Abstraction has 4397 states and 6283 transitions. [2019-09-07 13:12:12,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:12:12,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 6283 transitions. [2019-09-07 13:12:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 13:12:12,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:12,709 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:12,710 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:12,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:12,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1253594992, now seen corresponding path program 1 times [2019-09-07 13:12:12,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:12,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:12,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:12,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:12,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:12,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:12,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:12:12,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:12:12,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:12:12,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:12:12,831 INFO L87 Difference]: Start difference. First operand 4397 states and 6283 transitions. Second operand 6 states. [2019-09-07 13:12:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:15,116 INFO L93 Difference]: Finished difference Result 4455 states and 6350 transitions. [2019-09-07 13:12:15,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:12:15,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-09-07 13:12:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:15,126 INFO L225 Difference]: With dead ends: 4455 [2019-09-07 13:12:15,127 INFO L226 Difference]: Without dead ends: 4397 [2019-09-07 13:12:15,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:12:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2019-09-07 13:12:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 4397. [2019-09-07 13:12:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4397 states. [2019-09-07 13:12:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 6281 transitions. [2019-09-07 13:12:15,301 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 6281 transitions. Word has length 79 [2019-09-07 13:12:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:15,301 INFO L475 AbstractCegarLoop]: Abstraction has 4397 states and 6281 transitions. [2019-09-07 13:12:15,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:12:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 6281 transitions. [2019-09-07 13:12:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 13:12:15,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:15,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:15,304 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:15,304 INFO L82 PathProgramCache]: Analyzing trace with hash -56933927, now seen corresponding path program 1 times [2019-09-07 13:12:15,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:15,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:15,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:15,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:15,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:15,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:15,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:12:15,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:12:15,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:12:15,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:15,515 INFO L87 Difference]: Start difference. First operand 4397 states and 6281 transitions. Second operand 3 states. [2019-09-07 13:12:15,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:15,768 INFO L93 Difference]: Finished difference Result 4446 states and 6337 transitions. [2019-09-07 13:12:15,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:12:15,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-07 13:12:15,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:15,777 INFO L225 Difference]: With dead ends: 4446 [2019-09-07 13:12:15,778 INFO L226 Difference]: Without dead ends: 4399 [2019-09-07 13:12:15,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4399 states. [2019-09-07 13:12:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4399 to 4397. [2019-09-07 13:12:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4397 states. [2019-09-07 13:12:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 6280 transitions. [2019-09-07 13:12:15,945 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 6280 transitions. Word has length 84 [2019-09-07 13:12:15,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:15,945 INFO L475 AbstractCegarLoop]: Abstraction has 4397 states and 6280 transitions. [2019-09-07 13:12:15,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:12:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 6280 transitions. [2019-09-07 13:12:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 13:12:15,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:15,947 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:15,947 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1491366779, now seen corresponding path program 1 times [2019-09-07 13:12:15,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:15,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:15,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:16,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:16,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:12:16,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:12:16,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:12:16,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:16,090 INFO L87 Difference]: Start difference. First operand 4397 states and 6280 transitions. Second operand 3 states. [2019-09-07 13:12:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:16,267 INFO L93 Difference]: Finished difference Result 4467 states and 6360 transitions. [2019-09-07 13:12:16,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:12:16,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-07 13:12:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:16,276 INFO L225 Difference]: With dead ends: 4467 [2019-09-07 13:12:16,276 INFO L226 Difference]: Without dead ends: 4410 [2019-09-07 13:12:16,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2019-09-07 13:12:16,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4402. [2019-09-07 13:12:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4402 states. [2019-09-07 13:12:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4402 states to 4402 states and 6287 transitions. [2019-09-07 13:12:16,443 INFO L78 Accepts]: Start accepts. Automaton has 4402 states and 6287 transitions. Word has length 85 [2019-09-07 13:12:16,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:16,443 INFO L475 AbstractCegarLoop]: Abstraction has 4402 states and 6287 transitions. [2019-09-07 13:12:16,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:12:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4402 states and 6287 transitions. [2019-09-07 13:12:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 13:12:16,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:16,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:16,445 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:16,446 INFO L82 PathProgramCache]: Analyzing trace with hash 198331322, now seen corresponding path program 1 times [2019-09-07 13:12:16,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:16,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:16,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:16,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:16,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:16,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:16,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:12:16,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:12:16,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:12:16,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:12:16,565 INFO L87 Difference]: Start difference. First operand 4402 states and 6287 transitions. Second operand 6 states. [2019-09-07 13:12:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:18,803 INFO L93 Difference]: Finished difference Result 4460 states and 6354 transitions. [2019-09-07 13:12:18,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:12:18,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-07 13:12:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:18,812 INFO L225 Difference]: With dead ends: 4460 [2019-09-07 13:12:18,813 INFO L226 Difference]: Without dead ends: 4402 [2019-09-07 13:12:18,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:12:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2019-09-07 13:12:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 4402. [2019-09-07 13:12:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4402 states. [2019-09-07 13:12:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4402 states to 4402 states and 6286 transitions. [2019-09-07 13:12:18,980 INFO L78 Accepts]: Start accepts. Automaton has 4402 states and 6286 transitions. Word has length 83 [2019-09-07 13:12:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:18,980 INFO L475 AbstractCegarLoop]: Abstraction has 4402 states and 6286 transitions. [2019-09-07 13:12:18,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:12:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4402 states and 6286 transitions. [2019-09-07 13:12:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-07 13:12:18,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:18,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:18,983 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:18,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:18,983 INFO L82 PathProgramCache]: Analyzing trace with hash -986895225, now seen corresponding path program 1 times [2019-09-07 13:12:18,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:18,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:18,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:18,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:18,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:19,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-09-07 13:12:19,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:19,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:12:19,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:12:19,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:12:19,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:12:19,160 INFO L87 Difference]: Start difference. First operand 4402 states and 6286 transitions. Second operand 6 states. [2019-09-07 13:12:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:19,356 INFO L93 Difference]: Finished difference Result 4417 states and 6302 transitions. [2019-09-07 13:12:19,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:12:19,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-07 13:12:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:19,366 INFO L225 Difference]: With dead ends: 4417 [2019-09-07 13:12:19,366 INFO L226 Difference]: Without dead ends: 4396 [2019-09-07 13:12:19,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:12:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4396 states. [2019-09-07 13:12:19,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4396 to 4391. [2019-09-07 13:12:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4391 states. [2019-09-07 13:12:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4391 states to 4391 states and 6270 transitions. [2019-09-07 13:12:19,537 INFO L78 Accepts]: Start accepts. Automaton has 4391 states and 6270 transitions. Word has length 86 [2019-09-07 13:12:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:19,538 INFO L475 AbstractCegarLoop]: Abstraction has 4391 states and 6270 transitions. [2019-09-07 13:12:19,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:12:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4391 states and 6270 transitions. [2019-09-07 13:12:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-07 13:12:19,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:19,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:19,540 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:19,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1597447618, now seen corresponding path program 1 times [2019-09-07 13:12:19,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:19,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:19,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:19,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:19,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:19,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:19,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:12:19,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:12:19,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:12:19,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:19,660 INFO L87 Difference]: Start difference. First operand 4391 states and 6270 transitions. Second operand 3 states. [2019-09-07 13:12:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:19,924 INFO L93 Difference]: Finished difference Result 5591 states and 8026 transitions. [2019-09-07 13:12:19,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:12:19,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-07 13:12:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:19,936 INFO L225 Difference]: With dead ends: 5591 [2019-09-07 13:12:19,937 INFO L226 Difference]: Without dead ends: 5583 [2019-09-07 13:12:19,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5583 states. [2019-09-07 13:12:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5583 to 4420. [2019-09-07 13:12:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4420 states. [2019-09-07 13:12:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 6305 transitions. [2019-09-07 13:12:20,265 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 6305 transitions. Word has length 84 [2019-09-07 13:12:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:20,266 INFO L475 AbstractCegarLoop]: Abstraction has 4420 states and 6305 transitions. [2019-09-07 13:12:20,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:12:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 6305 transitions. [2019-09-07 13:12:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 13:12:20,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:20,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:20,268 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:20,268 INFO L82 PathProgramCache]: Analyzing trace with hash 198612998, now seen corresponding path program 1 times [2019-09-07 13:12:20,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:20,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:20,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:20,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:20,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:20,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:20,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:12:20,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:12:20,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:12:20,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:12:20,387 INFO L87 Difference]: Start difference. First operand 4420 states and 6305 transitions. Second operand 4 states. [2019-09-07 13:12:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:22,552 INFO L93 Difference]: Finished difference Result 6351 states and 9101 transitions. [2019-09-07 13:12:22,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:12:22,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-07 13:12:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:22,568 INFO L225 Difference]: With dead ends: 6351 [2019-09-07 13:12:22,568 INFO L226 Difference]: Without dead ends: 4368 [2019-09-07 13:12:22,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:12:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4368 states. [2019-09-07 13:12:22,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4368 to 4368. [2019-09-07 13:12:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4368 states. [2019-09-07 13:12:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4368 states to 4368 states and 6226 transitions. [2019-09-07 13:12:22,791 INFO L78 Accepts]: Start accepts. Automaton has 4368 states and 6226 transitions. Word has length 85 [2019-09-07 13:12:22,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:22,792 INFO L475 AbstractCegarLoop]: Abstraction has 4368 states and 6226 transitions. [2019-09-07 13:12:22,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:12:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4368 states and 6226 transitions. [2019-09-07 13:12:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 13:12:22,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:22,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:22,794 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1260388616, now seen corresponding path program 1 times [2019-09-07 13:12:22,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:22,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:22,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:22,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:22,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:22,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:22,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:12:22,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:12:22,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:12:22,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:22,896 INFO L87 Difference]: Start difference. First operand 4368 states and 6226 transitions. Second operand 3 states. [2019-09-07 13:12:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:23,104 INFO L93 Difference]: Finished difference Result 6697 states and 9635 transitions. [2019-09-07 13:12:23,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:12:23,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-07 13:12:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:23,114 INFO L225 Difference]: With dead ends: 6697 [2019-09-07 13:12:23,114 INFO L226 Difference]: Without dead ends: 4366 [2019-09-07 13:12:23,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4366 states. [2019-09-07 13:12:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4366 to 4366. [2019-09-07 13:12:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4366 states. [2019-09-07 13:12:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4366 states to 4366 states and 6222 transitions. [2019-09-07 13:12:23,311 INFO L78 Accepts]: Start accepts. Automaton has 4366 states and 6222 transitions. Word has length 90 [2019-09-07 13:12:23,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:23,311 INFO L475 AbstractCegarLoop]: Abstraction has 4366 states and 6222 transitions. [2019-09-07 13:12:23,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:12:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4366 states and 6222 transitions. [2019-09-07 13:12:23,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 13:12:23,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:23,313 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:23,313 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:23,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:23,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1824698338, now seen corresponding path program 1 times [2019-09-07 13:12:23,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:23,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:23,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:23,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:23,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:23,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:23,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:12:23,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:12:23,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:12:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:12:23,449 INFO L87 Difference]: Start difference. First operand 4366 states and 6222 transitions. Second operand 5 states. [2019-09-07 13:12:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:28,721 INFO L93 Difference]: Finished difference Result 5520 states and 7915 transitions. [2019-09-07 13:12:28,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:12:28,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-07 13:12:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:28,732 INFO L225 Difference]: With dead ends: 5520 [2019-09-07 13:12:28,732 INFO L226 Difference]: Without dead ends: 5514 [2019-09-07 13:12:28,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:12:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5514 states. [2019-09-07 13:12:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5514 to 4366. [2019-09-07 13:12:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4366 states. [2019-09-07 13:12:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4366 states to 4366 states and 6221 transitions. [2019-09-07 13:12:28,947 INFO L78 Accepts]: Start accepts. Automaton has 4366 states and 6221 transitions. Word has length 85 [2019-09-07 13:12:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:28,947 INFO L475 AbstractCegarLoop]: Abstraction has 4366 states and 6221 transitions. [2019-09-07 13:12:28,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:12:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4366 states and 6221 transitions. [2019-09-07 13:12:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 13:12:28,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:28,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:28,949 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash -834588261, now seen corresponding path program 1 times [2019-09-07 13:12:28,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:28,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:28,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:28,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:28,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:29,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:29,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:12:29,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:12:29,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:12:29,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:12:29,063 INFO L87 Difference]: Start difference. First operand 4366 states and 6221 transitions. Second operand 6 states. [2019-09-07 13:12:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:31,362 INFO L93 Difference]: Finished difference Result 4427 states and 6290 transitions. [2019-09-07 13:12:31,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:12:31,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-07 13:12:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:31,371 INFO L225 Difference]: With dead ends: 4427 [2019-09-07 13:12:31,371 INFO L226 Difference]: Without dead ends: 4375 [2019-09-07 13:12:31,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:12:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4375 states. [2019-09-07 13:12:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4375 to 4366. [2019-09-07 13:12:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4366 states. [2019-09-07 13:12:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4366 states to 4366 states and 6219 transitions. [2019-09-07 13:12:31,556 INFO L78 Accepts]: Start accepts. Automaton has 4366 states and 6219 transitions. Word has length 85 [2019-09-07 13:12:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:31,556 INFO L475 AbstractCegarLoop]: Abstraction has 4366 states and 6219 transitions. [2019-09-07 13:12:31,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:12:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4366 states and 6219 transitions. [2019-09-07 13:12:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-07 13:12:31,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:31,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:31,559 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:31,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:31,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1629971384, now seen corresponding path program 1 times [2019-09-07 13:12:31,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:31,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:31,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:31,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:31,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:31,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:31,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:12:31,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:12:31,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:12:31,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:12:31,753 INFO L87 Difference]: Start difference. First operand 4366 states and 6219 transitions. Second operand 9 states. [2019-09-07 13:12:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:34,340 INFO L93 Difference]: Finished difference Result 4387 states and 6243 transitions. [2019-09-07 13:12:34,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:12:34,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-07 13:12:34,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:34,350 INFO L225 Difference]: With dead ends: 4387 [2019-09-07 13:12:34,350 INFO L226 Difference]: Without dead ends: 4383 [2019-09-07 13:12:34,351 INFO L628 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-09-07 13:12:34,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-09-07 13:12:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 4379. [2019-09-07 13:12:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4379 states. [2019-09-07 13:12:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4379 states to 4379 states and 6235 transitions. [2019-09-07 13:12:34,532 INFO L78 Accepts]: Start accepts. Automaton has 4379 states and 6235 transitions. Word has length 86 [2019-09-07 13:12:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:34,532 INFO L475 AbstractCegarLoop]: Abstraction has 4379 states and 6235 transitions. [2019-09-07 13:12:34,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:12:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 4379 states and 6235 transitions. [2019-09-07 13:12:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-07 13:12:34,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:34,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:34,535 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:34,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:34,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1630248214, now seen corresponding path program 1 times [2019-09-07 13:12:34,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:34,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:34,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:34,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:34,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:34,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:34,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:12:34,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:12:34,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:12:34,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:12:34,661 INFO L87 Difference]: Start difference. First operand 4379 states and 6235 transitions. Second operand 5 states. [2019-09-07 13:12:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:39,866 INFO L93 Difference]: Finished difference Result 5531 states and 7926 transitions. [2019-09-07 13:12:39,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:12:39,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-07 13:12:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:39,878 INFO L225 Difference]: With dead ends: 5531 [2019-09-07 13:12:39,878 INFO L226 Difference]: Without dead ends: 5499 [2019-09-07 13:12:39,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:12:39,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2019-09-07 13:12:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4351. [2019-09-07 13:12:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4351 states. [2019-09-07 13:12:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4351 states to 4351 states and 6200 transitions. [2019-09-07 13:12:40,076 INFO L78 Accepts]: Start accepts. Automaton has 4351 states and 6200 transitions. Word has length 86 [2019-09-07 13:12:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:40,076 INFO L475 AbstractCegarLoop]: Abstraction has 4351 states and 6200 transitions. [2019-09-07 13:12:40,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:12:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4351 states and 6200 transitions. [2019-09-07 13:12:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 13:12:40,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:40,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:40,078 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:40,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:40,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1559133655, now seen corresponding path program 1 times [2019-09-07 13:12:40,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:40,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:40,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:40,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:40,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:12:40,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:12:40,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:12:40,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:40,177 INFO L87 Difference]: Start difference. First operand 4351 states and 6200 transitions. Second operand 3 states. [2019-09-07 13:12:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:40,521 INFO L93 Difference]: Finished difference Result 5501 states and 7887 transitions. [2019-09-07 13:12:40,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:12:40,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-07 13:12:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:40,533 INFO L225 Difference]: With dead ends: 5501 [2019-09-07 13:12:40,533 INFO L226 Difference]: Without dead ends: 5498 [2019-09-07 13:12:40,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:12:40,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5498 states. [2019-09-07 13:12:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5498 to 4489. [2019-09-07 13:12:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4489 states. [2019-09-07 13:12:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6392 transitions. [2019-09-07 13:12:40,746 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6392 transitions. Word has length 93 [2019-09-07 13:12:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:40,746 INFO L475 AbstractCegarLoop]: Abstraction has 4489 states and 6392 transitions. [2019-09-07 13:12:40,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:12:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6392 transitions. [2019-09-07 13:12:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 13:12:40,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:40,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:40,748 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash 402322031, now seen corresponding path program 1 times [2019-09-07 13:12:40,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:40,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:40,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:40,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:40,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:40,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:40,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:12:40,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:12:40,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:12:40,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:12:40,882 INFO L87 Difference]: Start difference. First operand 4489 states and 6392 transitions. Second operand 5 states. [2019-09-07 13:12:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:48,065 INFO L93 Difference]: Finished difference Result 8964 states and 12967 transitions. [2019-09-07 13:12:48,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:12:48,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-07 13:12:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:48,083 INFO L225 Difference]: With dead ends: 8964 [2019-09-07 13:12:48,084 INFO L226 Difference]: Without dead ends: 6642 [2019-09-07 13:12:48,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:12:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6642 states. [2019-09-07 13:12:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6642 to 4503. [2019-09-07 13:12:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2019-09-07 13:12:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 6409 transitions. [2019-09-07 13:12:48,975 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 6409 transitions. Word has length 93 [2019-09-07 13:12:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:48,976 INFO L475 AbstractCegarLoop]: Abstraction has 4503 states and 6409 transitions. [2019-09-07 13:12:48,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:12:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 6409 transitions. [2019-09-07 13:12:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 13:12:48,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:48,978 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:48,978 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:48,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:48,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1643656828, now seen corresponding path program 1 times [2019-09-07 13:12:48,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:48,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:48,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:48,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:48,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:49,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:49,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 13:12:49,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:12:49,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:12:49,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:12:49,350 INFO L87 Difference]: Start difference. First operand 4503 states and 6409 transitions. Second operand 14 states. [2019-09-07 13:12:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:12:55,744 INFO L93 Difference]: Finished difference Result 4520 states and 6427 transitions. [2019-09-07 13:12:55,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 13:12:55,745 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2019-09-07 13:12:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:12:55,754 INFO L225 Difference]: With dead ends: 4520 [2019-09-07 13:12:55,754 INFO L226 Difference]: Without dead ends: 4501 [2019-09-07 13:12:55,755 INFO L628 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-09-07 13:12:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2019-09-07 13:12:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4501. [2019-09-07 13:12:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4501 states. [2019-09-07 13:12:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4501 states to 4501 states and 6405 transitions. [2019-09-07 13:12:55,964 INFO L78 Accepts]: Start accepts. Automaton has 4501 states and 6405 transitions. Word has length 90 [2019-09-07 13:12:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:12:55,964 INFO L475 AbstractCegarLoop]: Abstraction has 4501 states and 6405 transitions. [2019-09-07 13:12:55,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:12:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4501 states and 6405 transitions. [2019-09-07 13:12:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 13:12:55,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:12:55,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:12:55,967 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:12:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:12:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1319756638, now seen corresponding path program 1 times [2019-09-07 13:12:55,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:12:55,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:12:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:55,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:12:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:12:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:12:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:12:56,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:12:56,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 13:12:56,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:12:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:12:56,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:12:56,210 INFO L87 Difference]: Start difference. First operand 4501 states and 6405 transitions. Second operand 14 states. [2019-09-07 13:13:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:02,498 INFO L93 Difference]: Finished difference Result 4518 states and 6423 transitions. [2019-09-07 13:13:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 13:13:02,499 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-09-07 13:13:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:02,507 INFO L225 Difference]: With dead ends: 4518 [2019-09-07 13:13:02,508 INFO L226 Difference]: Without dead ends: 4492 [2019-09-07 13:13:02,509 INFO L628 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-09-07 13:13:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4492 states. [2019-09-07 13:13:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4492 to 4492. [2019-09-07 13:13:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4492 states. [2019-09-07 13:13:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 6393 transitions. [2019-09-07 13:13:02,723 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 6393 transitions. Word has length 98 [2019-09-07 13:13:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:02,724 INFO L475 AbstractCegarLoop]: Abstraction has 4492 states and 6393 transitions. [2019-09-07 13:13:02,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:13:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 6393 transitions. [2019-09-07 13:13:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-07 13:13:02,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:02,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:02,726 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:02,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:02,726 INFO L82 PathProgramCache]: Analyzing trace with hash -425043435, now seen corresponding path program 1 times [2019-09-07 13:13:02,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:02,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:02,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:02,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 13:13:02,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:13:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:13:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:13:02,963 INFO L87 Difference]: Start difference. First operand 4492 states and 6393 transitions. Second operand 14 states. [2019-09-07 13:13:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:07,722 INFO L93 Difference]: Finished difference Result 4509 states and 6411 transitions. [2019-09-07 13:13:07,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 13:13:07,723 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2019-09-07 13:13:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:07,731 INFO L225 Difference]: With dead ends: 4509 [2019-09-07 13:13:07,731 INFO L226 Difference]: Without dead ends: 4483 [2019-09-07 13:13:07,733 INFO L628 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-09-07 13:13:07,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4483 states. [2019-09-07 13:13:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4483 to 4483. [2019-09-07 13:13:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4483 states. [2019-09-07 13:13:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 4483 states and 6381 transitions. [2019-09-07 13:13:07,953 INFO L78 Accepts]: Start accepts. Automaton has 4483 states and 6381 transitions. Word has length 101 [2019-09-07 13:13:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:07,953 INFO L475 AbstractCegarLoop]: Abstraction has 4483 states and 6381 transitions. [2019-09-07 13:13:07,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:13:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4483 states and 6381 transitions. [2019-09-07 13:13:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 13:13:07,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:07,955 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:07,955 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:07,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:07,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2042461425, now seen corresponding path program 1 times [2019-09-07 13:13:07,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:07,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:07,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:07,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:07,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:08,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:08,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 13:13:08,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:13:08,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:13:08,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:13:08,200 INFO L87 Difference]: Start difference. First operand 4483 states and 6381 transitions. Second operand 14 states. [2019-09-07 13:13:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:13,190 INFO L93 Difference]: Finished difference Result 4500 states and 6399 transitions. [2019-09-07 13:13:13,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 13:13:13,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2019-09-07 13:13:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:13,199 INFO L225 Difference]: With dead ends: 4500 [2019-09-07 13:13:13,199 INFO L226 Difference]: Without dead ends: 4476 [2019-09-07 13:13:13,200 INFO L628 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-09-07 13:13:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2019-09-07 13:13:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 4476. [2019-09-07 13:13:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4476 states. [2019-09-07 13:13:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 6372 transitions. [2019-09-07 13:13:13,405 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 6372 transitions. Word has length 91 [2019-09-07 13:13:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:13,405 INFO L475 AbstractCegarLoop]: Abstraction has 4476 states and 6372 transitions. [2019-09-07 13:13:13,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:13:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 6372 transitions. [2019-09-07 13:13:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 13:13:13,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:13,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:13,407 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash -823465480, now seen corresponding path program 1 times [2019-09-07 13:13:13,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:13,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:13,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:13,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:13,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:13:13,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:13:13,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:13:13,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:13:13,516 INFO L87 Difference]: Start difference. First operand 4476 states and 6372 transitions. Second operand 6 states. [2019-09-07 13:13:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:14,518 INFO L93 Difference]: Finished difference Result 4540 states and 6443 transitions. [2019-09-07 13:13:14,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:13:14,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-07 13:13:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:14,528 INFO L225 Difference]: With dead ends: 4540 [2019-09-07 13:13:14,528 INFO L226 Difference]: Without dead ends: 4470 [2019-09-07 13:13:14,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:13:14,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2019-09-07 13:13:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 4455. [2019-09-07 13:13:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4455 states. [2019-09-07 13:13:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 6339 transitions. [2019-09-07 13:13:14,734 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 6339 transitions. Word has length 89 [2019-09-07 13:13:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:14,734 INFO L475 AbstractCegarLoop]: Abstraction has 4455 states and 6339 transitions. [2019-09-07 13:13:14,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:13:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 6339 transitions. [2019-09-07 13:13:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 13:13:14,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:14,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:14,736 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:14,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1688969787, now seen corresponding path program 1 times [2019-09-07 13:13:14,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:14,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:14,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:14,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:14,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:14,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:14,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:13:14,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:13:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:13:14,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:13:14,882 INFO L87 Difference]: Start difference. First operand 4455 states and 6339 transitions. Second operand 9 states. [2019-09-07 13:13:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:17,213 INFO L93 Difference]: Finished difference Result 4524 states and 6416 transitions. [2019-09-07 13:13:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:13:17,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-07 13:13:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:17,222 INFO L225 Difference]: With dead ends: 4524 [2019-09-07 13:13:17,222 INFO L226 Difference]: Without dead ends: 4464 [2019-09-07 13:13:17,224 INFO L628 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-09-07 13:13:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4464 states. [2019-09-07 13:13:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4464 to 4455. [2019-09-07 13:13:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4455 states. [2019-09-07 13:13:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 6338 transitions. [2019-09-07 13:13:17,432 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 6338 transitions. Word has length 91 [2019-09-07 13:13:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:17,432 INFO L475 AbstractCegarLoop]: Abstraction has 4455 states and 6338 transitions. [2019-09-07 13:13:17,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:13:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 6338 transitions. [2019-09-07 13:13:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-07 13:13:17,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:17,434 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:17,434 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:17,435 INFO L82 PathProgramCache]: Analyzing trace with hash -645202431, now seen corresponding path program 1 times [2019-09-07 13:13:17,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:17,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:17,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:17,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:17,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:17,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:17,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:13:17,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:13:17,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:13:17,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:13:17,589 INFO L87 Difference]: Start difference. First operand 4455 states and 6338 transitions. Second operand 9 states. [2019-09-07 13:13:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:18,914 INFO L93 Difference]: Finished difference Result 4474 states and 6358 transitions. [2019-09-07 13:13:18,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:13:18,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-07 13:13:18,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:18,923 INFO L225 Difference]: With dead ends: 4474 [2019-09-07 13:13:18,923 INFO L226 Difference]: Without dead ends: 4428 [2019-09-07 13:13:18,925 INFO L628 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-09-07 13:13:18,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2019-09-07 13:13:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 4428. [2019-09-07 13:13:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4428 states. [2019-09-07 13:13:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4428 states to 4428 states and 6310 transitions. [2019-09-07 13:13:19,132 INFO L78 Accepts]: Start accepts. Automaton has 4428 states and 6310 transitions. Word has length 94 [2019-09-07 13:13:19,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:19,132 INFO L475 AbstractCegarLoop]: Abstraction has 4428 states and 6310 transitions. [2019-09-07 13:13:19,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:13:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 6310 transitions. [2019-09-07 13:13:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 13:13:19,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:19,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:19,134 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1559288994, now seen corresponding path program 1 times [2019-09-07 13:13:19,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:19,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:19,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:19,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:19,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:19,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:19,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:13:19,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:13:19,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:13:19,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:13:19,241 INFO L87 Difference]: Start difference. First operand 4428 states and 6310 transitions. Second operand 3 states. [2019-09-07 13:13:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:19,444 INFO L93 Difference]: Finished difference Result 6775 states and 9741 transitions. [2019-09-07 13:13:19,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:13:19,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-07 13:13:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:19,453 INFO L225 Difference]: With dead ends: 6775 [2019-09-07 13:13:19,454 INFO L226 Difference]: Without dead ends: 4444 [2019-09-07 13:13:19,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:13:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4444 states. [2019-09-07 13:13:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4444 to 4431. [2019-09-07 13:13:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4431 states. [2019-09-07 13:13:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 6314 transitions. [2019-09-07 13:13:19,772 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 6314 transitions. Word has length 100 [2019-09-07 13:13:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:19,772 INFO L475 AbstractCegarLoop]: Abstraction has 4431 states and 6314 transitions. [2019-09-07 13:13:19,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:13:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 6314 transitions. [2019-09-07 13:13:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 13:13:19,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:19,774 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:19,775 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:19,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:19,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1211368971, now seen corresponding path program 1 times [2019-09-07 13:13:19,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:19,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:19,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:19,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:19,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:19,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 13:13:19,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:19,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:13:19,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:13:19,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:13:19,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:13:19,897 INFO L87 Difference]: Start difference. First operand 4431 states and 6314 transitions. Second operand 8 states. [2019-09-07 13:13:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:22,231 INFO L93 Difference]: Finished difference Result 4487 states and 6378 transitions. [2019-09-07 13:13:22,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:13:22,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-09-07 13:13:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:22,240 INFO L225 Difference]: With dead ends: 4487 [2019-09-07 13:13:22,241 INFO L226 Difference]: Without dead ends: 4429 [2019-09-07 13:13:22,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:13:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4429 states. [2019-09-07 13:13:22,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4429 to 4429. [2019-09-07 13:13:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4429 states. [2019-09-07 13:13:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4429 states to 4429 states and 6310 transitions. [2019-09-07 13:13:22,464 INFO L78 Accepts]: Start accepts. Automaton has 4429 states and 6310 transitions. Word has length 97 [2019-09-07 13:13:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:22,464 INFO L475 AbstractCegarLoop]: Abstraction has 4429 states and 6310 transitions. [2019-09-07 13:13:22,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:13:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4429 states and 6310 transitions. [2019-09-07 13:13:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 13:13:22,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:22,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:22,467 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1065982173, now seen corresponding path program 1 times [2019-09-07 13:13:22,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:22,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:22,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:22,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:22,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:22,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:22,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:13:22,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:13:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:13:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:13:22,621 INFO L87 Difference]: Start difference. First operand 4429 states and 6310 transitions. Second operand 5 states. [2019-09-07 13:13:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:27,475 INFO L93 Difference]: Finished difference Result 5778 states and 8247 transitions. [2019-09-07 13:13:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:13:27,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-07 13:13:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:27,486 INFO L225 Difference]: With dead ends: 5778 [2019-09-07 13:13:27,486 INFO L226 Difference]: Without dead ends: 4438 [2019-09-07 13:13:27,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:13:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4438 states. [2019-09-07 13:13:27,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4438 to 4426. [2019-09-07 13:13:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4426 states. [2019-09-07 13:13:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 6303 transitions. [2019-09-07 13:13:27,722 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 6303 transitions. Word has length 99 [2019-09-07 13:13:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:27,723 INFO L475 AbstractCegarLoop]: Abstraction has 4426 states and 6303 transitions. [2019-09-07 13:13:27,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:13:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 6303 transitions. [2019-09-07 13:13:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 13:13:27,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:27,725 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:27,725 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash 46133904, now seen corresponding path program 1 times [2019-09-07 13:13:27,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:27,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:27,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:27,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:27,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 13:13:27,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:27,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:13:27,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:13:27,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:13:27,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:13:27,853 INFO L87 Difference]: Start difference. First operand 4426 states and 6303 transitions. Second operand 8 states. [2019-09-07 13:13:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:30,179 INFO L93 Difference]: Finished difference Result 4482 states and 6367 transitions. [2019-09-07 13:13:30,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:13:30,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-09-07 13:13:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:30,188 INFO L225 Difference]: With dead ends: 4482 [2019-09-07 13:13:30,188 INFO L226 Difference]: Without dead ends: 4424 [2019-09-07 13:13:30,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:13:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4424 states. [2019-09-07 13:13:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 4424. [2019-09-07 13:13:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4424 states. [2019-09-07 13:13:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 6299 transitions. [2019-09-07 13:13:30,478 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 6299 transitions. Word has length 96 [2019-09-07 13:13:30,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:30,479 INFO L475 AbstractCegarLoop]: Abstraction has 4424 states and 6299 transitions. [2019-09-07 13:13:30,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:13:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 6299 transitions. [2019-09-07 13:13:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 13:13:30,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:30,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:30,481 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:30,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1848029162, now seen corresponding path program 1 times [2019-09-07 13:13:30,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:30,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:30,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:30,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:30,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:30,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:30,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:13:30,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:13:30,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:13:30,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:13:30,578 INFO L87 Difference]: Start difference. First operand 4424 states and 6299 transitions. Second operand 3 states. [2019-09-07 13:13:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:30,775 INFO L93 Difference]: Finished difference Result 6771 states and 9730 transitions. [2019-09-07 13:13:30,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:13:30,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-07 13:13:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:30,785 INFO L225 Difference]: With dead ends: 6771 [2019-09-07 13:13:30,785 INFO L226 Difference]: Without dead ends: 4440 [2019-09-07 13:13:30,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:13:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4440 states. [2019-09-07 13:13:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4440 to 4424. [2019-09-07 13:13:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4424 states. [2019-09-07 13:13:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 6299 transitions. [2019-09-07 13:13:31,015 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 6299 transitions. Word has length 100 [2019-09-07 13:13:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:31,015 INFO L475 AbstractCegarLoop]: Abstraction has 4424 states and 6299 transitions. [2019-09-07 13:13:31,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:13:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 6299 transitions. [2019-09-07 13:13:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 13:13:31,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:31,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:31,016 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:31,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash -761387094, now seen corresponding path program 1 times [2019-09-07 13:13:31,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:31,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:31,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:31,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:31,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:31,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-09-07 13:13:31,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:31,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:13:31,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:13:31,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:13:31,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:13:31,122 INFO L87 Difference]: Start difference. First operand 4424 states and 6299 transitions. Second operand 3 states. [2019-09-07 13:13:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:31,528 INFO L93 Difference]: Finished difference Result 7931 states and 11421 transitions. [2019-09-07 13:13:31,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:13:31,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-07 13:13:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:31,541 INFO L225 Difference]: With dead ends: 7931 [2019-09-07 13:13:31,542 INFO L226 Difference]: Without dead ends: 5610 [2019-09-07 13:13:31,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:13:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2019-09-07 13:13:31,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 5553. [2019-09-07 13:13:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5553 states. [2019-09-07 13:13:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 7959 transitions. [2019-09-07 13:13:31,818 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 7959 transitions. Word has length 100 [2019-09-07 13:13:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:31,819 INFO L475 AbstractCegarLoop]: Abstraction has 5553 states and 7959 transitions. [2019-09-07 13:13:31,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:13:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 7959 transitions. [2019-09-07 13:13:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 13:13:31,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:31,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:31,820 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:31,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1192745558, now seen corresponding path program 1 times [2019-09-07 13:13:31,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:31,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:31,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:31,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:32,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:32,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 13:13:32,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:13:32,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:13:32,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:13:32,082 INFO L87 Difference]: Start difference. First operand 5553 states and 7959 transitions. Second operand 14 states. [2019-09-07 13:13:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:37,856 INFO L93 Difference]: Finished difference Result 5570 states and 7977 transitions. [2019-09-07 13:13:37,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 13:13:37,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-09-07 13:13:37,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:37,868 INFO L225 Difference]: With dead ends: 5570 [2019-09-07 13:13:37,868 INFO L226 Difference]: Without dead ends: 5506 [2019-09-07 13:13:37,870 INFO L628 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-09-07 13:13:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2019-09-07 13:13:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 5506. [2019-09-07 13:13:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5506 states. [2019-09-07 13:13:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5506 states to 5506 states and 7893 transitions. [2019-09-07 13:13:38,134 INFO L78 Accepts]: Start accepts. Automaton has 5506 states and 7893 transitions. Word has length 97 [2019-09-07 13:13:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:38,135 INFO L475 AbstractCegarLoop]: Abstraction has 5506 states and 7893 transitions. [2019-09-07 13:13:38,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:13:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5506 states and 7893 transitions. [2019-09-07 13:13:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 13:13:38,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:38,136 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:38,136 INFO L418 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:38,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:38,137 INFO L82 PathProgramCache]: Analyzing trace with hash -515610206, now seen corresponding path program 1 times [2019-09-07 13:13:38,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:38,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:38,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:38,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:38,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 13:13:38,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:13:38,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:13:38,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:13:38,372 INFO L87 Difference]: Start difference. First operand 5506 states and 7893 transitions. Second operand 14 states. [2019-09-07 13:13:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:44,425 INFO L93 Difference]: Finished difference Result 5523 states and 7911 transitions. [2019-09-07 13:13:44,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 13:13:44,426 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-09-07 13:13:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:44,437 INFO L225 Difference]: With dead ends: 5523 [2019-09-07 13:13:44,437 INFO L226 Difference]: Without dead ends: 5499 [2019-09-07 13:13:44,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-07 13:13:44,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2019-09-07 13:13:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 5499. [2019-09-07 13:13:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5499 states. [2019-09-07 13:13:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5499 states to 5499 states and 7884 transitions. [2019-09-07 13:13:44,779 INFO L78 Accepts]: Start accepts. Automaton has 5499 states and 7884 transitions. Word has length 98 [2019-09-07 13:13:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:44,780 INFO L475 AbstractCegarLoop]: Abstraction has 5499 states and 7884 transitions. [2019-09-07 13:13:44,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:13:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 5499 states and 7884 transitions. [2019-09-07 13:13:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 13:13:44,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:44,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:44,781 INFO L418 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:44,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1507974481, now seen corresponding path program 1 times [2019-09-07 13:13:44,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:44,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:44,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:44,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:44,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:45,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:45,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 13:13:45,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:13:45,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:13:45,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:13:45,015 INFO L87 Difference]: Start difference. First operand 5499 states and 7884 transitions. Second operand 14 states. [2019-09-07 13:13:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:49,082 INFO L93 Difference]: Finished difference Result 5516 states and 7902 transitions. [2019-09-07 13:13:49,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 13:13:49,082 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-09-07 13:13:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:49,093 INFO L225 Difference]: With dead ends: 5516 [2019-09-07 13:13:49,093 INFO L226 Difference]: Without dead ends: 5492 [2019-09-07 13:13:49,095 INFO L628 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-09-07 13:13:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2019-09-07 13:13:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 5492. [2019-09-07 13:13:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5492 states. [2019-09-07 13:13:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5492 states to 5492 states and 7875 transitions. [2019-09-07 13:13:49,356 INFO L78 Accepts]: Start accepts. Automaton has 5492 states and 7875 transitions. Word has length 97 [2019-09-07 13:13:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:49,356 INFO L475 AbstractCegarLoop]: Abstraction has 5492 states and 7875 transitions. [2019-09-07 13:13:49,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:13:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5492 states and 7875 transitions. [2019-09-07 13:13:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 13:13:49,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:49,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:49,358 INFO L418 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:49,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:49,358 INFO L82 PathProgramCache]: Analyzing trace with hash 738347308, now seen corresponding path program 1 times [2019-09-07 13:13:49,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:49,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:49,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:49,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:49,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:49,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:49,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 13:13:49,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:13:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:13:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:13:49,626 INFO L87 Difference]: Start difference. First operand 5492 states and 7875 transitions. Second operand 14 states. [2019-09-07 13:13:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:13:54,855 INFO L93 Difference]: Finished difference Result 5509 states and 7893 transitions. [2019-09-07 13:13:54,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 13:13:54,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2019-09-07 13:13:54,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:13:54,866 INFO L225 Difference]: With dead ends: 5509 [2019-09-07 13:13:54,867 INFO L226 Difference]: Without dead ends: 5483 [2019-09-07 13:13:54,869 INFO L628 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-09-07 13:13:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2019-09-07 13:13:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5483. [2019-09-07 13:13:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5483 states. [2019-09-07 13:13:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 7863 transitions. [2019-09-07 13:13:55,137 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 7863 transitions. Word has length 107 [2019-09-07 13:13:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:13:55,137 INFO L475 AbstractCegarLoop]: Abstraction has 5483 states and 7863 transitions. [2019-09-07 13:13:55,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:13:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 7863 transitions. [2019-09-07 13:13:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-07 13:13:55,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:13:55,138 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:13:55,139 INFO L418 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:13:55,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:13:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2046190639, now seen corresponding path program 1 times [2019-09-07 13:13:55,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:13:55,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:13:55,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:55,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:13:55,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:13:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:13:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:13:55,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:13:55,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-07 13:13:55,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 13:13:55,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 13:13:55,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-07 13:13:55,387 INFO L87 Difference]: Start difference. First operand 5483 states and 7863 transitions. Second operand 15 states. [2019-09-07 13:14:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:14:01,317 INFO L93 Difference]: Finished difference Result 5500 states and 7881 transitions. [2019-09-07 13:14:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:14:01,318 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-09-07 13:14:01,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:14:01,329 INFO L225 Difference]: With dead ends: 5500 [2019-09-07 13:14:01,329 INFO L226 Difference]: Without dead ends: 5458 [2019-09-07 13:14:01,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-07 13:14:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5458 states. [2019-09-07 13:14:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5458 to 5458. [2019-09-07 13:14:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5458 states. [2019-09-07 13:14:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5458 states to 5458 states and 7836 transitions. [2019-09-07 13:14:01,607 INFO L78 Accepts]: Start accepts. Automaton has 5458 states and 7836 transitions. Word has length 97 [2019-09-07 13:14:01,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:01,607 INFO L475 AbstractCegarLoop]: Abstraction has 5458 states and 7836 transitions. [2019-09-07 13:14:01,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 13:14:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 5458 states and 7836 transitions. [2019-09-07 13:14:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-07 13:14:01,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:01,609 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:14:01,609 INFO L418 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:01,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash 765573323, now seen corresponding path program 1 times [2019-09-07 13:14:01,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:01,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:01,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:01,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:01,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 13:14:01,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:14:01,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:14:01,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:14:01,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:14:01,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:14:01,830 INFO L87 Difference]: Start difference. First operand 5458 states and 7836 transitions. Second operand 8 states. [2019-09-07 13:14:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:14:04,167 INFO L93 Difference]: Finished difference Result 5514 states and 7900 transitions. [2019-09-07 13:14:04,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:14:04,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-07 13:14:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:14:04,179 INFO L225 Difference]: With dead ends: 5514 [2019-09-07 13:14:04,179 INFO L226 Difference]: Without dead ends: 5455 [2019-09-07 13:14:04,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:14:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5455 states. [2019-09-07 13:14:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5455 to 5455. [2019-09-07 13:14:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5455 states. [2019-09-07 13:14:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5455 states to 5455 states and 7831 transitions. [2019-09-07 13:14:04,445 INFO L78 Accepts]: Start accepts. Automaton has 5455 states and 7831 transitions. Word has length 101 [2019-09-07 13:14:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:04,445 INFO L475 AbstractCegarLoop]: Abstraction has 5455 states and 7831 transitions. [2019-09-07 13:14:04,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:14:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5455 states and 7831 transitions. [2019-09-07 13:14:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 13:14:04,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:04,446 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:14:04,447 INFO L418 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:04,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:04,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1584193472, now seen corresponding path program 1 times [2019-09-07 13:14:04,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:04,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:04,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:04,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:04,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:14:04,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:14:04,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:14:04,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:14:04,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:14:04,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:14:04,655 INFO L87 Difference]: Start difference. First operand 5455 states and 7831 transitions. Second operand 9 states. [2019-09-07 13:14:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:14:08,811 INFO L93 Difference]: Finished difference Result 5461 states and 7836 transitions. [2019-09-07 13:14:08,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:14:08,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-07 13:14:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:14:08,822 INFO L225 Difference]: With dead ends: 5461 [2019-09-07 13:14:08,822 INFO L226 Difference]: Without dead ends: 5307 [2019-09-07 13:14:08,824 INFO L628 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-09-07 13:14:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5307 states. [2019-09-07 13:14:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5307 to 5307. [2019-09-07 13:14:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5307 states. [2019-09-07 13:14:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 7643 transitions. [2019-09-07 13:14:09,085 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 7643 transitions. Word has length 99 [2019-09-07 13:14:09,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:09,085 INFO L475 AbstractCegarLoop]: Abstraction has 5307 states and 7643 transitions. [2019-09-07 13:14:09,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:14:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 7643 transitions. [2019-09-07 13:14:09,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 13:14:09,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:09,087 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:14:09,087 INFO L418 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:09,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:09,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1255010522, now seen corresponding path program 1 times [2019-09-07 13:14:09,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:09,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:09,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:09,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:09,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 13:14:09,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:14:09,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:14:09,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:14:09,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:14:09,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:14:09,216 INFO L87 Difference]: Start difference. First operand 5307 states and 7643 transitions. Second operand 8 states. [2019-09-07 13:14:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:14:11,115 INFO L93 Difference]: Finished difference Result 5363 states and 7707 transitions. [2019-09-07 13:14:11,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:14:11,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-07 13:14:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:14:11,127 INFO L225 Difference]: With dead ends: 5363 [2019-09-07 13:14:11,127 INFO L226 Difference]: Without dead ends: 5304 [2019-09-07 13:14:11,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:14:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5304 states. [2019-09-07 13:14:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5304 to 5304. [2019-09-07 13:14:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5304 states. [2019-09-07 13:14:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 7638 transitions. [2019-09-07 13:14:11,388 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 7638 transitions. Word has length 102 [2019-09-07 13:14:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:11,388 INFO L475 AbstractCegarLoop]: Abstraction has 5304 states and 7638 transitions. [2019-09-07 13:14:11,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:14:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 7638 transitions. [2019-09-07 13:14:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-07 13:14:11,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:11,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:14:11,390 INFO L418 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:11,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:11,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1737372550, now seen corresponding path program 1 times [2019-09-07 13:14:11,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:11,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:11,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:14:11,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:14:11,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:14:11,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:14:11,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:14:11,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:14:11,453 INFO L87 Difference]: Start difference. First operand 5304 states and 7638 transitions. Second operand 3 states. [2019-09-07 13:14:12,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:14:12,434 INFO L93 Difference]: Finished difference Result 5306 states and 7639 transitions. [2019-09-07 13:14:12,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:14:12,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-07 13:14:12,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:14:12,445 INFO L225 Difference]: With dead ends: 5306 [2019-09-07 13:14:12,445 INFO L226 Difference]: Without dead ends: 5009 [2019-09-07 13:14:12,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:14:12,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5009 states. [2019-09-07 13:14:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5009 to 5009. [2019-09-07 13:14:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5009 states. [2019-09-07 13:14:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5009 states to 5009 states and 7226 transitions. [2019-09-07 13:14:12,699 INFO L78 Accepts]: Start accepts. Automaton has 5009 states and 7226 transitions. Word has length 105 [2019-09-07 13:14:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:12,699 INFO L475 AbstractCegarLoop]: Abstraction has 5009 states and 7226 transitions. [2019-09-07 13:14:12,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:14:12,700 INFO L276 IsEmpty]: Start isEmpty. Operand 5009 states and 7226 transitions. [2019-09-07 13:14:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-07 13:14:12,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:12,701 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:14:12,701 INFO L418 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:12,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1094519463, now seen corresponding path program 1 times [2019-09-07 13:14:12,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:12,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:12,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 13:14:12,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:14:12,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 13:14:12,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 13:14:12,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 13:14:12,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:14:12,954 INFO L87 Difference]: Start difference. First operand 5009 states and 7226 transitions. Second operand 11 states. [2019-09-07 13:14:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:14:15,308 INFO L93 Difference]: Finished difference Result 5060 states and 7284 transitions. [2019-09-07 13:14:15,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:14:15,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-07 13:14:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:14:15,319 INFO L225 Difference]: With dead ends: 5060 [2019-09-07 13:14:15,319 INFO L226 Difference]: Without dead ends: 4980 [2019-09-07 13:14:15,321 INFO L628 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-09-07 13:14:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4980 states. [2019-09-07 13:14:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4980 to 4980. [2019-09-07 13:14:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4980 states. [2019-09-07 13:14:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4980 states to 4980 states and 7193 transitions. [2019-09-07 13:14:15,570 INFO L78 Accepts]: Start accepts. Automaton has 4980 states and 7193 transitions. Word has length 105 [2019-09-07 13:14:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:15,570 INFO L475 AbstractCegarLoop]: Abstraction has 4980 states and 7193 transitions. [2019-09-07 13:14:15,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 13:14:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4980 states and 7193 transitions. [2019-09-07 13:14:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 13:14:15,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:15,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:14:15,572 INFO L418 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:15,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:15,572 INFO L82 PathProgramCache]: Analyzing trace with hash -799423163, now seen corresponding path program 1 times [2019-09-07 13:14:15,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:15,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:15,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:15,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:15,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:14:15,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:14:15,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:14:15,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:14:15,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:14:15,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:14:15,709 INFO L87 Difference]: Start difference. First operand 4980 states and 7193 transitions. Second operand 6 states. [2019-09-07 13:14:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:14:18,002 INFO L93 Difference]: Finished difference Result 8427 states and 12247 transitions. [2019-09-07 13:14:18,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:14:18,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-09-07 13:14:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:14:18,013 INFO L225 Difference]: With dead ends: 8427 [2019-09-07 13:14:18,014 INFO L226 Difference]: Without dead ends: 5020 [2019-09-07 13:14:18,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:14:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2019-09-07 13:14:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 5002. [2019-09-07 13:14:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5002 states. [2019-09-07 13:14:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5002 states to 5002 states and 7220 transitions. [2019-09-07 13:14:18,275 INFO L78 Accepts]: Start accepts. Automaton has 5002 states and 7220 transitions. Word has length 111 [2019-09-07 13:14:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:18,275 INFO L475 AbstractCegarLoop]: Abstraction has 5002 states and 7220 transitions. [2019-09-07 13:14:18,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:14:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5002 states and 7220 transitions. [2019-09-07 13:14:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 13:14:18,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:18,276 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:14:18,276 INFO L418 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2079286841, now seen corresponding path program 1 times [2019-09-07 13:14:18,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:18,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:18,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:18,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:18,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:18,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-09-07 13:14:18,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:14:18,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:14:18,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:14:18,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:14:18,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:14:18,441 INFO L87 Difference]: Start difference. First operand 5002 states and 7220 transitions. Second operand 9 states. [2019-09-07 13:14:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:14:20,808 INFO L93 Difference]: Finished difference Result 5458 states and 7835 transitions. [2019-09-07 13:14:20,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:14:20,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-07 13:14:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:14:20,819 INFO L225 Difference]: With dead ends: 5458 [2019-09-07 13:14:20,820 INFO L226 Difference]: Without dead ends: 5087 [2019-09-07 13:14:20,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:14:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5087 states. [2019-09-07 13:14:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5087 to 5020. [2019-09-07 13:14:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5020 states. [2019-09-07 13:14:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 7242 transitions. [2019-09-07 13:14:21,073 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 7242 transitions. Word has length 111 [2019-09-07 13:14:21,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:21,073 INFO L475 AbstractCegarLoop]: Abstraction has 5020 states and 7242 transitions. [2019-09-07 13:14:21,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:14:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 7242 transitions. [2019-09-07 13:14:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 13:14:21,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:21,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:14:21,075 INFO L418 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1392010840, now seen corresponding path program 1 times [2019-09-07 13:14:21,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:21,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:21,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:21,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:21,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:14:21,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:14:21,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:14:21,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:14:21,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:14:21,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:14:21,251 INFO L87 Difference]: Start difference. First operand 5020 states and 7242 transitions. Second operand 9 states. [2019-09-07 13:14:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:14:23,641 INFO L93 Difference]: Finished difference Result 8126 states and 11841 transitions. [2019-09-07 13:14:23,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:14:23,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-07 13:14:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:14:23,653 INFO L225 Difference]: With dead ends: 8126 [2019-09-07 13:14:23,653 INFO L226 Difference]: Without dead ends: 5041 [2019-09-07 13:14:23,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:14:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5041 states. [2019-09-07 13:14:23,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5041 to 5028. [2019-09-07 13:14:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5028 states. [2019-09-07 13:14:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 7250 transitions. [2019-09-07 13:14:23,932 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 7250 transitions. Word has length 111 [2019-09-07 13:14:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:14:23,932 INFO L475 AbstractCegarLoop]: Abstraction has 5028 states and 7250 transitions. [2019-09-07 13:14:23,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:14:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 7250 transitions. [2019-09-07 13:14:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 13:14:23,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:14:23,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:14:23,933 INFO L418 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:14:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:14:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1319118770, now seen corresponding path program 1 times [2019-09-07 13:14:23,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:14:23,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:14:23,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:23,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:14:23,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:14:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:14:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:14:24,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:14:24,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:14:24,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:14:24,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:14:24,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:14:24,208 INFO L87 Difference]: Start difference. First operand 5028 states and 7250 transitions. Second operand 8 states. [2019-09-07 13:16:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:16:00,238 INFO L93 Difference]: Finished difference Result 10586 states and 15236 transitions. [2019-09-07 13:16:00,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:16:00,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-09-07 13:16:00,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:16:00,268 INFO L225 Difference]: With dead ends: 10586 [2019-09-07 13:16:00,268 INFO L226 Difference]: Without dead ends: 10104 [2019-09-07 13:16:00,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-09-07 13:16:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10104 states. [2019-09-07 13:16:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10104 to 9090. [2019-09-07 13:16:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9090 states. [2019-09-07 13:16:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9090 states to 9090 states and 13124 transitions. [2019-09-07 13:16:00,879 INFO L78 Accepts]: Start accepts. Automaton has 9090 states and 13124 transitions. Word has length 112 [2019-09-07 13:16:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:16:00,880 INFO L475 AbstractCegarLoop]: Abstraction has 9090 states and 13124 transitions. [2019-09-07 13:16:00,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:16:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 9090 states and 13124 transitions. [2019-09-07 13:16:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 13:16:00,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:16:00,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:16:00,882 INFO L418 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:16:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:16:00,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1695984848, now seen corresponding path program 1 times [2019-09-07 13:16:00,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:16:00,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:16:00,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:00,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:00,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:16:00,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:16:00,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:16:00,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:16:00,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:16:00,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:16:00,990 INFO L87 Difference]: Start difference. First operand 9090 states and 13124 transitions. Second operand 4 states. [2019-09-07 13:16:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:16:01,508 INFO L93 Difference]: Finished difference Result 17644 states and 25644 transitions. [2019-09-07 13:16:01,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:16:01,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-07 13:16:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:16:01,542 INFO L225 Difference]: With dead ends: 17644 [2019-09-07 13:16:01,542 INFO L226 Difference]: Without dead ends: 9124 [2019-09-07 13:16:01,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:16:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9124 states. [2019-09-07 13:16:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9124 to 9124. [2019-09-07 13:16:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9124 states. [2019-09-07 13:16:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9124 states to 9124 states and 13174 transitions. [2019-09-07 13:16:02,086 INFO L78 Accepts]: Start accepts. Automaton has 9124 states and 13174 transitions. Word has length 112 [2019-09-07 13:16:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:16:02,087 INFO L475 AbstractCegarLoop]: Abstraction has 9124 states and 13174 transitions. [2019-09-07 13:16:02,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:16:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 9124 states and 13174 transitions. [2019-09-07 13:16:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 13:16:02,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:16:02,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:16:02,089 INFO L418 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:16:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:16:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash -298592059, now seen corresponding path program 1 times [2019-09-07 13:16:02,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:16:02,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:16:02,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:02,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:02,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 13:16:02,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:16:02,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:16:02,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:16:02,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:16:02,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:16:02,213 INFO L87 Difference]: Start difference. First operand 9124 states and 13174 transitions. Second operand 4 states. [2019-09-07 13:16:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:16:02,804 INFO L93 Difference]: Finished difference Result 17724 states and 25754 transitions. [2019-09-07 13:16:02,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:16:02,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-07 13:16:02,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:16:02,828 INFO L225 Difference]: With dead ends: 17724 [2019-09-07 13:16:02,828 INFO L226 Difference]: Without dead ends: 9174 [2019-09-07 13:16:02,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:16:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9174 states. [2019-09-07 13:16:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9174 to 9134. [2019-09-07 13:16:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9134 states. [2019-09-07 13:16:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9134 states to 9134 states and 13192 transitions. [2019-09-07 13:16:03,556 INFO L78 Accepts]: Start accepts. Automaton has 9134 states and 13192 transitions. Word has length 113 [2019-09-07 13:16:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:16:03,557 INFO L475 AbstractCegarLoop]: Abstraction has 9134 states and 13192 transitions. [2019-09-07 13:16:03,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:16:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 9134 states and 13192 transitions. [2019-09-07 13:16:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-07 13:16:03,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:16:03,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:16:03,560 INFO L418 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:16:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:16:03,561 INFO L82 PathProgramCache]: Analyzing trace with hash -658667282, now seen corresponding path program 1 times [2019-09-07 13:16:03,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:16:03,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:16:03,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:03,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:03,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 13:16:03,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:16:03,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:16:03,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:04,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 2291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 13:16:04,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:16:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 13:16:04,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 13:16:04,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 13:16:04,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:16:04,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:16:04,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:16:04,564 INFO L87 Difference]: Start difference. First operand 9134 states and 13192 transitions. Second operand 6 states. [2019-09-07 13:16:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:16:05,603 INFO L93 Difference]: Finished difference Result 17770 states and 25826 transitions. [2019-09-07 13:16:05,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:16:05,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-09-07 13:16:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:16:05,666 INFO L225 Difference]: With dead ends: 17770 [2019-09-07 13:16:05,667 INFO L226 Difference]: Without dead ends: 9208 [2019-09-07 13:16:05,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:16:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9208 states. [2019-09-07 13:16:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9208 to 9144. [2019-09-07 13:16:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9144 states. [2019-09-07 13:16:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9144 states to 9144 states and 13210 transitions. [2019-09-07 13:16:06,862 INFO L78 Accepts]: Start accepts. Automaton has 9144 states and 13210 transitions. Word has length 114 [2019-09-07 13:16:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:16:06,864 INFO L475 AbstractCegarLoop]: Abstraction has 9144 states and 13210 transitions. [2019-09-07 13:16:06,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:16:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 9144 states and 13210 transitions. [2019-09-07 13:16:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-07 13:16:06,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:16:06,872 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:16:06,873 INFO L418 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:16:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:16:06,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1891660893, now seen corresponding path program 2 times [2019-09-07 13:16:06,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:16:06,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:16:06,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:06,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 13:16:07,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:16:07,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 13:16:07,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 13:16:07,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-07 13:16:07,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 13:16:07,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 2245 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 13:16:07,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:16:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 13:16:07,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:16:07,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 13:16:07,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:16:07,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:16:07,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:16:07,883 INFO L87 Difference]: Start difference. First operand 9144 states and 13210 transitions. Second operand 9 states. [2019-09-07 13:16:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:16:09,477 INFO L93 Difference]: Finished difference Result 17798 states and 25878 transitions. [2019-09-07 13:16:09,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:16:09,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-07 13:16:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:16:09,522 INFO L225 Difference]: With dead ends: 17798 [2019-09-07 13:16:09,522 INFO L226 Difference]: Without dead ends: 9228 [2019-09-07 13:16:09,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:16:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2019-09-07 13:16:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 9140. [2019-09-07 13:16:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9140 states. [2019-09-07 13:16:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9140 states to 9140 states and 13208 transitions. [2019-09-07 13:16:10,654 INFO L78 Accepts]: Start accepts. Automaton has 9140 states and 13208 transitions. Word has length 115 [2019-09-07 13:16:10,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:16:10,655 INFO L475 AbstractCegarLoop]: Abstraction has 9140 states and 13208 transitions. [2019-09-07 13:16:10,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:16:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 9140 states and 13208 transitions. [2019-09-07 13:16:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-07 13:16:10,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:16:10,658 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:16:10,659 INFO L418 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:16:10,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:16:10,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1777113685, now seen corresponding path program 1 times [2019-09-07 13:16:10,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:16:10,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:16:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:10,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 13:16:10,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 13:16:10,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:16:10,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:16:10,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:16:10,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:16:10,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:16:10,888 INFO L87 Difference]: Start difference. First operand 9140 states and 13208 transitions. Second operand 5 states. [2019-09-07 13:16:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:16:14,245 INFO L93 Difference]: Finished difference Result 13733 states and 19973 transitions. [2019-09-07 13:16:14,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:16:14,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-07 13:16:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:16:14,285 INFO L225 Difference]: With dead ends: 13733 [2019-09-07 13:16:14,285 INFO L226 Difference]: Without dead ends: 9066 [2019-09-07 13:16:14,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:16:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9066 states. [2019-09-07 13:16:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9066 to 9066. [2019-09-07 13:16:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9066 states. [2019-09-07 13:16:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 13114 transitions. [2019-09-07 13:16:14,980 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 13114 transitions. Word has length 120 [2019-09-07 13:16:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:16:14,980 INFO L475 AbstractCegarLoop]: Abstraction has 9066 states and 13114 transitions. [2019-09-07 13:16:14,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:16:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 13114 transitions. [2019-09-07 13:16:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 13:16:14,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:16:14,984 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:16:14,984 INFO L418 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:16:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:16:14,984 INFO L82 PathProgramCache]: Analyzing trace with hash 163834893, now seen corresponding path program 1 times [2019-09-07 13:16:14,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:16:14,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:16:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:14,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:14,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 13:16:15,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:16:15,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-07 13:16:15,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 13:16:15,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 13:16:15,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:16:15,187 INFO L87 Difference]: Start difference. First operand 9066 states and 13114 transitions. Second operand 10 states. [2019-09-07 13:16:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:16:17,792 INFO L93 Difference]: Finished difference Result 9183 states and 13240 transitions. [2019-09-07 13:16:17,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 13:16:17,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 119 [2019-09-07 13:16:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:16:17,827 INFO L225 Difference]: With dead ends: 9183 [2019-09-07 13:16:17,827 INFO L226 Difference]: Without dead ends: 9097 [2019-09-07 13:16:17,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:16:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9097 states. [2019-09-07 13:16:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9097 to 9062. [2019-09-07 13:16:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9062 states. [2019-09-07 13:16:19,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9062 states to 9062 states and 13104 transitions. [2019-09-07 13:16:19,571 INFO L78 Accepts]: Start accepts. Automaton has 9062 states and 13104 transitions. Word has length 119 [2019-09-07 13:16:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:16:19,572 INFO L475 AbstractCegarLoop]: Abstraction has 9062 states and 13104 transitions. [2019-09-07 13:16:19,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 13:16:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 9062 states and 13104 transitions. [2019-09-07 13:16:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 13:16:19,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:16:19,575 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:16:19,575 INFO L418 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:16:19,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:16:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash 150143568, now seen corresponding path program 1 times [2019-09-07 13:16:19,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:16:19,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:16:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:19,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 13:16:19,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:16:19,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:16:19,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:16:19,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:16:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:16:19,773 INFO L87 Difference]: Start difference. First operand 9062 states and 13104 transitions. Second operand 6 states. [2019-09-07 13:16:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:16:51,048 INFO L93 Difference]: Finished difference Result 9427 states and 13583 transitions. [2019-09-07 13:16:51,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:16:51,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-09-07 13:16:51,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:16:51,061 INFO L225 Difference]: With dead ends: 9427 [2019-09-07 13:16:51,061 INFO L226 Difference]: Without dead ends: 4820 [2019-09-07 13:16:51,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:16:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2019-09-07 13:16:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4482. [2019-09-07 13:16:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4482 states. [2019-09-07 13:16:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4482 states to 4482 states and 6335 transitions. [2019-09-07 13:16:51,376 INFO L78 Accepts]: Start accepts. Automaton has 4482 states and 6335 transitions. Word has length 122 [2019-09-07 13:16:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:16:51,376 INFO L475 AbstractCegarLoop]: Abstraction has 4482 states and 6335 transitions. [2019-09-07 13:16:51,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:16:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4482 states and 6335 transitions. [2019-09-07 13:16:51,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-07 13:16:51,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:16:51,379 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:16:51,379 INFO L418 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:16:51,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:16:51,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1519357897, now seen corresponding path program 1 times [2019-09-07 13:16:51,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:16:51,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:16:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:51,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:16:51,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:16:51,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-07 13:16:51,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 13:16:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 13:16:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:16:51,638 INFO L87 Difference]: Start difference. First operand 4482 states and 6335 transitions. Second operand 12 states. [2019-09-07 13:16:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:16:56,162 INFO L93 Difference]: Finished difference Result 4488 states and 6340 transitions. [2019-09-07 13:16:56,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 13:16:56,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 117 [2019-09-07 13:16:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:16:56,171 INFO L225 Difference]: With dead ends: 4488 [2019-09-07 13:16:56,171 INFO L226 Difference]: Without dead ends: 4338 [2019-09-07 13:16:56,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-09-07 13:16:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2019-09-07 13:16:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4338. [2019-09-07 13:16:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4338 states. [2019-09-07 13:16:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 6160 transitions. [2019-09-07 13:16:56,671 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 6160 transitions. Word has length 117 [2019-09-07 13:16:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:16:56,671 INFO L475 AbstractCegarLoop]: Abstraction has 4338 states and 6160 transitions. [2019-09-07 13:16:56,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 13:16:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 6160 transitions. [2019-09-07 13:16:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-07 13:16:56,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:16:56,675 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:16:56,676 INFO L418 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:16:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:16:56,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1916151773, now seen corresponding path program 1 times [2019-09-07 13:16:56,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:16:56,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:16:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:56,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 13:16:56,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:16:56,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-07 13:16:56,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 13:16:56,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 13:16:56,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:16:56,934 INFO L87 Difference]: Start difference. First operand 4338 states and 6160 transitions. Second operand 10 states. [2019-09-07 13:16:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:16:59,289 INFO L93 Difference]: Finished difference Result 4403 states and 6232 transitions. [2019-09-07 13:16:59,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 13:16:59,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2019-09-07 13:16:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:16:59,299 INFO L225 Difference]: With dead ends: 4403 [2019-09-07 13:16:59,299 INFO L226 Difference]: Without dead ends: 4253 [2019-09-07 13:16:59,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-07 13:16:59,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2019-09-07 13:16:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 4238. [2019-09-07 13:16:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4238 states. [2019-09-07 13:16:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 6038 transitions. [2019-09-07 13:16:59,571 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 6038 transitions. Word has length 124 [2019-09-07 13:16:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:16:59,571 INFO L475 AbstractCegarLoop]: Abstraction has 4238 states and 6038 transitions. [2019-09-07 13:16:59,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 13:16:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 6038 transitions. [2019-09-07 13:16:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 13:16:59,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:16:59,573 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:16:59,573 INFO L418 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:16:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:16:59,573 INFO L82 PathProgramCache]: Analyzing trace with hash 153626585, now seen corresponding path program 1 times [2019-09-07 13:16:59,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:16:59,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:16:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:59,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:16:59,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:16:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:16:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-09-07 13:16:59,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:16:59,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:16:59,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:16:59,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:16:59,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:16:59,768 INFO L87 Difference]: Start difference. First operand 4238 states and 6038 transitions. Second operand 7 states. [2019-09-07 13:17:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:17:00,574 INFO L93 Difference]: Finished difference Result 4300 states and 6107 transitions. [2019-09-07 13:17:00,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:17:00,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-09-07 13:17:00,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:17:00,582 INFO L225 Difference]: With dead ends: 4300 [2019-09-07 13:17:00,582 INFO L226 Difference]: Without dead ends: 4238 [2019-09-07 13:17:00,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:17:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4238 states. [2019-09-07 13:17:00,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4238 to 4232. [2019-09-07 13:17:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4232 states. [2019-09-07 13:17:00,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 6028 transitions. [2019-09-07 13:17:00,811 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 6028 transitions. Word has length 147 [2019-09-07 13:17:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:17:00,811 INFO L475 AbstractCegarLoop]: Abstraction has 4232 states and 6028 transitions. [2019-09-07 13:17:00,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:17:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 6028 transitions. [2019-09-07 13:17:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-07 13:17:00,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:17:00,813 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:17:00,813 INFO L418 AbstractCegarLoop]: === Iteration 92 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:17:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:17:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash 766842637, now seen corresponding path program 1 times [2019-09-07 13:17:00,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:17:00,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:17:00,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:17:00,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:17:00,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:17:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:17:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-09-07 13:17:00,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:17:00,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:17:00,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:17:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:17:00,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:17:00,951 INFO L87 Difference]: Start difference. First operand 4232 states and 6028 transitions. Second operand 7 states. [2019-09-07 13:17:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:17:03,181 INFO L93 Difference]: Finished difference Result 4244 states and 6039 transitions. [2019-09-07 13:17:03,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:17:03,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-07 13:17:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:17:03,194 INFO L225 Difference]: With dead ends: 4244 [2019-09-07 13:17:03,194 INFO L226 Difference]: Without dead ends: 4030 [2019-09-07 13:17:03,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:17:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4030 states. [2019-09-07 13:17:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4030 to 4024. [2019-09-07 13:17:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4024 states. [2019-09-07 13:17:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4024 states to 4024 states and 5780 transitions. [2019-09-07 13:17:03,513 INFO L78 Accepts]: Start accepts. Automaton has 4024 states and 5780 transitions. Word has length 146 [2019-09-07 13:17:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:17:03,513 INFO L475 AbstractCegarLoop]: Abstraction has 4024 states and 5780 transitions. [2019-09-07 13:17:03,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:17:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 4024 states and 5780 transitions. [2019-09-07 13:17:03,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-07 13:17:03,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:17:03,516 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:17:03,516 INFO L418 AbstractCegarLoop]: === Iteration 93 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:17:03,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:17:03,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1537437513, now seen corresponding path program 1 times [2019-09-07 13:17:03,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:17:03,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:17:03,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:17:03,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:17:03,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:17:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:17:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 13:17:03,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:17:03,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:17:03,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:17:03,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:17:03,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:17:03,752 INFO L87 Difference]: Start difference. First operand 4024 states and 5780 transitions. Second operand 8 states. [2019-09-07 13:17:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:17:23,363 INFO L93 Difference]: Finished difference Result 5592 states and 8020 transitions. [2019-09-07 13:17:23,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:17:23,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 152 [2019-09-07 13:17:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:17:23,378 INFO L225 Difference]: With dead ends: 5592 [2019-09-07 13:17:23,378 INFO L226 Difference]: Without dead ends: 4024 [2019-09-07 13:17:23,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:17:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2019-09-07 13:17:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 4024. [2019-09-07 13:17:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4024 states. [2019-09-07 13:17:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4024 states to 4024 states and 5778 transitions. [2019-09-07 13:17:23,601 INFO L78 Accepts]: Start accepts. Automaton has 4024 states and 5778 transitions. Word has length 152 [2019-09-07 13:17:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:17:23,601 INFO L475 AbstractCegarLoop]: Abstraction has 4024 states and 5778 transitions. [2019-09-07 13:17:23,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:17:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4024 states and 5778 transitions. [2019-09-07 13:17:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-07 13:17:23,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:17:23,604 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:17:23,604 INFO L418 AbstractCegarLoop]: === Iteration 94 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:17:23,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:17:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash -546957030, now seen corresponding path program 1 times [2019-09-07 13:17:23,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:17:23,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:17:23,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:17:23,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:17:23,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:17:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:17:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 13:17:23,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:17:23,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:17:23,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:17:23,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:17:23,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:17:23,876 INFO L87 Difference]: Start difference. First operand 4024 states and 5778 transitions. Second operand 9 states. [2019-09-07 13:17:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:17:26,282 INFO L93 Difference]: Finished difference Result 4119 states and 5935 transitions. [2019-09-07 13:17:26,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:17:26,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 152 [2019-09-07 13:17:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:17:26,289 INFO L225 Difference]: With dead ends: 4119 [2019-09-07 13:17:26,289 INFO L226 Difference]: Without dead ends: 4020 [2019-09-07 13:17:26,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:17:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2019-09-07 13:17:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 4016. [2019-09-07 13:17:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4016 states. [2019-09-07 13:17:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4016 states to 4016 states and 5762 transitions. [2019-09-07 13:17:26,504 INFO L78 Accepts]: Start accepts. Automaton has 4016 states and 5762 transitions. Word has length 152 [2019-09-07 13:17:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:17:26,504 INFO L475 AbstractCegarLoop]: Abstraction has 4016 states and 5762 transitions. [2019-09-07 13:17:26,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:17:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4016 states and 5762 transitions. [2019-09-07 13:17:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 13:17:26,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:17:26,506 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:17:26,507 INFO L418 AbstractCegarLoop]: === Iteration 95 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:17:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:17:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1982204740, now seen corresponding path program 1 times [2019-09-07 13:17:26,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:17:26,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:17:26,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:17:26,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:17:26,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:17:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:17:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 13:17:26,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:17:26,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-07 13:17:26,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 13:17:26,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 13:17:26,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-07 13:17:26,897 INFO L87 Difference]: Start difference. First operand 4016 states and 5762 transitions. Second operand 15 states. [2019-09-07 13:17:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:17:30,251 INFO L93 Difference]: Finished difference Result 5552 states and 7948 transitions. [2019-09-07 13:17:30,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:17:30,251 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 154 [2019-09-07 13:17:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:17:30,262 INFO L225 Difference]: With dead ends: 5552 [2019-09-07 13:17:30,263 INFO L226 Difference]: Without dead ends: 3780 [2019-09-07 13:17:30,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-07 13:17:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2019-09-07 13:17:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 3595. [2019-09-07 13:17:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3595 states. [2019-09-07 13:17:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 5168 transitions. [2019-09-07 13:17:30,462 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 5168 transitions. Word has length 154 [2019-09-07 13:17:30,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:17:30,462 INFO L475 AbstractCegarLoop]: Abstraction has 3595 states and 5168 transitions. [2019-09-07 13:17:30,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 13:17:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 5168 transitions. [2019-09-07 13:17:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 13:17:30,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:17:30,464 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:17:30,464 INFO L418 AbstractCegarLoop]: === Iteration 96 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:17:30,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:17:30,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1835372920, now seen corresponding path program 1 times [2019-09-07 13:17:30,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:17:30,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:17:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:17:30,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:17:30,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:17:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:17:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 13:17:30,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:17:30,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-07 13:17:30,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 13:17:30,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 13:17:30,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:17:30,771 INFO L87 Difference]: Start difference. First operand 3595 states and 5168 transitions. Second operand 10 states.