java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.08.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:53:41,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:53:41,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:53:41,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:53:41,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:53:41,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:53:41,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:53:41,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:53:41,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:53:41,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:53:41,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:53:41,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:53:41,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:53:41,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:53:41,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:53:41,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:53:41,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:53:41,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:53:41,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:53:41,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:53:41,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:53:41,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:53:41,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:53:41,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:53:41,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:53:41,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:53:41,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:53:41,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:53:41,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:53:41,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:53:41,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:53:41,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:53:41,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:53:41,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:53:41,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:53:41,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:53:41,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:53:41,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:53:41,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:53:41,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:53:41,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:53:41,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:53:41,894 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:53:41,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:53:41,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:53:41,895 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:53:41,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:53:41,896 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:53:41,896 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:53:41,896 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:53:41,896 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:53:41,896 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:53:41,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:53:41,897 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:53:41,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:53:41,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:53:41,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:53:41,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:53:41,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:53:41,898 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:53:41,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:53:41,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:53:41,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:53:41,899 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:53:41,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:53:41,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:53:41,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:53:41,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:53:41,900 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:53:41,901 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:53:41,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:53:41,901 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:53:41,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:53:41,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:53:41,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:53:41,944 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:53:41,945 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:53:41,946 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.08.i.cil-1.c [2019-09-09 05:53:42,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e4ae606/9723c4ddb99d4fed93ebbb40fc559bde/FLAG0537f99f6 [2019-09-09 05:53:42,580 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:53:42,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.08.i.cil-1.c [2019-09-09 05:53:42,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e4ae606/9723c4ddb99d4fed93ebbb40fc559bde/FLAG0537f99f6 [2019-09-09 05:53:42,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e4ae606/9723c4ddb99d4fed93ebbb40fc559bde [2019-09-09 05:53:42,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:53:42,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:53:42,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:53:42,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:53:42,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:53:42,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:53:42" (1/1) ... [2019-09-09 05:53:42,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3708f175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:42, skipping insertion in model container [2019-09-09 05:53:42,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:53:42" (1/1) ... [2019-09-09 05:53:42,865 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:53:42,934 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:53:43,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:53:43,526 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:53:43,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:53:43,715 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:53:43,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:43 WrapperNode [2019-09-09 05:53:43,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:53:43,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:53:43,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:53:43,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:53:43,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:43" (1/1) ... [2019-09-09 05:53:43,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:43" (1/1) ... [2019-09-09 05:53:43,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:43" (1/1) ... [2019-09-09 05:53:43,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:43" (1/1) ... [2019-09-09 05:53:43,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:43" (1/1) ... [2019-09-09 05:53:43,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:43" (1/1) ... [2019-09-09 05:53:43,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:43" (1/1) ... [2019-09-09 05:53:43,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:53:43,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:53:43,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:53:43,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:53:43,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:53:44,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:53:44,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:53:44,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-09 05:53:44,033 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-09 05:53:44,033 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:53:44,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:53:44,033 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:53:44,033 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:53:44,033 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:53:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:53:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:53:44,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:53:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:53:44,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:53:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:53:44,036 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:53:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-09 05:53:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:53:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:53:44,037 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-09 05:53:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:53:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:53:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:53:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:53:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:53:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:53:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:53:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:53:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:53:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:53:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:53:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:53:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:53:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:53:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:53:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:53:44,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:53:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:53:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:53:44,715 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:45,727 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:53:45,728 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:53:45,753 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:53:45,753 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:53:45,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:45 BoogieIcfgContainer [2019-09-09 05:53:45,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:53:45,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:53:45,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:53:45,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:53:45,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:53:42" (1/3) ... [2019-09-09 05:53:45,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bf7c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:45, skipping insertion in model container [2019-09-09 05:53:45,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:43" (2/3) ... [2019-09-09 05:53:45,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18bf7c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:45, skipping insertion in model container [2019-09-09 05:53:45,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:45" (3/3) ... [2019-09-09 05:53:45,762 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-1.c [2019-09-09 05:53:45,771 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:53:45,779 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:53:45,795 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:53:45,821 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:53:45,821 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:53:45,821 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:53:45,821 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:53:45,821 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:53:45,822 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:53:45,822 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:53:45,822 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:53:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-09-09 05:53:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:53:45,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:45,854 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:45,856 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:45,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:45,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2110190190, now seen corresponding path program 1 times [2019-09-09 05:53:45,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:45,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:46,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:46,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:46,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:46,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:46,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:46,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:46,270 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 4 states. [2019-09-09 05:53:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:46,723 INFO L93 Difference]: Finished difference Result 191 states and 312 transitions. [2019-09-09 05:53:46,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:46,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-09 05:53:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:46,745 INFO L225 Difference]: With dead ends: 191 [2019-09-09 05:53:46,745 INFO L226 Difference]: Without dead ends: 170 [2019-09-09 05:53:46,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:46,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-09 05:53:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2019-09-09 05:53:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-09 05:53:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 234 transitions. [2019-09-09 05:53:46,812 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 234 transitions. Word has length 49 [2019-09-09 05:53:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:46,812 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 234 transitions. [2019-09-09 05:53:46,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 234 transitions. [2019-09-09 05:53:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:53:46,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:46,816 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:46,816 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:46,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1494873476, now seen corresponding path program 1 times [2019-09-09 05:53:46,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:46,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:46,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:46,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:46,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:46,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:46,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:46,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:46,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:46,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:46,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:47,000 INFO L87 Difference]: Start difference. First operand 153 states and 234 transitions. Second operand 4 states. [2019-09-09 05:53:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:47,510 INFO L93 Difference]: Finished difference Result 170 states and 254 transitions. [2019-09-09 05:53:47,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:47,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-09 05:53:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:47,514 INFO L225 Difference]: With dead ends: 170 [2019-09-09 05:53:47,514 INFO L226 Difference]: Without dead ends: 170 [2019-09-09 05:53:47,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-09 05:53:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2019-09-09 05:53:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-09 05:53:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 233 transitions. [2019-09-09 05:53:47,536 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 233 transitions. Word has length 62 [2019-09-09 05:53:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:47,536 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 233 transitions. [2019-09-09 05:53:47,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 233 transitions. [2019-09-09 05:53:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:53:47,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:47,544 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:47,545 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:47,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1779153132, now seen corresponding path program 1 times [2019-09-09 05:53:47,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:47,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:47,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:47,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:47,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:47,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:47,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:47,672 INFO L87 Difference]: Start difference. First operand 153 states and 233 transitions. Second operand 4 states. [2019-09-09 05:53:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:47,982 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-09 05:53:47,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:47,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:53:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:47,984 INFO L225 Difference]: With dead ends: 169 [2019-09-09 05:53:47,984 INFO L226 Difference]: Without dead ends: 169 [2019-09-09 05:53:47,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-09 05:53:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 153. [2019-09-09 05:53:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-09 05:53:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 232 transitions. [2019-09-09 05:53:47,994 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 232 transitions. Word has length 63 [2019-09-09 05:53:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:47,995 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 232 transitions. [2019-09-09 05:53:47,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 232 transitions. [2019-09-09 05:53:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:53:47,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:47,998 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:47,998 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:47,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:47,998 INFO L82 PathProgramCache]: Analyzing trace with hash -628910720, now seen corresponding path program 1 times [2019-09-09 05:53:47,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:48,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:48,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:48,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:48,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:53:48,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:48,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:53:48,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:53:48,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:48,155 INFO L87 Difference]: Start difference. First operand 153 states and 232 transitions. Second operand 5 states. [2019-09-09 05:53:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:48,692 INFO L93 Difference]: Finished difference Result 174 states and 260 transitions. [2019-09-09 05:53:48,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:53:48,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-09 05:53:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:48,695 INFO L225 Difference]: With dead ends: 174 [2019-09-09 05:53:48,695 INFO L226 Difference]: Without dead ends: 174 [2019-09-09 05:53:48,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:53:48,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-09 05:53:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-09 05:53:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-09 05:53:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2019-09-09 05:53:48,716 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 63 [2019-09-09 05:53:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:48,716 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2019-09-09 05:53:48,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:53:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2019-09-09 05:53:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:53:48,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:48,722 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:48,724 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:48,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:48,724 INFO L82 PathProgramCache]: Analyzing trace with hash 553656120, now seen corresponding path program 1 times [2019-09-09 05:53:48,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:48,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:48,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:48,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:48,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:48,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:48,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:48,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:48,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:48,858 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand 4 states. [2019-09-09 05:53:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:49,166 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-09-09 05:53:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:49,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:53:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:49,169 INFO L225 Difference]: With dead ends: 188 [2019-09-09 05:53:49,169 INFO L226 Difference]: Without dead ends: 188 [2019-09-09 05:53:49,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-09 05:53:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 173. [2019-09-09 05:53:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-09 05:53:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 258 transitions. [2019-09-09 05:53:49,178 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 258 transitions. Word has length 63 [2019-09-09 05:53:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:49,178 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 258 transitions. [2019-09-09 05:53:49,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 258 transitions. [2019-09-09 05:53:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:53:49,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:49,180 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:49,180 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:49,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:49,181 INFO L82 PathProgramCache]: Analyzing trace with hash 486096119, now seen corresponding path program 1 times [2019-09-09 05:53:49,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:49,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:49,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:49,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:49,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:49,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:49,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:49,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:49,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:49,259 INFO L87 Difference]: Start difference. First operand 173 states and 258 transitions. Second operand 4 states. [2019-09-09 05:53:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:49,573 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2019-09-09 05:53:49,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:49,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:53:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:49,576 INFO L225 Difference]: With dead ends: 186 [2019-09-09 05:53:49,576 INFO L226 Difference]: Without dead ends: 186 [2019-09-09 05:53:49,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-09 05:53:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173. [2019-09-09 05:53:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-09 05:53:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 257 transitions. [2019-09-09 05:53:49,585 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 257 transitions. Word has length 63 [2019-09-09 05:53:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:49,586 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 257 transitions. [2019-09-09 05:53:49,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 257 transitions. [2019-09-09 05:53:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:53:49,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:49,588 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:49,588 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:49,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:49,588 INFO L82 PathProgramCache]: Analyzing trace with hash 163370881, now seen corresponding path program 1 times [2019-09-09 05:53:49,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:49,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:49,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:49,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:49,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:49,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:49,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:49,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:49,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:49,678 INFO L87 Difference]: Start difference. First operand 173 states and 257 transitions. Second operand 4 states. [2019-09-09 05:53:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:49,950 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2019-09-09 05:53:49,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:49,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:53:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:49,952 INFO L225 Difference]: With dead ends: 186 [2019-09-09 05:53:49,952 INFO L226 Difference]: Without dead ends: 186 [2019-09-09 05:53:49,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-09 05:53:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173. [2019-09-09 05:53:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-09 05:53:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 256 transitions. [2019-09-09 05:53:49,959 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 256 transitions. Word has length 64 [2019-09-09 05:53:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:49,959 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 256 transitions. [2019-09-09 05:53:49,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 256 transitions. [2019-09-09 05:53:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:53:49,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:49,961 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:49,961 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1804750988, now seen corresponding path program 1 times [2019-09-09 05:53:49,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:49,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:49,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:50,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:50,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:50,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:50,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:50,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:50,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:50,051 INFO L87 Difference]: Start difference. First operand 173 states and 256 transitions. Second operand 4 states. [2019-09-09 05:53:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:50,332 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2019-09-09 05:53:50,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:50,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:53:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:50,334 INFO L225 Difference]: With dead ends: 186 [2019-09-09 05:53:50,334 INFO L226 Difference]: Without dead ends: 186 [2019-09-09 05:53:50,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:50,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-09 05:53:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173. [2019-09-09 05:53:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-09 05:53:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2019-09-09 05:53:50,339 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 65 [2019-09-09 05:53:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:50,340 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2019-09-09 05:53:50,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2019-09-09 05:53:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:53:50,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:50,341 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:50,341 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2134048964, now seen corresponding path program 1 times [2019-09-09 05:53:50,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:50,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:50,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:50,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:50,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:50,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:50,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:50,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:50,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:50,404 INFO L87 Difference]: Start difference. First operand 173 states and 255 transitions. Second operand 4 states. [2019-09-09 05:53:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:50,679 INFO L93 Difference]: Finished difference Result 186 states and 270 transitions. [2019-09-09 05:53:50,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:50,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:53:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:50,681 INFO L225 Difference]: With dead ends: 186 [2019-09-09 05:53:50,681 INFO L226 Difference]: Without dead ends: 186 [2019-09-09 05:53:50,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-09 05:53:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173. [2019-09-09 05:53:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-09 05:53:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 254 transitions. [2019-09-09 05:53:50,686 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 254 transitions. Word has length 66 [2019-09-09 05:53:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:50,687 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 254 transitions. [2019-09-09 05:53:50,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 254 transitions. [2019-09-09 05:53:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:53:50,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:50,688 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:50,688 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:50,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1942820251, now seen corresponding path program 1 times [2019-09-09 05:53:50,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:50,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:50,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:50,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:50,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:50,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:50,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:50,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:50,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:50,749 INFO L87 Difference]: Start difference. First operand 173 states and 254 transitions. Second operand 4 states. [2019-09-09 05:53:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:51,041 INFO L93 Difference]: Finished difference Result 215 states and 316 transitions. [2019-09-09 05:53:51,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:51,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:53:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:51,043 INFO L225 Difference]: With dead ends: 215 [2019-09-09 05:53:51,044 INFO L226 Difference]: Without dead ends: 215 [2019-09-09 05:53:51,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-09 05:53:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2019-09-09 05:53:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-09 05:53:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 291 transitions. [2019-09-09 05:53:51,051 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 291 transitions. Word has length 66 [2019-09-09 05:53:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:51,051 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 291 transitions. [2019-09-09 05:53:51,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:51,052 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 291 transitions. [2019-09-09 05:53:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-09 05:53:51,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:51,053 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:51,053 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:51,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:51,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1095553487, now seen corresponding path program 1 times [2019-09-09 05:53:51,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:51,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:51,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:51,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:51,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:51,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:51,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:51,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:51,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:51,136 INFO L87 Difference]: Start difference. First operand 195 states and 291 transitions. Second operand 4 states. [2019-09-09 05:53:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:51,421 INFO L93 Difference]: Finished difference Result 198 states and 294 transitions. [2019-09-09 05:53:51,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:51,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-09 05:53:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:51,423 INFO L225 Difference]: With dead ends: 198 [2019-09-09 05:53:51,423 INFO L226 Difference]: Without dead ends: 198 [2019-09-09 05:53:51,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-09 05:53:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2019-09-09 05:53:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-09 05:53:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 290 transitions. [2019-09-09 05:53:51,429 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 290 transitions. Word has length 67 [2019-09-09 05:53:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:51,430 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 290 transitions. [2019-09-09 05:53:51,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 290 transitions. [2019-09-09 05:53:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:53:51,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:51,431 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:53:51,431 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:51,432 INFO L82 PathProgramCache]: Analyzing trace with hash -480173193, now seen corresponding path program 1 times [2019-09-09 05:53:51,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:51,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:51,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:51,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:51,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:51,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:51,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:51,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:51,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:51,501 INFO L87 Difference]: Start difference. First operand 195 states and 290 transitions. Second operand 4 states. [2019-09-09 05:53:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:51,798 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2019-09-09 05:53:51,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:51,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:53:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:51,801 INFO L225 Difference]: With dead ends: 215 [2019-09-09 05:53:51,801 INFO L226 Difference]: Without dead ends: 215 [2019-09-09 05:53:51,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-09 05:53:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2019-09-09 05:53:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-09 05:53:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 289 transitions. [2019-09-09 05:53:51,807 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 289 transitions. Word has length 79 [2019-09-09 05:53:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:51,807 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 289 transitions. [2019-09-09 05:53:51,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 289 transitions. [2019-09-09 05:53:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:53:51,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:51,809 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:51,809 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:51,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:51,809 INFO L82 PathProgramCache]: Analyzing trace with hash -543248475, now seen corresponding path program 1 times [2019-09-09 05:53:51,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:51,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:51,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:51,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:51,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:51,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:51,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:51,878 INFO L87 Difference]: Start difference. First operand 195 states and 289 transitions. Second operand 4 states. [2019-09-09 05:53:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:52,230 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-09 05:53:52,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:52,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:53:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:52,232 INFO L225 Difference]: With dead ends: 214 [2019-09-09 05:53:52,232 INFO L226 Difference]: Without dead ends: 214 [2019-09-09 05:53:52,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-09 05:53:52,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 195. [2019-09-09 05:53:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-09 05:53:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 288 transitions. [2019-09-09 05:53:52,238 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 288 transitions. Word has length 80 [2019-09-09 05:53:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:52,239 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 288 transitions. [2019-09-09 05:53:52,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 288 transitions. [2019-09-09 05:53:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:53:52,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:52,241 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:52,241 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash -610808476, now seen corresponding path program 1 times [2019-09-09 05:53:52,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:52,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:52,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:52,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:52,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:52,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:52,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:52,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:52,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:52,310 INFO L87 Difference]: Start difference. First operand 195 states and 288 transitions. Second operand 4 states. [2019-09-09 05:53:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:52,593 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2019-09-09 05:53:52,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:52,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:53:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:52,595 INFO L225 Difference]: With dead ends: 212 [2019-09-09 05:53:52,595 INFO L226 Difference]: Without dead ends: 212 [2019-09-09 05:53:52,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-09 05:53:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2019-09-09 05:53:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-09 05:53:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 287 transitions. [2019-09-09 05:53:52,601 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 287 transitions. Word has length 80 [2019-09-09 05:53:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:52,602 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 287 transitions. [2019-09-09 05:53:52,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 287 transitions. [2019-09-09 05:53:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:53:52,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:52,603 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-09 05:53:52,603 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash 519066804, now seen corresponding path program 1 times [2019-09-09 05:53:52,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:52,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:52,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:52,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:52,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:52,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:52,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:52,707 INFO L87 Difference]: Start difference. First operand 195 states and 287 transitions. Second operand 4 states. [2019-09-09 05:53:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:53,003 INFO L93 Difference]: Finished difference Result 212 states and 308 transitions. [2019-09-09 05:53:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:53,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:53:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:53,006 INFO L225 Difference]: With dead ends: 212 [2019-09-09 05:53:53,006 INFO L226 Difference]: Without dead ends: 212 [2019-09-09 05:53:53,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-09 05:53:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2019-09-09 05:53:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-09 05:53:53,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 286 transitions. [2019-09-09 05:53:53,014 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 286 transitions. Word has length 81 [2019-09-09 05:53:53,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:53,015 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 286 transitions. [2019-09-09 05:53:53,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 286 transitions. [2019-09-09 05:53:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:53:53,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:53,017 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:53,017 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:53,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:53,018 INFO L82 PathProgramCache]: Analyzing trace with hash 631888033, now seen corresponding path program 1 times [2019-09-09 05:53:53,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:53,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:53,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:53,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:53,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:53,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:53,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:53,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:53,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:53,104 INFO L87 Difference]: Start difference. First operand 195 states and 286 transitions. Second operand 4 states. [2019-09-09 05:53:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:53,534 INFO L93 Difference]: Finished difference Result 212 states and 307 transitions. [2019-09-09 05:53:53,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:53,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-09 05:53:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:53,536 INFO L225 Difference]: With dead ends: 212 [2019-09-09 05:53:53,537 INFO L226 Difference]: Without dead ends: 212 [2019-09-09 05:53:53,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-09 05:53:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2019-09-09 05:53:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-09 05:53:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 285 transitions. [2019-09-09 05:53:53,543 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 285 transitions. Word has length 82 [2019-09-09 05:53:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:53,543 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 285 transitions. [2019-09-09 05:53:53,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 285 transitions. [2019-09-09 05:53:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:53:53,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:53,544 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:53,545 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:53,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:53,545 INFO L82 PathProgramCache]: Analyzing trace with hash 387316655, now seen corresponding path program 1 times [2019-09-09 05:53:53,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:53,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:53,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:53,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:53,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:53,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:53,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:53,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:53,620 INFO L87 Difference]: Start difference. First operand 195 states and 285 transitions. Second operand 4 states. [2019-09-09 05:53:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:53,920 INFO L93 Difference]: Finished difference Result 212 states and 306 transitions. [2019-09-09 05:53:53,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:53,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-09 05:53:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:53,922 INFO L225 Difference]: With dead ends: 212 [2019-09-09 05:53:53,922 INFO L226 Difference]: Without dead ends: 212 [2019-09-09 05:53:53,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-09 05:53:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2019-09-09 05:53:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-09 05:53:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 284 transitions. [2019-09-09 05:53:53,928 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 284 transitions. Word has length 83 [2019-09-09 05:53:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:53,928 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 284 transitions. [2019-09-09 05:53:53,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 284 transitions. [2019-09-09 05:53:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-09 05:53:53,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:53,929 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:53,930 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:53,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:53,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1948476348, now seen corresponding path program 1 times [2019-09-09 05:53:53,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:53,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:53,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:54,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:54,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:54,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:54,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:54,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:54,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:54,006 INFO L87 Difference]: Start difference. First operand 195 states and 284 transitions. Second operand 4 states. [2019-09-09 05:53:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:54,297 INFO L93 Difference]: Finished difference Result 202 states and 293 transitions. [2019-09-09 05:53:54,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:54,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-09 05:53:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:54,300 INFO L225 Difference]: With dead ends: 202 [2019-09-09 05:53:54,300 INFO L226 Difference]: Without dead ends: 202 [2019-09-09 05:53:54,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:54,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-09 05:53:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2019-09-09 05:53:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-09 05:53:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2019-09-09 05:53:54,310 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 84 [2019-09-09 05:53:54,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:54,311 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2019-09-09 05:53:54,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2019-09-09 05:53:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:53:54,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:54,314 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:53:54,314 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1002887916, now seen corresponding path program 1 times [2019-09-09 05:53:54,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:54,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:54,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:54,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:54,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:54,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:54,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:54,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:54,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:54,509 INFO L87 Difference]: Start difference. First operand 195 states and 283 transitions. Second operand 4 states. [2019-09-09 05:53:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:54,995 INFO L93 Difference]: Finished difference Result 302 states and 446 transitions. [2019-09-09 05:53:54,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:54,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-09 05:53:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:54,998 INFO L225 Difference]: With dead ends: 302 [2019-09-09 05:53:54,998 INFO L226 Difference]: Without dead ends: 302 [2019-09-09 05:53:54,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-09 05:53:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 236. [2019-09-09 05:53:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-09 05:53:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 356 transitions. [2019-09-09 05:53:55,006 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 356 transitions. Word has length 88 [2019-09-09 05:53:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:55,006 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 356 transitions. [2019-09-09 05:53:55,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 356 transitions. [2019-09-09 05:53:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:53:55,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:55,008 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:53:55,008 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:55,008 INFO L82 PathProgramCache]: Analyzing trace with hash -579241194, now seen corresponding path program 1 times [2019-09-09 05:53:55,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:55,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:55,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:55,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:55,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:55,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:55,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:55,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:55,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:55,073 INFO L87 Difference]: Start difference. First operand 236 states and 356 transitions. Second operand 4 states. [2019-09-09 05:53:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:55,414 INFO L93 Difference]: Finished difference Result 284 states and 427 transitions. [2019-09-09 05:53:55,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:55,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-09 05:53:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:55,416 INFO L225 Difference]: With dead ends: 284 [2019-09-09 05:53:55,417 INFO L226 Difference]: Without dead ends: 284 [2019-09-09 05:53:55,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-09 05:53:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-09 05:53:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-09 05:53:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 397 transitions. [2019-09-09 05:53:55,426 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 397 transitions. Word has length 88 [2019-09-09 05:53:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:55,427 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 397 transitions. [2019-09-09 05:53:55,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 397 transitions. [2019-09-09 05:53:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:53:55,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:55,429 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:53:55,429 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:55,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:55,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1319252016, now seen corresponding path program 1 times [2019-09-09 05:53:55,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:55,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:55,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:55,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:55,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:55,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:55,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:55,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:55,511 INFO L87 Difference]: Start difference. First operand 260 states and 397 transitions. Second operand 4 states. [2019-09-09 05:53:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:55,946 INFO L93 Difference]: Finished difference Result 318 states and 475 transitions. [2019-09-09 05:53:55,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:55,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-09 05:53:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:55,950 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:53:55,950 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:53:55,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:53:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 261. [2019-09-09 05:53:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:53:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 398 transitions. [2019-09-09 05:53:55,958 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 398 transitions. Word has length 89 [2019-09-09 05:53:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:55,958 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 398 transitions. [2019-09-09 05:53:55,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 398 transitions. [2019-09-09 05:53:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:53:55,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:55,960 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:55,960 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:55,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:55,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1662632094, now seen corresponding path program 1 times [2019-09-09 05:53:55,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:55,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:55,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:56,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:56,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:56,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:56,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:56,022 INFO L87 Difference]: Start difference. First operand 261 states and 398 transitions. Second operand 4 states. [2019-09-09 05:53:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:56,459 INFO L93 Difference]: Finished difference Result 318 states and 474 transitions. [2019-09-09 05:53:56,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:56,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:53:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:56,462 INFO L225 Difference]: With dead ends: 318 [2019-09-09 05:53:56,462 INFO L226 Difference]: Without dead ends: 318 [2019-09-09 05:53:56,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-09 05:53:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 261. [2019-09-09 05:53:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:53:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 397 transitions. [2019-09-09 05:53:56,470 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 397 transitions. Word has length 101 [2019-09-09 05:53:56,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:56,470 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 397 transitions. [2019-09-09 05:53:56,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 397 transitions. [2019-09-09 05:53:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:53:56,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:56,472 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:56,472 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:56,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:56,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1756316196, now seen corresponding path program 1 times [2019-09-09 05:53:56,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:56,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:56,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:56,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:56,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:56,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:56,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:56,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:56,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:56,555 INFO L87 Difference]: Start difference. First operand 261 states and 397 transitions. Second operand 4 states. [2019-09-09 05:53:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:56,869 INFO L93 Difference]: Finished difference Result 285 states and 426 transitions. [2019-09-09 05:53:56,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:56,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:53:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:56,871 INFO L225 Difference]: With dead ends: 285 [2019-09-09 05:53:56,871 INFO L226 Difference]: Without dead ends: 285 [2019-09-09 05:53:56,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-09 05:53:56,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 261. [2019-09-09 05:53:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:53:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 396 transitions. [2019-09-09 05:53:56,878 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 396 transitions. Word has length 101 [2019-09-09 05:53:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:56,878 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 396 transitions. [2019-09-09 05:53:56,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 396 transitions. [2019-09-09 05:53:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:53:56,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:56,880 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:56,880 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:56,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:56,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1459205982, now seen corresponding path program 1 times [2019-09-09 05:53:56,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:56,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:56,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:56,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:56,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:56,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:56,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:56,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:56,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:56,940 INFO L87 Difference]: Start difference. First operand 261 states and 396 transitions. Second operand 4 states. [2019-09-09 05:53:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:57,475 INFO L93 Difference]: Finished difference Result 317 states and 471 transitions. [2019-09-09 05:53:57,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:57,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:53:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:57,478 INFO L225 Difference]: With dead ends: 317 [2019-09-09 05:53:57,478 INFO L226 Difference]: Without dead ends: 317 [2019-09-09 05:53:57,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-09 05:53:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 261. [2019-09-09 05:53:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:53:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2019-09-09 05:53:57,485 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 102 [2019-09-09 05:53:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:57,486 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2019-09-09 05:53:57,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2019-09-09 05:53:57,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:53:57,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:57,488 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:57,488 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:57,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1391645981, now seen corresponding path program 1 times [2019-09-09 05:53:57,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:57,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:57,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:57,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:57,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:57,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:57,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:57,578 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 4 states. [2019-09-09 05:53:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:57,999 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2019-09-09 05:53:57,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:58,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:53:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:58,002 INFO L225 Difference]: With dead ends: 315 [2019-09-09 05:53:58,002 INFO L226 Difference]: Without dead ends: 315 [2019-09-09 05:53:58,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-09 05:53:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 261. [2019-09-09 05:53:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:53:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 394 transitions. [2019-09-09 05:53:58,012 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 394 transitions. Word has length 102 [2019-09-09 05:53:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:58,013 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 394 transitions. [2019-09-09 05:53:58,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 394 transitions. [2019-09-09 05:53:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:53:58,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:58,015 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:58,016 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1448975904, now seen corresponding path program 1 times [2019-09-09 05:53:58,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:58,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:58,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:58,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:58,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:58,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:58,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:58,146 INFO L87 Difference]: Start difference. First operand 261 states and 394 transitions. Second operand 4 states. [2019-09-09 05:53:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:58,452 INFO L93 Difference]: Finished difference Result 284 states and 422 transitions. [2019-09-09 05:53:58,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:58,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:53:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:58,455 INFO L225 Difference]: With dead ends: 284 [2019-09-09 05:53:58,455 INFO L226 Difference]: Without dead ends: 284 [2019-09-09 05:53:58,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-09 05:53:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 261. [2019-09-09 05:53:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:53:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 393 transitions. [2019-09-09 05:53:58,462 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 393 transitions. Word has length 102 [2019-09-09 05:53:58,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:58,462 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 393 transitions. [2019-09-09 05:53:58,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 393 transitions. [2019-09-09 05:53:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:53:58,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:58,464 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:58,464 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:58,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:58,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1516535905, now seen corresponding path program 1 times [2019-09-09 05:53:58,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:58,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:58,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:58,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:58,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:58,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:58,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:58,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:58,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:58,546 INFO L87 Difference]: Start difference. First operand 261 states and 393 transitions. Second operand 4 states. [2019-09-09 05:53:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:58,904 INFO L93 Difference]: Finished difference Result 282 states and 419 transitions. [2019-09-09 05:53:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:58,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:53:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:58,906 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:53:58,907 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:53:58,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:53:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 261. [2019-09-09 05:53:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:53:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 392 transitions. [2019-09-09 05:53:58,913 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 392 transitions. Word has length 102 [2019-09-09 05:53:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:58,913 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 392 transitions. [2019-09-09 05:53:58,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 392 transitions. [2019-09-09 05:53:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:53:58,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:58,915 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:58,915 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1829354469, now seen corresponding path program 1 times [2019-09-09 05:53:58,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:58,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:58,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:58,967 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:58,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:58,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:58,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:58,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:58,968 INFO L87 Difference]: Start difference. First operand 261 states and 392 transitions. Second operand 4 states. [2019-09-09 05:53:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:59,352 INFO L93 Difference]: Finished difference Result 315 states and 465 transitions. [2019-09-09 05:53:59,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:59,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:53:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:59,355 INFO L225 Difference]: With dead ends: 315 [2019-09-09 05:53:59,355 INFO L226 Difference]: Without dead ends: 315 [2019-09-09 05:53:59,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-09 05:53:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 261. [2019-09-09 05:53:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:53:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 391 transitions. [2019-09-09 05:53:59,362 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 391 transitions. Word has length 103 [2019-09-09 05:53:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:59,362 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 391 transitions. [2019-09-09 05:53:59,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 391 transitions. [2019-09-09 05:53:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:53:59,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:59,364 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:59,364 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1788679719, now seen corresponding path program 1 times [2019-09-09 05:53:59,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:59,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:59,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:59,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:59,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:59,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:59,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:59,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:59,417 INFO L87 Difference]: Start difference. First operand 261 states and 391 transitions. Second operand 4 states. [2019-09-09 05:53:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:59,723 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2019-09-09 05:53:59,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:59,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:53:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:59,726 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:53:59,726 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:53:59,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:53:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 261. [2019-09-09 05:53:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:53:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 390 transitions. [2019-09-09 05:53:59,732 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 390 transitions. Word has length 103 [2019-09-09 05:53:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:59,732 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 390 transitions. [2019-09-09 05:53:59,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 390 transitions. [2019-09-09 05:53:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:53:59,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:59,734 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:59,734 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:59,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:59,734 INFO L82 PathProgramCache]: Analyzing trace with hash 845272602, now seen corresponding path program 1 times [2019-09-09 05:53:59,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:59,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:59,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:59,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:59,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:59,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:59,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:59,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:59,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:59,811 INFO L87 Difference]: Start difference. First operand 261 states and 390 transitions. Second operand 4 states. [2019-09-09 05:54:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:00,226 INFO L93 Difference]: Finished difference Result 315 states and 463 transitions. [2019-09-09 05:54:00,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:00,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:54:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:00,230 INFO L225 Difference]: With dead ends: 315 [2019-09-09 05:54:00,230 INFO L226 Difference]: Without dead ends: 315 [2019-09-09 05:54:00,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:00,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-09 05:54:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 261. [2019-09-09 05:54:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:54:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 389 transitions. [2019-09-09 05:54:00,236 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 389 transitions. Word has length 104 [2019-09-09 05:54:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:00,236 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 389 transitions. [2019-09-09 05:54:00,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 389 transitions. [2019-09-09 05:54:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:54:00,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:00,238 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:00,238 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash 2106189852, now seen corresponding path program 1 times [2019-09-09 05:54:00,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:00,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:00,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:00,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:00,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:00,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:00,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:00,304 INFO L87 Difference]: Start difference. First operand 261 states and 389 transitions. Second operand 4 states. [2019-09-09 05:54:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:00,579 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-09 05:54:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:00,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:54:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:00,581 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:54:00,581 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:54:00,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:54:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 261. [2019-09-09 05:54:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:54:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 388 transitions. [2019-09-09 05:54:00,588 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 388 transitions. Word has length 104 [2019-09-09 05:54:00,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:00,589 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 388 transitions. [2019-09-09 05:54:00,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 388 transitions. [2019-09-09 05:54:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:54:00,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:00,591 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:00,591 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:00,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1587696298, now seen corresponding path program 1 times [2019-09-09 05:54:00,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:00,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:00,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:00,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:00,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:00,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:00,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:00,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:00,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:00,658 INFO L87 Difference]: Start difference. First operand 261 states and 388 transitions. Second operand 4 states. [2019-09-09 05:54:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:01,087 INFO L93 Difference]: Finished difference Result 315 states and 461 transitions. [2019-09-09 05:54:01,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:01,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:54:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:01,090 INFO L225 Difference]: With dead ends: 315 [2019-09-09 05:54:01,090 INFO L226 Difference]: Without dead ends: 315 [2019-09-09 05:54:01,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-09 05:54:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 261. [2019-09-09 05:54:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:54:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 387 transitions. [2019-09-09 05:54:01,098 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 387 transitions. Word has length 105 [2019-09-09 05:54:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:01,099 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 387 transitions. [2019-09-09 05:54:01,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 387 transitions. [2019-09-09 05:54:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:54:01,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:01,100 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:01,101 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1153967212, now seen corresponding path program 1 times [2019-09-09 05:54:01,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:01,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:01,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:01,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:01,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:01,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:01,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:01,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:01,163 INFO L87 Difference]: Start difference. First operand 261 states and 387 transitions. Second operand 4 states. [2019-09-09 05:54:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:01,455 INFO L93 Difference]: Finished difference Result 282 states and 413 transitions. [2019-09-09 05:54:01,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:01,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:54:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:01,457 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:54:01,458 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:54:01,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:54:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 261. [2019-09-09 05:54:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:54:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 386 transitions. [2019-09-09 05:54:01,465 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 386 transitions. Word has length 105 [2019-09-09 05:54:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:01,465 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 386 transitions. [2019-09-09 05:54:01,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 386 transitions. [2019-09-09 05:54:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:54:01,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:01,467 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:01,467 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:01,468 INFO L82 PathProgramCache]: Analyzing trace with hash 852616949, now seen corresponding path program 1 times [2019-09-09 05:54:01,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:01,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:01,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:01,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:01,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:01,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:01,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:01,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:01,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:01,531 INFO L87 Difference]: Start difference. First operand 261 states and 386 transitions. Second operand 4 states. [2019-09-09 05:54:01,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:01,945 INFO L93 Difference]: Finished difference Result 305 states and 447 transitions. [2019-09-09 05:54:01,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:01,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:54:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:01,947 INFO L225 Difference]: With dead ends: 305 [2019-09-09 05:54:01,947 INFO L226 Difference]: Without dead ends: 305 [2019-09-09 05:54:01,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-09 05:54:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 261. [2019-09-09 05:54:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:54:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 385 transitions. [2019-09-09 05:54:01,953 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 385 transitions. Word has length 106 [2019-09-09 05:54:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:01,953 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 385 transitions. [2019-09-09 05:54:01,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 385 transitions. [2019-09-09 05:54:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:54:01,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:01,955 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:01,955 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:01,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:01,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1413316727, now seen corresponding path program 1 times [2019-09-09 05:54:01,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:01,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:01,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:02,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:02,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:02,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:02,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:02,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:02,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:02,029 INFO L87 Difference]: Start difference. First operand 261 states and 385 transitions. Second operand 4 states. [2019-09-09 05:54:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:02,291 INFO L93 Difference]: Finished difference Result 272 states and 399 transitions. [2019-09-09 05:54:02,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:02,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:54:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:02,294 INFO L225 Difference]: With dead ends: 272 [2019-09-09 05:54:02,295 INFO L226 Difference]: Without dead ends: 272 [2019-09-09 05:54:02,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-09 05:54:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 261. [2019-09-09 05:54:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:54:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 384 transitions. [2019-09-09 05:54:02,300 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 384 transitions. Word has length 106 [2019-09-09 05:54:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:02,300 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 384 transitions. [2019-09-09 05:54:02,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 384 transitions. [2019-09-09 05:54:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:54:02,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:02,302 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:02,302 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:02,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:02,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1368313697, now seen corresponding path program 1 times [2019-09-09 05:54:02,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:02,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:02,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:54:02,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:02,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:02,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:02,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:02,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:02,362 INFO L87 Difference]: Start difference. First operand 261 states and 384 transitions. Second operand 4 states. [2019-09-09 05:54:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:02,742 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2019-09-09 05:54:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:02,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-09 05:54:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:02,744 INFO L225 Difference]: With dead ends: 305 [2019-09-09 05:54:02,744 INFO L226 Difference]: Without dead ends: 305 [2019-09-09 05:54:02,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:02,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-09 05:54:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 261. [2019-09-09 05:54:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-09 05:54:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 383 transitions. [2019-09-09 05:54:02,749 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 383 transitions. Word has length 110 [2019-09-09 05:54:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:02,750 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 383 transitions. [2019-09-09 05:54:02,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 383 transitions. [2019-09-09 05:54:02,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:54:02,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:02,751 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:02,751 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:02,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:02,752 INFO L82 PathProgramCache]: Analyzing trace with hash 950917091, now seen corresponding path program 1 times [2019-09-09 05:54:02,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:54:02,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:02,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:02,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:02,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:02,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:02,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:02,823 INFO L87 Difference]: Start difference. First operand 261 states and 383 transitions. Second operand 3 states. [2019-09-09 05:54:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:02,877 INFO L93 Difference]: Finished difference Result 495 states and 729 transitions. [2019-09-09 05:54:02,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:02,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-09 05:54:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:02,880 INFO L225 Difference]: With dead ends: 495 [2019-09-09 05:54:02,880 INFO L226 Difference]: Without dead ends: 495 [2019-09-09 05:54:02,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-09 05:54:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2019-09-09 05:54:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-09 05:54:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 729 transitions. [2019-09-09 05:54:02,890 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 729 transitions. Word has length 110 [2019-09-09 05:54:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:02,892 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 729 transitions. [2019-09-09 05:54:02,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 729 transitions. [2019-09-09 05:54:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-09 05:54:02,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:02,894 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:54:02,895 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:02,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:02,895 INFO L82 PathProgramCache]: Analyzing trace with hash -450757812, now seen corresponding path program 1 times [2019-09-09 05:54:02,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:02,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:02,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:02,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:02,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:02,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:02,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:02,993 INFO L87 Difference]: Start difference. First operand 495 states and 729 transitions. Second operand 4 states. [2019-09-09 05:54:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:03,463 INFO L93 Difference]: Finished difference Result 703 states and 1044 transitions. [2019-09-09 05:54:03,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:03,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-09 05:54:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:03,468 INFO L225 Difference]: With dead ends: 703 [2019-09-09 05:54:03,468 INFO L226 Difference]: Without dead ends: 703 [2019-09-09 05:54:03,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-09-09 05:54:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 573. [2019-09-09 05:54:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-09 05:54:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 871 transitions. [2019-09-09 05:54:03,478 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 871 transitions. Word has length 129 [2019-09-09 05:54:03,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:03,480 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 871 transitions. [2019-09-09 05:54:03,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 871 transitions. [2019-09-09 05:54:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-09 05:54:03,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:03,482 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:54:03,482 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:03,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:03,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1255416056, now seen corresponding path program 1 times [2019-09-09 05:54:03,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:03,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:03,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:03,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:03,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:03,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:03,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:03,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:03,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:03,592 INFO L87 Difference]: Start difference. First operand 573 states and 871 transitions. Second operand 4 states. [2019-09-09 05:54:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:04,064 INFO L93 Difference]: Finished difference Result 689 states and 1024 transitions. [2019-09-09 05:54:04,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:04,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-09 05:54:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:04,069 INFO L225 Difference]: With dead ends: 689 [2019-09-09 05:54:04,069 INFO L226 Difference]: Without dead ends: 689 [2019-09-09 05:54:04,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:04,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-09-09 05:54:04,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 543. [2019-09-09 05:54:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-09 05:54:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 813 transitions. [2019-09-09 05:54:04,078 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 813 transitions. Word has length 130 [2019-09-09 05:54:04,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:04,079 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 813 transitions. [2019-09-09 05:54:04,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:04,079 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 813 transitions. [2019-09-09 05:54:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-09 05:54:04,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:04,081 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-09 05:54:04,081 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash -901724826, now seen corresponding path program 1 times [2019-09-09 05:54:04,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:04,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:04,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:04,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:04,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:04,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:04,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:04,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:04,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:04,165 INFO L87 Difference]: Start difference. First operand 543 states and 813 transitions. Second operand 4 states. [2019-09-09 05:54:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:04,626 INFO L93 Difference]: Finished difference Result 689 states and 1022 transitions. [2019-09-09 05:54:04,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:04,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-09 05:54:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:04,632 INFO L225 Difference]: With dead ends: 689 [2019-09-09 05:54:04,632 INFO L226 Difference]: Without dead ends: 689 [2019-09-09 05:54:04,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-09-09 05:54:04,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 543. [2019-09-09 05:54:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-09 05:54:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 811 transitions. [2019-09-09 05:54:04,641 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 811 transitions. Word has length 142 [2019-09-09 05:54:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:04,641 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 811 transitions. [2019-09-09 05:54:04,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 811 transitions. [2019-09-09 05:54:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:54:04,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:04,644 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-09 05:54:04,644 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash -726447210, now seen corresponding path program 1 times [2019-09-09 05:54:04,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:04,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:04,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:04,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:04,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:04,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:04,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:04,709 INFO L87 Difference]: Start difference. First operand 543 states and 811 transitions. Second operand 4 states. [2019-09-09 05:54:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:05,201 INFO L93 Difference]: Finished difference Result 687 states and 1018 transitions. [2019-09-09 05:54:05,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:05,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-09 05:54:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:05,204 INFO L225 Difference]: With dead ends: 687 [2019-09-09 05:54:05,205 INFO L226 Difference]: Without dead ends: 687 [2019-09-09 05:54:05,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-09-09 05:54:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 543. [2019-09-09 05:54:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-09 05:54:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 809 transitions. [2019-09-09 05:54:05,214 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 809 transitions. Word has length 143 [2019-09-09 05:54:05,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:05,215 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 809 transitions. [2019-09-09 05:54:05,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 809 transitions. [2019-09-09 05:54:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:54:05,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:05,217 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-09 05:54:05,217 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash -794007211, now seen corresponding path program 1 times [2019-09-09 05:54:05,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:05,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:05,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:05,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:05,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:05,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:05,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:05,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:05,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:05,283 INFO L87 Difference]: Start difference. First operand 543 states and 809 transitions. Second operand 4 states. [2019-09-09 05:54:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:05,800 INFO L93 Difference]: Finished difference Result 683 states and 1012 transitions. [2019-09-09 05:54:05,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:05,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-09 05:54:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:05,804 INFO L225 Difference]: With dead ends: 683 [2019-09-09 05:54:05,804 INFO L226 Difference]: Without dead ends: 683 [2019-09-09 05:54:05,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-09 05:54:05,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 543. [2019-09-09 05:54:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-09 05:54:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 807 transitions. [2019-09-09 05:54:05,815 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 807 transitions. Word has length 143 [2019-09-09 05:54:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:05,816 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 807 transitions. [2019-09-09 05:54:05,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:05,816 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 807 transitions. [2019-09-09 05:54:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-09 05:54:05,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:05,818 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-09 05:54:05,818 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:05,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:05,819 INFO L82 PathProgramCache]: Analyzing trace with hash -865126685, now seen corresponding path program 1 times [2019-09-09 05:54:05,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:05,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:05,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:05,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:05,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:05,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:05,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:05,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:05,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:05,935 INFO L87 Difference]: Start difference. First operand 543 states and 807 transitions. Second operand 4 states. [2019-09-09 05:54:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:06,384 INFO L93 Difference]: Finished difference Result 683 states and 1010 transitions. [2019-09-09 05:54:06,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:06,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-09 05:54:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:06,388 INFO L225 Difference]: With dead ends: 683 [2019-09-09 05:54:06,389 INFO L226 Difference]: Without dead ends: 683 [2019-09-09 05:54:06,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-09 05:54:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 543. [2019-09-09 05:54:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-09 05:54:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 805 transitions. [2019-09-09 05:54:06,399 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 805 transitions. Word has length 144 [2019-09-09 05:54:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:06,399 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 805 transitions. [2019-09-09 05:54:06,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 805 transitions. [2019-09-09 05:54:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-09 05:54:06,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:06,401 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-09 05:54:06,402 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:06,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:06,402 INFO L82 PathProgramCache]: Analyzing trace with hash 671562834, now seen corresponding path program 1 times [2019-09-09 05:54:06,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:06,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:06,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:06,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:06,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:06,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:06,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:06,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:06,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:06,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:06,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:06,467 INFO L87 Difference]: Start difference. First operand 543 states and 805 transitions. Second operand 4 states. [2019-09-09 05:54:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:06,900 INFO L93 Difference]: Finished difference Result 683 states and 1008 transitions. [2019-09-09 05:54:06,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:06,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-09 05:54:06,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:06,904 INFO L225 Difference]: With dead ends: 683 [2019-09-09 05:54:06,904 INFO L226 Difference]: Without dead ends: 683 [2019-09-09 05:54:06,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:06,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-09 05:54:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 543. [2019-09-09 05:54:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-09 05:54:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 803 transitions. [2019-09-09 05:54:06,913 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 803 transitions. Word has length 145 [2019-09-09 05:54:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:06,913 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 803 transitions. [2019-09-09 05:54:06,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 803 transitions. [2019-09-09 05:54:06,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-09 05:54:06,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:06,915 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-09 05:54:06,915 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:06,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:06,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1617235486, now seen corresponding path program 1 times [2019-09-09 05:54:06,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:06,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:06,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:06,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:06,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:06,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:06,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:06,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:06,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:06,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:06,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:06,983 INFO L87 Difference]: Start difference. First operand 543 states and 803 transitions. Second operand 4 states. [2019-09-09 05:54:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:07,427 INFO L93 Difference]: Finished difference Result 683 states and 1006 transitions. [2019-09-09 05:54:07,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:07,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-09 05:54:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:07,432 INFO L225 Difference]: With dead ends: 683 [2019-09-09 05:54:07,432 INFO L226 Difference]: Without dead ends: 683 [2019-09-09 05:54:07,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-09 05:54:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 543. [2019-09-09 05:54:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-09 05:54:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 801 transitions. [2019-09-09 05:54:07,439 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 801 transitions. Word has length 146 [2019-09-09 05:54:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:07,440 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 801 transitions. [2019-09-09 05:54:07,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 801 transitions. [2019-09-09 05:54:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-09 05:54:07,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:07,441 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-09 05:54:07,441 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:07,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:07,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1421254445, now seen corresponding path program 1 times [2019-09-09 05:54:07,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:07,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:07,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:07,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:07,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:07,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:07,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:07,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:07,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:07,519 INFO L87 Difference]: Start difference. First operand 543 states and 801 transitions. Second operand 4 states. [2019-09-09 05:54:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:07,918 INFO L93 Difference]: Finished difference Result 663 states and 980 transitions. [2019-09-09 05:54:07,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:07,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-09 05:54:07,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:07,929 INFO L225 Difference]: With dead ends: 663 [2019-09-09 05:54:07,929 INFO L226 Difference]: Without dead ends: 663 [2019-09-09 05:54:07,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-09 05:54:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 543. [2019-09-09 05:54:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-09 05:54:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 799 transitions. [2019-09-09 05:54:07,938 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 799 transitions. Word has length 147 [2019-09-09 05:54:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:07,938 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 799 transitions. [2019-09-09 05:54:07,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 799 transitions. [2019-09-09 05:54:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-09 05:54:07,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:07,940 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:07,940 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:07,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:07,941 INFO L82 PathProgramCache]: Analyzing trace with hash 91007897, now seen corresponding path program 1 times [2019-09-09 05:54:07,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:07,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:07,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:07,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:08,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:08,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:08,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:08,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:08,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:08,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:08,031 INFO L87 Difference]: Start difference. First operand 543 states and 799 transitions. Second operand 4 states. [2019-09-09 05:54:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:08,437 INFO L93 Difference]: Finished difference Result 663 states and 978 transitions. [2019-09-09 05:54:08,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:08,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-09 05:54:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:08,441 INFO L225 Difference]: With dead ends: 663 [2019-09-09 05:54:08,442 INFO L226 Difference]: Without dead ends: 663 [2019-09-09 05:54:08,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-09 05:54:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 495. [2019-09-09 05:54:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-09 05:54:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 729 transitions. [2019-09-09 05:54:08,449 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 729 transitions. Word has length 151 [2019-09-09 05:54:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:08,450 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 729 transitions. [2019-09-09 05:54:08,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 729 transitions. [2019-09-09 05:54:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 05:54:08,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:08,451 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-09 05:54:08,451 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash -357566710, now seen corresponding path program 1 times [2019-09-09 05:54:08,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:08,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:08,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:08,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:08,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:08,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:08,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:08,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:08,530 INFO L87 Difference]: Start difference. First operand 495 states and 729 transitions. Second operand 4 states. [2019-09-09 05:54:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:08,922 INFO L93 Difference]: Finished difference Result 655 states and 966 transitions. [2019-09-09 05:54:08,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:08,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-09 05:54:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:08,928 INFO L225 Difference]: With dead ends: 655 [2019-09-09 05:54:08,928 INFO L226 Difference]: Without dead ends: 655 [2019-09-09 05:54:08,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:08,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-09 05:54:08,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 545. [2019-09-09 05:54:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-09 05:54:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 799 transitions. [2019-09-09 05:54:08,936 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 799 transitions. Word has length 152 [2019-09-09 05:54:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:08,936 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 799 transitions. [2019-09-09 05:54:08,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 799 transitions. [2019-09-09 05:54:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:54:08,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:08,938 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:54:08,938 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:08,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:08,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2085165897, now seen corresponding path program 1 times [2019-09-09 05:54:08,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:08,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:08,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:08,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:09,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:09,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:09,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:09,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:09,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:09,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:09,017 INFO L87 Difference]: Start difference. First operand 545 states and 799 transitions. Second operand 4 states. [2019-09-09 05:54:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:09,405 INFO L93 Difference]: Finished difference Result 655 states and 964 transitions. [2019-09-09 05:54:09,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:09,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:54:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:09,409 INFO L225 Difference]: With dead ends: 655 [2019-09-09 05:54:09,409 INFO L226 Difference]: Without dead ends: 655 [2019-09-09 05:54:09,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-09 05:54:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 551. [2019-09-09 05:54:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-09 05:54:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 809 transitions. [2019-09-09 05:54:09,416 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 809 transitions. Word has length 154 [2019-09-09 05:54:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:09,417 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 809 transitions. [2019-09-09 05:54:09,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 809 transitions. [2019-09-09 05:54:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:54:09,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:09,418 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:54:09,419 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:09,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:09,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2123080456, now seen corresponding path program 1 times [2019-09-09 05:54:09,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:09,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:09,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:09,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:09,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:09,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:09,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:09,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:09,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:09,492 INFO L87 Difference]: Start difference. First operand 551 states and 809 transitions. Second operand 4 states. [2019-09-09 05:54:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:09,813 INFO L93 Difference]: Finished difference Result 639 states and 936 transitions. [2019-09-09 05:54:09,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:09,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:54:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:09,817 INFO L225 Difference]: With dead ends: 639 [2019-09-09 05:54:09,817 INFO L226 Difference]: Without dead ends: 639 [2019-09-09 05:54:09,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:09,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-09 05:54:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 553. [2019-09-09 05:54:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-09-09 05:54:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 811 transitions. [2019-09-09 05:54:09,824 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 811 transitions. Word has length 155 [2019-09-09 05:54:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:09,824 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 811 transitions. [2019-09-09 05:54:09,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 811 transitions. [2019-09-09 05:54:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:54:09,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:09,826 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:09,826 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1812033251, now seen corresponding path program 1 times [2019-09-09 05:54:09,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:09,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:09,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:09,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:09,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:09,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:09,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:09,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:09,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:09,905 INFO L87 Difference]: Start difference. First operand 553 states and 811 transitions. Second operand 4 states. [2019-09-09 05:54:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:10,290 INFO L93 Difference]: Finished difference Result 639 states and 934 transitions. [2019-09-09 05:54:10,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:10,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:54:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:10,294 INFO L225 Difference]: With dead ends: 639 [2019-09-09 05:54:10,294 INFO L226 Difference]: Without dead ends: 639 [2019-09-09 05:54:10,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-09 05:54:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 555. [2019-09-09 05:54:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-09 05:54:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 813 transitions. [2019-09-09 05:54:10,301 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 813 transitions. Word has length 156 [2019-09-09 05:54:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:10,301 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 813 transitions. [2019-09-09 05:54:10,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 813 transitions. [2019-09-09 05:54:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:54:10,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:10,303 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:54:10,303 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:10,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:10,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1318648782, now seen corresponding path program 1 times [2019-09-09 05:54:10,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:10,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:10,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:10,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:10,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:10,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:10,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:10,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:10,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:10,385 INFO L87 Difference]: Start difference. First operand 555 states and 813 transitions. Second operand 4 states. [2019-09-09 05:54:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:10,753 INFO L93 Difference]: Finished difference Result 639 states and 932 transitions. [2019-09-09 05:54:10,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:10,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:54:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:10,757 INFO L225 Difference]: With dead ends: 639 [2019-09-09 05:54:10,757 INFO L226 Difference]: Without dead ends: 639 [2019-09-09 05:54:10,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-09 05:54:10,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 555. [2019-09-09 05:54:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-09 05:54:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 811 transitions. [2019-09-09 05:54:10,764 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 811 transitions. Word has length 157 [2019-09-09 05:54:10,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:10,765 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 811 transitions. [2019-09-09 05:54:10,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 811 transitions. [2019-09-09 05:54:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:54:10,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:10,766 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:10,767 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1923363890, now seen corresponding path program 1 times [2019-09-09 05:54:10,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:10,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:10,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:10,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:10,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:10,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:10,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:10,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:10,838 INFO L87 Difference]: Start difference. First operand 555 states and 811 transitions. Second operand 4 states. [2019-09-09 05:54:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:11,180 INFO L93 Difference]: Finished difference Result 635 states and 926 transitions. [2019-09-09 05:54:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:11,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:54:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:11,184 INFO L225 Difference]: With dead ends: 635 [2019-09-09 05:54:11,184 INFO L226 Difference]: Without dead ends: 635 [2019-09-09 05:54:11,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-09 05:54:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 557. [2019-09-09 05:54:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-09 05:54:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 813 transitions. [2019-09-09 05:54:11,191 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 813 transitions. Word has length 157 [2019-09-09 05:54:11,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:11,192 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 813 transitions. [2019-09-09 05:54:11,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 813 transitions. [2019-09-09 05:54:11,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:54:11,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:11,193 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-09 05:54:11,194 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:11,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:11,194 INFO L82 PathProgramCache]: Analyzing trace with hash 787486495, now seen corresponding path program 1 times [2019-09-09 05:54:11,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:11,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:11,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:11,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:11,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:11,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:11,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:11,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:11,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:11,273 INFO L87 Difference]: Start difference. First operand 557 states and 813 transitions. Second operand 4 states. [2019-09-09 05:54:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:11,608 INFO L93 Difference]: Finished difference Result 631 states and 918 transitions. [2019-09-09 05:54:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:11,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:54:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:11,612 INFO L225 Difference]: With dead ends: 631 [2019-09-09 05:54:11,612 INFO L226 Difference]: Without dead ends: 631 [2019-09-09 05:54:11,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-09 05:54:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 557. [2019-09-09 05:54:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-09 05:54:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 811 transitions. [2019-09-09 05:54:11,619 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 811 transitions. Word has length 158 [2019-09-09 05:54:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:11,619 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 811 transitions. [2019-09-09 05:54:11,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 811 transitions. [2019-09-09 05:54:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:54:11,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:11,621 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:54:11,621 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1680077375, now seen corresponding path program 1 times [2019-09-09 05:54:11,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:11,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:11,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:11,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:11,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:11,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:11,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:11,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:11,698 INFO L87 Difference]: Start difference. First operand 557 states and 811 transitions. Second operand 4 states. [2019-09-09 05:54:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:12,021 INFO L93 Difference]: Finished difference Result 625 states and 908 transitions. [2019-09-09 05:54:12,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:12,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:54:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:12,025 INFO L225 Difference]: With dead ends: 625 [2019-09-09 05:54:12,025 INFO L226 Difference]: Without dead ends: 625 [2019-09-09 05:54:12,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-09 05:54:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 559. [2019-09-09 05:54:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-09 05:54:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 813 transitions. [2019-09-09 05:54:12,031 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 813 transitions. Word has length 158 [2019-09-09 05:54:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:12,031 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 813 transitions. [2019-09-09 05:54:12,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 813 transitions. [2019-09-09 05:54:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:54:12,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:12,033 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:54:12,033 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:12,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1610871587, now seen corresponding path program 1 times [2019-09-09 05:54:12,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:12,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:12,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:12,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:12,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:12,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:12,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:12,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:12,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:12,138 INFO L87 Difference]: Start difference. First operand 559 states and 813 transitions. Second operand 4 states. [2019-09-09 05:54:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:12,467 INFO L93 Difference]: Finished difference Result 625 states and 906 transitions. [2019-09-09 05:54:12,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:12,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:54:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:12,471 INFO L225 Difference]: With dead ends: 625 [2019-09-09 05:54:12,471 INFO L226 Difference]: Without dead ends: 625 [2019-09-09 05:54:12,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-09 05:54:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 561. [2019-09-09 05:54:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-09-09 05:54:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 815 transitions. [2019-09-09 05:54:12,477 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 815 transitions. Word has length 160 [2019-09-09 05:54:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:12,477 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 815 transitions. [2019-09-09 05:54:12,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 815 transitions. [2019-09-09 05:54:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:54:12,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:12,478 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:12,479 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:12,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1881046551, now seen corresponding path program 1 times [2019-09-09 05:54:12,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:12,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:12,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:12,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:12,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:12,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:12,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:12,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:12,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:12,546 INFO L87 Difference]: Start difference. First operand 561 states and 815 transitions. Second operand 4 states. [2019-09-09 05:54:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:12,863 INFO L93 Difference]: Finished difference Result 617 states and 894 transitions. [2019-09-09 05:54:12,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:12,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:54:12,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:12,867 INFO L225 Difference]: With dead ends: 617 [2019-09-09 05:54:12,867 INFO L226 Difference]: Without dead ends: 617 [2019-09-09 05:54:12,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:12,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-09 05:54:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 563. [2019-09-09 05:54:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-09 05:54:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 817 transitions. [2019-09-09 05:54:12,872 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 817 transitions. Word has length 161 [2019-09-09 05:54:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:12,873 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 817 transitions. [2019-09-09 05:54:12,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 817 transitions. [2019-09-09 05:54:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:54:12,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:12,874 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:12,874 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:12,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:12,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1768488536, now seen corresponding path program 1 times [2019-09-09 05:54:12,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:12,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:12,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:12,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:12,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:12,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:12,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:12,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:12,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:12,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:12,951 INFO L87 Difference]: Start difference. First operand 563 states and 817 transitions. Second operand 4 states. [2019-09-09 05:54:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:13,270 INFO L93 Difference]: Finished difference Result 617 states and 892 transitions. [2019-09-09 05:54:13,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:13,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:54:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:13,274 INFO L225 Difference]: With dead ends: 617 [2019-09-09 05:54:13,274 INFO L226 Difference]: Without dead ends: 617 [2019-09-09 05:54:13,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-09 05:54:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 565. [2019-09-09 05:54:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-09-09 05:54:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 819 transitions. [2019-09-09 05:54:13,280 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 819 transitions. Word has length 161 [2019-09-09 05:54:13,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:13,280 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 819 transitions. [2019-09-09 05:54:13,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 819 transitions. [2019-09-09 05:54:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 05:54:13,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:13,282 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:13,282 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:13,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:13,283 INFO L82 PathProgramCache]: Analyzing trace with hash 688851092, now seen corresponding path program 1 times [2019-09-09 05:54:13,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:13,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:13,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:13,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:13,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:13,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:13,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:13,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:13,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:13,347 INFO L87 Difference]: Start difference. First operand 565 states and 819 transitions. Second operand 4 states. [2019-09-09 05:54:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:13,664 INFO L93 Difference]: Finished difference Result 613 states and 886 transitions. [2019-09-09 05:54:13,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:13,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-09 05:54:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:13,667 INFO L225 Difference]: With dead ends: 613 [2019-09-09 05:54:13,667 INFO L226 Difference]: Without dead ends: 613 [2019-09-09 05:54:13,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:13,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-09 05:54:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 567. [2019-09-09 05:54:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-09 05:54:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 821 transitions. [2019-09-09 05:54:13,673 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 821 transitions. Word has length 162 [2019-09-09 05:54:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:13,674 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 821 transitions. [2019-09-09 05:54:13,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 821 transitions. [2019-09-09 05:54:13,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-09 05:54:13,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:13,676 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:13,676 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:13,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1153739747, now seen corresponding path program 1 times [2019-09-09 05:54:13,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:13,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:13,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:13,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:13,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:13,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:13,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:13,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:13,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:13,773 INFO L87 Difference]: Start difference. First operand 567 states and 821 transitions. Second operand 4 states. [2019-09-09 05:54:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,104 INFO L93 Difference]: Finished difference Result 613 states and 884 transitions. [2019-09-09 05:54:14,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:14,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-09 05:54:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,108 INFO L225 Difference]: With dead ends: 613 [2019-09-09 05:54:14,108 INFO L226 Difference]: Without dead ends: 613 [2019-09-09 05:54:14,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-09 05:54:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 569. [2019-09-09 05:54:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-09-09 05:54:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 823 transitions. [2019-09-09 05:54:14,114 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 823 transitions. Word has length 163 [2019-09-09 05:54:14,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,114 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 823 transitions. [2019-09-09 05:54:14,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 823 transitions. [2019-09-09 05:54:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:54:14,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,116 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:54:14,116 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1198007505, now seen corresponding path program 1 times [2019-09-09 05:54:14,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:14,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:14,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:14,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:14,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:14,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:14,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:14,192 INFO L87 Difference]: Start difference. First operand 569 states and 823 transitions. Second operand 4 states. [2019-09-09 05:54:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,503 INFO L93 Difference]: Finished difference Result 609 states and 878 transitions. [2019-09-09 05:54:14,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:14,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-09 05:54:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,508 INFO L225 Difference]: With dead ends: 609 [2019-09-09 05:54:14,508 INFO L226 Difference]: Without dead ends: 609 [2019-09-09 05:54:14,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-09 05:54:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 571. [2019-09-09 05:54:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-09 05:54:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 825 transitions. [2019-09-09 05:54:14,516 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 825 transitions. Word has length 164 [2019-09-09 05:54:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,516 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 825 transitions. [2019-09-09 05:54:14,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 825 transitions. [2019-09-09 05:54:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-09 05:54:14,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,517 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:14,518 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1845634934, now seen corresponding path program 1 times [2019-09-09 05:54:14,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-09 05:54:14,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:14,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:14,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:14,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:14,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:14,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:14,593 INFO L87 Difference]: Start difference. First operand 571 states and 825 transitions. Second operand 3 states. [2019-09-09 05:54:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:14,644 INFO L93 Difference]: Finished difference Result 837 states and 1209 transitions. [2019-09-09 05:54:14,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:14,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-09 05:54:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:14,648 INFO L225 Difference]: With dead ends: 837 [2019-09-09 05:54:14,648 INFO L226 Difference]: Without dead ends: 837 [2019-09-09 05:54:14,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-09-09 05:54:14,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2019-09-09 05:54:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-09 05:54:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1209 transitions. [2019-09-09 05:54:14,659 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1209 transitions. Word has length 172 [2019-09-09 05:54:14,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:14,659 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1209 transitions. [2019-09-09 05:54:14,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1209 transitions. [2019-09-09 05:54:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-09 05:54:14,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:14,661 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2019-09-09 05:54:14,661 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:14,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1319413782, now seen corresponding path program 1 times [2019-09-09 05:54:14,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:14,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:14,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:14,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-09 05:54:14,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:14,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:14,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:14,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:14,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:14,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:14,731 INFO L87 Difference]: Start difference. First operand 837 states and 1209 transitions. Second operand 4 states. [2019-09-09 05:54:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:15,034 INFO L93 Difference]: Finished difference Result 894 states and 1282 transitions. [2019-09-09 05:54:15,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:15,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-09 05:54:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:15,044 INFO L225 Difference]: With dead ends: 894 [2019-09-09 05:54:15,044 INFO L226 Difference]: Without dead ends: 894 [2019-09-09 05:54:15,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-09-09 05:54:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 837. [2019-09-09 05:54:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-09 05:54:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1206 transitions. [2019-09-09 05:54:15,055 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1206 transitions. Word has length 173 [2019-09-09 05:54:15,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:15,055 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1206 transitions. [2019-09-09 05:54:15,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1206 transitions. [2019-09-09 05:54:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-09 05:54:15,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:15,058 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:15,059 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:15,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:15,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1924816579, now seen corresponding path program 1 times [2019-09-09 05:54:15,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:54:15,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:15,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:15,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:15,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:15,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:15,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:15,142 INFO L87 Difference]: Start difference. First operand 837 states and 1206 transitions. Second operand 3 states. [2019-09-09 05:54:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:15,188 INFO L93 Difference]: Finished difference Result 1104 states and 1590 transitions. [2019-09-09 05:54:15,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:15,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-09 05:54:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:15,192 INFO L225 Difference]: With dead ends: 1104 [2019-09-09 05:54:15,192 INFO L226 Difference]: Without dead ends: 1104 [2019-09-09 05:54:15,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:15,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-09-09 05:54:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1104. [2019-09-09 05:54:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-09 05:54:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1590 transitions. [2019-09-09 05:54:15,204 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1590 transitions. Word has length 173 [2019-09-09 05:54:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:15,204 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1590 transitions. [2019-09-09 05:54:15,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1590 transitions. [2019-09-09 05:54:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-09 05:54:15,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:15,206 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:54:15,207 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:15,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:15,207 INFO L82 PathProgramCache]: Analyzing trace with hash -442937119, now seen corresponding path program 1 times [2019-09-09 05:54:15,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:15,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:15,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-09 05:54:15,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:15,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:15,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:15,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:15,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:15,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:15,286 INFO L87 Difference]: Start difference. First operand 1104 states and 1590 transitions. Second operand 3 states. [2019-09-09 05:54:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:15,352 INFO L93 Difference]: Finished difference Result 1376 states and 1986 transitions. [2019-09-09 05:54:15,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:15,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-09 05:54:15,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:15,354 INFO L225 Difference]: With dead ends: 1376 [2019-09-09 05:54:15,355 INFO L226 Difference]: Without dead ends: 1376 [2019-09-09 05:54:15,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2019-09-09 05:54:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2019-09-09 05:54:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2019-09-09 05:54:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1986 transitions. [2019-09-09 05:54:15,368 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1986 transitions. Word has length 211 [2019-09-09 05:54:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:15,368 INFO L475 AbstractCegarLoop]: Abstraction has 1376 states and 1986 transitions. [2019-09-09 05:54:15,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1986 transitions. [2019-09-09 05:54:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-09 05:54:15,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:15,370 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-09-09 05:54:15,371 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:15,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:15,371 INFO L82 PathProgramCache]: Analyzing trace with hash -846883203, now seen corresponding path program 1 times [2019-09-09 05:54:15,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:15,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:15,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:15,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-09-09 05:54:15,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:15,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:15,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:15,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:15,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:15,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:15,547 INFO L87 Difference]: Start difference. First operand 1376 states and 1986 transitions. Second operand 4 states. [2019-09-09 05:54:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:16,006 INFO L93 Difference]: Finished difference Result 1886 states and 2753 transitions. [2019-09-09 05:54:16,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:16,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-09-09 05:54:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:16,009 INFO L225 Difference]: With dead ends: 1886 [2019-09-09 05:54:16,009 INFO L226 Difference]: Without dead ends: 1886 [2019-09-09 05:54:16,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-09-09 05:54:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1581. [2019-09-09 05:54:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2019-09-09 05:54:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2361 transitions. [2019-09-09 05:54:16,027 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2361 transitions. Word has length 297 [2019-09-09 05:54:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:16,027 INFO L475 AbstractCegarLoop]: Abstraction has 1581 states and 2361 transitions. [2019-09-09 05:54:16,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2361 transitions. [2019-09-09 05:54:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-09 05:54:16,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:16,031 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-09-09 05:54:16,031 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:16,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:16,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1281388801, now seen corresponding path program 1 times [2019-09-09 05:54:16,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:16,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:16,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-09-09 05:54:16,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:16,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:16,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:16,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:16,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:16,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:16,157 INFO L87 Difference]: Start difference. First operand 1581 states and 2361 transitions. Second operand 3 states. [2019-09-09 05:54:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:16,215 INFO L93 Difference]: Finished difference Result 1889 states and 2820 transitions. [2019-09-09 05:54:16,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:16,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-09-09 05:54:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:16,219 INFO L225 Difference]: With dead ends: 1889 [2019-09-09 05:54:16,220 INFO L226 Difference]: Without dead ends: 1889 [2019-09-09 05:54:16,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-09-09 05:54:16,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1889. [2019-09-09 05:54:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1889 states. [2019-09-09 05:54:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2820 transitions. [2019-09-09 05:54:16,240 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2820 transitions. Word has length 297 [2019-09-09 05:54:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:16,240 INFO L475 AbstractCegarLoop]: Abstraction has 1889 states and 2820 transitions. [2019-09-09 05:54:16,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2820 transitions. [2019-09-09 05:54:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-09 05:54:16,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:16,244 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2019-09-09 05:54:16,244 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:16,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:16,245 INFO L82 PathProgramCache]: Analyzing trace with hash 461909867, now seen corresponding path program 1 times [2019-09-09 05:54:16,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:16,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:16,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:16,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 439 proven. 55 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-09-09 05:54:16,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:54:16,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:54:16,500 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 299 with the following transitions: [2019-09-09 05:54:16,504 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [141], [143], [146], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [203], [208], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [330], [336], [339], [341], [343], [345], [348], [357], [506], [509], [511], [516], [519], [527], [532], [534], [536], [541], [544], [546], [549], [562], [567], [569], [572], [590], [593], [597], [618], [652], [654], [666], [669], [670], [682], [690], [691], [692] [2019-09-09 05:54:16,567 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:54:16,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:54:16,652 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:54:16,653 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-09 05:54:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:16,658 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:54:16,765 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 05:54:16,766 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:54:16,777 INFO L420 sIntCurrentIteration]: We unified 297 AI predicates to 297 [2019-09-09 05:54:16,777 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:54:16,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:54:16,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-09 05:54:16,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:16,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:54:16,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:54:16,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:54:16,780 INFO L87 Difference]: Start difference. First operand 1889 states and 2820 transitions. Second operand 2 states. [2019-09-09 05:54:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:16,780 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 05:54:16,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:54:16,781 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 298 [2019-09-09 05:54:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:16,781 INFO L225 Difference]: With dead ends: 2 [2019-09-09 05:54:16,781 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:54:16,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:54:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:54:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:54:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:54:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:54:16,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 298 [2019-09-09 05:54:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:16,782 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:54:16,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:54:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:54:16,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:54:16,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:54:16 BoogieIcfgContainer [2019-09-09 05:54:16,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:54:16,790 INFO L168 Benchmark]: Toolchain (without parser) took 33940.16 ms. Allocated memory was 134.2 MB in the beginning and 604.0 MB in the end (delta: 469.8 MB). Free memory was 86.6 MB in the beginning and 493.0 MB in the end (delta: -406.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:16,791 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:54:16,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.78 ms. Allocated memory was 134.2 MB in the beginning and 202.4 MB in the end (delta: 68.2 MB). Free memory was 86.4 MB in the beginning and 158.3 MB in the end (delta: -71.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:16,793 INFO L168 Benchmark]: Boogie Preprocessor took 224.28 ms. Allocated memory is still 202.4 MB. Free memory was 158.3 MB in the beginning and 150.1 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:16,795 INFO L168 Benchmark]: RCFGBuilder took 1813.00 ms. Allocated memory was 202.4 MB in the beginning and 229.6 MB in the end (delta: 27.3 MB). Free memory was 150.1 MB in the beginning and 167.4 MB in the end (delta: -17.3 MB). Peak memory consumption was 77.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:16,800 INFO L168 Benchmark]: TraceAbstraction took 31031.63 ms. Allocated memory was 229.6 MB in the beginning and 604.0 MB in the end (delta: 374.3 MB). Free memory was 167.4 MB in the beginning and 493.0 MB in the end (delta: -325.6 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:16,809 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 866.78 ms. Allocated memory was 134.2 MB in the beginning and 202.4 MB in the end (delta: 68.2 MB). Free memory was 86.4 MB in the beginning and 158.3 MB in the end (delta: -71.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 224.28 ms. Allocated memory is still 202.4 MB. Free memory was 158.3 MB in the beginning and 150.1 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1813.00 ms. Allocated memory was 202.4 MB in the beginning and 229.6 MB in the end (delta: 27.3 MB). Free memory was 150.1 MB in the beginning and 167.4 MB in the end (delta: -17.3 MB). Peak memory consumption was 77.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31031.63 ms. Allocated memory was 229.6 MB in the beginning and 604.0 MB in the end (delta: 374.3 MB). Free memory was 167.4 MB in the beginning and 493.0 MB in the end (delta: -325.6 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1727]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 187 locations, 1 error locations. SAFE Result, 30.9s OverallTime, 68 OverallIterations, 9 TraceHistogramMax, 23.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15845 SDtfs, 4634 SDslu, 21811 SDs, 0 SdLazy, 13050 SolverSat, 519 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 437 SyntacticMatches, 33 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1889occurred in iteration=67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.1919191919191918 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 68 MinimizatonAttempts, 3721 StatesRemovedByMinimization, 62 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 8450 NumberOfCodeBlocks, 8450 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 8382 ConstructedInterpolants, 0 QuantifiedInterpolants, 2722781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 68 InterpolantComputations, 67 PerfectInterpolantSequences, 8483/8538 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...