java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:06:52,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:06:52,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:06:52,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:06:52,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:06:52,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:06:52,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:06:52,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:06:52,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:06:52,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:06:52,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:06:52,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:06:52,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:06:52,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:06:52,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:06:52,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:06:52,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:06:52,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:06:52,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:06:52,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:06:52,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:06:52,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:06:52,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:06:52,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:06:52,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:06:52,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:06:52,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:06:52,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:06:52,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:06:52,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:06:52,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:06:52,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:06:52,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:06:52,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:06:52,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:06:52,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:06:52,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:06:52,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:06:52,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:06:52,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:06:52,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:06:52,787 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:06:52,801 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:06:52,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:06:52,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:06:52,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:06:52,803 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:06:52,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:06:52,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:06:52,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:06:52,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:06:52,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:06:52,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:06:52,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:06:52,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:06:52,805 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:06:52,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:06:52,805 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:06:52,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:06:52,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:06:52,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:06:52,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:06:52,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:06:52,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:52,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:06:52,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:06:52,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:06:52,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:06:52,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:06:52,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:06:52,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:06:53,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:06:53,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:06:53,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:06:53,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:06:53,129 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:06:53,130 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-10-15 01:06:53,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2bd94c61/f322ba046b6f4662ba9d8fb65d24baf7/FLAG152186cf3 [2019-10-15 01:06:53,708 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:06:53,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-10-15 01:06:53,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2bd94c61/f322ba046b6f4662ba9d8fb65d24baf7/FLAG152186cf3 [2019-10-15 01:06:54,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2bd94c61/f322ba046b6f4662ba9d8fb65d24baf7 [2019-10-15 01:06:54,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:06:54,050 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:06:54,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:54,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:06:54,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:06:54,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebb8931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54, skipping insertion in model container [2019-10-15 01:06:54,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,068 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:06:54,130 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:06:54,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:54,617 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:06:54,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:54,739 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:06:54,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54 WrapperNode [2019-10-15 01:06:54,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:54,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:06:54,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:06:54,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:06:54,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... [2019-10-15 01:06:54,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:06:54,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:06:54,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:06:54,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:06:54,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:54,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:06:54,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:06:54,900 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 01:06:54,901 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 01:06:54,901 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-10-15 01:06:54,901 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-10-15 01:06:54,901 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-10-15 01:06:54,901 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-10-15 01:06:54,901 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-10-15 01:06:54,902 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-10-15 01:06:54,902 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-10-15 01:06:54,902 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-10-15 01:06:54,902 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-10-15 01:06:54,902 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-10-15 01:06:54,903 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-10-15 01:06:54,903 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-10-15 01:06:54,903 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-10-15 01:06:54,903 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-10-15 01:06:54,903 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 01:06:54,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:06:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-15 01:06:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 01:06:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 01:06:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 01:06:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 01:06:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 01:06:54,905 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-15 01:06:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:06:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:06:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:06:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:06:54,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:06:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-10-15 01:06:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-10-15 01:06:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-10-15 01:06:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-10-15 01:06:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-10-15 01:06:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-10-15 01:06:54,906 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-10-15 01:06:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-10-15 01:06:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-10-15 01:06:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-10-15 01:06:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-10-15 01:06:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-10-15 01:06:54,907 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-15 01:06:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 01:06:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 01:06:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 01:06:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-15 01:06:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 01:06:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 01:06:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 01:06:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-10-15 01:06:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-10-15 01:06:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 01:06:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:06:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 01:06:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:06:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:06:55,272 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:55,448 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-15 01:06:55,449 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-15 01:06:55,462 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:55,534 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-15 01:06:55,534 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-15 01:06:55,557 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:55,581 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 01:06:55,582 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 01:06:55,588 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:55,600 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:06:55,601 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:06:55,834 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:55,884 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-15 01:06:55,885 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-15 01:06:55,915 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:06:55,931 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-15 01:06:55,932 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-15 01:06:55,973 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:06:55,974 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:06:55,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:55 BoogieIcfgContainer [2019-10-15 01:06:55,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:06:55,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:06:55,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:06:55,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:06:55,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:06:54" (1/3) ... [2019-10-15 01:06:55,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445a65ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:55, skipping insertion in model container [2019-10-15 01:06:55,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:54" (2/3) ... [2019-10-15 01:06:55,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445a65ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:55, skipping insertion in model container [2019-10-15 01:06:55,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:55" (3/3) ... [2019-10-15 01:06:55,983 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-10-15 01:06:55,992 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:06:55,999 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:06:56,009 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:06:56,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:06:56,037 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:06:56,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:06:56,037 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:06:56,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:06:56,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:06:56,038 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:06:56,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:06:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2019-10-15 01:06:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:06:56,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:56,070 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:56,071 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:56,076 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2019-10-15 01:06:56,082 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:56,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389730986] [2019-10-15 01:06:56,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,083 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:56,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389730986] [2019-10-15 01:06:56,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:56,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:56,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916039548] [2019-10-15 01:06:56,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:56,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:56,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:56,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:56,336 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2019-10-15 01:06:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:56,531 INFO L93 Difference]: Finished difference Result 537 states and 780 transitions. [2019-10-15 01:06:56,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:56,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:06:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:56,558 INFO L225 Difference]: With dead ends: 537 [2019-10-15 01:06:56,558 INFO L226 Difference]: Without dead ends: 287 [2019-10-15 01:06:56,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-15 01:06:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-10-15 01:06:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-15 01:06:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2019-10-15 01:06:56,654 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2019-10-15 01:06:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:56,655 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2019-10-15 01:06:56,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2019-10-15 01:06:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:06:56,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:56,657 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:56,658 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:56,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:56,658 INFO L82 PathProgramCache]: Analyzing trace with hash -240124352, now seen corresponding path program 1 times [2019-10-15 01:06:56,658 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:56,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261305904] [2019-10-15 01:06:56,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:56,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:56,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261305904] [2019-10-15 01:06:56,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:56,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:56,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369649931] [2019-10-15 01:06:56,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:56,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:56,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:56,882 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2019-10-15 01:06:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:57,139 INFO L93 Difference]: Finished difference Result 637 states and 882 transitions. [2019-10-15 01:06:57,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:57,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:06:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:57,153 INFO L225 Difference]: With dead ends: 637 [2019-10-15 01:06:57,154 INFO L226 Difference]: Without dead ends: 454 [2019-10-15 01:06:57,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-10-15 01:06:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-10-15 01:06:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2019-10-15 01:06:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-10-15 01:06:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2019-10-15 01:06:57,223 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2019-10-15 01:06:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:57,224 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2019-10-15 01:06:57,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2019-10-15 01:06:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:06:57,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:57,229 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:57,229 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:57,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:57,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2018358777, now seen corresponding path program 1 times [2019-10-15 01:06:57,230 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:57,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090988651] [2019-10-15 01:06:57,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:57,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:57,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:57,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090988651] [2019-10-15 01:06:57,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:57,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:57,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201250287] [2019-10-15 01:06:57,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:57,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:57,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:57,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:57,374 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2019-10-15 01:06:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:57,455 INFO L93 Difference]: Finished difference Result 963 states and 1383 transitions. [2019-10-15 01:06:57,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:57,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:06:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:57,466 INFO L225 Difference]: With dead ends: 963 [2019-10-15 01:06:57,466 INFO L226 Difference]: Without dead ends: 646 [2019-10-15 01:06:57,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-10-15 01:06:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2019-10-15 01:06:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-15 01:06:57,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2019-10-15 01:06:57,528 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2019-10-15 01:06:57,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:57,529 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2019-10-15 01:06:57,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2019-10-15 01:06:57,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 01:06:57,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:57,532 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:57,533 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:57,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:57,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2019-10-15 01:06:57,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:57,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502602437] [2019-10-15 01:06:57,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:57,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:57,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:57,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502602437] [2019-10-15 01:06:57,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:57,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:57,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638798084] [2019-10-15 01:06:57,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:57,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:57,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:57,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:57,676 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2019-10-15 01:06:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:57,771 INFO L93 Difference]: Finished difference Result 621 states and 887 transitions. [2019-10-15 01:06:57,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:57,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-15 01:06:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:57,777 INFO L225 Difference]: With dead ends: 621 [2019-10-15 01:06:57,777 INFO L226 Difference]: Without dead ends: 617 [2019-10-15 01:06:57,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:57,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-15 01:06:57,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2019-10-15 01:06:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-10-15 01:06:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2019-10-15 01:06:57,832 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2019-10-15 01:06:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:57,833 INFO L462 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2019-10-15 01:06:57,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2019-10-15 01:06:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:06:57,842 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:57,842 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:57,843 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash -113678377, now seen corresponding path program 1 times [2019-10-15 01:06:57,843 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:57,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299621192] [2019-10-15 01:06:57,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:57,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:57,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:57,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-10-15 01:06:57,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299621192] [2019-10-15 01:06:57,907 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:57,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:57,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990100881] [2019-10-15 01:06:57,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:57,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:57,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:57,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:57,912 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2019-10-15 01:06:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:57,993 INFO L93 Difference]: Finished difference Result 1072 states and 1583 transitions. [2019-10-15 01:06:57,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:57,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-15 01:06:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:58,005 INFO L225 Difference]: With dead ends: 1072 [2019-10-15 01:06:58,006 INFO L226 Difference]: Without dead ends: 1053 [2019-10-15 01:06:58,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-10-15 01:06:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2019-10-15 01:06:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-10-15 01:06:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2019-10-15 01:06:58,094 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2019-10-15 01:06:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:58,097 INFO L462 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2019-10-15 01:06:58,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2019-10-15 01:06:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:06:58,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:58,100 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:58,101 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:58,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:58,101 INFO L82 PathProgramCache]: Analyzing trace with hash -128023286, now seen corresponding path program 1 times [2019-10-15 01:06:58,102 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:58,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264700526] [2019-10-15 01:06:58,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:58,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-10-15 01:06:58,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264700526] [2019-10-15 01:06:58,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:58,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:58,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977334575] [2019-10-15 01:06:58,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:58,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:58,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,182 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2019-10-15 01:06:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:58,308 INFO L93 Difference]: Finished difference Result 1050 states and 1554 transitions. [2019-10-15 01:06:58,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:58,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-15 01:06:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:58,319 INFO L225 Difference]: With dead ends: 1050 [2019-10-15 01:06:58,319 INFO L226 Difference]: Without dead ends: 1045 [2019-10-15 01:06:58,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-10-15 01:06:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2019-10-15 01:06:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-10-15 01:06:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2019-10-15 01:06:58,382 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2019-10-15 01:06:58,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:58,383 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2019-10-15 01:06:58,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:58,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2019-10-15 01:06:58,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:06:58,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:58,386 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:58,387 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:58,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:58,387 INFO L82 PathProgramCache]: Analyzing trace with hash 778971858, now seen corresponding path program 1 times [2019-10-15 01:06:58,388 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:58,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541991657] [2019-10-15 01:06:58,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:58,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541991657] [2019-10-15 01:06:58,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:58,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:06:58,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174998698] [2019-10-15 01:06:58,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:06:58,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:58,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:06:58,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:06:58,453 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2019-10-15 01:06:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:58,527 INFO L93 Difference]: Finished difference Result 1058 states and 1564 transitions. [2019-10-15 01:06:58,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:06:58,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-15 01:06:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:58,538 INFO L225 Difference]: With dead ends: 1058 [2019-10-15 01:06:58,538 INFO L226 Difference]: Without dead ends: 1036 [2019-10-15 01:06:58,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:06:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-10-15 01:06:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2019-10-15 01:06:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-10-15 01:06:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2019-10-15 01:06:58,627 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2019-10-15 01:06:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:58,628 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2019-10-15 01:06:58,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:06:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2019-10-15 01:06:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:06:58,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:58,632 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:58,632 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1897332428, now seen corresponding path program 1 times [2019-10-15 01:06:58,633 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:58,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809414539] [2019-10-15 01:06:58,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:58,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809414539] [2019-10-15 01:06:58,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:58,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:58,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995505307] [2019-10-15 01:06:58,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:58,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:58,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:58,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,733 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2019-10-15 01:06:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:58,798 INFO L93 Difference]: Finished difference Result 1448 states and 2195 transitions. [2019-10-15 01:06:58,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:58,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-15 01:06:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:58,813 INFO L225 Difference]: With dead ends: 1448 [2019-10-15 01:06:58,813 INFO L226 Difference]: Without dead ends: 578 [2019-10-15 01:06:58,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-15 01:06:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-15 01:06:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-15 01:06:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2019-10-15 01:06:58,860 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2019-10-15 01:06:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:58,861 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2019-10-15 01:06:58,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2019-10-15 01:06:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 01:06:58,863 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:58,864 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:58,864 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:58,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:58,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2019-10-15 01:06:58,865 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:58,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84437245] [2019-10-15 01:06:58,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:58,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:59,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84437245] [2019-10-15 01:06:59,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:59,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:06:59,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767255189] [2019-10-15 01:06:59,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:06:59,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:59,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:06:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:06:59,016 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 10 states. [2019-10-15 01:06:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:59,927 INFO L93 Difference]: Finished difference Result 607 states and 855 transitions. [2019-10-15 01:06:59,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:06:59,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-10-15 01:06:59,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:59,935 INFO L225 Difference]: With dead ends: 607 [2019-10-15 01:06:59,935 INFO L226 Difference]: Without dead ends: 601 [2019-10-15 01:06:59,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:06:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-15 01:06:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-10-15 01:06:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-15 01:06:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2019-10-15 01:06:59,978 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2019-10-15 01:06:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:59,978 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2019-10-15 01:06:59,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:06:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2019-10-15 01:06:59,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:06:59,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:59,981 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:59,981 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:59,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:59,982 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2019-10-15 01:06:59,982 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:59,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305211093] [2019-10-15 01:06:59,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:59,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:59,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:00,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305211093] [2019-10-15 01:07:00,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:00,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:00,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247926672] [2019-10-15 01:07:00,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:00,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:00,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:00,091 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 10 states. [2019-10-15 01:07:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:00,912 INFO L93 Difference]: Finished difference Result 607 states and 853 transitions. [2019-10-15 01:07:00,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:00,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-10-15 01:07:00,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:00,917 INFO L225 Difference]: With dead ends: 607 [2019-10-15 01:07:00,917 INFO L226 Difference]: Without dead ends: 601 [2019-10-15 01:07:00,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:07:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-15 01:07:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-10-15 01:07:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-15 01:07:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2019-10-15 01:07:00,954 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2019-10-15 01:07:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:00,954 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2019-10-15 01:07:00,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2019-10-15 01:07:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:07:00,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:00,956 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:00,956 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:00,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:00,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2019-10-15 01:07:00,957 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:00,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082214424] [2019-10-15 01:07:00,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:00,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:00,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:01,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082214424] [2019-10-15 01:07:01,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:01,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:01,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171019969] [2019-10-15 01:07:01,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:01,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:01,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:01,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:01,022 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2019-10-15 01:07:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:01,102 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2019-10-15 01:07:01,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:07:01,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-15 01:07:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:01,108 INFO L225 Difference]: With dead ends: 601 [2019-10-15 01:07:01,109 INFO L226 Difference]: Without dead ends: 576 [2019-10-15 01:07:01,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-15 01:07:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-15 01:07:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-15 01:07:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2019-10-15 01:07:01,166 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2019-10-15 01:07:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:01,167 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2019-10-15 01:07:01,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2019-10-15 01:07:01,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:07:01,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:01,169 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:01,169 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1289582749, now seen corresponding path program 1 times [2019-10-15 01:07:01,169 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:01,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556496264] [2019-10-15 01:07:01,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:01,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:01,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:01,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556496264] [2019-10-15 01:07:01,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:01,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:01,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633904360] [2019-10-15 01:07:01,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:01,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:01,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:01,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:01,243 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2019-10-15 01:07:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:01,372 INFO L93 Difference]: Finished difference Result 810 states and 1201 transitions. [2019-10-15 01:07:01,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:01,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-15 01:07:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:01,379 INFO L225 Difference]: With dead ends: 810 [2019-10-15 01:07:01,379 INFO L226 Difference]: Without dead ends: 802 [2019-10-15 01:07:01,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-10-15 01:07:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2019-10-15 01:07:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-15 01:07:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2019-10-15 01:07:01,426 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2019-10-15 01:07:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:01,426 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2019-10-15 01:07:01,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2019-10-15 01:07:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:07:01,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:01,428 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:01,428 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:01,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:01,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1713004902, now seen corresponding path program 1 times [2019-10-15 01:07:01,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:01,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770960993] [2019-10-15 01:07:01,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:01,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:01,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:01,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770960993] [2019-10-15 01:07:01,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:01,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:01,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171669730] [2019-10-15 01:07:01,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:01,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:01,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:01,480 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2019-10-15 01:07:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:01,735 INFO L93 Difference]: Finished difference Result 719 states and 992 transitions. [2019-10-15 01:07:01,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:01,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-10-15 01:07:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:01,740 INFO L225 Difference]: With dead ends: 719 [2019-10-15 01:07:01,740 INFO L226 Difference]: Without dead ends: 452 [2019-10-15 01:07:01,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-15 01:07:01,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2019-10-15 01:07:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-10-15 01:07:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2019-10-15 01:07:01,779 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 49 [2019-10-15 01:07:01,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:01,779 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2019-10-15 01:07:01,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2019-10-15 01:07:01,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:07:01,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:01,781 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:01,781 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:01,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:01,782 INFO L82 PathProgramCache]: Analyzing trace with hash -869356297, now seen corresponding path program 1 times [2019-10-15 01:07:01,782 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:01,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572825388] [2019-10-15 01:07:01,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:01,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:01,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:01,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572825388] [2019-10-15 01:07:01,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:01,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:01,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188912788] [2019-10-15 01:07:01,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:01,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:01,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:01,935 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2019-10-15 01:07:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:02,092 INFO L93 Difference]: Finished difference Result 447 states and 582 transitions. [2019-10-15 01:07:02,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:02,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-15 01:07:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:02,096 INFO L225 Difference]: With dead ends: 447 [2019-10-15 01:07:02,096 INFO L226 Difference]: Without dead ends: 443 [2019-10-15 01:07:02,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-15 01:07:02,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-10-15 01:07:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-15 01:07:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2019-10-15 01:07:02,121 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2019-10-15 01:07:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:02,122 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2019-10-15 01:07:02,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2019-10-15 01:07:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:07:02,123 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:02,123 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:02,123 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:02,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:02,124 INFO L82 PathProgramCache]: Analyzing trace with hash -869633127, now seen corresponding path program 1 times [2019-10-15 01:07:02,124 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:02,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877416039] [2019-10-15 01:07:02,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:02,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877416039] [2019-10-15 01:07:02,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:02,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:02,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090093930] [2019-10-15 01:07:02,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:02,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:02,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:02,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:02,191 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2019-10-15 01:07:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:02,271 INFO L93 Difference]: Finished difference Result 760 states and 1040 transitions. [2019-10-15 01:07:02,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:02,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-15 01:07:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:02,275 INFO L225 Difference]: With dead ends: 760 [2019-10-15 01:07:02,275 INFO L226 Difference]: Without dead ends: 462 [2019-10-15 01:07:02,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-10-15 01:07:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2019-10-15 01:07:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-15 01:07:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-10-15 01:07:02,304 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2019-10-15 01:07:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:02,304 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-10-15 01:07:02,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-10-15 01:07:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 01:07:02,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:02,306 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:02,306 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:02,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:02,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1156321742, now seen corresponding path program 1 times [2019-10-15 01:07:02,307 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:02,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434067630] [2019-10-15 01:07:02,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:02,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:02,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434067630] [2019-10-15 01:07:02,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:02,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:02,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249819009] [2019-10-15 01:07:02,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:02,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:02,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:02,453 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 11 states. [2019-10-15 01:07:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,359 INFO L93 Difference]: Finished difference Result 776 states and 1071 transitions. [2019-10-15 01:07:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:03,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-10-15 01:07:03,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,363 INFO L225 Difference]: With dead ends: 776 [2019-10-15 01:07:03,363 INFO L226 Difference]: Without dead ends: 475 [2019-10-15 01:07:03,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-10-15 01:07:03,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 449. [2019-10-15 01:07:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-15 01:07:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-10-15 01:07:03,390 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 48 [2019-10-15 01:07:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,390 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-10-15 01:07:03,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-10-15 01:07:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 01:07:03,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,392 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:03,392 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1551268366, now seen corresponding path program 1 times [2019-10-15 01:07:03,393 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368673464] [2019-10-15 01:07:03,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:03,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368673464] [2019-10-15 01:07:03,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:03,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213539191] [2019-10-15 01:07:03,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:03,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:03,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:03,455 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2019-10-15 01:07:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:04,002 INFO L93 Difference]: Finished difference Result 580 states and 794 transitions. [2019-10-15 01:07:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:04,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-15 01:07:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:04,007 INFO L225 Difference]: With dead ends: 580 [2019-10-15 01:07:04,007 INFO L226 Difference]: Without dead ends: 561 [2019-10-15 01:07:04,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:04,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-15 01:07:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2019-10-15 01:07:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-10-15 01:07:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2019-10-15 01:07:04,034 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2019-10-15 01:07:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:04,035 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2019-10-15 01:07:04,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2019-10-15 01:07:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:07:04,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:04,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:04,036 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:04,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:04,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1985376582, now seen corresponding path program 1 times [2019-10-15 01:07:04,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:04,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030626137] [2019-10-15 01:07:04,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:04,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030626137] [2019-10-15 01:07:04,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:04,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:04,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666576980] [2019-10-15 01:07:04,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:04,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:04,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:04,114 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2019-10-15 01:07:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:04,262 INFO L93 Difference]: Finished difference Result 448 states and 584 transitions. [2019-10-15 01:07:04,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:04,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-15 01:07:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:04,265 INFO L225 Difference]: With dead ends: 448 [2019-10-15 01:07:04,265 INFO L226 Difference]: Without dead ends: 417 [2019-10-15 01:07:04,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-10-15 01:07:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-10-15 01:07:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-10-15 01:07:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2019-10-15 01:07:04,288 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2019-10-15 01:07:04,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:04,289 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2019-10-15 01:07:04,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2019-10-15 01:07:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:07:04,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:04,292 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:04,292 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:04,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2019-10-15 01:07:04,293 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:04,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136853435] [2019-10-15 01:07:04,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:04,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136853435] [2019-10-15 01:07:04,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:04,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:04,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824225533] [2019-10-15 01:07:04,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:04,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:04,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:04,370 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2019-10-15 01:07:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:04,461 INFO L93 Difference]: Finished difference Result 432 states and 563 transitions. [2019-10-15 01:07:04,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:04,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-10-15 01:07:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:04,464 INFO L225 Difference]: With dead ends: 432 [2019-10-15 01:07:04,465 INFO L226 Difference]: Without dead ends: 399 [2019-10-15 01:07:04,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-15 01:07:04,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-10-15 01:07:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-10-15 01:07:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2019-10-15 01:07:04,494 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2019-10-15 01:07:04,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:04,494 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2019-10-15 01:07:04,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2019-10-15 01:07:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:07:04,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:04,500 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:04,500 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:04,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:04,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2019-10-15 01:07:04,501 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:04,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302407117] [2019-10-15 01:07:04,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:04,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302407117] [2019-10-15 01:07:04,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:04,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:04,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106666122] [2019-10-15 01:07:04,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:04,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:04,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:04,591 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2019-10-15 01:07:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:04,741 INFO L93 Difference]: Finished difference Result 429 states and 565 transitions. [2019-10-15 01:07:04,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:04,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-10-15 01:07:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:04,744 INFO L225 Difference]: With dead ends: 429 [2019-10-15 01:07:04,745 INFO L226 Difference]: Without dead ends: 408 [2019-10-15 01:07:04,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:04,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-10-15 01:07:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2019-10-15 01:07:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-10-15 01:07:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2019-10-15 01:07:04,770 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2019-10-15 01:07:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:04,770 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2019-10-15 01:07:04,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2019-10-15 01:07:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:07:04,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:04,771 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:04,772 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:04,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:04,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2019-10-15 01:07:04,772 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:04,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333318566] [2019-10-15 01:07:04,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:04,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333318566] [2019-10-15 01:07:04,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:04,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:04,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604783684] [2019-10-15 01:07:04,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:04,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:04,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:04,815 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2019-10-15 01:07:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:04,853 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2019-10-15 01:07:04,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:04,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-10-15 01:07:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:04,856 INFO L225 Difference]: With dead ends: 436 [2019-10-15 01:07:04,856 INFO L226 Difference]: Without dead ends: 410 [2019-10-15 01:07:04,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-15 01:07:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2019-10-15 01:07:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-10-15 01:07:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2019-10-15 01:07:04,888 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2019-10-15 01:07:04,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:04,888 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2019-10-15 01:07:04,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:04,889 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2019-10-15 01:07:04,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:07:04,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:04,891 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:04,891 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:04,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:04,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2019-10-15 01:07:04,892 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:04,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406040453] [2019-10-15 01:07:04,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:04,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406040453] [2019-10-15 01:07:04,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:04,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:07:04,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464660660] [2019-10-15 01:07:04,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:07:04,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:07:04,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:04,956 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2019-10-15 01:07:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:05,668 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2019-10-15 01:07:05,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:05,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-15 01:07:05,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:05,675 INFO L225 Difference]: With dead ends: 565 [2019-10-15 01:07:05,675 INFO L226 Difference]: Without dead ends: 511 [2019-10-15 01:07:05,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:07:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-15 01:07:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2019-10-15 01:07:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-10-15 01:07:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2019-10-15 01:07:05,709 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2019-10-15 01:07:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:05,710 INFO L462 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2019-10-15 01:07:05,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:07:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2019-10-15 01:07:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:07:05,711 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:05,711 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:05,711 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:05,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2019-10-15 01:07:05,712 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:05,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387161234] [2019-10-15 01:07:05,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:05,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387161234] [2019-10-15 01:07:05,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:05,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:05,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019086618] [2019-10-15 01:07:05,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:05,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:05,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:05,753 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2019-10-15 01:07:05,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:05,880 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2019-10-15 01:07:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:05,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-15 01:07:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:05,886 INFO L225 Difference]: With dead ends: 673 [2019-10-15 01:07:05,887 INFO L226 Difference]: Without dead ends: 659 [2019-10-15 01:07:05,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-15 01:07:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2019-10-15 01:07:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-15 01:07:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2019-10-15 01:07:05,963 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2019-10-15 01:07:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:05,964 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2019-10-15 01:07:05,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2019-10-15 01:07:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:05,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:05,965 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:05,965 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:05,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2019-10-15 01:07:05,966 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:05,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030978786] [2019-10-15 01:07:05,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:06,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030978786] [2019-10-15 01:07:06,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:06,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:06,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783171982] [2019-10-15 01:07:06,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:06,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:06,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:06,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:06,045 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2019-10-15 01:07:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:06,126 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2019-10-15 01:07:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:06,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-10-15 01:07:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:06,130 INFO L225 Difference]: With dead ends: 598 [2019-10-15 01:07:06,130 INFO L226 Difference]: Without dead ends: 574 [2019-10-15 01:07:06,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-15 01:07:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-15 01:07:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-15 01:07:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2019-10-15 01:07:06,168 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2019-10-15 01:07:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:06,168 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2019-10-15 01:07:06,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2019-10-15 01:07:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:07:06,169 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:06,169 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:06,169 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:06,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2019-10-15 01:07:06,170 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:06,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401748952] [2019-10-15 01:07:06,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:06,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:06,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:06,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401748952] [2019-10-15 01:07:06,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:06,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:06,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017239401] [2019-10-15 01:07:06,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:06,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:06,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:06,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:06,308 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 11 states. [2019-10-15 01:07:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:07,089 INFO L93 Difference]: Finished difference Result 597 states and 868 transitions. [2019-10-15 01:07:07,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:07,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-10-15 01:07:07,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:07,094 INFO L225 Difference]: With dead ends: 597 [2019-10-15 01:07:07,094 INFO L226 Difference]: Without dead ends: 573 [2019-10-15 01:07:07,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-10-15 01:07:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-10-15 01:07:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-15 01:07:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 842 transitions. [2019-10-15 01:07:07,133 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 842 transitions. Word has length 53 [2019-10-15 01:07:07,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:07,133 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 842 transitions. [2019-10-15 01:07:07,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 842 transitions. [2019-10-15 01:07:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:07:07,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:07,134 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:07,135 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:07,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:07,135 INFO L82 PathProgramCache]: Analyzing trace with hash 315899517, now seen corresponding path program 1 times [2019-10-15 01:07:07,135 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:07,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974417550] [2019-10-15 01:07:07,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:07,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:07,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:07,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974417550] [2019-10-15 01:07:07,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:07,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:07,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516960063] [2019-10-15 01:07:07,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:07,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:07,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:07,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:07,196 INFO L87 Difference]: Start difference. First operand 573 states and 842 transitions. Second operand 5 states. [2019-10-15 01:07:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:07,703 INFO L93 Difference]: Finished difference Result 659 states and 987 transitions. [2019-10-15 01:07:07,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:07,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-15 01:07:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:07,708 INFO L225 Difference]: With dead ends: 659 [2019-10-15 01:07:07,709 INFO L226 Difference]: Without dead ends: 624 [2019-10-15 01:07:07,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-15 01:07:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2019-10-15 01:07:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-15 01:07:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2019-10-15 01:07:07,769 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2019-10-15 01:07:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:07,770 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2019-10-15 01:07:07,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2019-10-15 01:07:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:07:07,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:07,771 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:07,772 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1255987189, now seen corresponding path program 1 times [2019-10-15 01:07:07,772 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:07,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591448020] [2019-10-15 01:07:07,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:07,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:07,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:07,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591448020] [2019-10-15 01:07:07,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:07,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:07,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130024613] [2019-10-15 01:07:07,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:07,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:07,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:07,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:07,849 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2019-10-15 01:07:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:07,938 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2019-10-15 01:07:07,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:07,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 01:07:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:07,947 INFO L225 Difference]: With dead ends: 955 [2019-10-15 01:07:07,947 INFO L226 Difference]: Without dead ends: 527 [2019-10-15 01:07:07,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-10-15 01:07:07,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-10-15 01:07:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-10-15 01:07:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2019-10-15 01:07:07,995 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2019-10-15 01:07:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:07,996 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2019-10-15 01:07:07,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2019-10-15 01:07:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:07:07,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:07,998 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:07,998 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:07,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1573979395, now seen corresponding path program 1 times [2019-10-15 01:07:07,999 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:07,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146926907] [2019-10-15 01:07:07,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:08,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146926907] [2019-10-15 01:07:08,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:08,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:08,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205520518] [2019-10-15 01:07:08,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:08,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:08,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:08,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:08,147 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2019-10-15 01:07:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:08,384 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2019-10-15 01:07:08,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:07:08,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-15 01:07:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:08,389 INFO L225 Difference]: With dead ends: 529 [2019-10-15 01:07:08,390 INFO L226 Difference]: Without dead ends: 466 [2019-10-15 01:07:08,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-15 01:07:08,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-10-15 01:07:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-15 01:07:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2019-10-15 01:07:08,432 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2019-10-15 01:07:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:08,433 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2019-10-15 01:07:08,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2019-10-15 01:07:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 01:07:08,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:08,434 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:08,434 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2092051162, now seen corresponding path program 1 times [2019-10-15 01:07:08,435 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:08,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741479071] [2019-10-15 01:07:08,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:08,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741479071] [2019-10-15 01:07:08,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:08,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:08,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294891599] [2019-10-15 01:07:08,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:08,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:08,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:08,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:08,503 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2019-10-15 01:07:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:08,562 INFO L93 Difference]: Finished difference Result 924 states and 1444 transitions. [2019-10-15 01:07:08,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:08,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-10-15 01:07:08,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:08,567 INFO L225 Difference]: With dead ends: 924 [2019-10-15 01:07:08,567 INFO L226 Difference]: Without dead ends: 497 [2019-10-15 01:07:08,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-10-15 01:07:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 481. [2019-10-15 01:07:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-10-15 01:07:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 750 transitions. [2019-10-15 01:07:08,604 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 750 transitions. Word has length 62 [2019-10-15 01:07:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:08,604 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 750 transitions. [2019-10-15 01:07:08,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 750 transitions. [2019-10-15 01:07:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:07:08,607 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:08,607 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:08,608 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1395701921, now seen corresponding path program 1 times [2019-10-15 01:07:08,608 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:08,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535591421] [2019-10-15 01:07:08,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:08,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535591421] [2019-10-15 01:07:08,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:08,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:08,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422854503] [2019-10-15 01:07:08,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:08,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:08,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:08,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:08,658 INFO L87 Difference]: Start difference. First operand 481 states and 750 transitions. Second operand 3 states. [2019-10-15 01:07:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:08,754 INFO L93 Difference]: Finished difference Result 735 states and 1199 transitions. [2019-10-15 01:07:08,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:08,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-15 01:07:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:08,760 INFO L225 Difference]: With dead ends: 735 [2019-10-15 01:07:08,761 INFO L226 Difference]: Without dead ends: 732 [2019-10-15 01:07:08,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-10-15 01:07:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 487. [2019-10-15 01:07:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-10-15 01:07:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 759 transitions. [2019-10-15 01:07:08,799 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 759 transitions. Word has length 63 [2019-10-15 01:07:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:08,799 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 759 transitions. [2019-10-15 01:07:08,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 759 transitions. [2019-10-15 01:07:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-15 01:07:08,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:08,800 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:08,800 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:08,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:08,801 INFO L82 PathProgramCache]: Analyzing trace with hash -554950542, now seen corresponding path program 1 times [2019-10-15 01:07:08,801 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:08,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511385203] [2019-10-15 01:07:08,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:08,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511385203] [2019-10-15 01:07:08,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:08,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:08,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130228908] [2019-10-15 01:07:08,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:08,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:08,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:08,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:08,933 INFO L87 Difference]: Start difference. First operand 487 states and 759 transitions. Second operand 9 states. [2019-10-15 01:07:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:09,809 INFO L93 Difference]: Finished difference Result 1228 states and 2118 transitions. [2019-10-15 01:07:09,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:09,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-10-15 01:07:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:09,817 INFO L225 Difference]: With dead ends: 1228 [2019-10-15 01:07:09,818 INFO L226 Difference]: Without dead ends: 786 [2019-10-15 01:07:09,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:07:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-10-15 01:07:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 516. [2019-10-15 01:07:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-10-15 01:07:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 826 transitions. [2019-10-15 01:07:09,869 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 826 transitions. Word has length 64 [2019-10-15 01:07:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:09,869 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 826 transitions. [2019-10-15 01:07:09,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 826 transitions. [2019-10-15 01:07:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-15 01:07:09,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:09,870 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:09,871 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:09,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:09,871 INFO L82 PathProgramCache]: Analyzing trace with hash -303975472, now seen corresponding path program 1 times [2019-10-15 01:07:09,871 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:09,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81932091] [2019-10-15 01:07:09,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,872 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:10,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81932091] [2019-10-15 01:07:10,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:10,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:10,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774320132] [2019-10-15 01:07:10,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:10,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:10,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:10,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:10,011 INFO L87 Difference]: Start difference. First operand 516 states and 826 transitions. Second operand 6 states. [2019-10-15 01:07:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:10,082 INFO L93 Difference]: Finished difference Result 808 states and 1290 transitions. [2019-10-15 01:07:10,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:10,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-15 01:07:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:10,086 INFO L225 Difference]: With dead ends: 808 [2019-10-15 01:07:10,086 INFO L226 Difference]: Without dead ends: 335 [2019-10-15 01:07:10,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-10-15 01:07:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2019-10-15 01:07:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-10-15 01:07:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 482 transitions. [2019-10-15 01:07:10,120 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 482 transitions. Word has length 65 [2019-10-15 01:07:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:10,120 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 482 transitions. [2019-10-15 01:07:10,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 482 transitions. [2019-10-15 01:07:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-15 01:07:10,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:10,121 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:10,122 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:10,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:10,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1801004585, now seen corresponding path program 1 times [2019-10-15 01:07:10,122 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:10,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310584870] [2019-10-15 01:07:10,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:10,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310584870] [2019-10-15 01:07:10,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:10,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:10,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818976270] [2019-10-15 01:07:10,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:10,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:10,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:10,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:10,198 INFO L87 Difference]: Start difference. First operand 335 states and 482 transitions. Second operand 5 states. [2019-10-15 01:07:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:10,418 INFO L93 Difference]: Finished difference Result 602 states and 874 transitions. [2019-10-15 01:07:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:10,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-10-15 01:07:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:10,421 INFO L225 Difference]: With dead ends: 602 [2019-10-15 01:07:10,421 INFO L226 Difference]: Without dead ends: 310 [2019-10-15 01:07:10,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-15 01:07:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-10-15 01:07:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-10-15 01:07:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 423 transitions. [2019-10-15 01:07:10,446 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 423 transitions. Word has length 69 [2019-10-15 01:07:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:10,446 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 423 transitions. [2019-10-15 01:07:10,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2019-10-15 01:07:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-15 01:07:10,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:10,447 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:10,448 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:10,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:10,448 INFO L82 PathProgramCache]: Analyzing trace with hash -671634044, now seen corresponding path program 1 times [2019-10-15 01:07:10,448 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:10,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975985913] [2019-10-15 01:07:10,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:10,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975985913] [2019-10-15 01:07:10,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:10,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:10,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600463941] [2019-10-15 01:07:10,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:10,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:10,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:10,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:10,575 INFO L87 Difference]: Start difference. First operand 310 states and 423 transitions. Second operand 11 states. [2019-10-15 01:07:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:11,490 INFO L93 Difference]: Finished difference Result 632 states and 901 transitions. [2019-10-15 01:07:11,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:07:11,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-10-15 01:07:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:11,493 INFO L225 Difference]: With dead ends: 632 [2019-10-15 01:07:11,494 INFO L226 Difference]: Without dead ends: 384 [2019-10-15 01:07:11,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:07:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-15 01:07:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 307. [2019-10-15 01:07:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-15 01:07:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2019-10-15 01:07:11,521 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 70 [2019-10-15 01:07:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:11,522 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2019-10-15 01:07:11,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2019-10-15 01:07:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-15 01:07:11,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:11,523 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:11,523 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:11,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1051957894, now seen corresponding path program 1 times [2019-10-15 01:07:11,524 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:11,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016757494] [2019-10-15 01:07:11,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:11,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:11,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:11,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016757494] [2019-10-15 01:07:11,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:11,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:11,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650285657] [2019-10-15 01:07:11,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:11,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:11,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:11,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:11,639 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand 5 states. [2019-10-15 01:07:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:12,115 INFO L93 Difference]: Finished difference Result 671 states and 934 transitions. [2019-10-15 01:07:12,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:12,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-10-15 01:07:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:12,119 INFO L225 Difference]: With dead ends: 671 [2019-10-15 01:07:12,119 INFO L226 Difference]: Without dead ends: 407 [2019-10-15 01:07:12,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-10-15 01:07:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2019-10-15 01:07:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-15 01:07:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2019-10-15 01:07:12,152 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 70 [2019-10-15 01:07:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:12,153 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2019-10-15 01:07:12,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2019-10-15 01:07:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 01:07:12,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:12,154 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:12,154 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:12,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:12,154 INFO L82 PathProgramCache]: Analyzing trace with hash 59211627, now seen corresponding path program 1 times [2019-10-15 01:07:12,155 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:12,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410411009] [2019-10-15 01:07:12,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:12,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410411009] [2019-10-15 01:07:12,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:12,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:12,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668961547] [2019-10-15 01:07:12,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:12,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:12,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:12,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:12,230 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand 6 states. [2019-10-15 01:07:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:12,285 INFO L93 Difference]: Finished difference Result 676 states and 947 transitions. [2019-10-15 01:07:12,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:12,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-10-15 01:07:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:12,289 INFO L225 Difference]: With dead ends: 676 [2019-10-15 01:07:12,289 INFO L226 Difference]: Without dead ends: 369 [2019-10-15 01:07:12,291 INFO L600 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-10-15 01:07:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-15 01:07:12,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-10-15 01:07:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-15 01:07:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 498 transitions. [2019-10-15 01:07:12,321 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 498 transitions. Word has length 72 [2019-10-15 01:07:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:12,322 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 498 transitions. [2019-10-15 01:07:12,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 498 transitions. [2019-10-15 01:07:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 01:07:12,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:12,323 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:12,323 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:12,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:12,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1688145691, now seen corresponding path program 1 times [2019-10-15 01:07:12,324 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:12,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485233093] [2019-10-15 01:07:12,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:12,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485233093] [2019-10-15 01:07:12,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:12,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:12,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4030286] [2019-10-15 01:07:12,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:12,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:12,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:12,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:12,395 INFO L87 Difference]: Start difference. First operand 366 states and 498 transitions. Second operand 6 states. [2019-10-15 01:07:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:12,752 INFO L93 Difference]: Finished difference Result 642 states and 882 transitions. [2019-10-15 01:07:12,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:07:12,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-15 01:07:12,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:12,755 INFO L225 Difference]: With dead ends: 642 [2019-10-15 01:07:12,756 INFO L226 Difference]: Without dead ends: 337 [2019-10-15 01:07:12,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-10-15 01:07:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2019-10-15 01:07:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-15 01:07:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 434 transitions. [2019-10-15 01:07:12,790 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 434 transitions. Word has length 83 [2019-10-15 01:07:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:12,790 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 434 transitions. [2019-10-15 01:07:12,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:12,790 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2019-10-15 01:07:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:07:12,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:12,792 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:12,793 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:12,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash 404145100, now seen corresponding path program 1 times [2019-10-15 01:07:12,793 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:12,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419345266] [2019-10-15 01:07:12,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:12,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:13,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419345266] [2019-10-15 01:07:13,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:13,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-15 01:07:13,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669639442] [2019-10-15 01:07:13,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:07:13,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:13,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:07:13,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:07:13,024 INFO L87 Difference]: Start difference. First operand 329 states and 434 transitions. Second operand 15 states. [2019-10-15 01:07:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:13,216 INFO L93 Difference]: Finished difference Result 357 states and 465 transitions. [2019-10-15 01:07:13,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:07:13,216 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2019-10-15 01:07:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:13,219 INFO L225 Difference]: With dead ends: 357 [2019-10-15 01:07:13,220 INFO L226 Difference]: Without dead ends: 332 [2019-10-15 01:07:13,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-15 01:07:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-10-15 01:07:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-10-15 01:07:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 437 transitions. [2019-10-15 01:07:13,257 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 437 transitions. Word has length 92 [2019-10-15 01:07:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:13,258 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 437 transitions. [2019-10-15 01:07:13,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:07:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 437 transitions. [2019-10-15 01:07:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:07:13,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:13,261 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:13,262 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:13,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:13,262 INFO L82 PathProgramCache]: Analyzing trace with hash 558183389, now seen corresponding path program 1 times [2019-10-15 01:07:13,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:13,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59230475] [2019-10-15 01:07:13,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:13,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59230475] [2019-10-15 01:07:13,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:13,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:13,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729008854] [2019-10-15 01:07:13,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:13,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:13,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:13,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:13,358 INFO L87 Difference]: Start difference. First operand 332 states and 437 transitions. Second operand 5 states. [2019-10-15 01:07:13,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:13,755 INFO L93 Difference]: Finished difference Result 726 states and 938 transitions. [2019-10-15 01:07:13,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:13,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-15 01:07:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:13,759 INFO L225 Difference]: With dead ends: 726 [2019-10-15 01:07:13,759 INFO L226 Difference]: Without dead ends: 458 [2019-10-15 01:07:13,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-15 01:07:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2019-10-15 01:07:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-10-15 01:07:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 532 transitions. [2019-10-15 01:07:13,796 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 532 transitions. Word has length 103 [2019-10-15 01:07:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:13,797 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 532 transitions. [2019-10-15 01:07:13,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 532 transitions. [2019-10-15 01:07:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:07:13,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:13,799 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:13,799 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:13,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:13,799 INFO L82 PathProgramCache]: Analyzing trace with hash -717142946, now seen corresponding path program 1 times [2019-10-15 01:07:13,799 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:13,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986437658] [2019-10-15 01:07:13,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:13,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986437658] [2019-10-15 01:07:13,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:13,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 01:07:13,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381382519] [2019-10-15 01:07:13,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 01:07:13,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:13,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 01:07:13,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:07:13,956 INFO L87 Difference]: Start difference. First operand 421 states and 532 transitions. Second operand 14 states. [2019-10-15 01:07:15,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:15,920 INFO L93 Difference]: Finished difference Result 816 states and 1035 transitions. [2019-10-15 01:07:15,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 01:07:15,920 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-10-15 01:07:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:15,925 INFO L225 Difference]: With dead ends: 816 [2019-10-15 01:07:15,925 INFO L226 Difference]: Without dead ends: 774 [2019-10-15 01:07:15,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-10-15 01:07:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-10-15 01:07:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 521. [2019-10-15 01:07:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-10-15 01:07:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 639 transitions. [2019-10-15 01:07:15,975 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 639 transitions. Word has length 103 [2019-10-15 01:07:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:15,976 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 639 transitions. [2019-10-15 01:07:15,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 01:07:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 639 transitions. [2019-10-15 01:07:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-15 01:07:15,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:15,978 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:15,978 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash -745643236, now seen corresponding path program 1 times [2019-10-15 01:07:15,979 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:15,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032456015] [2019-10-15 01:07:15,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:15,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:16,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032456015] [2019-10-15 01:07:16,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 01:07:16,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529658460] [2019-10-15 01:07:16,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 01:07:16,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 01:07:16,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:07:16,124 INFO L87 Difference]: Start difference. First operand 521 states and 639 transitions. Second operand 14 states. [2019-10-15 01:07:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:18,778 INFO L93 Difference]: Finished difference Result 797 states and 1012 transitions. [2019-10-15 01:07:18,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:07:18,779 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-10-15 01:07:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:18,783 INFO L225 Difference]: With dead ends: 797 [2019-10-15 01:07:18,783 INFO L226 Difference]: Without dead ends: 755 [2019-10-15 01:07:18,784 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-10-15 01:07:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-10-15 01:07:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 388. [2019-10-15 01:07:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-15 01:07:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-10-15 01:07:18,823 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 103 [2019-10-15 01:07:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:18,823 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-10-15 01:07:18,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 01:07:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-10-15 01:07:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 01:07:18,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:18,825 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:18,825 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:18,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:18,826 INFO L82 PathProgramCache]: Analyzing trace with hash 663424798, now seen corresponding path program 1 times [2019-10-15 01:07:18,826 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:18,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670745188] [2019-10-15 01:07:18,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:18,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:18,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:19,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670745188] [2019-10-15 01:07:19,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:19,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-15 01:07:19,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066954170] [2019-10-15 01:07:19,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:07:19,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:19,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:07:19,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:07:19,066 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 15 states. [2019-10-15 01:07:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:19,294 INFO L93 Difference]: Finished difference Result 423 states and 534 transitions. [2019-10-15 01:07:19,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:07:19,294 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-10-15 01:07:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:19,299 INFO L225 Difference]: With dead ends: 423 [2019-10-15 01:07:19,299 INFO L226 Difference]: Without dead ends: 396 [2019-10-15 01:07:19,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-10-15 01:07:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2019-10-15 01:07:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-15 01:07:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2019-10-15 01:07:19,336 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 108 [2019-10-15 01:07:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:19,336 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2019-10-15 01:07:19,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:07:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2019-10-15 01:07:19,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:07:19,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:19,339 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:19,340 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:19,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:19,340 INFO L82 PathProgramCache]: Analyzing trace with hash 672856935, now seen corresponding path program 1 times [2019-10-15 01:07:19,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:19,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830437083] [2019-10-15 01:07:19,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:19,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830437083] [2019-10-15 01:07:19,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:19,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 01:07:19,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063286647] [2019-10-15 01:07:19,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 01:07:19,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:19,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 01:07:19,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:07:19,513 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand 14 states. [2019-10-15 01:07:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:21,450 INFO L93 Difference]: Finished difference Result 781 states and 987 transitions. [2019-10-15 01:07:21,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 01:07:21,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-10-15 01:07:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:21,455 INFO L225 Difference]: With dead ends: 781 [2019-10-15 01:07:21,455 INFO L226 Difference]: Without dead ends: 719 [2019-10-15 01:07:21,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-10-15 01:07:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-10-15 01:07:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 670. [2019-10-15 01:07:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-15 01:07:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 828 transitions. [2019-10-15 01:07:21,513 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 828 transitions. Word has length 120 [2019-10-15 01:07:21,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:21,515 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 828 transitions. [2019-10-15 01:07:21,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 01:07:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 828 transitions. [2019-10-15 01:07:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:07:21,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:21,517 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:21,517 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:21,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:21,518 INFO L82 PathProgramCache]: Analyzing trace with hash -365727639, now seen corresponding path program 1 times [2019-10-15 01:07:21,518 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:21,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863431079] [2019-10-15 01:07:21,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:21,518 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:21,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:07:21,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863431079] [2019-10-15 01:07:21,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:21,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 01:07:21,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377306927] [2019-10-15 01:07:21,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 01:07:21,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:21,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 01:07:21,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:07:21,680 INFO L87 Difference]: Start difference. First operand 670 states and 828 transitions. Second operand 14 states. [2019-10-15 01:07:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:24,241 INFO L93 Difference]: Finished difference Result 681 states and 837 transitions. [2019-10-15 01:07:24,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:07:24,241 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-10-15 01:07:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:24,245 INFO L225 Difference]: With dead ends: 681 [2019-10-15 01:07:24,246 INFO L226 Difference]: Without dead ends: 617 [2019-10-15 01:07:24,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-10-15 01:07:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-15 01:07:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 275. [2019-10-15 01:07:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-15 01:07:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 327 transitions. [2019-10-15 01:07:24,273 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 327 transitions. Word has length 120 [2019-10-15 01:07:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:24,274 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 327 transitions. [2019-10-15 01:07:24,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 01:07:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 327 transitions. [2019-10-15 01:07:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:07:24,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:24,276 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:24,276 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:24,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash 147468031, now seen corresponding path program 1 times [2019-10-15 01:07:24,276 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:24,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023039757] [2019-10-15 01:07:24,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:24,351 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 01:07:24,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023039757] [2019-10-15 01:07:24,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:24,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:24,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090887134] [2019-10-15 01:07:24,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:24,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:24,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:24,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:24,353 INFO L87 Difference]: Start difference. First operand 275 states and 327 transitions. Second operand 6 states. [2019-10-15 01:07:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:24,406 INFO L93 Difference]: Finished difference Result 468 states and 581 transitions. [2019-10-15 01:07:24,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:24,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-15 01:07:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:24,408 INFO L225 Difference]: With dead ends: 468 [2019-10-15 01:07:24,409 INFO L226 Difference]: Without dead ends: 322 [2019-10-15 01:07:24,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-15 01:07:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2019-10-15 01:07:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-15 01:07:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 314 transitions. [2019-10-15 01:07:24,435 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 314 transitions. Word has length 121 [2019-10-15 01:07:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:24,436 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 314 transitions. [2019-10-15 01:07:24,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 314 transitions. [2019-10-15 01:07:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 01:07:24,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:24,438 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:24,438 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:24,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:24,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1256855655, now seen corresponding path program 1 times [2019-10-15 01:07:24,439 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:24,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311854331] [2019-10-15 01:07:24,439 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,439 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat