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.13.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:53,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:53,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:53,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:53,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:53,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:53,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:53,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:53,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:53,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:53,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:53,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:53,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:53,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:53,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:53,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:53,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:53,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:53,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:53,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:53,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:53,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:53,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:53,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:53,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:53,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:53,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:53,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:53,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:53,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:53,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:53,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:53,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:53,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:53,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:53,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:53,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:53,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:53,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:53,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:53,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:53,869 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-20 13:27:53,884 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:53,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:53,885 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:53,885 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:53,886 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:53,886 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:53,886 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:53,887 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:53,887 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:53,887 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:53,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:53,888 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:53,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:53,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:53,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:53,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:53,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:53,889 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:53,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:53,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:53,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:53,890 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:53,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:53,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:53,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:53,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:53,891 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:53,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:53,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:53,891 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:53,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:53,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:53,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:53,943 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:53,944 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:53,946 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.13.i.cil-1.c [2019-09-20 13:27:54,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4442968d2/ea26382279fe49d89efedc3536650db6/FLAGd9474627f [2019-09-20 13:27:54,533 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:54,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.13.i.cil-1.c [2019-09-20 13:27:54,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4442968d2/ea26382279fe49d89efedc3536650db6/FLAGd9474627f [2019-09-20 13:27:54,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4442968d2/ea26382279fe49d89efedc3536650db6 [2019-09-20 13:27:54,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:54,775 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:54,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:54,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:54,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:54,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:54" (1/1) ... [2019-09-20 13:27:54,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fe3e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:54, skipping insertion in model container [2019-09-20 13:27:54,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:54" (1/1) ... [2019-09-20 13:27:54,792 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:54,859 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:55,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:55,555 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:55,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:55,786 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:55,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55 WrapperNode [2019-09-20 13:27:55,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:55,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:55,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:55,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:55,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (1/1) ... [2019-09-20 13:27:55,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:55,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:55,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:55,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:55,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (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-20 13:27:56,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:56,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:56,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:56,010 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:56,010 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:56,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:56,010 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:56,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:56,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:56,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:56,011 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:56,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:56,012 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:56,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:56,455 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:57,163 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:57,164 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:57,183 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:57,183 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:57,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:57 BoogieIcfgContainer [2019-09-20 13:27:57,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:57,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:57,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:57,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:57,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:54" (1/3) ... [2019-09-20 13:27:57,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ece197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:57, skipping insertion in model container [2019-09-20 13:27:57,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:55" (2/3) ... [2019-09-20 13:27:57,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ece197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:57, skipping insertion in model container [2019-09-20 13:27:57,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:57" (3/3) ... [2019-09-20 13:27:57,194 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-1.c [2019-09-20 13:27:57,204 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:57,213 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:57,229 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:57,261 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:57,261 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:57,261 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:57,261 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:57,261 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:57,261 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:57,261 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:57,262 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2019-09-20 13:27:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-20 13:27:57,297 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:57,298 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:27:57,301 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:57,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1489368308, now seen corresponding path program 1 times [2019-09-20 13:27:57,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:57,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,608 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-20 13:27:57,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:57,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:57,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:57,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:57,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:57,633 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2019-09-20 13:27:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,087 INFO L93 Difference]: Finished difference Result 190 states and 310 transitions. [2019-09-20 13:27:58,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-20 13:27:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,103 INFO L225 Difference]: With dead ends: 190 [2019-09-20 13:27:58,103 INFO L226 Difference]: Without dead ends: 169 [2019-09-20 13:27:58,105 INFO L636 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-20 13:27:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-20 13:27:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-20 13:27:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:27:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-09-20 13:27:58,163 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2019-09-20 13:27:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,163 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-09-20 13:27:58,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-09-20 13:27:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:27:58,166 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,167 INFO L407 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] [2019-09-20 13:27:58,167 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,167 INFO L82 PathProgramCache]: Analyzing trace with hash 380678987, now seen corresponding path program 1 times [2019-09-20 13:27:58,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,337 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-20 13:27:58,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,344 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-09-20 13:27:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:58,746 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-20 13:27:58,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:58,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-09-20 13:27:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:58,749 INFO L225 Difference]: With dead ends: 169 [2019-09-20 13:27:58,749 INFO L226 Difference]: Without dead ends: 169 [2019-09-20 13:27:58,750 INFO L636 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-20 13:27:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-20 13:27:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-09-20 13:27:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:27:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-09-20 13:27:58,761 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2019-09-20 13:27:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:58,761 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-09-20 13:27:58,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-09-20 13:27:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:58,764 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:58,764 INFO L407 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] [2019-09-20 13:27:58,764 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1401722649, now seen corresponding path program 1 times [2019-09-20 13:27:58,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:58,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:58,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:58,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:58,863 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-20 13:27:58,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:58,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:58,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:58,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:58,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:58,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:58,866 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-09-20 13:27:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,165 INFO L93 Difference]: Finished difference Result 168 states and 250 transitions. [2019-09-20 13:27:59,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:59,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-20 13:27:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,168 INFO L225 Difference]: With dead ends: 168 [2019-09-20 13:27:59,168 INFO L226 Difference]: Without dead ends: 168 [2019-09-20 13:27:59,168 INFO L636 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-20 13:27:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-20 13:27:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-09-20 13:27:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-20 13:27:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-09-20 13:27:59,177 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 55 [2019-09-20 13:27:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,178 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-09-20 13:27:59,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-09-20 13:27:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:59,180 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,180 INFO L407 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] [2019-09-20 13:27:59,181 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash -536143493, now seen corresponding path program 1 times [2019-09-20 13:27:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,309 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-20 13:27:59,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:59,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:59,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:59,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:59,311 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 5 states. [2019-09-20 13:27:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:59,794 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2019-09-20 13:27:59,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:59,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-20 13:27:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:59,795 INFO L225 Difference]: With dead ends: 173 [2019-09-20 13:27:59,796 INFO L226 Difference]: Without dead ends: 173 [2019-09-20 13:27:59,796 INFO L636 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-20 13:27:59,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-20 13:27:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-09-20 13:27:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:27:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-09-20 13:27:59,805 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2019-09-20 13:27:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:59,805 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-09-20 13:27:59,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-09-20 13:27:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:27:59,810 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:59,811 INFO L407 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] [2019-09-20 13:27:59,811 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:59,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:59,811 INFO L82 PathProgramCache]: Analyzing trace with hash -358032589, now seen corresponding path program 1 times [2019-09-20 13:27:59,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:59,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:59,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:59,939 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-20 13:27:59,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:59,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:59,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:59,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:59,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:59,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:59,942 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-09-20 13:28:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,225 INFO L93 Difference]: Finished difference Result 187 states and 274 transitions. [2019-09-20 13:28:00,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-20 13:28:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,228 INFO L225 Difference]: With dead ends: 187 [2019-09-20 13:28:00,228 INFO L226 Difference]: Without dead ends: 187 [2019-09-20 13:28:00,228 INFO L636 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-20 13:28:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-20 13:28:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2019-09-20 13:28:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:28:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-09-20 13:28:00,235 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2019-09-20 13:28:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,235 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-09-20 13:28:00,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-09-20 13:28:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:28:00,237 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,237 INFO L407 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] [2019-09-20 13:28:00,238 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1285498866, now seen corresponding path program 1 times [2019-09-20 13:28:00,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,309 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-20 13:28:00,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,311 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-09-20 13:28:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,568 INFO L93 Difference]: Finished difference Result 185 states and 271 transitions. [2019-09-20 13:28:00,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-20 13:28:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,571 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:28:00,571 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:28:00,572 INFO L636 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-20 13:28:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:28:00,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:28:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:28:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2019-09-20 13:28:00,578 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2019-09-20 13:28:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,578 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2019-09-20 13:28:00,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2019-09-20 13:28:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:28:00,580 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,580 INFO L407 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] [2019-09-20 13:28:00,581 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1797335240, now seen corresponding path program 1 times [2019-09-20 13:28:00,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,645 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-20 13:28:00,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,646 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2019-09-20 13:28:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:00,902 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2019-09-20 13:28:00,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:00,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-20 13:28:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:00,904 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:28:00,904 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:28:00,905 INFO L636 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-20 13:28:00,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:28:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:28:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:28:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2019-09-20 13:28:00,910 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2019-09-20 13:28:00,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:00,911 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2019-09-20 13:28:00,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2019-09-20 13:28:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-20 13:28:00,912 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:00,912 INFO L407 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] [2019-09-20 13:28:00,912 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:00,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:00,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1679814895, now seen corresponding path program 1 times [2019-09-20 13:28:00,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:00,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:00,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:00,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:00,975 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-20 13:28:00,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:00,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:00,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:00,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:00,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:00,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:00,977 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2019-09-20 13:28:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,240 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2019-09-20 13:28:01,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-09-20 13:28:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,242 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:28:01,243 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:28:01,243 INFO L636 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-20 13:28:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:28:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:28:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:28:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2019-09-20 13:28:01,249 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2019-09-20 13:28:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,250 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2019-09-20 13:28:01,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2019-09-20 13:28:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:28:01,251 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,251 INFO L407 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] [2019-09-20 13:28:01,252 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1049616899, now seen corresponding path program 1 times [2019-09-20 13:28:01,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,303 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-20 13:28:01,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,305 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2019-09-20 13:28:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,567 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2019-09-20 13:28:01,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-20 13:28:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,570 INFO L225 Difference]: With dead ends: 185 [2019-09-20 13:28:01,570 INFO L226 Difference]: Without dead ends: 185 [2019-09-20 13:28:01,571 INFO L636 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-20 13:28:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-20 13:28:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2019-09-20 13:28:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:28:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2019-09-20 13:28:01,576 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 58 [2019-09-20 13:28:01,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,577 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2019-09-20 13:28:01,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2019-09-20 13:28:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:28:01,578 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,578 INFO L407 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] [2019-09-20 13:28:01,578 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1277180062, now seen corresponding path program 1 times [2019-09-20 13:28:01,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:01,653 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-20 13:28:01,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:01,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:01,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:01,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:01,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:01,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:01,655 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand 4 states. [2019-09-20 13:28:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:01,961 INFO L93 Difference]: Finished difference Result 214 states and 314 transitions. [2019-09-20 13:28:01,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:01,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-20 13:28:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:01,964 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:28:01,964 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:28:01,964 INFO L636 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-20 13:28:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:28:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-20 13:28:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:28:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-09-20 13:28:01,970 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2019-09-20 13:28:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:01,970 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2019-09-20 13:28:01,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2019-09-20 13:28:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:28:01,972 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:01,972 INFO L407 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] [2019-09-20 13:28:01,972 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:01,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:01,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1706280906, now seen corresponding path program 1 times [2019-09-20 13:28:01,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:01,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:01,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:01,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,026 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-20 13:28:02,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,028 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2019-09-20 13:28:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,249 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-20 13:28:02,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-09-20 13:28:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,252 INFO L225 Difference]: With dead ends: 197 [2019-09-20 13:28:02,252 INFO L226 Difference]: Without dead ends: 197 [2019-09-20 13:28:02,252 INFO L636 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-20 13:28:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-20 13:28:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-09-20 13:28:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:28:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2019-09-20 13:28:02,259 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2019-09-20 13:28:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,259 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2019-09-20 13:28:02,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2019-09-20 13:28:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-20 13:28:02,261 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,261 INFO L407 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] [2019-09-20 13:28:02,261 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1052652213, now seen corresponding path program 1 times [2019-09-20 13:28:02,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,317 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-20 13:28:02,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,319 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2019-09-20 13:28:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,616 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-20 13:28:02,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-09-20 13:28:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,619 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:28:02,619 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:28:02,620 INFO L636 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-20 13:28:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:28:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2019-09-20 13:28:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:28:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2019-09-20 13:28:02,626 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2019-09-20 13:28:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,626 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2019-09-20 13:28:02,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2019-09-20 13:28:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:28:02,627 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,628 INFO L407 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] [2019-09-20 13:28:02,628 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1001699063, now seen corresponding path program 1 times [2019-09-20 13:28:02,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:02,676 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-20 13:28:02,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:02,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:02,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:02,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:02,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:02,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:02,678 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2019-09-20 13:28:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:02,977 INFO L93 Difference]: Finished difference Result 213 states and 310 transitions. [2019-09-20 13:28:02,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:02,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-20 13:28:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:02,980 INFO L225 Difference]: With dead ends: 213 [2019-09-20 13:28:02,980 INFO L226 Difference]: Without dead ends: 213 [2019-09-20 13:28:02,980 INFO L636 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-20 13:28:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-20 13:28:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2019-09-20 13:28:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:28:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2019-09-20 13:28:02,988 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2019-09-20 13:28:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:02,988 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2019-09-20 13:28:02,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2019-09-20 13:28:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:28:02,990 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:02,990 INFO L407 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] [2019-09-20 13:28:02,991 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:02,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:02,991 INFO L82 PathProgramCache]: Analyzing trace with hash 641832392, now seen corresponding path program 1 times [2019-09-20 13:28:02,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:02,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:02,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,055 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-20 13:28:03,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,057 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2019-09-20 13:28:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,296 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2019-09-20 13:28:03,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-20 13:28:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,298 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:28:03,298 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:28:03,298 INFO L636 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-20 13:28:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:28:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:28:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:28:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2019-09-20 13:28:03,303 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2019-09-20 13:28:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,304 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2019-09-20 13:28:03,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2019-09-20 13:28:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-20 13:28:03,305 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,305 INFO L407 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] [2019-09-20 13:28:03,305 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash -976456270, now seen corresponding path program 1 times [2019-09-20 13:28:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,377 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-20 13:28:03,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,379 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2019-09-20 13:28:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,614 INFO L93 Difference]: Finished difference Result 211 states and 306 transitions. [2019-09-20 13:28:03,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-20 13:28:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,616 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:28:03,617 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:28:03,617 INFO L636 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-20 13:28:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:28:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:28:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:28:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2019-09-20 13:28:03,622 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2019-09-20 13:28:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,622 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2019-09-20 13:28:03,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2019-09-20 13:28:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 13:28:03,624 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,624 INFO L407 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] [2019-09-20 13:28:03,624 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1591624005, now seen corresponding path program 1 times [2019-09-20 13:28:03,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,677 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-20 13:28:03,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,679 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2019-09-20 13:28:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:03,939 INFO L93 Difference]: Finished difference Result 211 states and 305 transitions. [2019-09-20 13:28:03,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:03,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-20 13:28:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:03,941 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:28:03,942 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:28:03,942 INFO L636 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-20 13:28:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:28:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:28:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:28:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2019-09-20 13:28:03,968 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2019-09-20 13:28:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:03,968 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2019-09-20 13:28:03,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2019-09-20 13:28:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 13:28:03,969 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,969 INFO L407 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] [2019-09-20 13:28:03,970 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1684300691, now seen corresponding path program 1 times [2019-09-20 13:28:03,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,032 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-20 13:28:04,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,034 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2019-09-20 13:28:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,364 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2019-09-20 13:28:04,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-20 13:28:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,368 INFO L225 Difference]: With dead ends: 211 [2019-09-20 13:28:04,368 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:28:04,369 INFO L636 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-20 13:28:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:28:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2019-09-20 13:28:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:28:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2019-09-20 13:28:04,379 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2019-09-20 13:28:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,380 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2019-09-20 13:28:04,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2019-09-20 13:28:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-20 13:28:04,382 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,382 INFO L407 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] [2019-09-20 13:28:04,382 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1440785760, now seen corresponding path program 1 times [2019-09-20 13:28:04,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,474 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-20 13:28:04,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,476 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2019-09-20 13:28:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,764 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2019-09-20 13:28:04,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-09-20 13:28:04,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,766 INFO L225 Difference]: With dead ends: 201 [2019-09-20 13:28:04,766 INFO L226 Difference]: Without dead ends: 201 [2019-09-20 13:28:04,766 INFO L636 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-20 13:28:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-20 13:28:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2019-09-20 13:28:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:28:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2019-09-20 13:28:04,772 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2019-09-20 13:28:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,772 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2019-09-20 13:28:04,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2019-09-20 13:28:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:04,773 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,774 INFO L407 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] [2019-09-20 13:28:04,774 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,774 INFO L82 PathProgramCache]: Analyzing trace with hash 164825720, now seen corresponding path program 1 times [2019-09-20 13:28:04,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,866 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-20 13:28:04,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,868 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2019-09-20 13:28:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,298 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2019-09-20 13:28:05,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,300 INFO L225 Difference]: With dead ends: 300 [2019-09-20 13:28:05,300 INFO L226 Difference]: Without dead ends: 300 [2019-09-20 13:28:05,300 INFO L636 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-20 13:28:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-20 13:28:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2019-09-20 13:28:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-20 13:28:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2019-09-20 13:28:05,305 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2019-09-20 13:28:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,305 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2019-09-20 13:28:05,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2019-09-20 13:28:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:05,307 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,307 INFO L407 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] [2019-09-20 13:28:05,307 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash 92439162, now seen corresponding path program 1 times [2019-09-20 13:28:05,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,368 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-20 13:28:05,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,370 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2019-09-20 13:28:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,665 INFO L93 Difference]: Finished difference Result 273 states and 405 transitions. [2019-09-20 13:28:05,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,668 INFO L225 Difference]: With dead ends: 273 [2019-09-20 13:28:05,668 INFO L226 Difference]: Without dead ends: 273 [2019-09-20 13:28:05,668 INFO L636 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-20 13:28:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-20 13:28:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2019-09-20 13:28:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-20 13:28:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2019-09-20 13:28:05,677 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2019-09-20 13:28:05,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,678 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2019-09-20 13:28:05,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2019-09-20 13:28:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:28:05,680 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,680 INFO L407 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] [2019-09-20 13:28:05,680 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1395813593, now seen corresponding path program 1 times [2019-09-20 13:28:05,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,826 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-20 13:28:05,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,828 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2019-09-20 13:28:06,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,233 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2019-09-20 13:28:06,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:28:06,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,236 INFO L225 Difference]: With dead ends: 316 [2019-09-20 13:28:06,236 INFO L226 Difference]: Without dead ends: 316 [2019-09-20 13:28:06,236 INFO L636 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-20 13:28:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-20 13:28:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2019-09-20 13:28:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-20 13:28:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2019-09-20 13:28:06,242 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2019-09-20 13:28:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,243 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2019-09-20 13:28:06,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2019-09-20 13:28:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:28:06,244 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,244 INFO L407 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] [2019-09-20 13:28:06,245 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1346211210, now seen corresponding path program 1 times [2019-09-20 13:28:06,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,316 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-20 13:28:06,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,318 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2019-09-20 13:28:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,679 INFO L93 Difference]: Finished difference Result 316 states and 468 transitions. [2019-09-20 13:28:06,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:28:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,684 INFO L225 Difference]: With dead ends: 316 [2019-09-20 13:28:06,684 INFO L226 Difference]: Without dead ends: 316 [2019-09-20 13:28:06,685 INFO L636 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-20 13:28:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-20 13:28:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2019-09-20 13:28:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-20 13:28:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2019-09-20 13:28:06,694 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2019-09-20 13:28:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,694 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2019-09-20 13:28:06,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2019-09-20 13:28:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:28:06,696 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,696 INFO L407 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] [2019-09-20 13:28:06,696 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1209790738, now seen corresponding path program 1 times [2019-09-20 13:28:06,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,816 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-20 13:28:06,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,818 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2019-09-20 13:28:07,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,178 INFO L93 Difference]: Finished difference Result 310 states and 460 transitions. [2019-09-20 13:28:07,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:28:07,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,181 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:28:07,181 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:28:07,181 INFO L636 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-20 13:28:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:28:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-20 13:28:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-09-20 13:28:07,188 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2019-09-20 13:28:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,188 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-09-20 13:28:07,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-09-20 13:28:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-20 13:28:07,190 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,190 INFO L407 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] [2019-09-20 13:28:07,190 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,191 INFO L82 PathProgramCache]: Analyzing trace with hash -528538785, now seen corresponding path program 1 times [2019-09-20 13:28:07,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,258 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-20 13:28:07,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,260 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-09-20 13:28:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,655 INFO L93 Difference]: Finished difference Result 310 states and 459 transitions. [2019-09-20 13:28:07,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-20 13:28:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,657 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:28:07,658 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:28:07,658 INFO L636 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-20 13:28:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:28:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2019-09-20 13:28:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-09-20 13:28:07,665 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2019-09-20 13:28:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,665 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-09-20 13:28:07,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-09-20 13:28:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-20 13:28:07,667 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,667 INFO L407 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] [2019-09-20 13:28:07,667 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1399733917, now seen corresponding path program 1 times [2019-09-20 13:28:07,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,723 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-20 13:28:07,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,725 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-09-20 13:28:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,008 INFO L93 Difference]: Finished difference Result 285 states and 424 transitions. [2019-09-20 13:28:08,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-20 13:28:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,011 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:28:08,011 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:28:08,012 INFO L636 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-20 13:28:08,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:28:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2019-09-20 13:28:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-09-20 13:28:08,019 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2019-09-20 13:28:08,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,019 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-09-20 13:28:08,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-09-20 13:28:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:28:08,020 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,020 INFO L407 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] [2019-09-20 13:28:08,021 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1520987551, now seen corresponding path program 1 times [2019-09-20 13:28:08,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,093 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-20 13:28:08,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,095 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-09-20 13:28:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,493 INFO L93 Difference]: Finished difference Result 309 states and 456 transitions. [2019-09-20 13:28:08,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:28:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,495 INFO L225 Difference]: With dead ends: 309 [2019-09-20 13:28:08,496 INFO L226 Difference]: Without dead ends: 309 [2019-09-20 13:28:08,496 INFO L636 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-20 13:28:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-20 13:28:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 260. [2019-09-20 13:28:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-09-20 13:28:08,503 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2019-09-20 13:28:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,503 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-09-20 13:28:08,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-09-20 13:28:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:28:08,504 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,504 INFO L407 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] [2019-09-20 13:28:08,505 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1130448290, now seen corresponding path program 1 times [2019-09-20 13:28:08,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,565 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-20 13:28:08,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,567 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-09-20 13:28:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,900 INFO L93 Difference]: Finished difference Result 307 states and 453 transitions. [2019-09-20 13:28:08,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:28:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,903 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:28:08,903 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:28:08,903 INFO L636 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-20 13:28:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:28:08,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-20 13:28:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-09-20 13:28:08,910 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2019-09-20 13:28:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,910 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-09-20 13:28:08,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-09-20 13:28:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:28:08,912 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,912 INFO L407 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] [2019-09-20 13:28:08,912 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1167899169, now seen corresponding path program 1 times [2019-09-20 13:28:08,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,976 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-20 13:28:08,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,978 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-09-20 13:28:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,261 INFO L93 Difference]: Finished difference Result 284 states and 420 transitions. [2019-09-20 13:28:09,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:28:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,265 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:28:09,265 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:28:09,265 INFO L636 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-20 13:28:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:28:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-20 13:28:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-09-20 13:28:09,272 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2019-09-20 13:28:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,273 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-09-20 13:28:09,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-09-20 13:28:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-20 13:28:09,274 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,275 INFO L407 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] [2019-09-20 13:28:09,275 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1483536672, now seen corresponding path program 1 times [2019-09-20 13:28:09,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,363 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-20 13:28:09,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,365 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-09-20 13:28:09,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,652 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2019-09-20 13:28:09,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-20 13:28:09,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,655 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:28:09,655 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:28:09,655 INFO L636 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-20 13:28:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:28:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:28:09,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-09-20 13:28:09,661 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2019-09-20 13:28:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,662 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-09-20 13:28:09,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-09-20 13:28:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-20 13:28:09,663 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,663 INFO L407 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] [2019-09-20 13:28:09,664 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,664 INFO L82 PathProgramCache]: Analyzing trace with hash -82582564, now seen corresponding path program 1 times [2019-09-20 13:28:09,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,715 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-20 13:28:09,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,717 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-09-20 13:28:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,057 INFO L93 Difference]: Finished difference Result 307 states and 450 transitions. [2019-09-20 13:28:10,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-20 13:28:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,060 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:28:10,060 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:28:10,061 INFO L636 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-20 13:28:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:28:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-20 13:28:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-09-20 13:28:10,067 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2019-09-20 13:28:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,068 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-09-20 13:28:10,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-09-20 13:28:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-20 13:28:10,069 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,069 INFO L407 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] [2019-09-20 13:28:10,069 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1856579482, now seen corresponding path program 1 times [2019-09-20 13:28:10,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,124 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-20 13:28:10,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,126 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2019-09-20 13:28:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,389 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-20 13:28:10,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-20 13:28:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,393 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:28:10,393 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:28:10,393 INFO L636 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-20 13:28:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:28:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:28:10,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2019-09-20 13:28:10,399 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2019-09-20 13:28:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,399 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2019-09-20 13:28:10,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2019-09-20 13:28:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-20 13:28:10,400 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,400 INFO L407 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] [2019-09-20 13:28:10,401 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,401 INFO L82 PathProgramCache]: Analyzing trace with hash -763062181, now seen corresponding path program 1 times [2019-09-20 13:28:10,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,458 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-20 13:28:10,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,460 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2019-09-20 13:28:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,799 INFO L93 Difference]: Finished difference Result 307 states and 448 transitions. [2019-09-20 13:28:10,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-20 13:28:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,801 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:28:10,801 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:28:10,802 INFO L636 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-20 13:28:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:28:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-20 13:28:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2019-09-20 13:28:10,807 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2019-09-20 13:28:10,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,808 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2019-09-20 13:28:10,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,808 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2019-09-20 13:28:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-20 13:28:10,809 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,809 INFO L407 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] [2019-09-20 13:28:10,809 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,810 INFO L82 PathProgramCache]: Analyzing trace with hash -778580899, now seen corresponding path program 1 times [2019-09-20 13:28:10,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,872 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-20 13:28:10,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,874 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2019-09-20 13:28:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,158 INFO L93 Difference]: Finished difference Result 282 states and 413 transitions. [2019-09-20 13:28:11,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-09-20 13:28:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,161 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:28:11,161 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:28:11,162 INFO L636 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-20 13:28:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:28:11,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:28:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2019-09-20 13:28:11,167 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2019-09-20 13:28:11,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,168 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2019-09-20 13:28:11,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2019-09-20 13:28:11,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-20 13:28:11,169 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,169 INFO L407 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] [2019-09-20 13:28:11,169 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1665128425, now seen corresponding path program 1 times [2019-09-20 13:28:11,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,230 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-20 13:28:11,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,232 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2019-09-20 13:28:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,575 INFO L93 Difference]: Finished difference Result 307 states and 446 transitions. [2019-09-20 13:28:11,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-20 13:28:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,577 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:28:11,578 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:28:11,578 INFO L636 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-20 13:28:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:28:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-09-20 13:28:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2019-09-20 13:28:11,584 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2019-09-20 13:28:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,584 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2019-09-20 13:28:11,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2019-09-20 13:28:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-20 13:28:11,585 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,586 INFO L407 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] [2019-09-20 13:28:11,586 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2146208683, now seen corresponding path program 1 times [2019-09-20 13:28:11,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,647 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-20 13:28:11,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,648 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2019-09-20 13:28:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,923 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2019-09-20 13:28:11,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-20 13:28:11,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,926 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:28:11,926 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:28:11,926 INFO L636 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-20 13:28:11,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:28:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-09-20 13:28:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2019-09-20 13:28:11,932 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2019-09-20 13:28:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,933 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2019-09-20 13:28:11,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2019-09-20 13:28:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-20 13:28:11,934 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,934 INFO L407 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] [2019-09-20 13:28:11,934 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash -846445514, now seen corresponding path program 1 times [2019-09-20 13:28:11,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,993 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-20 13:28:11,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,994 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2019-09-20 13:28:12,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,306 INFO L93 Difference]: Finished difference Result 297 states and 432 transitions. [2019-09-20 13:28:12,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-20 13:28:12,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,310 INFO L225 Difference]: With dead ends: 297 [2019-09-20 13:28:12,310 INFO L226 Difference]: Without dead ends: 297 [2019-09-20 13:28:12,310 INFO L636 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-20 13:28:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-20 13:28:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-20 13:28:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2019-09-20 13:28:12,315 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2019-09-20 13:28:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,316 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2019-09-20 13:28:12,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2019-09-20 13:28:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-20 13:28:12,317 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,317 INFO L407 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] [2019-09-20 13:28:12,317 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1419935672, now seen corresponding path program 1 times [2019-09-20 13:28:12,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,384 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-20 13:28:12,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,387 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2019-09-20 13:28:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,629 INFO L93 Difference]: Finished difference Result 272 states and 397 transitions. [2019-09-20 13:28:12,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-20 13:28:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,631 INFO L225 Difference]: With dead ends: 272 [2019-09-20 13:28:12,631 INFO L226 Difference]: Without dead ends: 272 [2019-09-20 13:28:12,632 INFO L636 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-20 13:28:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-20 13:28:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-09-20 13:28:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2019-09-20 13:28:12,637 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2019-09-20 13:28:12,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,637 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2019-09-20 13:28:12,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2019-09-20 13:28:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:12,638 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,639 INFO L407 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] [2019-09-20 13:28:12,639 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,639 INFO L82 PathProgramCache]: Analyzing trace with hash 228784092, now seen corresponding path program 1 times [2019-09-20 13:28:12,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,712 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-20 13:28:12,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,714 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2019-09-20 13:28:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,130 INFO L93 Difference]: Finished difference Result 297 states and 430 transitions. [2019-09-20 13:28:13,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,132 INFO L225 Difference]: With dead ends: 297 [2019-09-20 13:28:13,132 INFO L226 Difference]: Without dead ends: 297 [2019-09-20 13:28:13,132 INFO L636 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-20 13:28:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-20 13:28:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2019-09-20 13:28:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:28:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2019-09-20 13:28:13,137 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2019-09-20 13:28:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,137 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2019-09-20 13:28:13,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2019-09-20 13:28:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:13,139 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,139 INFO L407 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] [2019-09-20 13:28:13,139 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1615569502, now seen corresponding path program 1 times [2019-09-20 13:28:13,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,200 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-20 13:28:13,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:13,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:13,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:13,202 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2019-09-20 13:28:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,243 INFO L93 Difference]: Finished difference Result 493 states and 723 transitions. [2019-09-20 13:28:13,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:13,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-20 13:28:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,246 INFO L225 Difference]: With dead ends: 493 [2019-09-20 13:28:13,246 INFO L226 Difference]: Without dead ends: 493 [2019-09-20 13:28:13,246 INFO L636 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-20 13:28:13,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-20 13:28:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-09-20 13:28:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-09-20 13:28:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2019-09-20 13:28:13,254 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2019-09-20 13:28:13,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,255 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2019-09-20 13:28:13,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2019-09-20 13:28:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:13,256 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,257 INFO L407 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] [2019-09-20 13:28:13,257 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash -929123768, now seen corresponding path program 1 times [2019-09-20 13:28:13,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:13,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:13,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:13,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:13,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:13,316 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2019-09-20 13:28:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,358 INFO L93 Difference]: Finished difference Result 728 states and 1072 transitions. [2019-09-20 13:28:13,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:13,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-20 13:28:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,361 INFO L225 Difference]: With dead ends: 728 [2019-09-20 13:28:13,361 INFO L226 Difference]: Without dead ends: 728 [2019-09-20 13:28:13,362 INFO L636 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-20 13:28:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-20 13:28:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2019-09-20 13:28:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-20 13:28:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2019-09-20 13:28:13,372 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2019-09-20 13:28:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,373 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2019-09-20 13:28:13,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2019-09-20 13:28:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:28:13,374 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,375 INFO L407 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-20 13:28:13,375 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash 369425990, now seen corresponding path program 1 times [2019-09-20 13:28:13,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:13,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:13,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:13,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:13,435 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2019-09-20 13:28:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,479 INFO L93 Difference]: Finished difference Result 961 states and 1406 transitions. [2019-09-20 13:28:13,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:13,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-20 13:28:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,483 INFO L225 Difference]: With dead ends: 961 [2019-09-20 13:28:13,483 INFO L226 Difference]: Without dead ends: 961 [2019-09-20 13:28:13,484 INFO L636 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-20 13:28:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-09-20 13:28:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-09-20 13:28:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-09-20 13:28:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2019-09-20 13:28:13,497 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2019-09-20 13:28:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,498 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2019-09-20 13:28:13,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2019-09-20 13:28:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:28:13,500 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,500 INFO L407 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] [2019-09-20 13:28:13,501 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2133236826, now seen corresponding path program 1 times [2019-09-20 13:28:13,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,611 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-20 13:28:13,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,613 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2019-09-20 13:28:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,051 INFO L93 Difference]: Finished difference Result 1369 states and 2020 transitions. [2019-09-20 13:28:14,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-20 13:28:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,058 INFO L225 Difference]: With dead ends: 1369 [2019-09-20 13:28:14,058 INFO L226 Difference]: Without dead ends: 1369 [2019-09-20 13:28:14,059 INFO L636 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-20 13:28:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-20 13:28:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2019-09-20 13:28:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-09-20 13:28:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2019-09-20 13:28:14,077 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2019-09-20 13:28:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,077 INFO L475 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2019-09-20 13:28:14,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2019-09-20 13:28:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-20 13:28:14,080 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,080 INFO L407 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] [2019-09-20 13:28:14,080 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1698497454, now seen corresponding path program 1 times [2019-09-20 13:28:14,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,157 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-20 13:28:14,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,159 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2019-09-20 13:28:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,570 INFO L93 Difference]: Finished difference Result 1351 states and 1994 transitions. [2019-09-20 13:28:14,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-20 13:28:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,576 INFO L225 Difference]: With dead ends: 1351 [2019-09-20 13:28:14,576 INFO L226 Difference]: Without dead ends: 1351 [2019-09-20 13:28:14,577 INFO L636 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-20 13:28:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-09-20 13:28:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1075. [2019-09-20 13:28:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-20 13:28:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2019-09-20 13:28:14,593 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2019-09-20 13:28:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,594 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2019-09-20 13:28:14,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2019-09-20 13:28:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-20 13:28:14,596 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,597 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:14,597 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash -502838968, now seen corresponding path program 1 times [2019-09-20 13:28:14,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:14,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:14,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:14,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:14,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:14,697 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2019-09-20 13:28:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,756 INFO L93 Difference]: Finished difference Result 1339 states and 2008 transitions. [2019-09-20 13:28:14,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:14,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-09-20 13:28:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,764 INFO L225 Difference]: With dead ends: 1339 [2019-09-20 13:28:14,765 INFO L226 Difference]: Without dead ends: 1339 [2019-09-20 13:28:14,765 INFO L636 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-20 13:28:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2019-09-20 13:28:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2019-09-20 13:28:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:28:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2019-09-20 13:28:14,789 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2019-09-20 13:28:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,790 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2019-09-20 13:28:14,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2019-09-20 13:28:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-20 13:28:14,794 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,794 INFO L407 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] [2019-09-20 13:28:14,794 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash 682232505, now seen corresponding path program 1 times [2019-09-20 13:28:14,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,886 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-20 13:28:14,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,888 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2019-09-20 13:28:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,323 INFO L93 Difference]: Finished difference Result 1682 states and 2477 transitions. [2019-09-20 13:28:15,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-20 13:28:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,329 INFO L225 Difference]: With dead ends: 1682 [2019-09-20 13:28:15,329 INFO L226 Difference]: Without dead ends: 1682 [2019-09-20 13:28:15,330 INFO L636 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-20 13:28:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2019-09-20 13:28:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1337. [2019-09-20 13:28:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:28:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2019-09-20 13:28:15,348 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2019-09-20 13:28:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,349 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2019-09-20 13:28:15,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2019-09-20 13:28:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-20 13:28:15,352 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,352 INFO L407 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] [2019-09-20 13:28:15,352 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1599625407, now seen corresponding path program 1 times [2019-09-20 13:28:15,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,421 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-20 13:28:15,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,423 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2019-09-20 13:28:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,836 INFO L93 Difference]: Finished difference Result 1677 states and 2467 transitions. [2019-09-20 13:28:15,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-20 13:28:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,845 INFO L225 Difference]: With dead ends: 1677 [2019-09-20 13:28:15,845 INFO L226 Difference]: Without dead ends: 1677 [2019-09-20 13:28:15,845 INFO L636 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-20 13:28:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2019-09-20 13:28:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1337. [2019-09-20 13:28:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:28:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2019-09-20 13:28:15,864 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2019-09-20 13:28:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,864 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2019-09-20 13:28:15,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2019-09-20 13:28:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-20 13:28:15,867 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,867 INFO L407 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] [2019-09-20 13:28:15,868 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,868 INFO L82 PathProgramCache]: Analyzing trace with hash 58403008, now seen corresponding path program 1 times [2019-09-20 13:28:15,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,933 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-20 13:28:15,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,935 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2019-09-20 13:28:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,324 INFO L93 Difference]: Finished difference Result 1667 states and 2452 transitions. [2019-09-20 13:28:16,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-20 13:28:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,332 INFO L225 Difference]: With dead ends: 1667 [2019-09-20 13:28:16,332 INFO L226 Difference]: Without dead ends: 1667 [2019-09-20 13:28:16,332 INFO L636 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-20 13:28:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-20 13:28:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-20 13:28:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:28:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2019-09-20 13:28:16,348 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2019-09-20 13:28:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,349 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2019-09-20 13:28:16,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2019-09-20 13:28:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-20 13:28:16,352 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,352 INFO L407 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] [2019-09-20 13:28:16,352 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1044774282, now seen corresponding path program 1 times [2019-09-20 13:28:16,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,442 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-20 13:28:16,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,445 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2019-09-20 13:28:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,877 INFO L93 Difference]: Finished difference Result 1667 states and 2447 transitions. [2019-09-20 13:28:16,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-20 13:28:16,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,886 INFO L225 Difference]: With dead ends: 1667 [2019-09-20 13:28:16,886 INFO L226 Difference]: Without dead ends: 1667 [2019-09-20 13:28:16,886 INFO L636 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-20 13:28:16,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-20 13:28:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-20 13:28:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:28:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2019-09-20 13:28:16,905 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2019-09-20 13:28:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,906 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2019-09-20 13:28:16,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2019-09-20 13:28:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-20 13:28:16,908 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,908 INFO L407 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] [2019-09-20 13:28:16,909 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1179079683, now seen corresponding path program 1 times [2019-09-20 13:28:16,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,969 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-20 13:28:16,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,971 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2019-09-20 13:28:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,365 INFO L93 Difference]: Finished difference Result 1667 states and 2442 transitions. [2019-09-20 13:28:17,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-20 13:28:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,371 INFO L225 Difference]: With dead ends: 1667 [2019-09-20 13:28:17,372 INFO L226 Difference]: Without dead ends: 1667 [2019-09-20 13:28:17,372 INFO L636 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-20 13:28:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-20 13:28:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-20 13:28:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:28:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2019-09-20 13:28:17,388 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2019-09-20 13:28:17,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,389 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2019-09-20 13:28:17,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2019-09-20 13:28:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-20 13:28:17,391 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,391 INFO L407 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] [2019-09-20 13:28:17,392 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1625618289, now seen corresponding path program 1 times [2019-09-20 13:28:17,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,461 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-20 13:28:17,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,462 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2019-09-20 13:28:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,857 INFO L93 Difference]: Finished difference Result 1667 states and 2437 transitions. [2019-09-20 13:28:17,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-20 13:28:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,866 INFO L225 Difference]: With dead ends: 1667 [2019-09-20 13:28:17,866 INFO L226 Difference]: Without dead ends: 1667 [2019-09-20 13:28:17,866 INFO L636 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-20 13:28:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-09-20 13:28:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2019-09-20 13:28:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:28:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2019-09-20 13:28:17,887 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2019-09-20 13:28:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,887 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2019-09-20 13:28:17,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2019-09-20 13:28:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-20 13:28:17,890 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,890 INFO L407 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] [2019-09-20 13:28:17,890 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1050140312, now seen corresponding path program 1 times [2019-09-20 13:28:17,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,964 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-20 13:28:17,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,966 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2019-09-20 13:28:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,356 INFO L93 Difference]: Finished difference Result 1617 states and 2372 transitions. [2019-09-20 13:28:18,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-20 13:28:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,363 INFO L225 Difference]: With dead ends: 1617 [2019-09-20 13:28:18,363 INFO L226 Difference]: Without dead ends: 1617 [2019-09-20 13:28:18,363 INFO L636 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-20 13:28:18,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-20 13:28:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-20 13:28:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:28:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2019-09-20 13:28:18,381 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2019-09-20 13:28:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,381 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2019-09-20 13:28:18,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2019-09-20 13:28:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-20 13:28:18,383 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,384 INFO L407 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] [2019-09-20 13:28:18,384 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1657295938, now seen corresponding path program 1 times [2019-09-20 13:28:18,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,456 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-20 13:28:18,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,458 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2019-09-20 13:28:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,845 INFO L93 Difference]: Finished difference Result 1617 states and 2367 transitions. [2019-09-20 13:28:18,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-20 13:28:18,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,860 INFO L225 Difference]: With dead ends: 1617 [2019-09-20 13:28:18,860 INFO L226 Difference]: Without dead ends: 1617 [2019-09-20 13:28:18,860 INFO L636 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-20 13:28:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2019-09-20 13:28:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2019-09-20 13:28:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:28:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2019-09-20 13:28:18,885 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2019-09-20 13:28:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,885 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2019-09-20 13:28:18,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2019-09-20 13:28:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-20 13:28:18,887 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,888 INFO L407 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] [2019-09-20 13:28:18,888 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash -459540457, now seen corresponding path program 1 times [2019-09-20 13:28:18,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,955 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-20 13:28:18,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,956 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2019-09-20 13:28:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,313 INFO L93 Difference]: Finished difference Result 1592 states and 2330 transitions. [2019-09-20 13:28:19,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-20 13:28:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,318 INFO L225 Difference]: With dead ends: 1592 [2019-09-20 13:28:19,318 INFO L226 Difference]: Without dead ends: 1592 [2019-09-20 13:28:19,318 INFO L636 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-20 13:28:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-20 13:28:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-20 13:28:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:28:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2019-09-20 13:28:19,333 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2019-09-20 13:28:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,333 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2019-09-20 13:28:19,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2019-09-20 13:28:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-20 13:28:19,336 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,336 INFO L407 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] [2019-09-20 13:28:19,336 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1308556535, now seen corresponding path program 1 times [2019-09-20 13:28:19,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,411 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-20 13:28:19,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,412 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2019-09-20 13:28:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,778 INFO L93 Difference]: Finished difference Result 1592 states and 2325 transitions. [2019-09-20 13:28:19,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-20 13:28:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,781 INFO L225 Difference]: With dead ends: 1592 [2019-09-20 13:28:19,782 INFO L226 Difference]: Without dead ends: 1592 [2019-09-20 13:28:19,782 INFO L636 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-20 13:28:19,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-20 13:28:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2019-09-20 13:28:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-09-20 13:28:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2019-09-20 13:28:19,794 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2019-09-20 13:28:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,795 INFO L475 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2019-09-20 13:28:19,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2019-09-20 13:28:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-20 13:28:19,797 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,797 INFO L407 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] [2019-09-20 13:28:19,798 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1355244734, now seen corresponding path program 1 times [2019-09-20 13:28:19,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,885 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-20 13:28:19,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,887 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2019-09-20 13:28:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,220 INFO L93 Difference]: Finished difference Result 1552 states and 2255 transitions. [2019-09-20 13:28:20,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-20 13:28:20,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,225 INFO L225 Difference]: With dead ends: 1552 [2019-09-20 13:28:20,226 INFO L226 Difference]: Without dead ends: 1552 [2019-09-20 13:28:20,226 INFO L636 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-20 13:28:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-20 13:28:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1317. [2019-09-20 13:28:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-09-20 13:28:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2019-09-20 13:28:20,241 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2019-09-20 13:28:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,242 INFO L475 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2019-09-20 13:28:20,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2019-09-20 13:28:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-20 13:28:20,246 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,246 INFO L407 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] [2019-09-20 13:28:20,246 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -245297578, now seen corresponding path program 1 times [2019-09-20 13:28:20,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,337 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-20 13:28:20,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,339 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2019-09-20 13:28:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,699 INFO L93 Difference]: Finished difference Result 1552 states and 2250 transitions. [2019-09-20 13:28:20,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-20 13:28:20,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,704 INFO L225 Difference]: With dead ends: 1552 [2019-09-20 13:28:20,704 INFO L226 Difference]: Without dead ends: 1552 [2019-09-20 13:28:20,704 INFO L636 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-20 13:28:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-20 13:28:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-20 13:28:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-20 13:28:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2019-09-20 13:28:20,720 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2019-09-20 13:28:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,720 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2019-09-20 13:28:20,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2019-09-20 13:28:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:28:20,723 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,723 INFO L407 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] [2019-09-20 13:28:20,724 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,724 INFO L82 PathProgramCache]: Analyzing trace with hash -304506221, now seen corresponding path program 1 times [2019-09-20 13:28:20,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,843 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-20 13:28:20,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,846 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2019-09-20 13:28:21,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,186 INFO L93 Difference]: Finished difference Result 1552 states and 2245 transitions. [2019-09-20 13:28:21,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:28:21,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,191 INFO L225 Difference]: With dead ends: 1552 [2019-09-20 13:28:21,191 INFO L226 Difference]: Without dead ends: 1552 [2019-09-20 13:28:21,191 INFO L636 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-20 13:28:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-09-20 13:28:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2019-09-20 13:28:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-20 13:28:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2019-09-20 13:28:21,206 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2019-09-20 13:28:21,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,207 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2019-09-20 13:28:21,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2019-09-20 13:28:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:28:21,209 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,209 INFO L407 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] [2019-09-20 13:28:21,210 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,210 INFO L82 PathProgramCache]: Analyzing trace with hash -698012739, now seen corresponding path program 1 times [2019-09-20 13:28:21,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,291 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-20 13:28:21,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,295 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2019-09-20 13:28:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,635 INFO L93 Difference]: Finished difference Result 1542 states and 2230 transitions. [2019-09-20 13:28:21,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:28:21,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,639 INFO L225 Difference]: With dead ends: 1542 [2019-09-20 13:28:21,639 INFO L226 Difference]: Without dead ends: 1542 [2019-09-20 13:28:21,639 INFO L636 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-20 13:28:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-20 13:28:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1347. [2019-09-20 13:28:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-20 13:28:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2019-09-20 13:28:21,653 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2019-09-20 13:28:21,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,654 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2019-09-20 13:28:21,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2019-09-20 13:28:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:28:21,656 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,656 INFO L407 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] [2019-09-20 13:28:21,656 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2086211788, now seen corresponding path program 1 times [2019-09-20 13:28:21,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,729 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-20 13:28:21,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,731 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2019-09-20 13:28:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,141 INFO L93 Difference]: Finished difference Result 1532 states and 2210 transitions. [2019-09-20 13:28:22,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:28:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,145 INFO L225 Difference]: With dead ends: 1532 [2019-09-20 13:28:22,145 INFO L226 Difference]: Without dead ends: 1532 [2019-09-20 13:28:22,145 INFO L636 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-20 13:28:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-09-20 13:28:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1347. [2019-09-20 13:28:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-20 13:28:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1952 transitions. [2019-09-20 13:28:22,161 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1952 transitions. Word has length 156 [2019-09-20 13:28:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,161 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 1952 transitions. [2019-09-20 13:28:22,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1952 transitions. [2019-09-20 13:28:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:28:22,164 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,164 INFO L407 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] [2019-09-20 13:28:22,164 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash -960768076, now seen corresponding path program 1 times [2019-09-20 13:28:22,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,241 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-20 13:28:22,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,244 INFO L87 Difference]: Start difference. First operand 1347 states and 1952 transitions. Second operand 4 states. [2019-09-20 13:28:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,545 INFO L93 Difference]: Finished difference Result 1517 states and 2185 transitions. [2019-09-20 13:28:22,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:28:22,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,548 INFO L225 Difference]: With dead ends: 1517 [2019-09-20 13:28:22,548 INFO L226 Difference]: Without dead ends: 1517 [2019-09-20 13:28:22,548 INFO L636 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-20 13:28:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-20 13:28:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1352. [2019-09-20 13:28:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-20 13:28:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2019-09-20 13:28:22,564 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2019-09-20 13:28:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,564 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2019-09-20 13:28:22,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2019-09-20 13:28:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 13:28:22,567 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,567 INFO L407 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] [2019-09-20 13:28:22,567 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2014185627, now seen corresponding path program 1 times [2019-09-20 13:28:22,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,663 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-20 13:28:22,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,665 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2019-09-20 13:28:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,016 INFO L93 Difference]: Finished difference Result 1517 states and 2180 transitions. [2019-09-20 13:28:23,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-20 13:28:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,019 INFO L225 Difference]: With dead ends: 1517 [2019-09-20 13:28:23,019 INFO L226 Difference]: Without dead ends: 1517 [2019-09-20 13:28:23,019 INFO L636 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-20 13:28:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-09-20 13:28:23,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1357. [2019-09-20 13:28:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-09-20 13:28:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2019-09-20 13:28:23,033 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2019-09-20 13:28:23,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,034 INFO L475 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2019-09-20 13:28:23,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2019-09-20 13:28:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:28:23,036 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,037 INFO L407 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] [2019-09-20 13:28:23,038 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1202525105, now seen corresponding path program 1 times [2019-09-20 13:28:23,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,132 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-20 13:28:23,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,134 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2019-09-20 13:28:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,418 INFO L93 Difference]: Finished difference Result 1497 states and 2150 transitions. [2019-09-20 13:28:23,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-20 13:28:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,420 INFO L225 Difference]: With dead ends: 1497 [2019-09-20 13:28:23,420 INFO L226 Difference]: Without dead ends: 1497 [2019-09-20 13:28:23,420 INFO L636 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-20 13:28:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-20 13:28:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1362. [2019-09-20 13:28:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-20 13:28:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2019-09-20 13:28:23,432 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2019-09-20 13:28:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,433 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2019-09-20 13:28:23,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2019-09-20 13:28:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:28:23,435 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,435 INFO L407 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] [2019-09-20 13:28:23,436 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1712961357, now seen corresponding path program 1 times [2019-09-20 13:28:23,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,526 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-20 13:28:23,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,528 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2019-09-20 13:28:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,812 INFO L93 Difference]: Finished difference Result 1497 states and 2145 transitions. [2019-09-20 13:28:23,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-20 13:28:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,814 INFO L225 Difference]: With dead ends: 1497 [2019-09-20 13:28:23,814 INFO L226 Difference]: Without dead ends: 1497 [2019-09-20 13:28:23,815 INFO L636 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-20 13:28:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-09-20 13:28:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1367. [2019-09-20 13:28:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-09-20 13:28:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2019-09-20 13:28:23,827 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2019-09-20 13:28:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,827 INFO L475 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2019-09-20 13:28:23,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2019-09-20 13:28:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-20 13:28:23,829 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,830 INFO L407 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] [2019-09-20 13:28:23,830 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1145389383, now seen corresponding path program 1 times [2019-09-20 13:28:23,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,918 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-20 13:28:23,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,920 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2019-09-20 13:28:24,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,218 INFO L93 Difference]: Finished difference Result 1487 states and 2130 transitions. [2019-09-20 13:28:24,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-20 13:28:24,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,221 INFO L225 Difference]: With dead ends: 1487 [2019-09-20 13:28:24,222 INFO L226 Difference]: Without dead ends: 1487 [2019-09-20 13:28:24,222 INFO L636 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-20 13:28:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-20 13:28:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1372. [2019-09-20 13:28:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-20 13:28:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2019-09-20 13:28:24,236 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 160 [2019-09-20 13:28:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,236 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2019-09-20 13:28:24,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2019-09-20 13:28:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-20 13:28:24,238 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,239 INFO L407 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] [2019-09-20 13:28:24,239 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1245927820, now seen corresponding path program 1 times [2019-09-20 13:28:24,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,338 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-20 13:28:24,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,340 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2019-09-20 13:28:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,642 INFO L93 Difference]: Finished difference Result 1487 states and 2125 transitions. [2019-09-20 13:28:24,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-20 13:28:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,645 INFO L225 Difference]: With dead ends: 1487 [2019-09-20 13:28:24,645 INFO L226 Difference]: Without dead ends: 1487 [2019-09-20 13:28:24,645 INFO L636 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-20 13:28:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-20 13:28:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1377. [2019-09-20 13:28:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-09-20 13:28:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2019-09-20 13:28:24,656 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 162 [2019-09-20 13:28:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,657 INFO L475 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2019-09-20 13:28:24,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2019-09-20 13:28:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-20 13:28:24,659 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,659 INFO L407 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] [2019-09-20 13:28:24,659 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1883212056, now seen corresponding path program 1 times [2019-09-20 13:28:24,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,782 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-20 13:28:24,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,784 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2019-09-20 13:28:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,068 INFO L93 Difference]: Finished difference Result 1467 states and 2097 transitions. [2019-09-20 13:28:25,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-20 13:28:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,070 INFO L225 Difference]: With dead ends: 1467 [2019-09-20 13:28:25,070 INFO L226 Difference]: Without dead ends: 1467 [2019-09-20 13:28:25,071 INFO L636 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-20 13:28:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2019-09-20 13:28:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1382. [2019-09-20 13:28:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-20 13:28:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2019-09-20 13:28:25,086 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 163 [2019-09-20 13:28:25,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,086 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2019-09-20 13:28:25,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2019-09-20 13:28:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-20 13:28:25,089 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,089 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:25,090 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash -648127340, now seen corresponding path program 1 times [2019-09-20 13:28:25,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:25,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,180 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 4 states. [2019-09-20 13:28:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,505 INFO L93 Difference]: Finished difference Result 1697 states and 2463 transitions. [2019-09-20 13:28:25,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-20 13:28:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,507 INFO L225 Difference]: With dead ends: 1697 [2019-09-20 13:28:25,507 INFO L226 Difference]: Without dead ends: 1697 [2019-09-20 13:28:25,507 INFO L636 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-20 13:28:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-09-20 13:28:25,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1522. [2019-09-20 13:28:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2019-09-20 13:28:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2232 transitions. [2019-09-20 13:28:25,518 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2232 transitions. Word has length 169 [2019-09-20 13:28:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,519 INFO L475 AbstractCegarLoop]: Abstraction has 1522 states and 2232 transitions. [2019-09-20 13:28:25,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2232 transitions. [2019-09-20 13:28:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-20 13:28:25,520 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,521 INFO L407 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] [2019-09-20 13:28:25,521 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1887649026, now seen corresponding path program 1 times [2019-09-20 13:28:25,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,594 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-20 13:28:25,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:25,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:25,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:25,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:25,596 INFO L87 Difference]: Start difference. First operand 1522 states and 2232 transitions. Second operand 3 states. [2019-09-20 13:28:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,641 INFO L93 Difference]: Finished difference Result 1821 states and 2675 transitions. [2019-09-20 13:28:25,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:25,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-20 13:28:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,643 INFO L225 Difference]: With dead ends: 1821 [2019-09-20 13:28:25,643 INFO L226 Difference]: Without dead ends: 1821 [2019-09-20 13:28:25,644 INFO L636 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-20 13:28:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2019-09-20 13:28:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2019-09-20 13:28:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-09-20 13:28:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2675 transitions. [2019-09-20 13:28:25,661 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2675 transitions. Word has length 170 [2019-09-20 13:28:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,661 INFO L475 AbstractCegarLoop]: Abstraction has 1821 states and 2675 transitions. [2019-09-20 13:28:25,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2675 transitions. [2019-09-20 13:28:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-20 13:28:25,664 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,664 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:25,664 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,665 INFO L82 PathProgramCache]: Analyzing trace with hash 753119835, now seen corresponding path program 1 times [2019-09-20 13:28:25,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:28:25,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,743 INFO L87 Difference]: Start difference. First operand 1821 states and 2675 transitions. Second operand 4 states. [2019-09-20 13:28:26,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,072 INFO L93 Difference]: Finished difference Result 2031 states and 2948 transitions. [2019-09-20 13:28:26,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-09-20 13:28:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,078 INFO L225 Difference]: With dead ends: 2031 [2019-09-20 13:28:26,078 INFO L226 Difference]: Without dead ends: 2031 [2019-09-20 13:28:26,079 INFO L636 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-20 13:28:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2019-09-20 13:28:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1821. [2019-09-20 13:28:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-09-20 13:28:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2669 transitions. [2019-09-20 13:28:26,096 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2669 transitions. Word has length 182 [2019-09-20 13:28:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,097 INFO L475 AbstractCegarLoop]: Abstraction has 1821 states and 2669 transitions. [2019-09-20 13:28:26,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2669 transitions. [2019-09-20 13:28:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-20 13:28:26,100 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,100 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:26,100 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,100 INFO L82 PathProgramCache]: Analyzing trace with hash 314002491, now seen corresponding path program 1 times [2019-09-20 13:28:26,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:28:26,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,176 INFO L87 Difference]: Start difference. First operand 1821 states and 2669 transitions. Second operand 4 states. [2019-09-20 13:28:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,509 INFO L93 Difference]: Finished difference Result 2025 states and 2936 transitions. [2019-09-20 13:28:26,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-09-20 13:28:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,511 INFO L225 Difference]: With dead ends: 2025 [2019-09-20 13:28:26,511 INFO L226 Difference]: Without dead ends: 2025 [2019-09-20 13:28:26,512 INFO L636 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-20 13:28:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2019-09-20 13:28:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1821. [2019-09-20 13:28:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-09-20 13:28:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2663 transitions. [2019-09-20 13:28:26,524 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2663 transitions. Word has length 183 [2019-09-20 13:28:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,524 INFO L475 AbstractCegarLoop]: Abstraction has 1821 states and 2663 transitions. [2019-09-20 13:28:26,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2663 transitions. [2019-09-20 13:28:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-20 13:28:26,526 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,527 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:26,527 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1364302470, now seen corresponding path program 1 times [2019-09-20 13:28:26,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,635 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:28:26,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,637 INFO L87 Difference]: Start difference. First operand 1821 states and 2663 transitions. Second operand 4 states. [2019-09-20 13:28:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,957 INFO L93 Difference]: Finished difference Result 2013 states and 2918 transitions. [2019-09-20 13:28:26,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-09-20 13:28:26,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,959 INFO L225 Difference]: With dead ends: 2013 [2019-09-20 13:28:26,960 INFO L226 Difference]: Without dead ends: 2013 [2019-09-20 13:28:26,960 INFO L636 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-20 13:28:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2019-09-20 13:28:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1821. [2019-09-20 13:28:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-09-20 13:28:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2657 transitions. [2019-09-20 13:28:26,978 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2657 transitions. Word has length 183 [2019-09-20 13:28:26,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,978 INFO L475 AbstractCegarLoop]: Abstraction has 1821 states and 2657 transitions. [2019-09-20 13:28:26,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2657 transitions. [2019-09-20 13:28:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-20 13:28:26,981 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,982 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:26,982 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,982 INFO L82 PathProgramCache]: Analyzing trace with hash -587232908, now seen corresponding path program 1 times [2019-09-20 13:28:26,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-20 13:28:27,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,075 INFO L87 Difference]: Start difference. First operand 1821 states and 2657 transitions. Second operand 4 states. [2019-09-20 13:28:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,354 INFO L93 Difference]: Finished difference Result 1923 states and 2785 transitions. [2019-09-20 13:28:27,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-20 13:28:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,356 INFO L225 Difference]: With dead ends: 1923 [2019-09-20 13:28:27,356 INFO L226 Difference]: Without dead ends: 1923 [2019-09-20 13:28:27,356 INFO L636 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-20 13:28:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-09-20 13:28:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1821. [2019-09-20 13:28:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-09-20 13:28:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2651 transitions. [2019-09-20 13:28:27,368 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2651 transitions. Word has length 184 [2019-09-20 13:28:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,368 INFO L475 AbstractCegarLoop]: Abstraction has 1821 states and 2651 transitions. [2019-09-20 13:28:27,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2651 transitions. [2019-09-20 13:28:27,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-20 13:28:27,370 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,370 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:27,370 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,371 INFO L82 PathProgramCache]: Analyzing trace with hash -413619112, now seen corresponding path program 1 times [2019-09-20 13:28:27,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:28:27,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,451 INFO L87 Difference]: Start difference. First operand 1821 states and 2651 transitions. Second operand 4 states. [2019-09-20 13:28:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,880 INFO L93 Difference]: Finished difference Result 2013 states and 2906 transitions. [2019-09-20 13:28:27,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-20 13:28:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,883 INFO L225 Difference]: With dead ends: 2013 [2019-09-20 13:28:27,883 INFO L226 Difference]: Without dead ends: 2013 [2019-09-20 13:28:27,883 INFO L636 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-20 13:28:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2019-09-20 13:28:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1821. [2019-09-20 13:28:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-09-20 13:28:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2645 transitions. [2019-09-20 13:28:27,896 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2645 transitions. Word has length 184 [2019-09-20 13:28:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,896 INFO L475 AbstractCegarLoop]: Abstraction has 1821 states and 2645 transitions. [2019-09-20 13:28:27,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2645 transitions. [2019-09-20 13:28:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-20 13:28:27,898 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,899 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2019-09-20 13:28:27,899 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,899 INFO L82 PathProgramCache]: Analyzing trace with hash 458619675, now seen corresponding path program 1 times [2019-09-20 13:28:27,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-20 13:28:27,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,996 INFO L87 Difference]: Start difference. First operand 1821 states and 2645 transitions. Second operand 4 states.