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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:52:03,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:52:03,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:52:03,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:52:03,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:52:03,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:52:03,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:52:03,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:52:03,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:52:03,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:52:03,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:52:03,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:52:03,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:52:03,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:52:03,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:52:03,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:52:03,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:52:03,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:52:03,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:52:03,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:52:03,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:52:03,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:52:03,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:52:03,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:52:03,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:52:03,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:52:03,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:52:03,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:52:03,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:52:03,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:52:03,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:52:03,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:52:03,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:52:03,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:52:03,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:52:03,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:52:03,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:52:03,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:52:03,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:52:03,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:52:03,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:52:03,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:52:03,802 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:52:03,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:52:03,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:52:03,805 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:52:03,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:52:03,805 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:52:03,806 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:52:03,806 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:52:03,806 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:52:03,806 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:52:03,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:52:03,809 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:52:03,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:52:03,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:52:03,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:52:03,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:52:03,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:52:03,810 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:52:03,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:52:03,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:52:03,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:52:03,812 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:52:03,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:52:03,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:52:03,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:52:03,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:52:03,813 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:52:03,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:52:03,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:52:03,813 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:52:03,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:52:03,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:52:03,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:52:03,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:52:03,878 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:52:03,879 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-09 05:52:03,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5e6e416/90ce939026754f77a273d0d2729a6529/FLAGd43b183ff [2019-09-09 05:52:04,830 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:52:04,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/parport.i.cil-2.c [2019-09-09 05:52:04,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5e6e416/90ce939026754f77a273d0d2729a6529/FLAGd43b183ff [2019-09-09 05:52:05,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5e6e416/90ce939026754f77a273d0d2729a6529 [2019-09-09 05:52:05,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:52:05,247 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:52:05,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:52:05,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:52:05,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:52:05,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:52:05" (1/1) ... [2019-09-09 05:52:05,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ffcf0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:05, skipping insertion in model container [2019-09-09 05:52:05,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:52:05" (1/1) ... [2019-09-09 05:52:05,264 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:52:05,444 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:52:07,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:52:07,650 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:52:08,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:52:08,469 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:52:08,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:08 WrapperNode [2019-09-09 05:52:08,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:52:08,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:52:08,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:52:08,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:52:08,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:08" (1/1) ... [2019-09-09 05:52:08,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:08" (1/1) ... [2019-09-09 05:52:08,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:08" (1/1) ... [2019-09-09 05:52:08,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:08" (1/1) ... [2019-09-09 05:52:08,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:08" (1/1) ... [2019-09-09 05:52:09,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:08" (1/1) ... [2019-09-09 05:52:09,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:08" (1/1) ... [2019-09-09 05:52:09,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:52:09,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:52:09,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:52:09,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:52:09,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:08" (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-09 05:52:09,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:52:09,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:52:09,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2019-09-09 05:52:09,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2019-09-09 05:52:09,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PVOID~0~TO~VOID [2019-09-09 05:52:09,196 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2019-09-09 05:52:09,196 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlIntegerToUnicodeString [2019-09-09 05:52:09,196 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlUnicodeStringToInteger [2019-09-09 05:52:09,197 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareUnicodeString [2019-09-09 05:52:09,197 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAppendUnicodeStringToString [2019-09-09 05:52:09,197 INFO L138 BoogieDeclarations]: Found implementation of procedure READ_PORT_UCHAR [2019-09-09 05:52:09,197 INFO L138 BoogieDeclarations]: Found implementation of procedure WRITE_PORT_UCHAR [2019-09-09 05:52:09,198 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2019-09-09 05:52:09,198 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2019-09-09 05:52:09,198 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2019-09-09 05:52:09,198 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeDpc [2019-09-09 05:52:09,198 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInsertQueueDpc [2019-09-09 05:52:09,198 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSynchronizeExecution [2019-09-09 05:52:09,199 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTimeIncrement [2019-09-09 05:52:09,202 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireCancelSpinLock [2019-09-09 05:52:09,203 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateErrorLogEntry [2019-09-09 05:52:09,203 INFO L138 BoogieDeclarations]: Found implementation of procedure IoConnectInterrupt [2019-09-09 05:52:09,203 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReportResourceUsage [2019-09-09 05:52:09,203 INFO L138 BoogieDeclarations]: Found implementation of procedure IoInitializeRemoveLockEx [2019-09-09 05:52:09,204 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockEx [2019-09-09 05:52:09,204 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseRemoveLockAndWaitEx [2019-09-09 05:52:09,204 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWriteErrorLogEntry [2019-09-09 05:52:09,205 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2019-09-09 05:52:09,205 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2019-09-09 05:52:09,205 INFO L138 BoogieDeclarations]: Found implementation of procedure KeStallExecutionProcessor [2019-09-09 05:52:09,205 INFO L138 BoogieDeclarations]: Found implementation of procedure PoRequestPowerIrp [2019-09-09 05:52:09,205 INFO L138 BoogieDeclarations]: Found implementation of procedure PoSetPowerState [2019-09-09 05:52:09,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfReferenceObject [2019-09-09 05:52:09,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwQueryValueKey [2019-09-09 05:52:09,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwSetValueKey [2019-09-09 05:52:09,206 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiCompleteRequest [2019-09-09 05:52:09,206 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-09 05:52:09,206 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCleanup [2019-09-09 05:52:09,206 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpPnpIrpInfo [2019-09-09 05:52:09,206 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLock [2019-09-09 05:52:09,207 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLock [2019-09-09 05:52:09,207 INFO L138 BoogieDeclarations]: Found implementation of procedure PptReleaseRemoveLockAndWait [2019-09-09 05:52:09,207 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceList [2019-09-09 05:52:09,207 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDebugDumpResourceRequirementsList [2019-09-09 05:52:09,207 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLogError [2019-09-09 05:52:09,207 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2019-09-09 05:52:09,207 INFO L138 BoogieDeclarations]: Found implementation of procedure PptUnload [2019-09-09 05:52:09,208 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCleanRemovalRelationsList [2019-09-09 05:52:09,208 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAddPptRemovalRelation [2019-09-09 05:52:09,208 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRemovePptRemovalRelation [2019-09-09 05:52:09,208 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpRemovalRelationsList [2019-09-09 05:52:09,208 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDumpPptRemovalRelationsStruct [2019-09-09 05:52:09,208 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchInternalDeviceControl [2019-09-09 05:52:09,208 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsNecR98Machine [2019-09-09 05:52:09,209 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchCreate [2019-09-09 05:52:09,209 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchClose [2019-09-09 05:52:09,209 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitiate1284_3 [2019-09-09 05:52:09,209 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectDevice [2019-09-09 05:52:09,210 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectDevice [2019-09-09 05:52:09,210 INFO L138 BoogieDeclarations]: Found implementation of procedure Ppt1284_3AssignAddress [2019-09-09 05:52:09,210 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfNon1284_3Present [2019-09-09 05:52:09,210 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStl1284_3 [2019-09-09 05:52:09,211 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckIfStlProductId [2019-09-09 05:52:09,211 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSend1284_3Command [2019-09-09 05:52:09,211 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectChipFilter [2019-09-09 05:52:09,211 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortType [2019-09-09 05:52:09,212 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectPortCapabilities [2019-09-09 05:52:09,212 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEcpPort [2019-09-09 05:52:09,212 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfDot3DevicePresent [2019-09-09 05:52:09,212 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPortIfUserRequested [2019-09-09 05:52:09,213 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectEppPort [2019-09-09 05:52:09,213 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetectBytePort [2019-09-09 05:52:09,213 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoDepth [2019-09-09 05:52:09,214 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDetermineFifoWidth [2019-09-09 05:52:09,214 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetChipMode [2019-09-09 05:52:09,214 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearChipMode [2019-09-09 05:52:09,214 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrSetMode [2019-09-09 05:52:09,215 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetByteMode [2019-09-09 05:52:09,215 INFO L138 BoogieDeclarations]: Found implementation of procedure PptClearByteMode [2019-09-09 05:52:09,216 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCheckByteMode [2019-09-09 05:52:09,216 INFO L138 BoogieDeclarations]: Found implementation of procedure PptEcrClearMode [2019-09-09 05:52:09,216 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFindNatChip [2019-09-09 05:52:09,216 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildResourceList [2019-09-09 05:52:09,217 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBuildRemovalRelations [2019-09-09 05:52:09,217 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanPciCardCmResourceList [2019-09-09 05:52:09,218 INFO L138 BoogieDeclarations]: Found implementation of procedure PptIsPci [2019-09-09 05:52:09,218 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCompleteRequest [2019-09-09 05:52:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpInitDispatchFunctionTable [2019-09-09 05:52:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpAddDevice [2019-09-09 05:52:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPnp [2019-09-09 05:52:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartDevice [2019-09-09 05:52:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartScanCmResourceList [2019-09-09 05:52:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStartValidateResources [2019-09-09 05:52:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterResourceRequirements [2019-09-09 05:52:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterExistsNonIrqResourceList [2019-09-09 05:52:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterRemoveIrqResourceLists [2019-09-09 05:52:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterGetEndOfResourceRequirementsList [2019-09-09 05:52:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2019-09-09 05:52:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpFilterNukeIrqResourceDescriptors [2019-09-09 05:52:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryDeviceRelations [2019-09-09 05:52:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryStopDevice [2019-09-09 05:52:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelStopDevice [2019-09-09 05:52:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpStopDevice [2019-09-09 05:52:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpQueryRemoveDevice [2019-09-09 05:52:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpCancelRemoveDevice [2019-09-09 05:52:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpRemoveDevice [2019-09-09 05:52:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpSurpriseRemoval [2019-09-09 05:52:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpListContainsIrqResourceDescriptor [2019-09-09 05:52:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpBounceAndCatchPnpIrp [2019-09-09 05:52:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2019-09-09 05:52:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPnpUnhandledIrp [2019-09-09 05:52:09,223 INFO L138 BoogieDeclarations]: Found implementation of procedure PptPowerComplete [2019-09-09 05:52:09,223 INFO L138 BoogieDeclarations]: Found implementation of procedure InitNEC_98 [2019-09-09 05:52:09,223 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPower [2019-09-09 05:52:09,224 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockDiskModeByte [2019-09-09 05:52:09,224 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipClockPrtModeByte [2019-09-09 05:52:09,224 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipSetDiskMode [2019-09-09 05:52:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure PptLegacyZipCheckDevice [2019-09-09 05:52:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTrySelectLegacyZip [2019-09-09 05:52:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDeselectLegacyZip [2019-09-09 05:52:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegInitDriverSettings [2019-09-09 05:52:09,226 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegGetDeviceParameterDword [2019-09-09 05:52:09,226 INFO L138 BoogieDeclarations]: Found implementation of procedure PptRegSetDeviceParameterDword [2019-09-09 05:52:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFailRequest [2019-09-09 05:52:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure PptAcquireRemoveLockOrFailIrp [2019-09-09 05:52:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPreProcessIrp [2019-09-09 05:52:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchPostProcessIrp [2019-09-09 05:52:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchCompletionRoutine [2019-09-09 05:52:09,227 INFO L138 BoogieDeclarations]: Found implementation of procedure PptGetPortNameFromPhysicalDeviceObject [2019-09-09 05:52:09,228 INFO L138 BoogieDeclarations]: Found implementation of procedure PptConnectInterrupt [2019-09-09 05:52:09,228 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDisconnectInterrupt [2019-09-09 05:52:09,228 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedIncrement [2019-09-09 05:52:09,229 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDecrement [2019-09-09 05:52:09,229 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedRead [2019-09-09 05:52:09,229 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedQueue [2019-09-09 05:52:09,229 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSynchronizedDisconnect [2019-09-09 05:52:09,229 INFO L138 BoogieDeclarations]: Found implementation of procedure PptCancelRoutine [2019-09-09 05:52:09,230 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePortDpc [2019-09-09 05:52:09,231 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTryAllocatePortAtInterruptLevel [2019-09-09 05:52:09,234 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePortFromInterruptLevel [2019-09-09 05:52:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInterruptService [2019-09-09 05:52:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTryAllocatePort [2019-09-09 05:52:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure PptTraversePortCheckList [2019-09-09 05:52:09,242 INFO L138 BoogieDeclarations]: Found implementation of procedure PptFreePort [2019-09-09 05:52:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure PptQueryNumWaiters [2019-09-09 05:52:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure PptSetCancelRoutine [2019-09-09 05:52:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryTickCount [2019-09-09 05:52:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure CheckPort [2019-09-09 05:52:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildParallelPortDeviceName [2019-09-09 05:52:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure PptInitializeDeviceExtension [2019-09-09 05:52:09,243 INFO L138 BoogieDeclarations]: Found implementation of procedure PptGetPortNumberFromLptName [2019-09-09 05:52:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure PptBuildDeviceObject [2019-09-09 05:52:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiInitWmi [2019-09-09 05:52:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure PptDispatchSystemControl [2019-09-09 05:52:09,244 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiQueryWmiRegInfo [2019-09-09 05:52:09,245 INFO L138 BoogieDeclarations]: Found implementation of procedure PptWmiQueryWmiDataBlock [2019-09-09 05:52:09,245 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-09 05:52:09,245 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-09 05:52:09,245 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:52:09,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2019-09-09 05:52:09,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2019-09-09 05:52:09,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2019-09-09 05:52:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2019-09-09 05:52:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2019-09-09 05:52:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2019-09-09 05:52:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2019-09-09 05:52:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2019-09-09 05:52:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2019-09-09 05:52:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2019-09-09 05:52:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-09 05:52:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2019-09-09 05:52:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2019-09-09 05:52:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2019-09-09 05:52:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-09-09 05:52:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2019-09-09 05:52:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2019-09-09 05:52:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2019-09-09 05:52:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2019-09-09 05:52:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-09-09 05:52:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-09-09 05:52:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2019-09-09 05:52:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-09-09 05:52:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2019-09-09 05:52:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-09 05:52:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-09 05:52:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-09 05:52:09,248 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2019-09-09 05:52:09,249 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2019-09-09 05:52:09,249 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2019-09-09 05:52:09,249 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2019-09-09 05:52:09,249 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2019-09-09 05:52:09,249 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2019-09-09 05:52:09,249 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2019-09-09 05:52:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-09 05:52:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-09 05:52:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2019-09-09 05:52:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2019-09-09 05:52:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2019-09-09 05:52:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2019-09-09 05:52:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2019-09-09 05:52:09,250 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2019-09-09 05:52:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-09-09 05:52:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2019-09-09 05:52:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-09 05:52:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2019-09-09 05:52:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-09-09 05:52:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2019-09-09 05:52:09,251 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2019-09-09 05:52:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2019-09-09 05:52:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2019-09-09 05:52:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2019-09-09 05:52:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2019-09-09 05:52:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2019-09-09 05:52:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2019-09-09 05:52:09,252 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2019-09-09 05:52:09,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-09 05:52:09,253 INFO L138 BoogieDeclarations]: Found implementation of procedure WmiSystemControl [2019-09-09 05:52:09,253 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAcquireRemoveLockEx [2019-09-09 05:52:09,253 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-09 05:52:09,253 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:52:09,253 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-09-09 05:52:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:52:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-09 05:52:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-09-09 05:52:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:52:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:52:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:52:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-09 05:52:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:52:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-09 05:52:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2019-09-09 05:52:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:52:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:52:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-09 05:52:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-09-09 05:52:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2019-09-09 05:52:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2019-09-09 05:52:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure RtlIntegerToUnicodeString [2019-09-09 05:52:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:52:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure RtlUnicodeStringToInteger [2019-09-09 05:52:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:52:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2019-09-09 05:52:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2019-09-09 05:52:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2019-09-09 05:52:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareUnicodeString [2019-09-09 05:52:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2019-09-09 05:52:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAppendUnicodeStringToString [2019-09-09 05:52:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2019-09-09 05:52:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2019-09-09 05:52:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure READ_PORT_UCHAR [2019-09-09 05:52:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure WRITE_PORT_UCHAR [2019-09-09 05:52:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2019-09-09 05:52:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2019-09-09 05:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2019-09-09 05:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeDpc [2019-09-09 05:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure KeInsertQueueDpc [2019-09-09 05:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure KeSynchronizeExecution [2019-09-09 05:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2019-09-09 05:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-09 05:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2019-09-09 05:52:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2019-09-09 05:52:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2019-09-09 05:52:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-09 05:52:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2019-09-09 05:52:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2019-09-09 05:52:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTimeIncrement [2019-09-09 05:52:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2019-09-09 05:52:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2019-09-09 05:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2019-09-09 05:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2019-09-09 05:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2019-09-09 05:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2019-09-09 05:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2019-09-09 05:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2019-09-09 05:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2019-09-09 05:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2019-09-09 05:52:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2019-09-09 05:52:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2019-09-09 05:52:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2019-09-09 05:52:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-09-09 05:52:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2019-09-09 05:52:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireCancelSpinLock [2019-09-09 05:52:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateErrorLogEntry [2019-09-09 05:52:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:52:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2019-09-09 05:52:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2019-09-09 05:52:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2019-09-09 05:52:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-09 05:52:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-09 05:52:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-09 05:52:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure IoConnectInterrupt [2019-09-09 05:52:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~PVOID~0~TO~~BOOLEAN~0 [2019-09-09 05:52:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2019-09-09 05:52:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2019-09-09 05:52:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2019-09-09 05:52:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-09-09 05:52:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2019-09-09 05:52:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2019-09-09 05:52:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2019-09-09 05:52:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2019-09-09 05:52:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-09-09 05:52:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2019-09-09 05:52:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure IoReportResourceUsage [2019-09-09 05:52:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2019-09-09 05:52:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure IoInitializeRemoveLockEx [2019-09-09 05:52:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure IoAcquireRemoveLockEx [2019-09-09 05:52:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockEx [2019-09-09 05:52:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseRemoveLockAndWaitEx [2019-09-09 05:52:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure IoWriteErrorLogEntry [2019-09-09 05:52:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2019-09-09 05:52:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2019-09-09 05:52:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-09-09 05:52:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-09-09 05:52:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure KeStallExecutionProcessor [2019-09-09 05:52:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure PoRequestPowerIrp [2019-09-09 05:52:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure PoSetPowerState [2019-09-09 05:52:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:52:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:52:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-09 05:52:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2019-09-09 05:52:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-09-09 05:52:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure ObfReferenceObject [2019-09-09 05:52:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2019-09-09 05:52:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-09 05:52:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure ZwQueryValueKey [2019-09-09 05:52:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure ZwSetValueKey [2019-09-09 05:52:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure WmiCompleteRequest [2019-09-09 05:52:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure WmiSystemControl [2019-09-09 05:52:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure PptCompleteRequest [2019-09-09 05:52:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-09 05:52:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiInitWmi [2019-09-09 05:52:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchSystemControl [2019-09-09 05:52:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpInitDispatchFunctionTable [2019-09-09 05:52:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpAddDevice [2019-09-09 05:52:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPnp [2019-09-09 05:52:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure PptFailRequest [2019-09-09 05:52:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPreProcessIrp [2019-09-09 05:52:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPostProcessIrp [2019-09-09 05:52:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2019-09-09 05:52:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure PptUnload [2019-09-09 05:52:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchCompletionRoutine [2019-09-09 05:52:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure PptLogError [2019-09-09 05:52:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure PptConnectInterrupt [2019-09-09 05:52:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure PptDisconnectInterrupt [2019-09-09 05:52:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCreate [2019-09-09 05:52:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchClose [2019-09-09 05:52:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedIncrement [2019-09-09 05:52:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDecrement [2019-09-09 05:52:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedRead [2019-09-09 05:52:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedQueue [2019-09-09 05:52:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure PptSynchronizedDisconnect [2019-09-09 05:52:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure PptCancelRoutine [2019-09-09 05:52:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePortDpc [2019-09-09 05:52:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure PptTryAllocatePortAtInterruptLevel [2019-09-09 05:52:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePortFromInterruptLevel [2019-09-09 05:52:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure PptInterruptService [2019-09-09 05:52:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure PptTryAllocatePort [2019-09-09 05:52:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure PptTraversePortCheckList [2019-09-09 05:52:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure PptFreePort [2019-09-09 05:52:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure PptQueryNumWaiters [2019-09-09 05:52:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchInternalDeviceControl [2019-09-09 05:52:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchCleanup [2019-09-09 05:52:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsNecR98Machine [2019-09-09 05:52:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure PptDispatchPower [2019-09-09 05:52:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegInitDriverSettings [2019-09-09 05:52:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure PptGetPortNameFromPhysicalDeviceObject [2019-09-09 05:52:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetCancelRoutine [2019-09-09 05:52:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLockOrFailIrp [2019-09-09 05:52:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpPnpIrpInfo [2019-09-09 05:52:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure PptAcquireRemoveLock [2019-09-09 05:52:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLock [2019-09-09 05:52:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure PptReleaseRemoveLockAndWait [2019-09-09 05:52:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceList [2019-09-09 05:52:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure PptDebugDumpResourceRequirementsList [2019-09-09 05:52:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectChipFilter [2019-09-09 05:52:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortType [2019-09-09 05:52:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetChipMode [2019-09-09 05:52:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearChipMode [2019-09-09 05:52:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitiate1284_3 [2019-09-09 05:52:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectDevice [2019-09-09 05:52:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectDevice [2019-09-09 05:52:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure Ppt1284_3AssignAddress [2019-09-09 05:52:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure PptSend1284_3Command [2019-09-09 05:52:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure PptTrySelectLegacyZip [2019-09-09 05:52:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure PptDeselectLegacyZip [2019-09-09 05:52:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpRemovalRelationsList [2019-09-09 05:52:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegGetDeviceParameterDword [2019-09-09 05:52:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure PptRegSetDeviceParameterDword [2019-09-09 05:52:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildParallelPortDeviceName [2019-09-09 05:52:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure PptInitializeDeviceExtension [2019-09-09 05:52:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure PptGetPortNumberFromLptName [2019-09-09 05:52:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildDeviceObject [2019-09-09 05:52:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPort [2019-09-09 05:52:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure PptCleanRemovalRelationsList [2019-09-09 05:52:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure CheckPort [2019-09-09 05:52:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:52:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-09-09 05:52:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:52:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-09 05:52:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure PptAddPptRemovalRelation [2019-09-09 05:52:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure PptRemovePptRemovalRelation [2019-09-09 05:52:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure PptDumpPptRemovalRelationsStruct [2019-09-09 05:52:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStl1284_3 [2019-09-09 05:52:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfNon1284_3Present [2019-09-09 05:52:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckIfStlProductId [2019-09-09 05:52:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectPortCapabilities [2019-09-09 05:52:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEcpPort [2019-09-09 05:52:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfDot3DevicePresent [2019-09-09 05:52:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectEppPortIfUserRequested [2019-09-09 05:52:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetectBytePort [2019-09-09 05:52:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoDepth [2019-09-09 05:52:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure PptDetermineFifoWidth [2019-09-09 05:52:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrSetMode [2019-09-09 05:52:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure PptEcrClearMode [2019-09-09 05:52:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure PptFindNatChip [2019-09-09 05:52:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure PptBuildResourceList [2019-09-09 05:52:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure PptSetByteMode [2019-09-09 05:52:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure PptClearByteMode [2019-09-09 05:52:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure PptCheckByteMode [2019-09-09 05:52:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~X~~UCHAR~0~TO~~NTSTATUS~0 [2019-09-09 05:52:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterResourceRequirements [2019-09-09 05:52:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryDeviceRelations [2019-09-09 05:52:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryStopDevice [2019-09-09 05:52:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelStopDevice [2019-09-09 05:52:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStopDevice [2019-09-09 05:52:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpQueryRemoveDevice [2019-09-09 05:52:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpCancelRemoveDevice [2019-09-09 05:52:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpRemoveDevice [2019-09-09 05:52:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpSurpriseRemoval [2019-09-09 05:52:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpUnhandledIrp [2019-09-09 05:52:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartDevice [2019-09-09 05:52:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartValidateResources [2019-09-09 05:52:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanCmResourceList [2019-09-09 05:52:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpPassThroughPnpIrpAndReleaseRemoveLock [2019-09-09 05:52:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptors [2019-09-09 05:52:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterNukeIrqResourceDescriptorsFromAllLists [2019-09-09 05:52:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterExistsNonIrqResourceList [2019-09-09 05:52:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterGetEndOfResourceRequirementsList [2019-09-09 05:52:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpListContainsIrqResourceDescriptor [2019-09-09 05:52:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpFilterRemoveIrqResourceLists [2019-09-09 05:52:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBounceAndCatchPnpIrp [2019-09-09 05:52:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpBuildRemovalRelations [2019-09-09 05:52:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure PptPnpStartScanPciCardCmResourceList [2019-09-09 05:52:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure PptIsPci [2019-09-09 05:52:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure PptPowerComplete [2019-09-09 05:52:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure InitNEC_98 [2019-09-09 05:52:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockDiskModeByte [2019-09-09 05:52:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipClockPrtModeByte [2019-09-09 05:52:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipSetDiskMode [2019-09-09 05:52:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure PptLegacyZipCheckDevice [2019-09-09 05:52:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PVOID~0~TO~VOID [2019-09-09 05:52:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryTickCount [2019-09-09 05:52:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiQueryWmiRegInfo [2019-09-09 05:52:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure PptWmiQueryWmiDataBlock [2019-09-09 05:52:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-09 05:52:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-09 05:52:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:52:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-09 05:52:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2019-09-09 05:52:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:52:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:52:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:52:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:52:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:52:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:52:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:52:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:52:10,670 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:10,755 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:10,755 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:11,017 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:22,478 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !false; [2019-09-09 05:52:22,478 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume false; [2019-09-09 05:52:22,512 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:28,845 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-09 05:52:28,845 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-09 05:52:28,845 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:28,855 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:28,856 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:29,019 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:29,070 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-09 05:52:29,070 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-09 05:52:29,071 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:29,090 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:29,090 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:29,381 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:29,404 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:29,404 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:29,566 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:29,628 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-09 05:52:29,628 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-09 05:52:29,877 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:32,086 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2019-09-09 05:52:32,087 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2019-09-09 05:52:32,088 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:32,128 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-09 05:52:32,128 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-09 05:52:32,171 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:32,182 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:32,183 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:32,429 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:39,344 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2019-09-09 05:52:39,345 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2019-09-09 05:52:41,506 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:41,514 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:41,514 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:41,637 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:41,638 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:47,913 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-09-09 05:52:47,913 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2019-09-09 05:52:47,913 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-09-09 05:52:47,913 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2019-09-09 05:52:48,245 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:48,254 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:48,255 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:53,310 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:53,324 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:53,324 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:53,843 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:53,859 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:53,860 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:53,860 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:53,873 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:53,873 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:53,913 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:53,924 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:53,924 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:53,924 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:53,935 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:53,936 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:53,936 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:53,950 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:53,951 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:54,139 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:54,149 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:54,149 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:54,164 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:54,174 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:54,174 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:54,290 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:54,299 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:54,300 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:54,331 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:54,340 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:54,340 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:55,037 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:52:55,046 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:52:55,046 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:52:55,060 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:00,138 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-09 05:53:00,139 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-09 05:53:00,146 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:00,255 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2019-09-09 05:53:00,255 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2019-09-09 05:53:01,181 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:01,190 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:53:01,190 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:53:01,289 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:01,373 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-09-09 05:53:01,374 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-09-09 05:53:01,480 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:12,642 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume !false; [2019-09-09 05:53:12,643 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume false; [2019-09-09 05:53:12,720 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:17,887 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-09 05:53:17,888 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-09 05:53:17,888 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:17,942 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-09 05:53:17,942 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-09 05:53:20,105 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:20,125 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-09 05:53:20,125 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-09 05:53:21,080 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:21,086 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-09 05:53:21,087 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-09 05:53:21,340 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:26,547 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-09 05:53:26,547 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-09 05:53:26,600 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:53:26,600 INFO L283 CfgBuilder]: Removed 37 assume(true) statements. [2019-09-09 05:53:26,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:26 BoogieIcfgContainer [2019-09-09 05:53:26,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:53:26,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:53:26,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:53:26,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:53:26,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:52:05" (1/3) ... [2019-09-09 05:53:26,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b579511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:26, skipping insertion in model container [2019-09-09 05:53:26,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:52:08" (2/3) ... [2019-09-09 05:53:26,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b579511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:26, skipping insertion in model container [2019-09-09 05:53:26,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:26" (3/3) ... [2019-09-09 05:53:26,611 INFO L109 eAbstractionObserver]: Analyzing ICFG parport.i.cil-2.c [2019-09-09 05:53:26,621 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:53:26,631 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:53:26,648 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:53:26,675 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:53:26,675 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:53:26,675 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:53:26,676 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:53:26,676 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:53:26,676 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:53:26,676 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:53:26,676 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:53:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states. [2019-09-09 05:53:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:53:26,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:26,740 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-09 05:53:26,742 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:26,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:26,748 INFO L82 PathProgramCache]: Analyzing trace with hash 300354810, now seen corresponding path program 1 times [2019-09-09 05:53:26,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:26,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:26,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:26,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:26,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:27,298 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-09 05:53:27,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:27,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:27,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:27,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:27,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:27,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:27,325 INFO L87 Difference]: Start difference. First operand 2173 states. Second operand 3 states. [2019-09-09 05:53:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:27,674 INFO L93 Difference]: Finished difference Result 1923 states and 2768 transitions. [2019-09-09 05:53:27,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:27,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:53:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:27,717 INFO L225 Difference]: With dead ends: 1923 [2019-09-09 05:53:27,718 INFO L226 Difference]: Without dead ends: 1907 [2019-09-09 05:53:27,719 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-09 05:53:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2019-09-09 05:53:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1907. [2019-09-09 05:53:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2019-09-09 05:53:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2740 transitions. [2019-09-09 05:53:27,958 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2740 transitions. Word has length 20 [2019-09-09 05:53:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:27,959 INFO L475 AbstractCegarLoop]: Abstraction has 1907 states and 2740 transitions. [2019-09-09 05:53:27,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2740 transitions. [2019-09-09 05:53:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:53:27,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:27,964 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-09 05:53:27,964 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:27,965 INFO L82 PathProgramCache]: Analyzing trace with hash -227578647, now seen corresponding path program 1 times [2019-09-09 05:53:27,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:27,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:27,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:27,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:27,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:28,220 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-09 05:53:28,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:28,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:28,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:28,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:28,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:28,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:28,225 INFO L87 Difference]: Start difference. First operand 1907 states and 2740 transitions. Second operand 3 states. [2019-09-09 05:53:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:28,789 INFO L93 Difference]: Finished difference Result 3582 states and 5203 transitions. [2019-09-09 05:53:28,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:28,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:53:28,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:28,815 INFO L225 Difference]: With dead ends: 3582 [2019-09-09 05:53:28,816 INFO L226 Difference]: Without dead ends: 3581 [2019-09-09 05:53:28,817 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-09 05:53:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2019-09-09 05:53:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3560. [2019-09-09 05:53:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3560 states. [2019-09-09 05:53:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 5176 transitions. [2019-09-09 05:53:28,995 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 5176 transitions. Word has length 30 [2019-09-09 05:53:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:28,996 INFO L475 AbstractCegarLoop]: Abstraction has 3560 states and 5176 transitions. [2019-09-09 05:53:28,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 5176 transitions. [2019-09-09 05:53:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-09 05:53:29,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:29,002 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-09 05:53:29,002 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:29,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:29,002 INFO L82 PathProgramCache]: Analyzing trace with hash 833048032, now seen corresponding path program 1 times [2019-09-09 05:53:29,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:29,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:29,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:29,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:29,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:29,213 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-09 05:53:29,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:29,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:53:29,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:29,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:53:29,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:53:29,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:29,216 INFO L87 Difference]: Start difference. First operand 3560 states and 5176 transitions. Second operand 5 states. [2019-09-09 05:53:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:36,377 INFO L93 Difference]: Finished difference Result 4323 states and 6278 transitions. [2019-09-09 05:53:36,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:53:36,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-09 05:53:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:36,409 INFO L225 Difference]: With dead ends: 4323 [2019-09-09 05:53:36,410 INFO L226 Difference]: Without dead ends: 4323 [2019-09-09 05:53:36,410 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-09 05:53:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2019-09-09 05:53:36,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 4292. [2019-09-09 05:53:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-09-09 05:53:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 6241 transitions. [2019-09-09 05:53:36,619 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 6241 transitions. Word has length 45 [2019-09-09 05:53:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:36,620 INFO L475 AbstractCegarLoop]: Abstraction has 4292 states and 6241 transitions. [2019-09-09 05:53:36,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:53:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 6241 transitions. [2019-09-09 05:53:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-09 05:53:36,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:36,631 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-09 05:53:36,632 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:36,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:36,632 INFO L82 PathProgramCache]: Analyzing trace with hash -383328916, now seen corresponding path program 1 times [2019-09-09 05:53:36,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:36,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:36,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:36,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:36,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:36,947 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-09 05:53:36,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:36,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:53:36,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:36,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:53:36,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:53:36,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:36,950 INFO L87 Difference]: Start difference. First operand 4292 states and 6241 transitions. Second operand 5 states. [2019-09-09 05:53:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:43,566 INFO L93 Difference]: Finished difference Result 4317 states and 6269 transitions. [2019-09-09 05:53:43,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:53:43,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-09-09 05:53:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:43,593 INFO L225 Difference]: With dead ends: 4317 [2019-09-09 05:53:43,593 INFO L226 Difference]: Without dead ends: 4317 [2019-09-09 05:53:43,594 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-09 05:53:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2019-09-09 05:53:43,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 4292. [2019-09-09 05:53:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4292 states. [2019-09-09 05:53:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 6240 transitions. [2019-09-09 05:53:43,753 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 6240 transitions. Word has length 46 [2019-09-09 05:53:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:43,753 INFO L475 AbstractCegarLoop]: Abstraction has 4292 states and 6240 transitions. [2019-09-09 05:53:43,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:53:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 6240 transitions. [2019-09-09 05:53:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-09 05:53:43,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:43,756 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-09 05:53:43,756 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:43,757 INFO L82 PathProgramCache]: Analyzing trace with hash 238606324, now seen corresponding path program 1 times [2019-09-09 05:53:43,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:43,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:43,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:43,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:43,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:43,898 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-09 05:53:43,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:43,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:43,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:43,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:43,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:43,900 INFO L87 Difference]: Start difference. First operand 4292 states and 6240 transitions. Second operand 3 states. [2019-09-09 05:53:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:44,008 INFO L93 Difference]: Finished difference Result 6722 states and 9779 transitions. [2019-09-09 05:53:44,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:44,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-09 05:53:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:44,045 INFO L225 Difference]: With dead ends: 6722 [2019-09-09 05:53:44,045 INFO L226 Difference]: Without dead ends: 6722 [2019-09-09 05:53:44,046 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-09 05:53:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6722 states. [2019-09-09 05:53:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6722 to 6660. [2019-09-09 05:53:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-09-09 05:53:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9703 transitions. [2019-09-09 05:53:44,363 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9703 transitions. Word has length 47 [2019-09-09 05:53:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:44,363 INFO L475 AbstractCegarLoop]: Abstraction has 6660 states and 9703 transitions. [2019-09-09 05:53:44,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9703 transitions. [2019-09-09 05:53:44,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-09 05:53:44,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:44,366 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-09 05:53:44,366 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:44,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:44,367 INFO L82 PathProgramCache]: Analyzing trace with hash 732695703, now seen corresponding path program 1 times [2019-09-09 05:53:44,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:44,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:44,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:44,500 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-09 05:53:44,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:44,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:44,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:44,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:44,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:44,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:44,502 INFO L87 Difference]: Start difference. First operand 6660 states and 9703 transitions. Second operand 3 states. [2019-09-09 05:53:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:44,598 INFO L93 Difference]: Finished difference Result 6756 states and 9810 transitions. [2019-09-09 05:53:44,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:44,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-09 05:53:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:44,641 INFO L225 Difference]: With dead ends: 6756 [2019-09-09 05:53:44,641 INFO L226 Difference]: Without dead ends: 6756 [2019-09-09 05:53:44,642 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-09 05:53:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6756 states. [2019-09-09 05:53:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6756 to 6689. [2019-09-09 05:53:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2019-09-09 05:53:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 9734 transitions. [2019-09-09 05:53:44,935 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 9734 transitions. Word has length 47 [2019-09-09 05:53:44,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:44,935 INFO L475 AbstractCegarLoop]: Abstraction has 6689 states and 9734 transitions. [2019-09-09 05:53:44,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 9734 transitions. [2019-09-09 05:53:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:53:44,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:44,939 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-09 05:53:44,939 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:44,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1153041076, now seen corresponding path program 1 times [2019-09-09 05:53:44,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:44,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:44,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:45,137 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-09 05:53:45,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:45,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:53:45,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:45,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:53:45,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:53:45,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:45,139 INFO L87 Difference]: Start difference. First operand 6689 states and 9734 transitions. Second operand 5 states. [2019-09-09 05:53:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:45,235 INFO L93 Difference]: Finished difference Result 6696 states and 9744 transitions. [2019-09-09 05:53:45,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:53:45,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-09 05:53:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:45,266 INFO L225 Difference]: With dead ends: 6696 [2019-09-09 05:53:45,266 INFO L226 Difference]: Without dead ends: 6696 [2019-09-09 05:53:45,266 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-09 05:53:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states. [2019-09-09 05:53:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6696 to 6693. [2019-09-09 05:53:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6693 states. [2019-09-09 05:53:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6693 states to 6693 states and 9739 transitions. [2019-09-09 05:53:45,537 INFO L78 Accepts]: Start accepts. Automaton has 6693 states and 9739 transitions. Word has length 64 [2019-09-09 05:53:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:45,538 INFO L475 AbstractCegarLoop]: Abstraction has 6693 states and 9739 transitions. [2019-09-09 05:53:45,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:53:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6693 states and 9739 transitions. [2019-09-09 05:53:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:53:45,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:45,541 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-09 05:53:45,542 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:45,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:45,542 INFO L82 PathProgramCache]: Analyzing trace with hash 958249293, now seen corresponding path program 1 times [2019-09-09 05:53:45,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:45,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:45,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:45,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:45,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:53:45,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:45,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:53:45,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:53:45,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:53:45,868 INFO L87 Difference]: Start difference. First operand 6693 states and 9739 transitions. Second operand 6 states. [2019-09-09 05:53:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:47,669 INFO L93 Difference]: Finished difference Result 6538 states and 9471 transitions. [2019-09-09 05:53:47,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:53:47,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-09 05:53:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:47,703 INFO L225 Difference]: With dead ends: 6538 [2019-09-09 05:53:47,703 INFO L226 Difference]: Without dead ends: 6538 [2019-09-09 05:53:47,704 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-09 05:53:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-09-09 05:53:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6532. [2019-09-09 05:53:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-09-09 05:53:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 9465 transitions. [2019-09-09 05:53:47,965 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 9465 transitions. Word has length 64 [2019-09-09 05:53:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:47,966 INFO L475 AbstractCegarLoop]: Abstraction has 6532 states and 9465 transitions. [2019-09-09 05:53:47,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:53:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 9465 transitions. [2019-09-09 05:53:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-09 05:53:47,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:47,968 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-09 05:53:47,969 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:47,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1147187110, now seen corresponding path program 1 times [2019-09-09 05:53:47,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:47,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:48,080 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-09 05:53:48,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:48,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:48,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:48,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:48,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:48,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:48,082 INFO L87 Difference]: Start difference. First operand 6532 states and 9465 transitions. Second operand 3 states. [2019-09-09 05:53:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:48,281 INFO L93 Difference]: Finished difference Result 6532 states and 9464 transitions. [2019-09-09 05:53:48,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:48,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-09 05:53:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:48,312 INFO L225 Difference]: With dead ends: 6532 [2019-09-09 05:53:48,313 INFO L226 Difference]: Without dead ends: 6532 [2019-09-09 05:53:48,313 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-09 05:53:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2019-09-09 05:53:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 6532. [2019-09-09 05:53:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-09-09 05:53:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 9464 transitions. [2019-09-09 05:53:48,666 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 9464 transitions. Word has length 47 [2019-09-09 05:53:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:48,667 INFO L475 AbstractCegarLoop]: Abstraction has 6532 states and 9464 transitions. [2019-09-09 05:53:48,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 9464 transitions. [2019-09-09 05:53:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:53:48,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:48,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, 1] [2019-09-09 05:53:48,669 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:48,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:48,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1245298868, now seen corresponding path program 1 times [2019-09-09 05:53:48,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:48,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:48,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:48,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:48,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:53:48,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:48,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:53:48,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:53:48,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:48,803 INFO L87 Difference]: Start difference. First operand 6532 states and 9464 transitions. Second operand 5 states. [2019-09-09 05:53:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:48,896 INFO L93 Difference]: Finished difference Result 6544 states and 9477 transitions. [2019-09-09 05:53:48,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:53:48,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-09 05:53:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:48,927 INFO L225 Difference]: With dead ends: 6544 [2019-09-09 05:53:48,927 INFO L226 Difference]: Without dead ends: 6506 [2019-09-09 05:53:48,927 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-09 05:53:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6506 states. [2019-09-09 05:53:49,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6506 to 6506. [2019-09-09 05:53:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-09-09 05:53:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 9427 transitions. [2019-09-09 05:53:49,184 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 9427 transitions. Word has length 48 [2019-09-09 05:53:49,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:49,184 INFO L475 AbstractCegarLoop]: Abstraction has 6506 states and 9427 transitions. [2019-09-09 05:53:49,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:53:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 9427 transitions. [2019-09-09 05:53:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:53:49,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:49,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:49,186 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:49,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:49,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1265177314, now seen corresponding path program 1 times [2019-09-09 05:53:49,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:49,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:49,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:49,385 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-09 05:53:49,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:49,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:53:49,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:49,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:53:49,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:53:49,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:53:49,387 INFO L87 Difference]: Start difference. First operand 6506 states and 9427 transitions. Second operand 8 states. [2019-09-09 05:53:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:49,559 INFO L93 Difference]: Finished difference Result 6519 states and 9445 transitions. [2019-09-09 05:53:49,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:53:49,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-09-09 05:53:49,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:49,584 INFO L225 Difference]: With dead ends: 6519 [2019-09-09 05:53:49,585 INFO L226 Difference]: Without dead ends: 6519 [2019-09-09 05:53:49,586 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-09 05:53:49,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6519 states. [2019-09-09 05:53:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6519 to 6511. [2019-09-09 05:53:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6511 states. [2019-09-09 05:53:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6511 states to 6511 states and 9434 transitions. [2019-09-09 05:53:49,870 INFO L78 Accepts]: Start accepts. Automaton has 6511 states and 9434 transitions. Word has length 48 [2019-09-09 05:53:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:49,873 INFO L475 AbstractCegarLoop]: Abstraction has 6511 states and 9434 transitions. [2019-09-09 05:53:49,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:53:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 6511 states and 9434 transitions. [2019-09-09 05:53:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:53:49,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:49,876 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:49,876 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:49,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1785025501, now seen corresponding path program 1 times [2019-09-09 05:53:49,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:49,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:49,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:50,026 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-09 05:53:50,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:50,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:53:50,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:50,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:53:50,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:53:50,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:50,028 INFO L87 Difference]: Start difference. First operand 6511 states and 9434 transitions. Second operand 5 states. [2019-09-09 05:53:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:50,103 INFO L93 Difference]: Finished difference Result 6503 states and 9422 transitions. [2019-09-09 05:53:50,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:53:50,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-09 05:53:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:50,128 INFO L225 Difference]: With dead ends: 6503 [2019-09-09 05:53:50,128 INFO L226 Difference]: Without dead ends: 6503 [2019-09-09 05:53:50,129 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-09 05:53:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6503 states. [2019-09-09 05:53:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6503 to 6503. [2019-09-09 05:53:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2019-09-09 05:53:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 9422 transitions. [2019-09-09 05:53:50,357 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 9422 transitions. Word has length 48 [2019-09-09 05:53:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:50,357 INFO L475 AbstractCegarLoop]: Abstraction has 6503 states and 9422 transitions. [2019-09-09 05:53:50,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:53:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 9422 transitions. [2019-09-09 05:53:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-09 05:53:50,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:50,360 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-09 05:53:50,360 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:50,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:50,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1055190255, now seen corresponding path program 1 times [2019-09-09 05:53:50,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:50,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:50,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:50,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:53:50,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:50,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:53:50,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:53:50,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:50,533 INFO L87 Difference]: Start difference. First operand 6503 states and 9422 transitions. Second operand 5 states. [2019-09-09 05:53:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:50,647 INFO L93 Difference]: Finished difference Result 6515 states and 9435 transitions. [2019-09-09 05:53:50,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:53:50,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-09 05:53:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:50,680 INFO L225 Difference]: With dead ends: 6515 [2019-09-09 05:53:50,681 INFO L226 Difference]: Without dead ends: 6501 [2019-09-09 05:53:50,681 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-09 05:53:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6501 states. [2019-09-09 05:53:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6501 to 6501. [2019-09-09 05:53:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6501 states. [2019-09-09 05:53:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 9418 transitions. [2019-09-09 05:53:50,946 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 9418 transitions. Word has length 52 [2019-09-09 05:53:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:50,946 INFO L475 AbstractCegarLoop]: Abstraction has 6501 states and 9418 transitions. [2019-09-09 05:53:50,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:53:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 9418 transitions. [2019-09-09 05:53:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-09 05:53:50,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:50,953 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-09 05:53:50,954 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:50,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:50,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1500953186, now seen corresponding path program 1 times [2019-09-09 05:53:50,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:50,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:50,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:51,193 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-09 05:53:51,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:51,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:53:51,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:51,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:53:51,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:53:51,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:53:51,195 INFO L87 Difference]: Start difference. First operand 6501 states and 9418 transitions. Second operand 8 states. [2019-09-09 05:53:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:51,413 INFO L93 Difference]: Finished difference Result 6516 states and 9434 transitions. [2019-09-09 05:53:51,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:53:51,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-09-09 05:53:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:51,437 INFO L225 Difference]: With dead ends: 6516 [2019-09-09 05:53:51,437 INFO L226 Difference]: Without dead ends: 6499 [2019-09-09 05:53:51,439 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-09 05:53:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2019-09-09 05:53:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6499. [2019-09-09 05:53:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6499 states. [2019-09-09 05:53:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 9413 transitions. [2019-09-09 05:53:51,654 INFO L78 Accepts]: Start accepts. Automaton has 6499 states and 9413 transitions. Word has length 52 [2019-09-09 05:53:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:51,655 INFO L475 AbstractCegarLoop]: Abstraction has 6499 states and 9413 transitions. [2019-09-09 05:53:51,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:53:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6499 states and 9413 transitions. [2019-09-09 05:53:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:53:51,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:51,657 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-09 05:53:51,657 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1349184777, now seen corresponding path program 1 times [2019-09-09 05:53:51,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:51,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:51,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:51,941 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-09 05:53:51,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:51,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:53:51,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:51,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:53:51,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:53:51,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:53:51,943 INFO L87 Difference]: Start difference. First operand 6499 states and 9413 transitions. Second operand 8 states. [2019-09-09 05:53:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:54,154 INFO L93 Difference]: Finished difference Result 6499 states and 9412 transitions. [2019-09-09 05:53:54,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:53:54,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-09-09 05:53:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:54,179 INFO L225 Difference]: With dead ends: 6499 [2019-09-09 05:53:54,179 INFO L226 Difference]: Without dead ends: 6499 [2019-09-09 05:53:54,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:53:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2019-09-09 05:53:54,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6499. [2019-09-09 05:53:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6499 states. [2019-09-09 05:53:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 9412 transitions. [2019-09-09 05:53:54,438 INFO L78 Accepts]: Start accepts. Automaton has 6499 states and 9412 transitions. Word has length 55 [2019-09-09 05:53:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:54,438 INFO L475 AbstractCegarLoop]: Abstraction has 6499 states and 9412 transitions. [2019-09-09 05:53:54,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:53:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6499 states and 9412 transitions. [2019-09-09 05:53:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:53:54,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:54,443 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-09 05:53:54,443 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash -139491608, now seen corresponding path program 1 times [2019-09-09 05:53:54,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:54,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:54,618 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-09 05:53:54,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:54,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:53:54,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:54,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:53:54,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:53:54,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:53:54,620 INFO L87 Difference]: Start difference. First operand 6499 states and 9412 transitions. Second operand 8 states. [2019-09-09 05:53:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:54,781 INFO L93 Difference]: Finished difference Result 6534 states and 9457 transitions. [2019-09-09 05:53:54,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:53:54,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-09 05:53:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:54,807 INFO L225 Difference]: With dead ends: 6534 [2019-09-09 05:53:54,807 INFO L226 Difference]: Without dead ends: 6516 [2019-09-09 05:53:54,808 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-09 05:53:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6516 states. [2019-09-09 05:53:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6516 to 6504. [2019-09-09 05:53:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6504 states. [2019-09-09 05:53:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 9417 transitions. [2019-09-09 05:53:55,120 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 9417 transitions. Word has length 51 [2019-09-09 05:53:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:55,120 INFO L475 AbstractCegarLoop]: Abstraction has 6504 states and 9417 transitions. [2019-09-09 05:53:55,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:53:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 9417 transitions. [2019-09-09 05:53:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:53:55,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:55,127 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-09 05:53:55,127 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:55,127 INFO L82 PathProgramCache]: Analyzing trace with hash 971259367, now seen corresponding path program 1 times [2019-09-09 05:53:55,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:55,293 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-09 05:53:55,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:55,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:53:55,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:55,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:53:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:53:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:53:55,295 INFO L87 Difference]: Start difference. First operand 6504 states and 9417 transitions. Second operand 8 states. [2019-09-09 05:53:55,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:55,439 INFO L93 Difference]: Finished difference Result 6528 states and 9448 transitions. [2019-09-09 05:53:55,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:53:55,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-09 05:53:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:55,464 INFO L225 Difference]: With dead ends: 6528 [2019-09-09 05:53:55,465 INFO L226 Difference]: Without dead ends: 6510 [2019-09-09 05:53:55,466 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-09 05:53:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-09-09 05:53:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6493. [2019-09-09 05:53:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6493 states. [2019-09-09 05:53:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6493 states to 6493 states and 9403 transitions. [2019-09-09 05:53:55,700 INFO L78 Accepts]: Start accepts. Automaton has 6493 states and 9403 transitions. Word has length 51 [2019-09-09 05:53:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:55,700 INFO L475 AbstractCegarLoop]: Abstraction has 6493 states and 9403 transitions. [2019-09-09 05:53:55,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:53:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6493 states and 9403 transitions. [2019-09-09 05:53:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-09 05:53:55,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:55,704 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-09 05:53:55,705 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:55,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:55,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2145606927, now seen corresponding path program 1 times [2019-09-09 05:53:55,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:55,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:55,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:55,904 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-09 05:53:55,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:55,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:53:55,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:55,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:53:55,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:53:55,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:53:55,906 INFO L87 Difference]: Start difference. First operand 6493 states and 9403 transitions. Second operand 8 states. [2019-09-09 05:54:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:00,296 INFO L93 Difference]: Finished difference Result 6532 states and 9463 transitions. [2019-09-09 05:54:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:54:00,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-09-09 05:54:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:00,320 INFO L225 Difference]: With dead ends: 6532 [2019-09-09 05:54:00,320 INFO L226 Difference]: Without dead ends: 6532 [2019-09-09 05:54:00,321 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-09 05:54:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2019-09-09 05:54:00,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 6501. [2019-09-09 05:54:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6501 states. [2019-09-09 05:54:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 9414 transitions. [2019-09-09 05:54:00,591 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 9414 transitions. Word has length 56 [2019-09-09 05:54:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:00,591 INFO L475 AbstractCegarLoop]: Abstraction has 6501 states and 9414 transitions. [2019-09-09 05:54:00,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:54:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 9414 transitions. [2019-09-09 05:54:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:54:00,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:00,595 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-09 05:54:00,595 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:00,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1614623444, now seen corresponding path program 1 times [2019-09-09 05:54:00,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:00,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:00,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:00,758 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-09 05:54:00,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:00,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:54:00,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:00,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:54:00,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:54:00,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:00,760 INFO L87 Difference]: Start difference. First operand 6501 states and 9414 transitions. Second operand 5 states. [2019-09-09 05:54:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:00,848 INFO L93 Difference]: Finished difference Result 6513 states and 9427 transitions. [2019-09-09 05:54:00,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:54:00,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-09 05:54:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:00,873 INFO L225 Difference]: With dead ends: 6513 [2019-09-09 05:54:00,873 INFO L226 Difference]: Without dead ends: 6491 [2019-09-09 05:54:00,874 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-09 05:54:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6491 states. [2019-09-09 05:54:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6491 to 6491. [2019-09-09 05:54:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6491 states. [2019-09-09 05:54:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6491 states to 6491 states and 9401 transitions. [2019-09-09 05:54:01,132 INFO L78 Accepts]: Start accepts. Automaton has 6491 states and 9401 transitions. Word has length 55 [2019-09-09 05:54:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:01,133 INFO L475 AbstractCegarLoop]: Abstraction has 6491 states and 9401 transitions. [2019-09-09 05:54:01,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:54:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 6491 states and 9401 transitions. [2019-09-09 05:54:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-09 05:54:01,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:01,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] [2019-09-09 05:54:01,136 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:01,137 INFO L82 PathProgramCache]: Analyzing trace with hash 801916040, now seen corresponding path program 1 times [2019-09-09 05:54:01,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:01,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:01,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:01,288 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-09 05:54:01,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:01,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:54:01,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:01,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:54:01,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:54:01,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:54:01,289 INFO L87 Difference]: Start difference. First operand 6491 states and 9401 transitions. Second operand 7 states. [2019-09-09 05:54:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:05,411 INFO L93 Difference]: Finished difference Result 6496 states and 9406 transitions. [2019-09-09 05:54:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:54:05,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-09-09 05:54:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:05,431 INFO L225 Difference]: With dead ends: 6496 [2019-09-09 05:54:05,431 INFO L226 Difference]: Without dead ends: 6496 [2019-09-09 05:54:05,432 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-09 05:54:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-09-09 05:54:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-09-09 05:54:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-09-09 05:54:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 9406 transitions. [2019-09-09 05:54:05,635 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 9406 transitions. Word has length 61 [2019-09-09 05:54:05,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:05,635 INFO L475 AbstractCegarLoop]: Abstraction has 6496 states and 9406 transitions. [2019-09-09 05:54:05,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:54:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 9406 transitions. [2019-09-09 05:54:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-09 05:54:05,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:05,638 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-09 05:54:05,638 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:05,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:05,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1827408039, now seen corresponding path program 1 times [2019-09-09 05:54:05,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:05,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:05,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:05,810 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-09 05:54:05,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:05,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:54:05,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:05,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:54:05,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:54:05,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:54:05,812 INFO L87 Difference]: Start difference. First operand 6496 states and 9406 transitions. Second operand 6 states. [2019-09-09 05:54:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:09,951 INFO L93 Difference]: Finished difference Result 6511 states and 9422 transitions. [2019-09-09 05:54:09,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:54:09,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-09-09 05:54:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:09,971 INFO L225 Difference]: With dead ends: 6511 [2019-09-09 05:54:09,972 INFO L226 Difference]: Without dead ends: 6494 [2019-09-09 05:54:09,972 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-09 05:54:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6494 states. [2019-09-09 05:54:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6494 to 6489. [2019-09-09 05:54:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6489 states. [2019-09-09 05:54:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6489 states to 6489 states and 9397 transitions. [2019-09-09 05:54:10,173 INFO L78 Accepts]: Start accepts. Automaton has 6489 states and 9397 transitions. Word has length 61 [2019-09-09 05:54:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:10,175 INFO L475 AbstractCegarLoop]: Abstraction has 6489 states and 9397 transitions. [2019-09-09 05:54:10,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:54:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6489 states and 9397 transitions. [2019-09-09 05:54:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-09 05:54:10,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:10,181 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-09 05:54:10,182 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:10,182 INFO L82 PathProgramCache]: Analyzing trace with hash -372962380, now seen corresponding path program 1 times [2019-09-09 05:54:10,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:10,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:10,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:54:10,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:10,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:54:10,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:10,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:54:10,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:54:10,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:54:10,382 INFO L87 Difference]: Start difference. First operand 6489 states and 9397 transitions. Second operand 8 states. [2019-09-09 05:54:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:10,565 INFO L93 Difference]: Finished difference Result 6504 states and 9413 transitions. [2019-09-09 05:54:10,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:54:10,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-09-09 05:54:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:10,587 INFO L225 Difference]: With dead ends: 6504 [2019-09-09 05:54:10,587 INFO L226 Difference]: Without dead ends: 6482 [2019-09-09 05:54:10,587 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-09 05:54:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2019-09-09 05:54:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 6482. [2019-09-09 05:54:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6482 states. [2019-09-09 05:54:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 9382 transitions. [2019-09-09 05:54:10,795 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 9382 transitions. Word has length 60 [2019-09-09 05:54:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:10,796 INFO L475 AbstractCegarLoop]: Abstraction has 6482 states and 9382 transitions. [2019-09-09 05:54:10,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:54:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 9382 transitions. [2019-09-09 05:54:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-09 05:54:10,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:10,800 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-09 05:54:10,800 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:10,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1233382885, now seen corresponding path program 1 times [2019-09-09 05:54:10,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:10,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:10,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:10,987 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-09 05:54:10,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:10,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:54:10,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:10,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:54:10,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:54:10,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:54:10,989 INFO L87 Difference]: Start difference. First operand 6482 states and 9382 transitions. Second operand 9 states. [2019-09-09 05:57:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:57:09,360 INFO L93 Difference]: Finished difference Result 7654 states and 11096 transitions. [2019-09-09 05:57:09,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 05:57:09,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-09-09 05:57:09,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:57:09,381 INFO L225 Difference]: With dead ends: 7654 [2019-09-09 05:57:09,381 INFO L226 Difference]: Without dead ends: 7654 [2019-09-09 05:57:09,381 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-09 05:57:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7654 states. [2019-09-09 05:57:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7654 to 6490. [2019-09-09 05:57:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6490 states. [2019-09-09 05:57:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 9388 transitions. [2019-09-09 05:57:09,593 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 9388 transitions. Word has length 61 [2019-09-09 05:57:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:57:09,594 INFO L475 AbstractCegarLoop]: Abstraction has 6490 states and 9388 transitions. [2019-09-09 05:57:09,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:57:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 9388 transitions. [2019-09-09 05:57:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:57:09,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:57:09,598 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-09 05:57:09,598 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:57:09,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:57:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash -351171645, now seen corresponding path program 1 times [2019-09-09 05:57:09,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:57:09,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:09,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:57:09,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:09,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:57:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:57:09,707 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-09 05:57:09,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:57:09,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:57:09,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:57:09,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:57:09,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:57:09,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:57:09,709 INFO L87 Difference]: Start difference. First operand 6490 states and 9388 transitions. Second operand 3 states. [2019-09-09 05:57:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:57:16,164 INFO L93 Difference]: Finished difference Result 6513 states and 9423 transitions. [2019-09-09 05:57:16,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:57:16,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-09 05:57:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:57:16,194 INFO L225 Difference]: With dead ends: 6513 [2019-09-09 05:57:16,195 INFO L226 Difference]: Without dead ends: 6513 [2019-09-09 05:57:16,201 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-09 05:57:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2019-09-09 05:57:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 6486. [2019-09-09 05:57:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6486 states. [2019-09-09 05:57:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6486 states to 6486 states and 9380 transitions. [2019-09-09 05:57:16,437 INFO L78 Accepts]: Start accepts. Automaton has 6486 states and 9380 transitions. Word has length 64 [2019-09-09 05:57:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:57:16,437 INFO L475 AbstractCegarLoop]: Abstraction has 6486 states and 9380 transitions. [2019-09-09 05:57:16,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:57:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6486 states and 9380 transitions. [2019-09-09 05:57:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:57:16,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:57:16,443 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, 1] [2019-09-09 05:57:16,444 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:57:16,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:57:16,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2025557598, now seen corresponding path program 1 times [2019-09-09 05:57:16,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:57:16,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:16,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:57:16,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:16,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:57:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:57:16,618 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-09 05:57:16,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:57:16,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:57:16,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:57:16,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:57:16,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:57:16,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:57:16,620 INFO L87 Difference]: Start difference. First operand 6486 states and 9380 transitions. Second operand 6 states. [2019-09-09 05:57:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:57:22,878 INFO L93 Difference]: Finished difference Result 5668 states and 8157 transitions. [2019-09-09 05:57:22,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:57:22,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-09 05:57:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:57:22,902 INFO L225 Difference]: With dead ends: 5668 [2019-09-09 05:57:22,902 INFO L226 Difference]: Without dead ends: 5666 [2019-09-09 05:57:22,903 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-09 05:57:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5666 states. [2019-09-09 05:57:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5666 to 5614. [2019-09-09 05:57:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5614 states. [2019-09-09 05:57:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5614 states to 5614 states and 8090 transitions. [2019-09-09 05:57:23,095 INFO L78 Accepts]: Start accepts. Automaton has 5614 states and 8090 transitions. Word has length 78 [2019-09-09 05:57:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:57:23,096 INFO L475 AbstractCegarLoop]: Abstraction has 5614 states and 8090 transitions. [2019-09-09 05:57:23,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:57:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5614 states and 8090 transitions. [2019-09-09 05:57:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-09 05:57:23,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:57:23,102 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-09 05:57:23,102 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:57:23,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:57:23,103 INFO L82 PathProgramCache]: Analyzing trace with hash 308442726, now seen corresponding path program 1 times [2019-09-09 05:57:23,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:57:23,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:23,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:57:23,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:23,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:57:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:57:23,280 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-09 05:57:23,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:57:23,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:57:23,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:57:23,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:57:23,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:57:23,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:57:23,282 INFO L87 Difference]: Start difference. First operand 5614 states and 8090 transitions. Second operand 6 states. [2019-09-09 05:57:23,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:57:23,386 INFO L93 Difference]: Finished difference Result 5606 states and 8079 transitions. [2019-09-09 05:57:23,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:57:23,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-09 05:57:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:57:23,410 INFO L225 Difference]: With dead ends: 5606 [2019-09-09 05:57:23,411 INFO L226 Difference]: Without dead ends: 5604 [2019-09-09 05:57:23,411 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-09 05:57:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5604 states. [2019-09-09 05:57:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5604 to 5604. [2019-09-09 05:57:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5604 states. [2019-09-09 05:57:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5604 states to 5604 states and 8077 transitions. [2019-09-09 05:57:23,593 INFO L78 Accepts]: Start accepts. Automaton has 5604 states and 8077 transitions. Word has length 71 [2019-09-09 05:57:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:57:23,594 INFO L475 AbstractCegarLoop]: Abstraction has 5604 states and 8077 transitions. [2019-09-09 05:57:23,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:57:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 5604 states and 8077 transitions. [2019-09-09 05:57:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:57:23,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:57:23,598 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-09 05:57:23,598 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:57:23,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:57:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1562784128, now seen corresponding path program 1 times [2019-09-09 05:57:23,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:57:23,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:23,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:57:23,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:23,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:57:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:57:23,700 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-09 05:57:23,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:57:23,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:57:23,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:57:23,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:57:23,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:57:23,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:57:23,702 INFO L87 Difference]: Start difference. First operand 5604 states and 8077 transitions. Second operand 3 states. [2019-09-09 05:57:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:57:23,902 INFO L93 Difference]: Finished difference Result 6893 states and 9934 transitions. [2019-09-09 05:57:23,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:57:23,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-09 05:57:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:57:23,923 INFO L225 Difference]: With dead ends: 6893 [2019-09-09 05:57:23,923 INFO L226 Difference]: Without dead ends: 6893 [2019-09-09 05:57:23,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:57:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6893 states. [2019-09-09 05:57:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6893 to 5730. [2019-09-09 05:57:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5730 states. [2019-09-09 05:57:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5730 states to 5730 states and 8221 transitions. [2019-09-09 05:57:24,120 INFO L78 Accepts]: Start accepts. Automaton has 5730 states and 8221 transitions. Word has length 63 [2019-09-09 05:57:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:57:24,120 INFO L475 AbstractCegarLoop]: Abstraction has 5730 states and 8221 transitions. [2019-09-09 05:57:24,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:57:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5730 states and 8221 transitions. [2019-09-09 05:57:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:57:24,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:57:24,125 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-09 05:57:24,125 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:57:24,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:57:24,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1295748992, now seen corresponding path program 1 times [2019-09-09 05:57:24,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:57:24,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:24,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:57:24,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:57:24,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:57:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:57:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:57:24,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:57:24,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:57:24,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:57:24,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:57:24,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:57:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:57:24,266 INFO L87 Difference]: Start difference. First operand 5730 states and 8221 transitions. Second operand 7 states. [2019-09-09 05:58:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:22,234 INFO L93 Difference]: Finished difference Result 5584 states and 8046 transitions. [2019-09-09 05:58:22,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 05:58:22,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-09-09 05:58:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:22,249 INFO L225 Difference]: With dead ends: 5584 [2019-09-09 05:58:22,250 INFO L226 Difference]: Without dead ends: 5584 [2019-09-09 05:58:22,250 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-09 05:58:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5584 states. [2019-09-09 05:58:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5584 to 5570. [2019-09-09 05:58:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5570 states. [2019-09-09 05:58:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8031 transitions. [2019-09-09 05:58:22,409 INFO L78 Accepts]: Start accepts. Automaton has 5570 states and 8031 transitions. Word has length 63 [2019-09-09 05:58:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:22,409 INFO L475 AbstractCegarLoop]: Abstraction has 5570 states and 8031 transitions. [2019-09-09 05:58:22,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:58:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 8031 transitions. [2019-09-09 05:58:22,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-09 05:58:22,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:22,413 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-09 05:58:22,414 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:22,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:22,414 INFO L82 PathProgramCache]: Analyzing trace with hash 91646988, now seen corresponding path program 1 times [2019-09-09 05:58:22,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:22,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:22,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:22,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:22,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:22,690 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-09 05:58:22,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:22,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-09 05:58:22,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:22,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 05:58:22,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 05:58:22,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:58:22,693 INFO L87 Difference]: Start difference. First operand 5570 states and 8031 transitions. Second operand 11 states. [2019-09-09 05:58:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:24,933 INFO L93 Difference]: Finished difference Result 5586 states and 8048 transitions. [2019-09-09 05:58:24,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 05:58:24,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-09-09 05:58:24,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:24,947 INFO L225 Difference]: With dead ends: 5586 [2019-09-09 05:58:24,947 INFO L226 Difference]: Without dead ends: 5561 [2019-09-09 05:58:24,948 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-09 05:58:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5561 states. [2019-09-09 05:58:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5561 to 5561. [2019-09-09 05:58:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-09-09 05:58:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 8020 transitions. [2019-09-09 05:58:25,080 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 8020 transitions. Word has length 73 [2019-09-09 05:58:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:25,080 INFO L475 AbstractCegarLoop]: Abstraction has 5561 states and 8020 transitions. [2019-09-09 05:58:25,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 05:58:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 8020 transitions. [2019-09-09 05:58:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:58:25,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:25,084 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-09 05:58:25,084 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:25,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1653205276, now seen corresponding path program 1 times [2019-09-09 05:58:25,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:25,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:25,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:25,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:25,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:25,248 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-09 05:58:25,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:25,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:58:25,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:25,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:58:25,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:58:25,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:58:25,250 INFO L87 Difference]: Start difference. First operand 5561 states and 8020 transitions. Second operand 9 states. [2019-09-09 05:58:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:28,182 INFO L93 Difference]: Finished difference Result 5577 states and 8038 transitions. [2019-09-09 05:58:28,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:58:28,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-09-09 05:58:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:28,196 INFO L225 Difference]: With dead ends: 5577 [2019-09-09 05:58:28,196 INFO L226 Difference]: Without dead ends: 5576 [2019-09-09 05:58:28,197 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-09 05:58:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5576 states. [2019-09-09 05:58:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5576 to 5572. [2019-09-09 05:58:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5572 states. [2019-09-09 05:58:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 8033 transitions. [2019-09-09 05:58:28,310 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 8033 transitions. Word has length 64 [2019-09-09 05:58:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:28,310 INFO L475 AbstractCegarLoop]: Abstraction has 5572 states and 8033 transitions. [2019-09-09 05:58:28,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:58:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 8033 transitions. [2019-09-09 05:58:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:58:28,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:28,315 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-09 05:58:28,316 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:28,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1652928446, now seen corresponding path program 1 times [2019-09-09 05:58:28,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:28,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:28,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:28,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:28,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-09 05:58:28,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:28,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:58:28,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:28,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:58:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:58:28,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:58:28,454 INFO L87 Difference]: Start difference. First operand 5572 states and 8033 transitions. Second operand 6 states. [2019-09-09 05:58:34,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:34,421 INFO L93 Difference]: Finished difference Result 6737 states and 9745 transitions. [2019-09-09 05:58:34,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:58:34,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-09 05:58:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:34,441 INFO L225 Difference]: With dead ends: 6737 [2019-09-09 05:58:34,441 INFO L226 Difference]: Without dead ends: 6720 [2019-09-09 05:58:34,442 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-09 05:58:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6720 states. [2019-09-09 05:58:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6720 to 5559. [2019-09-09 05:58:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5559 states. [2019-09-09 05:58:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 8015 transitions. [2019-09-09 05:58:34,665 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 8015 transitions. Word has length 64 [2019-09-09 05:58:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:34,665 INFO L475 AbstractCegarLoop]: Abstraction has 5559 states and 8015 transitions. [2019-09-09 05:58:34,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:58:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 8015 transitions. [2019-09-09 05:58:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-09 05:58:34,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:34,668 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-09 05:58:34,668 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:34,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:34,669 INFO L82 PathProgramCache]: Analyzing trace with hash 610671469, now seen corresponding path program 1 times [2019-09-09 05:58:34,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:34,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:34,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:34,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:34,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:35,284 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-09 05:58:35,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:35,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:58:35,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:35,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:58:35,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:58:35,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:58:35,286 INFO L87 Difference]: Start difference. First operand 5559 states and 8015 transitions. Second operand 3 states. [2019-09-09 05:58:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:35,384 INFO L93 Difference]: Finished difference Result 5606 states and 8068 transitions. [2019-09-09 05:58:35,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:58:35,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-09 05:58:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:35,402 INFO L225 Difference]: With dead ends: 5606 [2019-09-09 05:58:35,402 INFO L226 Difference]: Without dead ends: 5606 [2019-09-09 05:58:35,404 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-09 05:58:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5606 states. [2019-09-09 05:58:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5606 to 5557. [2019-09-09 05:58:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5557 states. [2019-09-09 05:58:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5557 states to 5557 states and 8011 transitions. [2019-09-09 05:58:35,575 INFO L78 Accepts]: Start accepts. Automaton has 5557 states and 8011 transitions. Word has length 70 [2019-09-09 05:58:35,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:35,575 INFO L475 AbstractCegarLoop]: Abstraction has 5557 states and 8011 transitions. [2019-09-09 05:58:35,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:58:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 5557 states and 8011 transitions. [2019-09-09 05:58:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:58:35,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:35,579 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-09 05:58:35,579 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:35,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:35,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1101022210, now seen corresponding path program 1 times [2019-09-09 05:58:35,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:35,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:35,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:35,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:35,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:35,795 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-09 05:58:35,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:35,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:58:35,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:35,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:58:35,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:58:35,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:58:35,800 INFO L87 Difference]: Start difference. First operand 5557 states and 8011 transitions. Second operand 9 states. [2019-09-09 05:58:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:38,225 INFO L93 Difference]: Finished difference Result 5567 states and 8022 transitions. [2019-09-09 05:58:38,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:58:38,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-09 05:58:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:38,238 INFO L225 Difference]: With dead ends: 5567 [2019-09-09 05:58:38,238 INFO L226 Difference]: Without dead ends: 5535 [2019-09-09 05:58:38,238 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-09 05:58:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-09-09 05:58:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5535. [2019-09-09 05:58:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5535 states. [2019-09-09 05:58:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 7986 transitions. [2019-09-09 05:58:38,366 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 7986 transitions. Word has length 65 [2019-09-09 05:58:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:38,367 INFO L475 AbstractCegarLoop]: Abstraction has 5535 states and 7986 transitions. [2019-09-09 05:58:38,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:58:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 7986 transitions. [2019-09-09 05:58:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-09 05:58:38,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:38,371 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-09 05:58:38,372 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash -841217434, now seen corresponding path program 1 times [2019-09-09 05:58:38,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:38,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:38,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:58:38,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:38,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:58:38,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:38,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:58:38,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:58:38,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:58:38,566 INFO L87 Difference]: Start difference. First operand 5535 states and 7986 transitions. Second operand 3 states. [2019-09-09 05:58:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:38,824 INFO L93 Difference]: Finished difference Result 8014 states and 11587 transitions. [2019-09-09 05:58:38,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:58:38,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-09 05:58:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:38,857 INFO L225 Difference]: With dead ends: 8014 [2019-09-09 05:58:38,857 INFO L226 Difference]: Without dead ends: 8014 [2019-09-09 05:58:38,858 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-09 05:58:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8014 states. [2019-09-09 05:58:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8014 to 5538. [2019-09-09 05:58:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5538 states. [2019-09-09 05:58:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5538 states to 5538 states and 7986 transitions. [2019-09-09 05:58:39,163 INFO L78 Accepts]: Start accepts. Automaton has 5538 states and 7986 transitions. Word has length 72 [2019-09-09 05:58:39,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:39,164 INFO L475 AbstractCegarLoop]: Abstraction has 5538 states and 7986 transitions. [2019-09-09 05:58:39,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:58:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 5538 states and 7986 transitions. [2019-09-09 05:58:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:58:39,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:39,168 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-09 05:58:39,168 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash 549540455, now seen corresponding path program 1 times [2019-09-09 05:58:39,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:39,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:39,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:39,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:39,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:39,343 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-09 05:58:39,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:39,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:58:39,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:39,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:58:39,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:58:39,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:58:39,345 INFO L87 Difference]: Start difference. First operand 5538 states and 7986 transitions. Second operand 6 states. [2019-09-09 05:58:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:40,358 INFO L93 Difference]: Finished difference Result 5556 states and 8008 transitions. [2019-09-09 05:58:40,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:58:40,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-09-09 05:58:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:40,371 INFO L225 Difference]: With dead ends: 5556 [2019-09-09 05:58:40,372 INFO L226 Difference]: Without dead ends: 5430 [2019-09-09 05:58:40,372 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-09 05:58:40,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5430 states. [2019-09-09 05:58:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5430 to 5403. [2019-09-09 05:58:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5403 states. [2019-09-09 05:58:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 7775 transitions. [2019-09-09 05:58:40,511 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 7775 transitions. Word has length 81 [2019-09-09 05:58:40,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:40,511 INFO L475 AbstractCegarLoop]: Abstraction has 5403 states and 7775 transitions. [2019-09-09 05:58:40,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:58:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 7775 transitions. [2019-09-09 05:58:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-09 05:58:40,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:40,515 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-09 05:58:40,515 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:40,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1966852698, now seen corresponding path program 1 times [2019-09-09 05:58:40,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:40,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:40,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:40,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:40,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:40,750 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-09 05:58:40,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:40,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-09 05:58:40,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:40,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 05:58:40,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 05:58:40,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:58:40,752 INFO L87 Difference]: Start difference. First operand 5403 states and 7775 transitions. Second operand 11 states. [2019-09-09 05:58:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:41,067 INFO L93 Difference]: Finished difference Result 5415 states and 7788 transitions. [2019-09-09 05:58:41,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 05:58:41,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-09-09 05:58:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:41,085 INFO L225 Difference]: With dead ends: 5415 [2019-09-09 05:58:41,086 INFO L226 Difference]: Without dead ends: 5378 [2019-09-09 05:58:41,087 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-09 05:58:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5378 states. [2019-09-09 05:58:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5378 to 5378. [2019-09-09 05:58:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5378 states. [2019-09-09 05:58:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5378 states to 5378 states and 7747 transitions. [2019-09-09 05:58:41,202 INFO L78 Accepts]: Start accepts. Automaton has 5378 states and 7747 transitions. Word has length 75 [2019-09-09 05:58:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:41,202 INFO L475 AbstractCegarLoop]: Abstraction has 5378 states and 7747 transitions. [2019-09-09 05:58:41,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 05:58:41,202 INFO L276 IsEmpty]: Start isEmpty. Operand 5378 states and 7747 transitions. [2019-09-09 05:58:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:58:41,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:41,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, 1] [2019-09-09 05:58:41,207 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:41,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:41,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1373489922, now seen corresponding path program 1 times [2019-09-09 05:58:41,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:41,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:41,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:41,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:41,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:41,401 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-09 05:58:41,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:41,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:58:41,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:41,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:58:41,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:58:41,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:58:41,403 INFO L87 Difference]: Start difference. First operand 5378 states and 7747 transitions. Second operand 4 states. [2019-09-09 05:58:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:44,285 INFO L93 Difference]: Finished difference Result 3556 states and 4995 transitions. [2019-09-09 05:58:44,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:58:44,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:58:44,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:44,295 INFO L225 Difference]: With dead ends: 3556 [2019-09-09 05:58:44,296 INFO L226 Difference]: Without dead ends: 3556 [2019-09-09 05:58:44,296 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-09 05:58:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3556 states. [2019-09-09 05:58:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3556 to 3439. [2019-09-09 05:58:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3439 states. [2019-09-09 05:58:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 4860 transitions. [2019-09-09 05:58:44,358 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 4860 transitions. Word has length 81 [2019-09-09 05:58:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:44,358 INFO L475 AbstractCegarLoop]: Abstraction has 3439 states and 4860 transitions. [2019-09-09 05:58:44,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:58:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 4860 transitions. [2019-09-09 05:58:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:58:44,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:44,361 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-09 05:58:44,362 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:44,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1576500620, now seen corresponding path program 1 times [2019-09-09 05:58:44,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:44,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:44,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:44,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:44,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:44,547 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-09 05:58:44,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:44,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:58:44,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:44,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:58:44,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:58:44,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:58:44,549 INFO L87 Difference]: Start difference. First operand 3439 states and 4860 transitions. Second operand 3 states. [2019-09-09 05:58:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:44,614 INFO L93 Difference]: Finished difference Result 3517 states and 4946 transitions. [2019-09-09 05:58:44,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:58:44,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-09 05:58:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:44,626 INFO L225 Difference]: With dead ends: 3517 [2019-09-09 05:58:44,626 INFO L226 Difference]: Without dead ends: 3517 [2019-09-09 05:58:44,627 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-09 05:58:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2019-09-09 05:58:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3434. [2019-09-09 05:58:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3434 states. [2019-09-09 05:58:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4850 transitions. [2019-09-09 05:58:44,737 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4850 transitions. Word has length 80 [2019-09-09 05:58:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:44,740 INFO L475 AbstractCegarLoop]: Abstraction has 3434 states and 4850 transitions. [2019-09-09 05:58:44,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:58:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4850 transitions. [2019-09-09 05:58:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:58:44,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:44,743 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-09 05:58:44,743 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:44,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash -245192666, now seen corresponding path program 1 times [2019-09-09 05:58:44,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:44,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:44,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:44,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:44,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:44,902 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-09 05:58:44,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:44,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:58:44,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:44,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:58:44,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:58:44,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:58:44,904 INFO L87 Difference]: Start difference. First operand 3434 states and 4850 transitions. Second operand 6 states. [2019-09-09 05:58:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:47,072 INFO L93 Difference]: Finished difference Result 3441 states and 4856 transitions. [2019-09-09 05:58:47,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:58:47,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-09 05:58:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:47,080 INFO L225 Difference]: With dead ends: 3441 [2019-09-09 05:58:47,080 INFO L226 Difference]: Without dead ends: 3434 [2019-09-09 05:58:47,080 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-09 05:58:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2019-09-09 05:58:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3434. [2019-09-09 05:58:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3434 states. [2019-09-09 05:58:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3434 states to 3434 states and 4846 transitions. [2019-09-09 05:58:47,139 INFO L78 Accepts]: Start accepts. Automaton has 3434 states and 4846 transitions. Word has length 78 [2019-09-09 05:58:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:47,139 INFO L475 AbstractCegarLoop]: Abstraction has 3434 states and 4846 transitions. [2019-09-09 05:58:47,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:58:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3434 states and 4846 transitions. [2019-09-09 05:58:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:58:47,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:47,141 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-09 05:58:47,142 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:47,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:47,142 INFO L82 PathProgramCache]: Analyzing trace with hash -219822743, now seen corresponding path program 1 times [2019-09-09 05:58:47,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:47,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:47,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:47,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:47,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:47,394 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-09 05:58:47,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:47,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:58:47,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:47,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:58:47,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:58:47,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:58:47,396 INFO L87 Difference]: Start difference. First operand 3434 states and 4846 transitions. Second operand 5 states. [2019-09-09 05:58:47,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:47,443 INFO L93 Difference]: Finished difference Result 3404 states and 4809 transitions. [2019-09-09 05:58:47,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:58:47,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-09 05:58:47,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:47,454 INFO L225 Difference]: With dead ends: 3404 [2019-09-09 05:58:47,454 INFO L226 Difference]: Without dead ends: 3404 [2019-09-09 05:58:47,454 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-09 05:58:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2019-09-09 05:58:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3404. [2019-09-09 05:58:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-09-09 05:58:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4809 transitions. [2019-09-09 05:58:47,564 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4809 transitions. Word has length 79 [2019-09-09 05:58:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:47,564 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4809 transitions. [2019-09-09 05:58:47,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:58:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4809 transitions. [2019-09-09 05:58:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:58:47,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:47,567 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-09 05:58:47,568 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:47,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1253594992, now seen corresponding path program 1 times [2019-09-09 05:58:47,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:47,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:47,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:47,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:47,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:47,803 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-09 05:58:47,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:47,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:58:47,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:47,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:58:47,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:58:47,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:58:47,805 INFO L87 Difference]: Start difference. First operand 3404 states and 4809 transitions. Second operand 6 states. [2019-09-09 05:58:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:49,968 INFO L93 Difference]: Finished difference Result 3410 states and 4814 transitions. [2019-09-09 05:58:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:58:49,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-09-09 05:58:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:49,976 INFO L225 Difference]: With dead ends: 3410 [2019-09-09 05:58:49,976 INFO L226 Difference]: Without dead ends: 3404 [2019-09-09 05:58:49,976 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-09 05:58:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2019-09-09 05:58:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3404. [2019-09-09 05:58:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-09-09 05:58:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4807 transitions. [2019-09-09 05:58:50,034 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4807 transitions. Word has length 79 [2019-09-09 05:58:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:50,034 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4807 transitions. [2019-09-09 05:58:50,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:58:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4807 transitions. [2019-09-09 05:58:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-09 05:58:50,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:50,036 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-09 05:58:50,036 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash -56933927, now seen corresponding path program 1 times [2019-09-09 05:58:50,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:50,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:50,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:50,148 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-09 05:58:50,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:50,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:58:50,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:50,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:58:50,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:58:50,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:58:50,150 INFO L87 Difference]: Start difference. First operand 3404 states and 4807 transitions. Second operand 3 states. [2019-09-09 05:58:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:50,305 INFO L93 Difference]: Finished difference Result 3434 states and 4840 transitions. [2019-09-09 05:58:50,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:58:50,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-09 05:58:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:50,312 INFO L225 Difference]: With dead ends: 3434 [2019-09-09 05:58:50,313 INFO L226 Difference]: Without dead ends: 3406 [2019-09-09 05:58:50,313 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-09 05:58:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2019-09-09 05:58:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3404. [2019-09-09 05:58:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3404 states. [2019-09-09 05:58:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4806 transitions. [2019-09-09 05:58:50,376 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4806 transitions. Word has length 84 [2019-09-09 05:58:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:50,377 INFO L475 AbstractCegarLoop]: Abstraction has 3404 states and 4806 transitions. [2019-09-09 05:58:50,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:58:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4806 transitions. [2019-09-09 05:58:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-09 05:58:50,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:50,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] [2019-09-09 05:58:50,379 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:50,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:50,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1491366779, now seen corresponding path program 1 times [2019-09-09 05:58:50,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:50,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:50,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:50,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:50,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:50,567 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-09 05:58:50,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:50,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:58:50,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:50,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:58:50,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:58:50,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:58:50,569 INFO L87 Difference]: Start difference. First operand 3404 states and 4806 transitions. Second operand 3 states. [2019-09-09 05:58:50,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:50,622 INFO L93 Difference]: Finished difference Result 3417 states and 4824 transitions. [2019-09-09 05:58:50,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:58:50,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-09 05:58:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:50,634 INFO L225 Difference]: With dead ends: 3417 [2019-09-09 05:58:50,635 INFO L226 Difference]: Without dead ends: 3417 [2019-09-09 05:58:50,635 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-09 05:58:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2019-09-09 05:58:50,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 3409. [2019-09-09 05:58:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-09-09 05:58:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4813 transitions. [2019-09-09 05:58:50,740 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4813 transitions. Word has length 85 [2019-09-09 05:58:50,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:50,741 INFO L475 AbstractCegarLoop]: Abstraction has 3409 states and 4813 transitions. [2019-09-09 05:58:50,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:58:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4813 transitions. [2019-09-09 05:58:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:58:50,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:50,744 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-09 05:58:50,744 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:50,745 INFO L82 PathProgramCache]: Analyzing trace with hash 198331322, now seen corresponding path program 1 times [2019-09-09 05:58:50,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:50,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:50,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:50,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:50,928 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-09 05:58:50,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:50,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:58:50,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:50,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:58:50,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:58:50,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:58:50,930 INFO L87 Difference]: Start difference. First operand 3409 states and 4813 transitions. Second operand 6 states. [2019-09-09 05:58:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:53,086 INFO L93 Difference]: Finished difference Result 3415 states and 4818 transitions. [2019-09-09 05:58:53,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:58:53,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-09 05:58:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:53,094 INFO L225 Difference]: With dead ends: 3415 [2019-09-09 05:58:53,094 INFO L226 Difference]: Without dead ends: 3409 [2019-09-09 05:58:53,094 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-09 05:58:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2019-09-09 05:58:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 3409. [2019-09-09 05:58:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-09-09 05:58:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4812 transitions. [2019-09-09 05:58:53,169 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4812 transitions. Word has length 83 [2019-09-09 05:58:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:53,169 INFO L475 AbstractCegarLoop]: Abstraction has 3409 states and 4812 transitions. [2019-09-09 05:58:53,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:58:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4812 transitions. [2019-09-09 05:58:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-09 05:58:53,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:53,171 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-09 05:58:53,172 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:53,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:53,172 INFO L82 PathProgramCache]: Analyzing trace with hash -986895225, now seen corresponding path program 1 times [2019-09-09 05:58:53,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:53,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:53,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:53,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:53,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:53,416 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-09 05:58:53,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:53,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:58:53,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:53,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:58:53,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:58:53,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:58:53,419 INFO L87 Difference]: Start difference. First operand 3409 states and 4812 transitions. Second operand 6 states. [2019-09-09 05:58:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:53,534 INFO L93 Difference]: Finished difference Result 3421 states and 4825 transitions. [2019-09-09 05:58:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:58:53,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-09 05:58:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:53,542 INFO L225 Difference]: With dead ends: 3421 [2019-09-09 05:58:53,542 INFO L226 Difference]: Without dead ends: 3403 [2019-09-09 05:58:53,542 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-09 05:58:53,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2019-09-09 05:58:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3398. [2019-09-09 05:58:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3398 states. [2019-09-09 05:58:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4796 transitions. [2019-09-09 05:58:53,602 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4796 transitions. Word has length 86 [2019-09-09 05:58:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:53,602 INFO L475 AbstractCegarLoop]: Abstraction has 3398 states and 4796 transitions. [2019-09-09 05:58:53,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:58:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4796 transitions. [2019-09-09 05:58:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-09 05:58:53,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:53,604 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-09 05:58:53,604 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:53,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:53,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1597447618, now seen corresponding path program 1 times [2019-09-09 05:58:53,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:53,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:53,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:53,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:53,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:53,775 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-09 05:58:53,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:53,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:58:53,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:53,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:58:53,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:58:53,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:58:53,776 INFO L87 Difference]: Start difference. First operand 3398 states and 4796 transitions. Second operand 3 states. [2019-09-09 05:58:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:53,953 INFO L93 Difference]: Finished difference Result 4590 states and 6543 transitions. [2019-09-09 05:58:53,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:58:53,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-09 05:58:53,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:53,964 INFO L225 Difference]: With dead ends: 4590 [2019-09-09 05:58:53,964 INFO L226 Difference]: Without dead ends: 4590 [2019-09-09 05:58:53,965 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-09 05:58:53,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4590 states. [2019-09-09 05:58:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4590 to 3427. [2019-09-09 05:58:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-09-09 05:58:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 4831 transitions. [2019-09-09 05:58:54,044 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 4831 transitions. Word has length 84 [2019-09-09 05:58:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:54,045 INFO L475 AbstractCegarLoop]: Abstraction has 3427 states and 4831 transitions. [2019-09-09 05:58:54,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:58:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 4831 transitions. [2019-09-09 05:58:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-09 05:58:54,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:54,047 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-09 05:58:54,047 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash 198612998, now seen corresponding path program 1 times [2019-09-09 05:58:54,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:54,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:54,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:54,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:54,178 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-09 05:58:54,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:54,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:58:54,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:54,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:58:54,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:58:54,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:58:54,180 INFO L87 Difference]: Start difference. First operand 3427 states and 4831 transitions. Second operand 4 states. [2019-09-09 05:58:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:56,391 INFO L93 Difference]: Finished difference Result 3390 states and 4775 transitions. [2019-09-09 05:58:56,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:58:56,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-09 05:58:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:56,400 INFO L225 Difference]: With dead ends: 3390 [2019-09-09 05:58:56,401 INFO L226 Difference]: Without dead ends: 3390 [2019-09-09 05:58:56,401 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-09 05:58:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2019-09-09 05:58:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 3390. [2019-09-09 05:58:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3390 states. [2019-09-09 05:58:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 4775 transitions. [2019-09-09 05:58:56,458 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 4775 transitions. Word has length 85 [2019-09-09 05:58:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:56,459 INFO L475 AbstractCegarLoop]: Abstraction has 3390 states and 4775 transitions. [2019-09-09 05:58:56,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:58:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 4775 transitions. [2019-09-09 05:58:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:58:56,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:56,462 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-09 05:58:56,462 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:56,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:56,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1260388616, now seen corresponding path program 1 times [2019-09-09 05:58:56,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:56,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:56,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:56,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:56,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-09 05:58:56,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:56,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:58:56,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:56,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:58:56,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:58:56,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:58:56,621 INFO L87 Difference]: Start difference. First operand 3390 states and 4775 transitions. Second operand 3 states. [2019-09-09 05:58:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:58:56,732 INFO L93 Difference]: Finished difference Result 3388 states and 4771 transitions. [2019-09-09 05:58:56,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:58:56,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-09 05:58:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:58:56,741 INFO L225 Difference]: With dead ends: 3388 [2019-09-09 05:58:56,741 INFO L226 Difference]: Without dead ends: 3388 [2019-09-09 05:58:56,741 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-09 05:58:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2019-09-09 05:58:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3388. [2019-09-09 05:58:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-09-09 05:58:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4771 transitions. [2019-09-09 05:58:56,799 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4771 transitions. Word has length 90 [2019-09-09 05:58:56,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:58:56,799 INFO L475 AbstractCegarLoop]: Abstraction has 3388 states and 4771 transitions. [2019-09-09 05:58:56,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:58:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4771 transitions. [2019-09-09 05:58:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-09 05:58:56,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:58:56,802 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-09 05:58:56,802 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:58:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:58:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1824698338, now seen corresponding path program 1 times [2019-09-09 05:58:56,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:58:56,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:56,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:58:56,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:58:56,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:58:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:58:56,985 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-09 05:58:56,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:58:56,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:58:56,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:58:56,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:58:56,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:58:56,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:58:56,987 INFO L87 Difference]: Start difference. First operand 3388 states and 4771 transitions. Second operand 5 states. [2019-09-09 05:59:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:59:02,494 INFO L93 Difference]: Finished difference Result 4536 states and 6458 transitions. [2019-09-09 05:59:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:59:02,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-09 05:59:02,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:59:02,504 INFO L225 Difference]: With dead ends: 4536 [2019-09-09 05:59:02,505 INFO L226 Difference]: Without dead ends: 4536 [2019-09-09 05:59:02,505 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-09 05:59:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-09-09 05:59:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3388. [2019-09-09 05:59:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-09-09 05:59:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4770 transitions. [2019-09-09 05:59:02,582 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4770 transitions. Word has length 85 [2019-09-09 05:59:02,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:59:02,583 INFO L475 AbstractCegarLoop]: Abstraction has 3388 states and 4770 transitions. [2019-09-09 05:59:02,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:59:02,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4770 transitions. [2019-09-09 05:59:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-09 05:59:02,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:59:02,585 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-09 05:59:02,585 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:59:02,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:59:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash -834588261, now seen corresponding path program 1 times [2019-09-09 05:59:02,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:59:02,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:02,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:59:02,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:02,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:59:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:59:02,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-09 05:59:02,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:59:02,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:59:02,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:59:02,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:59:02,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:59:02,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:59:02,709 INFO L87 Difference]: Start difference. First operand 3388 states and 4770 transitions. Second operand 6 states. [2019-09-09 05:59:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:59:04,847 INFO L93 Difference]: Finished difference Result 3399 states and 4780 transitions. [2019-09-09 05:59:04,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:59:04,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-09-09 05:59:04,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:59:04,854 INFO L225 Difference]: With dead ends: 3399 [2019-09-09 05:59:04,854 INFO L226 Difference]: Without dead ends: 3394 [2019-09-09 05:59:04,854 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-09 05:59:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2019-09-09 05:59:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 3388. [2019-09-09 05:59:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-09-09 05:59:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4768 transitions. [2019-09-09 05:59:04,909 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4768 transitions. Word has length 85 [2019-09-09 05:59:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:59:04,909 INFO L475 AbstractCegarLoop]: Abstraction has 3388 states and 4768 transitions. [2019-09-09 05:59:04,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:59:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4768 transitions. [2019-09-09 05:59:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-09 05:59:04,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:59:04,911 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-09 05:59:04,911 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:59:04,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:59:04,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1629971384, now seen corresponding path program 1 times [2019-09-09 05:59:04,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:59:04,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:04,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:59:04,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:04,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:59:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:59:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:59:05,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:59:05,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:59:05,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:59:05,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:59:05,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:59:05,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:59:05,091 INFO L87 Difference]: Start difference. First operand 3388 states and 4768 transitions. Second operand 9 states. [2019-09-09 05:59:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:59:10,056 INFO L93 Difference]: Finished difference Result 3406 states and 4789 transitions. [2019-09-09 05:59:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:59:10,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-09 05:59:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:59:10,063 INFO L225 Difference]: With dead ends: 3406 [2019-09-09 05:59:10,064 INFO L226 Difference]: Without dead ends: 3405 [2019-09-09 05:59:10,064 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-09 05:59:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2019-09-09 05:59:10,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3401. [2019-09-09 05:59:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2019-09-09 05:59:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4784 transitions. [2019-09-09 05:59:10,117 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4784 transitions. Word has length 86 [2019-09-09 05:59:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:59:10,117 INFO L475 AbstractCegarLoop]: Abstraction has 3401 states and 4784 transitions. [2019-09-09 05:59:10,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:59:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4784 transitions. [2019-09-09 05:59:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-09 05:59:10,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:59:10,120 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-09 05:59:10,120 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:59:10,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:59:10,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1630248214, now seen corresponding path program 1 times [2019-09-09 05:59:10,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:59:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:10,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:59:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:10,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:59:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:59:10,258 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-09 05:59:10,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:59:10,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:59:10,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:59:10,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:59:10,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:59:10,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:59:10,260 INFO L87 Difference]: Start difference. First operand 3401 states and 4784 transitions. Second operand 5 states. [2019-09-09 05:59:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:59:15,435 INFO L93 Difference]: Finished difference Result 4549 states and 6470 transitions. [2019-09-09 05:59:15,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:59:15,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-09 05:59:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:59:15,445 INFO L225 Difference]: With dead ends: 4549 [2019-09-09 05:59:15,445 INFO L226 Difference]: Without dead ends: 4521 [2019-09-09 05:59:15,445 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-09 05:59:15,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4521 states. [2019-09-09 05:59:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4521 to 3373. [2019-09-09 05:59:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2019-09-09 05:59:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 4749 transitions. [2019-09-09 05:59:15,514 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 4749 transitions. Word has length 86 [2019-09-09 05:59:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:59:15,514 INFO L475 AbstractCegarLoop]: Abstraction has 3373 states and 4749 transitions. [2019-09-09 05:59:15,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:59:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 4749 transitions. [2019-09-09 05:59:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-09 05:59:15,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:59:15,516 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] [2019-09-09 05:59:15,516 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:59:15,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:59:15,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1226245044, now seen corresponding path program 1 times [2019-09-09 05:59:15,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:59:15,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:15,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:59:15,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:15,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:59:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:59:15,641 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-09 05:59:15,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:59:15,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:59:15,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:59:15,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:59:15,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:59:15,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:59:15,642 INFO L87 Difference]: Start difference. First operand 3373 states and 4749 transitions. Second operand 3 states. [2019-09-09 05:59:15,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:59:15,886 INFO L93 Difference]: Finished difference Result 4507 states and 6420 transitions. [2019-09-09 05:59:15,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:59:15,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-09 05:59:15,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:59:15,900 INFO L225 Difference]: With dead ends: 4507 [2019-09-09 05:59:15,900 INFO L226 Difference]: Without dead ends: 4507 [2019-09-09 05:59:15,900 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-09 05:59:15,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-09-09 05:59:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3377. [2019-09-09 05:59:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2019-09-09 05:59:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 4755 transitions. [2019-09-09 05:59:16,003 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 4755 transitions. Word has length 92 [2019-09-09 05:59:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:59:16,003 INFO L475 AbstractCegarLoop]: Abstraction has 3377 states and 4755 transitions. [2019-09-09 05:59:16,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:59:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 4755 transitions. [2019-09-09 05:59:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-09 05:59:16,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:59:16,006 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-09 05:59:16,006 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:59:16,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:59:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1327290318, now seen corresponding path program 1 times [2019-09-09 05:59:16,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:59:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:16,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:59:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:16,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:59:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:59:16,188 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-09 05:59:16,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:59:16,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:59:16,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:59:16,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:59:16,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:59:16,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:59:16,189 INFO L87 Difference]: Start difference. First operand 3377 states and 4755 transitions. Second operand 5 states. [2019-09-09 05:59:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:59:23,238 INFO L93 Difference]: Finished difference Result 5651 states and 8102 transitions. [2019-09-09 05:59:23,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:59:23,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-09 05:59:23,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:59:23,250 INFO L225 Difference]: With dead ends: 5651 [2019-09-09 05:59:23,250 INFO L226 Difference]: Without dead ends: 5651 [2019-09-09 05:59:23,251 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-09 05:59:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2019-09-09 05:59:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 3391. [2019-09-09 05:59:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3391 states. [2019-09-09 05:59:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 4772 transitions. [2019-09-09 05:59:23,331 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 4772 transitions. Word has length 94 [2019-09-09 05:59:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:59:23,331 INFO L475 AbstractCegarLoop]: Abstraction has 3391 states and 4772 transitions. [2019-09-09 05:59:23,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:59:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 4772 transitions. [2019-09-09 05:59:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:59:23,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:59:23,334 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-09 05:59:23,334 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:59:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:59:23,334 INFO L82 PathProgramCache]: Analyzing trace with hash -425043435, now seen corresponding path program 1 times [2019-09-09 05:59:23,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:59:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:23,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:59:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:23,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:59:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:59:23,576 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-09 05:59:23,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:59:23,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:59:23,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:59:23,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:59:23,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:59:23,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:59:23,577 INFO L87 Difference]: Start difference. First operand 3391 states and 4772 transitions. Second operand 14 states. [2019-09-09 05:59:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:59:30,144 INFO L93 Difference]: Finished difference Result 3405 states and 4787 transitions. [2019-09-09 05:59:30,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 05:59:30,144 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 101 [2019-09-09 05:59:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:59:30,151 INFO L225 Difference]: With dead ends: 3405 [2019-09-09 05:59:30,151 INFO L226 Difference]: Without dead ends: 3382 [2019-09-09 05:59:30,151 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-09 05:59:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3382 states. [2019-09-09 05:59:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3382 to 3382. [2019-09-09 05:59:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-09-09 05:59:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4760 transitions. [2019-09-09 05:59:30,207 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4760 transitions. Word has length 101 [2019-09-09 05:59:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:59:30,208 INFO L475 AbstractCegarLoop]: Abstraction has 3382 states and 4760 transitions. [2019-09-09 05:59:30,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:59:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4760 transitions. [2019-09-09 05:59:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-09 05:59:30,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:59:30,211 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-09 05:59:30,211 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:59:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:59:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2042461425, now seen corresponding path program 1 times [2019-09-09 05:59:30,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:59:30,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:30,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:59:30,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:30,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:59:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:59:30,446 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-09 05:59:30,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:59:30,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:59:30,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:59:30,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:59:30,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:59:30,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:59:30,448 INFO L87 Difference]: Start difference. First operand 3382 states and 4760 transitions. Second operand 14 states. [2019-09-09 05:59:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:59:37,315 INFO L93 Difference]: Finished difference Result 3396 states and 4775 transitions. [2019-09-09 05:59:37,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 05:59:37,317 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2019-09-09 05:59:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:59:37,324 INFO L225 Difference]: With dead ends: 3396 [2019-09-09 05:59:37,324 INFO L226 Difference]: Without dead ends: 3380 [2019-09-09 05:59:37,325 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-09 05:59:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2019-09-09 05:59:37,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3380. [2019-09-09 05:59:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3380 states. [2019-09-09 05:59:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4756 transitions. [2019-09-09 05:59:37,383 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4756 transitions. Word has length 91 [2019-09-09 05:59:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:59:37,383 INFO L475 AbstractCegarLoop]: Abstraction has 3380 states and 4756 transitions. [2019-09-09 05:59:37,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:59:37,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4756 transitions. [2019-09-09 05:59:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-09 05:59:37,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:59:37,385 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-09 05:59:37,385 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:59:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:59:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash -515610206, now seen corresponding path program 1 times [2019-09-09 05:59:37,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:59:37,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:37,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:59:37,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:37,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:59:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:59:37,631 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-09 05:59:37,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:59:37,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:59:37,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:59:37,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:59:37,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:59:37,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:59:37,633 INFO L87 Difference]: Start difference. First operand 3380 states and 4756 transitions. Second operand 14 states. [2019-09-09 05:59:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:59:44,469 INFO L93 Difference]: Finished difference Result 3394 states and 4771 transitions. [2019-09-09 05:59:44,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 05:59:44,470 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-09-09 05:59:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:59:44,477 INFO L225 Difference]: With dead ends: 3394 [2019-09-09 05:59:44,478 INFO L226 Difference]: Without dead ends: 3373 [2019-09-09 05:59:44,478 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-09 05:59:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2019-09-09 05:59:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3373. [2019-09-09 05:59:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2019-09-09 05:59:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 4747 transitions. [2019-09-09 05:59:44,550 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 4747 transitions. Word has length 98 [2019-09-09 05:59:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:59:44,550 INFO L475 AbstractCegarLoop]: Abstraction has 3373 states and 4747 transitions. [2019-09-09 05:59:44,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:59:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 4747 transitions. [2019-09-09 05:59:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-09 05:59:44,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:59:44,552 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-09 05:59:44,553 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:59:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:59:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1192745558, now seen corresponding path program 1 times [2019-09-09 05:59:44,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:59:44,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:44,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:59:44,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:44,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:59:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:59:44,823 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-09 05:59:44,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:59:44,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:59:44,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:59:44,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:59:44,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:59:44,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:59:44,825 INFO L87 Difference]: Start difference. First operand 3373 states and 4747 transitions. Second operand 14 states. [2019-09-09 05:59:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:59:51,466 INFO L93 Difference]: Finished difference Result 3387 states and 4762 transitions. [2019-09-09 05:59:51,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 05:59:51,466 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-09-09 05:59:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:59:51,474 INFO L225 Difference]: With dead ends: 3387 [2019-09-09 05:59:51,474 INFO L226 Difference]: Without dead ends: 3326 [2019-09-09 05:59:51,474 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-09 05:59:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2019-09-09 05:59:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3326. [2019-09-09 05:59:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2019-09-09 05:59:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 4681 transitions. [2019-09-09 05:59:51,533 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 4681 transitions. Word has length 97 [2019-09-09 05:59:51,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:59:51,533 INFO L475 AbstractCegarLoop]: Abstraction has 3326 states and 4681 transitions. [2019-09-09 05:59:51,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:59:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 4681 transitions. [2019-09-09 05:59:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-09 05:59:51,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:59:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:59:51,536 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:59:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:59:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1319756638, now seen corresponding path program 1 times [2019-09-09 05:59:51,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:59:51,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:51,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:59:51,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:51,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:59:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:59:51,790 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-09 05:59:51,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:59:51,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:59:51,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:59:51,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:59:51,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:59:51,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:59:51,791 INFO L87 Difference]: Start difference. First operand 3326 states and 4681 transitions. Second operand 14 states. [2019-09-09 05:59:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:59:58,855 INFO L93 Difference]: Finished difference Result 3340 states and 4696 transitions. [2019-09-09 05:59:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 05:59:58,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-09-09 05:59:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:59:58,864 INFO L225 Difference]: With dead ends: 3340 [2019-09-09 05:59:58,864 INFO L226 Difference]: Without dead ends: 3317 [2019-09-09 05:59:58,864 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-09 05:59:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2019-09-09 05:59:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2019-09-09 05:59:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3317 states. [2019-09-09 05:59:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4669 transitions. [2019-09-09 05:59:58,918 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4669 transitions. Word has length 98 [2019-09-09 05:59:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:59:58,918 INFO L475 AbstractCegarLoop]: Abstraction has 3317 states and 4669 transitions. [2019-09-09 05:59:58,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:59:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4669 transitions. [2019-09-09 05:59:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-09 05:59:58,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:59:58,920 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-09 05:59:58,920 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:59:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:59:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1507974481, now seen corresponding path program 1 times [2019-09-09 05:59:58,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:59:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:58,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:59:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:59:58,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:59:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:59:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:59:59,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:59:59,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 05:59:59,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:59:59,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:59:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:59:59,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:59:59,159 INFO L87 Difference]: Start difference. First operand 3317 states and 4669 transitions. Second operand 14 states. [2019-09-09 06:00:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:04,751 INFO L93 Difference]: Finished difference Result 3331 states and 4684 transitions. [2019-09-09 06:00:04,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 06:00:04,751 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-09-09 06:00:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:04,758 INFO L225 Difference]: With dead ends: 3331 [2019-09-09 06:00:04,758 INFO L226 Difference]: Without dead ends: 3310 [2019-09-09 06:00:04,759 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-09 06:00:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-09-09 06:00:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3310. [2019-09-09 06:00:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3310 states. [2019-09-09 06:00:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4660 transitions. [2019-09-09 06:00:04,810 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4660 transitions. Word has length 97 [2019-09-09 06:00:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:04,811 INFO L475 AbstractCegarLoop]: Abstraction has 3310 states and 4660 transitions. [2019-09-09 06:00:04,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 06:00:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4660 transitions. [2019-09-09 06:00:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 06:00:04,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:04,813 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-09 06:00:04,813 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:04,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:04,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1643656828, now seen corresponding path program 1 times [2019-09-09 06:00:04,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:04,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:04,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:04,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:04,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:05,056 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-09 06:00:05,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:05,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 06:00:05,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:05,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 06:00:05,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 06:00:05,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 06:00:05,058 INFO L87 Difference]: Start difference. First operand 3310 states and 4660 transitions. Second operand 14 states. [2019-09-09 06:00:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:11,046 INFO L93 Difference]: Finished difference Result 3324 states and 4675 transitions. [2019-09-09 06:00:11,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 06:00:11,047 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2019-09-09 06:00:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:11,053 INFO L225 Difference]: With dead ends: 3324 [2019-09-09 06:00:11,053 INFO L226 Difference]: Without dead ends: 3303 [2019-09-09 06:00:11,053 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-09 06:00:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2019-09-09 06:00:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 3303. [2019-09-09 06:00:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3303 states. [2019-09-09 06:00:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4651 transitions. [2019-09-09 06:00:11,104 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4651 transitions. Word has length 90 [2019-09-09 06:00:11,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:11,104 INFO L475 AbstractCegarLoop]: Abstraction has 3303 states and 4651 transitions. [2019-09-09 06:00:11,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 06:00:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4651 transitions. [2019-09-09 06:00:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 06:00:11,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:11,106 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-09 06:00:11,106 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash -823465480, now seen corresponding path program 1 times [2019-09-09 06:00:11,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:11,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:11,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:11,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:11,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:11,264 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-09 06:00:11,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:11,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 06:00:11,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:11,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 06:00:11,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 06:00:11,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 06:00:11,266 INFO L87 Difference]: Start difference. First operand 3303 states and 4651 transitions. Second operand 6 states. [2019-09-09 06:00:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:13,401 INFO L93 Difference]: Finished difference Result 3317 states and 4664 transitions. [2019-09-09 06:00:13,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 06:00:13,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-09 06:00:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:13,408 INFO L225 Difference]: With dead ends: 3317 [2019-09-09 06:00:13,408 INFO L226 Difference]: Without dead ends: 3292 [2019-09-09 06:00:13,408 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-09 06:00:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2019-09-09 06:00:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3282. [2019-09-09 06:00:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3282 states. [2019-09-09 06:00:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 4618 transitions. [2019-09-09 06:00:13,494 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 4618 transitions. Word has length 89 [2019-09-09 06:00:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:13,494 INFO L475 AbstractCegarLoop]: Abstraction has 3282 states and 4618 transitions. [2019-09-09 06:00:13,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 06:00:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 4618 transitions. [2019-09-09 06:00:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-09 06:00:13,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:13,497 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-09 06:00:13,497 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:13,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:13,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1688969787, now seen corresponding path program 1 times [2019-09-09 06:00:13,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:13,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:13,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:13,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:13,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:13,643 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-09 06:00:13,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:13,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 06:00:13,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:13,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 06:00:13,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 06:00:13,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 06:00:13,644 INFO L87 Difference]: Start difference. First operand 3282 states and 4618 transitions. Second operand 9 states. [2019-09-09 06:00:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:15,858 INFO L93 Difference]: Finished difference Result 3298 states and 4633 transitions. [2019-09-09 06:00:15,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 06:00:15,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-09 06:00:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:15,864 INFO L225 Difference]: With dead ends: 3298 [2019-09-09 06:00:15,864 INFO L226 Difference]: Without dead ends: 3288 [2019-09-09 06:00:15,865 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-09 06:00:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2019-09-09 06:00:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3282. [2019-09-09 06:00:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3282 states. [2019-09-09 06:00:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 4617 transitions. [2019-09-09 06:00:15,915 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 4617 transitions. Word has length 91 [2019-09-09 06:00:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:15,915 INFO L475 AbstractCegarLoop]: Abstraction has 3282 states and 4617 transitions. [2019-09-09 06:00:15,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 06:00:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 4617 transitions. [2019-09-09 06:00:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-09 06:00:15,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:15,918 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-09 06:00:15,918 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:15,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:15,918 INFO L82 PathProgramCache]: Analyzing trace with hash -645202431, now seen corresponding path program 1 times [2019-09-09 06:00:15,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:15,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:15,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:15,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:15,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:16,074 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-09 06:00:16,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:16,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 06:00:16,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:16,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 06:00:16,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 06:00:16,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 06:00:16,075 INFO L87 Difference]: Start difference. First operand 3282 states and 4617 transitions. Second operand 9 states. [2019-09-09 06:00:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:18,251 INFO L93 Difference]: Finished difference Result 3298 states and 4634 transitions. [2019-09-09 06:00:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 06:00:18,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-09 06:00:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:18,257 INFO L225 Difference]: With dead ends: 3298 [2019-09-09 06:00:18,257 INFO L226 Difference]: Without dead ends: 3255 [2019-09-09 06:00:18,257 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-09 06:00:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2019-09-09 06:00:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3255. [2019-09-09 06:00:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2019-09-09 06:00:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4589 transitions. [2019-09-09 06:00:18,310 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4589 transitions. Word has length 94 [2019-09-09 06:00:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:18,311 INFO L475 AbstractCegarLoop]: Abstraction has 3255 states and 4589 transitions. [2019-09-09 06:00:18,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 06:00:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4589 transitions. [2019-09-09 06:00:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-09 06:00:18,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 06:00:18,314 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:18,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1652788187, now seen corresponding path program 1 times [2019-09-09 06:00:18,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:18,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:18,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:18,431 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-09 06:00:18,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:18,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 06:00:18,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:18,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 06:00:18,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 06:00:18,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 06:00:18,433 INFO L87 Difference]: Start difference. First operand 3255 states and 4589 transitions. Second operand 3 states. [2019-09-09 06:00:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:18,466 INFO L93 Difference]: Finished difference Result 3271 states and 4607 transitions. [2019-09-09 06:00:18,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 06:00:18,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-09 06:00:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:18,473 INFO L225 Difference]: With dead ends: 3271 [2019-09-09 06:00:18,473 INFO L226 Difference]: Without dead ends: 3271 [2019-09-09 06:00:18,474 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-09 06:00:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2019-09-09 06:00:18,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 3258. [2019-09-09 06:00:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3258 states. [2019-09-09 06:00:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 4593 transitions. [2019-09-09 06:00:18,525 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 4593 transitions. Word has length 99 [2019-09-09 06:00:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:18,525 INFO L475 AbstractCegarLoop]: Abstraction has 3258 states and 4593 transitions. [2019-09-09 06:00:18,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 06:00:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 4593 transitions. [2019-09-09 06:00:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-09 06:00:18,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:18,527 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-09 06:00:18,527 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:18,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1065982173, now seen corresponding path program 1 times [2019-09-09 06:00:18,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:18,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:18,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:18,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:18,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:18,661 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-09 06:00:18,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:18,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 06:00:18,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:18,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 06:00:18,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 06:00:18,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 06:00:18,662 INFO L87 Difference]: Start difference. First operand 3258 states and 4593 transitions. Second operand 5 states. [2019-09-09 06:00:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:23,357 INFO L93 Difference]: Finished difference Result 3267 states and 4596 transitions. [2019-09-09 06:00:23,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 06:00:23,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-09 06:00:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:23,366 INFO L225 Difference]: With dead ends: 3267 [2019-09-09 06:00:23,366 INFO L226 Difference]: Without dead ends: 3267 [2019-09-09 06:00:23,366 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-09 06:00:23,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2019-09-09 06:00:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 3255. [2019-09-09 06:00:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2019-09-09 06:00:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4586 transitions. [2019-09-09 06:00:23,419 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4586 transitions. Word has length 99 [2019-09-09 06:00:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:23,419 INFO L475 AbstractCegarLoop]: Abstraction has 3255 states and 4586 transitions. [2019-09-09 06:00:23,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 06:00:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4586 transitions. [2019-09-09 06:00:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-09 06:00:23,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:23,421 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-09 06:00:23,421 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:23,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash 46133904, now seen corresponding path program 1 times [2019-09-09 06:00:23,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:23,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:23,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:23,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:23,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:23,540 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-09 06:00:23,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:23,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 06:00:23,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:23,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 06:00:23,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 06:00:23,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 06:00:23,541 INFO L87 Difference]: Start difference. First operand 3255 states and 4586 transitions. Second operand 8 states. [2019-09-09 06:00:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:25,697 INFO L93 Difference]: Finished difference Result 3261 states and 4591 transitions. [2019-09-09 06:00:25,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 06:00:25,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-09-09 06:00:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:25,703 INFO L225 Difference]: With dead ends: 3261 [2019-09-09 06:00:25,703 INFO L226 Difference]: Without dead ends: 3253 [2019-09-09 06:00:25,703 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-09 06:00:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2019-09-09 06:00:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 3253. [2019-09-09 06:00:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3253 states. [2019-09-09 06:00:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 4582 transitions. [2019-09-09 06:00:25,753 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 4582 transitions. Word has length 96 [2019-09-09 06:00:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:25,754 INFO L475 AbstractCegarLoop]: Abstraction has 3253 states and 4582 transitions. [2019-09-09 06:00:25,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 06:00:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 4582 transitions. [2019-09-09 06:00:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 06:00:25,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:25,755 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-09 06:00:25,755 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:25,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:25,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1848029162, now seen corresponding path program 1 times [2019-09-09 06:00:25,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:25,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:25,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:25,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:25,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:25,856 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-09 06:00:25,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:25,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 06:00:25,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:25,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 06:00:25,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 06:00:25,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 06:00:25,857 INFO L87 Difference]: Start difference. First operand 3253 states and 4582 transitions. Second operand 3 states. [2019-09-09 06:00:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:25,890 INFO L93 Difference]: Finished difference Result 3269 states and 4600 transitions. [2019-09-09 06:00:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 06:00:25,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-09 06:00:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:25,900 INFO L225 Difference]: With dead ends: 3269 [2019-09-09 06:00:25,900 INFO L226 Difference]: Without dead ends: 3269 [2019-09-09 06:00:25,900 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-09 06:00:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-09-09 06:00:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3253. [2019-09-09 06:00:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3253 states. [2019-09-09 06:00:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 4582 transitions. [2019-09-09 06:00:25,964 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 4582 transitions. Word has length 100 [2019-09-09 06:00:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:25,966 INFO L475 AbstractCegarLoop]: Abstraction has 3253 states and 4582 transitions. [2019-09-09 06:00:25,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 06:00:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 4582 transitions. [2019-09-09 06:00:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 06:00:25,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:25,969 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-09 06:00:25,969 INFO L418 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:25,969 INFO L82 PathProgramCache]: Analyzing trace with hash -761387094, now seen corresponding path program 1 times [2019-09-09 06:00:25,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:25,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:25,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:25,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:25,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:26,135 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-09 06:00:26,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:26,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 06:00:26,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:26,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 06:00:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 06:00:26,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 06:00:26,136 INFO L87 Difference]: Start difference. First operand 3253 states and 4582 transitions. Second operand 3 states. [2019-09-09 06:00:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:26,319 INFO L93 Difference]: Finished difference Result 4439 states and 6304 transitions. [2019-09-09 06:00:26,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 06:00:26,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-09 06:00:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:26,333 INFO L225 Difference]: With dead ends: 4439 [2019-09-09 06:00:26,333 INFO L226 Difference]: Without dead ends: 4439 [2019-09-09 06:00:26,333 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-09 06:00:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4439 states. [2019-09-09 06:00:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4439 to 4382. [2019-09-09 06:00:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4382 states. [2019-09-09 06:00:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 6242 transitions. [2019-09-09 06:00:26,468 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 6242 transitions. Word has length 100 [2019-09-09 06:00:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:26,469 INFO L475 AbstractCegarLoop]: Abstraction has 4382 states and 6242 transitions. [2019-09-09 06:00:26,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 06:00:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 6242 transitions. [2019-09-09 06:00:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-09 06:00:26,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:26,471 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-09 06:00:26,471 INFO L418 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:26,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash 738347308, now seen corresponding path program 1 times [2019-09-09 06:00:26,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:26,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:26,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:26,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:26,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-09 06:00:26,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:26,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-09 06:00:26,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:26,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 06:00:26,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 06:00:26,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-09 06:00:26,725 INFO L87 Difference]: Start difference. First operand 4382 states and 6242 transitions. Second operand 14 states. [2019-09-09 06:00:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:32,393 INFO L93 Difference]: Finished difference Result 4396 states and 6257 transitions. [2019-09-09 06:00:32,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 06:00:32,394 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2019-09-09 06:00:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:32,403 INFO L225 Difference]: With dead ends: 4396 [2019-09-09 06:00:32,403 INFO L226 Difference]: Without dead ends: 4373 [2019-09-09 06:00:32,403 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-09 06:00:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2019-09-09 06:00:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4373. [2019-09-09 06:00:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4373 states. [2019-09-09 06:00:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 6230 transitions. [2019-09-09 06:00:32,478 INFO L78 Accepts]: Start accepts. Automaton has 4373 states and 6230 transitions. Word has length 107 [2019-09-09 06:00:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:32,478 INFO L475 AbstractCegarLoop]: Abstraction has 4373 states and 6230 transitions. [2019-09-09 06:00:32,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 06:00:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4373 states and 6230 transitions. [2019-09-09 06:00:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-09 06:00:32,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:32,480 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-09 06:00:32,480 INFO L418 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:32,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:32,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1211368971, now seen corresponding path program 1 times [2019-09-09 06:00:32,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:32,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:32,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:32,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:32,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:32,677 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-09 06:00:32,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:32,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 06:00:32,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:32,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 06:00:32,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 06:00:32,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 06:00:32,678 INFO L87 Difference]: Start difference. First operand 4373 states and 6230 transitions. Second operand 8 states. [2019-09-09 06:00:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:34,850 INFO L93 Difference]: Finished difference Result 4379 states and 6235 transitions. [2019-09-09 06:00:34,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 06:00:34,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-09-09 06:00:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:34,859 INFO L225 Difference]: With dead ends: 4379 [2019-09-09 06:00:34,859 INFO L226 Difference]: Without dead ends: 4371 [2019-09-09 06:00:34,859 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-09 06:00:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2019-09-09 06:00:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 4371. [2019-09-09 06:00:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4371 states. [2019-09-09 06:00:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4371 states to 4371 states and 6226 transitions. [2019-09-09 06:00:34,934 INFO L78 Accepts]: Start accepts. Automaton has 4371 states and 6226 transitions. Word has length 97 [2019-09-09 06:00:34,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:34,935 INFO L475 AbstractCegarLoop]: Abstraction has 4371 states and 6226 transitions. [2019-09-09 06:00:34,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 06:00:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 4371 states and 6226 transitions. [2019-09-09 06:00:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-09 06:00:34,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:34,936 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-09 06:00:34,936 INFO L418 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:34,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2046190639, now seen corresponding path program 1 times [2019-09-09 06:00:34,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:34,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:34,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:34,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:34,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:35,192 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-09 06:00:35,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:35,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-09 06:00:35,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:35,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-09 06:00:35,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-09 06:00:35,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-09 06:00:35,195 INFO L87 Difference]: Start difference. First operand 4371 states and 6226 transitions. Second operand 15 states. [2019-09-09 06:00:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:40,920 INFO L93 Difference]: Finished difference Result 4385 states and 6241 transitions. [2019-09-09 06:00:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-09 06:00:40,921 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-09-09 06:00:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:40,929 INFO L225 Difference]: With dead ends: 4385 [2019-09-09 06:00:40,929 INFO L226 Difference]: Without dead ends: 4346 [2019-09-09 06:00:40,930 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-09 06:00:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-09-09 06:00:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4346. [2019-09-09 06:00:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4346 states. [2019-09-09 06:00:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 6199 transitions. [2019-09-09 06:00:41,003 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 6199 transitions. Word has length 97 [2019-09-09 06:00:41,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:41,003 INFO L475 AbstractCegarLoop]: Abstraction has 4346 states and 6199 transitions. [2019-09-09 06:00:41,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-09 06:00:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 6199 transitions. [2019-09-09 06:00:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 06:00:41,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:41,004 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-09 06:00:41,005 INFO L418 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:41,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:41,005 INFO L82 PathProgramCache]: Analyzing trace with hash 765573323, now seen corresponding path program 1 times [2019-09-09 06:00:41,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:41,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:41,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:41,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:41,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:41,126 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-09 06:00:41,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:41,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 06:00:41,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:41,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 06:00:41,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 06:00:41,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 06:00:41,128 INFO L87 Difference]: Start difference. First operand 4346 states and 6199 transitions. Second operand 8 states. [2019-09-09 06:00:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:43,282 INFO L93 Difference]: Finished difference Result 4352 states and 6204 transitions. [2019-09-09 06:00:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 06:00:43,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-09 06:00:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:43,290 INFO L225 Difference]: With dead ends: 4352 [2019-09-09 06:00:43,291 INFO L226 Difference]: Without dead ends: 4343 [2019-09-09 06:00:43,293 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-09 06:00:43,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2019-09-09 06:00:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 4343. [2019-09-09 06:00:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4343 states. [2019-09-09 06:00:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6194 transitions. [2019-09-09 06:00:43,372 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 6194 transitions. Word has length 101 [2019-09-09 06:00:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:43,372 INFO L475 AbstractCegarLoop]: Abstraction has 4343 states and 6194 transitions. [2019-09-09 06:00:43,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 06:00:43,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 6194 transitions. [2019-09-09 06:00:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-09 06:00:43,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:43,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:00:43,374 INFO L418 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:43,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:43,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1584193472, now seen corresponding path program 1 times [2019-09-09 06:00:43,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:43,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:43,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:43,639 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-09 06:00:43,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:43,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 06:00:43,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:43,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 06:00:43,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 06:00:43,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 06:00:43,640 INFO L87 Difference]: Start difference. First operand 4343 states and 6194 transitions. Second operand 9 states. [2019-09-09 06:00:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:46,499 INFO L93 Difference]: Finished difference Result 4346 states and 6196 transitions. [2019-09-09 06:00:46,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 06:00:46,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-09 06:00:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:46,507 INFO L225 Difference]: With dead ends: 4346 [2019-09-09 06:00:46,507 INFO L226 Difference]: Without dead ends: 4195 [2019-09-09 06:00:46,508 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-09 06:00:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-09-09 06:00:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4195. [2019-09-09 06:00:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-09-09 06:00:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6006 transitions. [2019-09-09 06:00:46,579 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6006 transitions. Word has length 99 [2019-09-09 06:00:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:46,580 INFO L475 AbstractCegarLoop]: Abstraction has 4195 states and 6006 transitions. [2019-09-09 06:00:46,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 06:00:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6006 transitions. [2019-09-09 06:00:46,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 06:00:46,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:46,581 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-09 06:00:46,581 INFO L418 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:46,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1255010522, now seen corresponding path program 1 times [2019-09-09 06:00:46,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:46,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:46,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:46,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:46,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:46,711 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-09 06:00:46,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:46,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 06:00:46,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:46,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 06:00:46,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 06:00:46,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 06:00:46,713 INFO L87 Difference]: Start difference. First operand 4195 states and 6006 transitions. Second operand 8 states. [2019-09-09 06:00:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:48,885 INFO L93 Difference]: Finished difference Result 4201 states and 6011 transitions. [2019-09-09 06:00:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 06:00:48,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-09 06:00:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:48,894 INFO L225 Difference]: With dead ends: 4201 [2019-09-09 06:00:48,894 INFO L226 Difference]: Without dead ends: 4192 [2019-09-09 06:00:48,894 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-09 06:00:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2019-09-09 06:00:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 4192. [2019-09-09 06:00:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4192 states. [2019-09-09 06:00:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4192 states to 4192 states and 6001 transitions. [2019-09-09 06:00:48,966 INFO L78 Accepts]: Start accepts. Automaton has 4192 states and 6001 transitions. Word has length 102 [2019-09-09 06:00:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:48,966 INFO L475 AbstractCegarLoop]: Abstraction has 4192 states and 6001 transitions. [2019-09-09 06:00:48,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 06:00:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 4192 states and 6001 transitions. [2019-09-09 06:00:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 06:00:48,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:48,968 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-09 06:00:48,968 INFO L418 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:48,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:48,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1737372550, now seen corresponding path program 1 times [2019-09-09 06:00:48,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:48,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:48,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:48,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:48,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:49,033 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-09 06:00:49,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:49,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 06:00:49,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:49,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 06:00:49,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 06:00:49,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 06:00:49,034 INFO L87 Difference]: Start difference. First operand 4192 states and 6001 transitions. Second operand 3 states. [2019-09-09 06:00:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:51,114 INFO L93 Difference]: Finished difference Result 4136 states and 5939 transitions. [2019-09-09 06:00:51,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 06:00:51,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-09 06:00:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:51,122 INFO L225 Difference]: With dead ends: 4136 [2019-09-09 06:00:51,122 INFO L226 Difference]: Without dead ends: 3897 [2019-09-09 06:00:51,122 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-09 06:00:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3897 states. [2019-09-09 06:00:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3897 to 3897. [2019-09-09 06:00:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3897 states. [2019-09-09 06:00:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 5589 transitions. [2019-09-09 06:00:51,189 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 5589 transitions. Word has length 105 [2019-09-09 06:00:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:51,189 INFO L475 AbstractCegarLoop]: Abstraction has 3897 states and 5589 transitions. [2019-09-09 06:00:51,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 06:00:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 5589 transitions. [2019-09-09 06:00:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 06:00:51,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:51,190 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-09 06:00:51,191 INFO L418 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:51,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:51,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1094519463, now seen corresponding path program 1 times [2019-09-09 06:00:51,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:51,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:51,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:51,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:51,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:51,362 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-09 06:00:51,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:51,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-09 06:00:51,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:51,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 06:00:51,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 06:00:51,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-09 06:00:51,363 INFO L87 Difference]: Start difference. First operand 3897 states and 5589 transitions. Second operand 11 states. [2019-09-09 06:00:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:53,562 INFO L93 Difference]: Finished difference Result 3898 states and 5588 transitions. [2019-09-09 06:00:53,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 06:00:53,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-09 06:00:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:53,571 INFO L225 Difference]: With dead ends: 3898 [2019-09-09 06:00:53,571 INFO L226 Difference]: Without dead ends: 3868 [2019-09-09 06:00:53,571 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-09 06:00:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2019-09-09 06:00:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3868. [2019-09-09 06:00:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3868 states. [2019-09-09 06:00:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3868 states to 3868 states and 5556 transitions. [2019-09-09 06:00:53,644 INFO L78 Accepts]: Start accepts. Automaton has 3868 states and 5556 transitions. Word has length 105 [2019-09-09 06:00:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:53,644 INFO L475 AbstractCegarLoop]: Abstraction has 3868 states and 5556 transitions. [2019-09-09 06:00:53,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 06:00:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3868 states and 5556 transitions. [2019-09-09 06:00:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 06:00:53,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:53,645 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-09 06:00:53,646 INFO L418 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:53,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:53,646 INFO L82 PathProgramCache]: Analyzing trace with hash -799423163, now seen corresponding path program 1 times [2019-09-09 06:00:53,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:53,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:53,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:53,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:53,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 06:00:53,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:53,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 06:00:53,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:53,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 06:00:53,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 06:00:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 06:00:53,771 INFO L87 Difference]: Start difference. First operand 3868 states and 5556 transitions. Second operand 6 states. [2019-09-09 06:00:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:55,878 INFO L93 Difference]: Finished difference Result 3898 states and 5592 transitions. [2019-09-09 06:00:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 06:00:55,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-09-09 06:00:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:55,885 INFO L225 Difference]: With dead ends: 3898 [2019-09-09 06:00:55,885 INFO L226 Difference]: Without dead ends: 3898 [2019-09-09 06:00:55,886 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-09 06:00:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2019-09-09 06:00:55,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3886. [2019-09-09 06:00:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states. [2019-09-09 06:00:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 5578 transitions. [2019-09-09 06:00:55,990 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 5578 transitions. Word has length 111 [2019-09-09 06:00:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:55,990 INFO L475 AbstractCegarLoop]: Abstraction has 3886 states and 5578 transitions. [2019-09-09 06:00:55,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 06:00:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 5578 transitions. [2019-09-09 06:00:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 06:00:55,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:55,991 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-09 06:00:55,991 INFO L418 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2079286841, now seen corresponding path program 1 times [2019-09-09 06:00:55,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:55,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:55,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:55,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:55,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:56,185 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-09 06:00:56,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:56,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 06:00:56,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:56,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 06:00:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 06:00:56,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 06:00:56,186 INFO L87 Difference]: Start difference. First operand 3886 states and 5578 transitions. Second operand 9 states. [2019-09-09 06:00:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:00:58,392 INFO L93 Difference]: Finished difference Result 3946 states and 5673 transitions. [2019-09-09 06:00:58,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 06:00:58,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-09 06:00:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:00:58,400 INFO L225 Difference]: With dead ends: 3946 [2019-09-09 06:00:58,400 INFO L226 Difference]: Without dead ends: 3946 [2019-09-09 06:00:58,400 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-09 06:00:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2019-09-09 06:00:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3896. [2019-09-09 06:00:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3896 states. [2019-09-09 06:00:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 5590 transitions. [2019-09-09 06:00:58,469 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 5590 transitions. Word has length 111 [2019-09-09 06:00:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:00:58,469 INFO L475 AbstractCegarLoop]: Abstraction has 3896 states and 5590 transitions. [2019-09-09 06:00:58,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 06:00:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 5590 transitions. [2019-09-09 06:00:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 06:00:58,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:00:58,471 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-09 06:00:58,471 INFO L418 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:00:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:00:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1392010840, now seen corresponding path program 1 times [2019-09-09 06:00:58,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:00:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:58,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:00:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:00:58,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:00:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:00:58,664 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-09 06:00:58,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:00:58,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 06:00:58,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:00:58,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 06:00:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 06:00:58,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-09 06:00:58,665 INFO L87 Difference]: Start difference. First operand 3896 states and 5590 transitions. Second operand 9 states. [2019-09-09 06:01:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:01:00,895 INFO L93 Difference]: Finished difference Result 3910 states and 5606 transitions. [2019-09-09 06:01:00,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 06:01:00,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-09 06:01:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:01:00,903 INFO L225 Difference]: With dead ends: 3910 [2019-09-09 06:01:00,903 INFO L226 Difference]: Without dead ends: 3910 [2019-09-09 06:01:00,904 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-09 06:01:00,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2019-09-09 06:01:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 3900. [2019-09-09 06:01:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3900 states. [2019-09-09 06:01:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 5594 transitions. [2019-09-09 06:01:01,002 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 5594 transitions. Word has length 111 [2019-09-09 06:01:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:01:01,002 INFO L475 AbstractCegarLoop]: Abstraction has 3900 states and 5594 transitions. [2019-09-09 06:01:01,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 06:01:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 5594 transitions. [2019-09-09 06:01:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-09 06:01:01,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:01:01,004 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-09 06:01:01,004 INFO L418 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:01:01,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:01:01,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1319118770, now seen corresponding path program 1 times [2019-09-09 06:01:01,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:01:01,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:01:01,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:01:01,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:01:01,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:01:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:01:01,179 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-09 06:01:01,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:01:01,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 06:01:01,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:01:01,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 06:01:01,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 06:01:01,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 06:01:01,180 INFO L87 Difference]: Start difference. First operand 3900 states and 5594 transitions. Second operand 8 states. [2019-09-09 06:03:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:03:37,747 INFO L93 Difference]: Finished difference Result 7817 states and 11251 transitions. [2019-09-09 06:03:37,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 06:03:37,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-09-09 06:03:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:03:37,768 INFO L225 Difference]: With dead ends: 7817 [2019-09-09 06:03:37,768 INFO L226 Difference]: Without dead ends: 7817 [2019-09-09 06:03:37,768 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-09 06:03:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7817 states. [2019-09-09 06:03:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7817 to 7626. [2019-09-09 06:03:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7626 states. [2019-09-09 06:03:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7626 states to 7626 states and 11007 transitions. [2019-09-09 06:03:37,940 INFO L78 Accepts]: Start accepts. Automaton has 7626 states and 11007 transitions. Word has length 112 [2019-09-09 06:03:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:03:37,940 INFO L475 AbstractCegarLoop]: Abstraction has 7626 states and 11007 transitions. [2019-09-09 06:03:37,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 06:03:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 7626 states and 11007 transitions. [2019-09-09 06:03:37,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-09 06:03:37,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:03:37,942 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-09 06:03:37,942 INFO L418 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:03:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:03:37,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1695984848, now seen corresponding path program 1 times [2019-09-09 06:03:37,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:03:37,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:03:37,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:03:37,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:03:37,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:03:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:03:38,079 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-09 06:03:38,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:03:38,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 06:03:38,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:03:38,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 06:03:38,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 06:03:38,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 06:03:38,081 INFO L87 Difference]: Start difference. First operand 7626 states and 11007 transitions. Second operand 4 states. [2019-09-09 06:03:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:03:38,262 INFO L93 Difference]: Finished difference Result 7658 states and 11053 transitions. [2019-09-09 06:03:38,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 06:03:38,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-09 06:03:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:03:38,286 INFO L225 Difference]: With dead ends: 7658 [2019-09-09 06:03:38,287 INFO L226 Difference]: Without dead ends: 7652 [2019-09-09 06:03:38,288 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-09 06:03:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2019-09-09 06:03:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 7652. [2019-09-09 06:03:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7652 states. [2019-09-09 06:03:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7652 states to 7652 states and 11045 transitions. [2019-09-09 06:03:38,515 INFO L78 Accepts]: Start accepts. Automaton has 7652 states and 11045 transitions. Word has length 112 [2019-09-09 06:03:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:03:38,515 INFO L475 AbstractCegarLoop]: Abstraction has 7652 states and 11045 transitions. [2019-09-09 06:03:38,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 06:03:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 7652 states and 11045 transitions. [2019-09-09 06:03:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-09 06:03:38,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:03:38,517 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-09 06:03:38,517 INFO L418 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:03:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:03:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash -298592059, now seen corresponding path program 1 times [2019-09-09 06:03:38,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:03:38,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:03:38,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:03:38,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:03:38,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:03:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:03:38,632 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-09 06:03:38,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:03:38,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 06:03:38,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:03:38,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 06:03:38,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 06:03:38,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 06:03:38,633 INFO L87 Difference]: Start difference. First operand 7652 states and 11045 transitions. Second operand 4 states. [2019-09-09 06:03:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:03:38,795 INFO L93 Difference]: Finished difference Result 7694 states and 11099 transitions. [2019-09-09 06:03:38,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 06:03:38,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-09 06:03:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:03:38,812 INFO L225 Difference]: With dead ends: 7694 [2019-09-09 06:03:38,812 INFO L226 Difference]: Without dead ends: 7690 [2019-09-09 06:03:38,812 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-09 06:03:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7690 states. [2019-09-09 06:03:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7690 to 7660. [2019-09-09 06:03:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7660 states. [2019-09-09 06:03:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7660 states to 7660 states and 11059 transitions. [2019-09-09 06:03:38,994 INFO L78 Accepts]: Start accepts. Automaton has 7660 states and 11059 transitions. Word has length 113 [2019-09-09 06:03:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:03:38,995 INFO L475 AbstractCegarLoop]: Abstraction has 7660 states and 11059 transitions. [2019-09-09 06:03:38,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 06:03:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7660 states and 11059 transitions. [2019-09-09 06:03:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-09 06:03:38,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:03:38,997 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-09 06:03:38,997 INFO L418 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:03:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:03:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash -658667282, now seen corresponding path program 1 times [2019-09-09 06:03:38,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:03:39,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:03:39,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:03:39,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:03:39,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:03:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:03:39,169 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-09 06:03:39,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 06:03:39,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 06:03:39,172 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 115 with the following transitions: [2019-09-09 06:03:39,175 INFO L207 CegarAbsIntRunner]: [763], [768], [855], [858], [861], [863], [879], [888], [891], [898], [906], [927], [928], [931], [932], [933], [936], [939], [946], [951], [956], [959], [1604], [1605], [2151], [2155], [2157], [2161], [2163], [2164], [2184], [2187], [2193], [2199], [2201], [2203], [2205], [2210], [2212], [2213], [2445], [2446], [2480], [2482], [2483], [2662], [3800], [3804], [3809], [3815], [3820], [3825], [3828], [3981], [3984], [3986], [4150], [4151], [4658], [4671], [4673], [4676], [4679], [4742], [4841], [4852], [4858], [4864], [4868], [4873], [4877], [4882], [4884], [4891], [4893], [4894], [4895], [4898], [4902], [5183], [5186], [5188], [5614], [5632], [5633], [5640], [5641], [5642], [5643], [5650], [5848], [5849], [5850], [5851], [5856], [5857], [5858], [5859], [5910], [5911], [6150], [6151], [6152], [6153], [6158], [6350], [6354], [6355], [6372], [6394], [6395], [6540], [6541], [6542] [2019-09-09 06:03:39,276 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 06:03:39,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 06:03:39,431 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 06:03:39,433 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 141 root evaluator evaluations with a maximum evaluation depth of 0. Performed 141 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 238 variables. [2019-09-09 06:03:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:03:39,440 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 06:03:39,543 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 06:03:39,543 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 06:03:39,549 INFO L420 sIntCurrentIteration]: We unified 113 AI predicates to 113 [2019-09-09 06:03:39,550 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 06:03:39,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 06:03:39,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2019-09-09 06:03:39,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:03:39,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 06:03:39,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 06:03:39,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 06:03:39,552 INFO L87 Difference]: Start difference. First operand 7660 states and 11059 transitions. Second operand 2 states. [2019-09-09 06:03:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:03:39,553 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 06:03:39,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 06:03:39,553 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 114 [2019-09-09 06:03:39,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:03:39,554 INFO L225 Difference]: With dead ends: 2 [2019-09-09 06:03:39,554 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 06:03:39,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 06:03:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 06:03:39,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 06:03:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 06:03:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 06:03:39,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2019-09-09 06:03:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:03:39,555 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 06:03:39,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 06:03:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 06:03:39,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 06:03:39,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 06:03:39 BoogieIcfgContainer [2019-09-09 06:03:39,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 06:03:39,563 INFO L168 Benchmark]: Toolchain (without parser) took 694315.26 ms. Allocated memory was 136.3 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 81.6 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 406.7 MB. Max. memory is 7.1 GB. [2019-09-09 06:03:39,564 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.3 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 06:03:39,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3222.74 ms. Allocated memory was 136.3 MB in the beginning and 264.2 MB in the end (delta: 127.9 MB). Free memory was 81.4 MB in the beginning and 101.0 MB in the end (delta: -19.6 MB). Peak memory consumption was 120.7 MB. Max. memory is 7.1 GB. [2019-09-09 06:03:39,570 INFO L168 Benchmark]: Boogie Preprocessor took 655.95 ms. Allocated memory was 264.2 MB in the beginning and 271.6 MB in the end (delta: 7.3 MB). Free memory was 101.0 MB in the beginning and 154.8 MB in the end (delta: -53.7 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2019-09-09 06:03:39,571 INFO L168 Benchmark]: RCFGBuilder took 77475.27 ms. Allocated memory was 271.6 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 154.8 MB in the beginning and 837.7 MB in the end (delta: -682.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-09-09 06:03:39,575 INFO L168 Benchmark]: TraceAbstraction took 612956.98 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 638.6 MB). Free memory was 837.7 MB in the beginning and 1.8 GB in the end (delta: -978.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 06:03:39,582 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 136.3 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3222.74 ms. Allocated memory was 136.3 MB in the beginning and 264.2 MB in the end (delta: 127.9 MB). Free memory was 81.4 MB in the beginning and 101.0 MB in the end (delta: -19.6 MB). Peak memory consumption was 120.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 655.95 ms. Allocated memory was 264.2 MB in the beginning and 271.6 MB in the end (delta: 7.3 MB). Free memory was 101.0 MB in the beginning and 154.8 MB in the end (delta: -53.7 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 77475.27 ms. Allocated memory was 271.6 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 154.8 MB in the beginning and 837.7 MB in the end (delta: -682.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * TraceAbstraction took 612956.98 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 638.6 MB). Free memory was 837.7 MB in the beginning and 1.8 GB in the end (delta: -978.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2407]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 221 procedures, 2448 locations, 1 error locations. SAFE Result, 612.8s OverallTime, 84 OverallIterations, 2 TraceHistogramMax, 584.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 221247 SDtfs, 77152 SDslu, 854192 SDs, 0 SdLazy, 56136 SolverSat, 22791 SolverUnsat, 181 SolverUnknown, 0 SolverNotchecked, 553.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 303 SyntacticMatches, 7 SemanticMatches, 514 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7660occurred in iteration=83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 3.230088495575221 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.6s AutomataMinimizationTime, 84 MinimizatonAttempts, 13906 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 6631 NumberOfCodeBlocks, 6631 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 6547 ConstructedInterpolants, 0 QuantifiedInterpolants, 792529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 84 InterpolantComputations, 83 PerfectInterpolantSequences, 25/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...