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.16.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:55:03,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:55:03,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:55:03,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:55:03,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:55:03,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:55:03,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:55:03,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:55:03,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:55:03,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:55:03,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:55:03,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:55:03,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:55:03,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:55:03,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:55:03,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:55:03,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:55:03,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:55:03,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:55:03,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:55:03,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:55:03,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:55:03,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:55:03,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:55:03,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:55:03,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:55:03,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:55:03,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:55:03,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:55:03,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:55:03,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:55:03,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:55:03,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:55:03,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:55:03,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:55:03,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:55:03,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:55:03,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:55:03,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:55:03,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:55:03,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:55:03,806 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:55:03,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:55:03,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:55:03,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:55:03,843 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:55:03,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:55:03,843 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:55:03,844 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:55:03,844 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:55:03,845 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:55:03,845 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:55:03,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:55:03,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:55:03,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:55:03,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:55:03,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:55:03,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:55:03,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:55:03,848 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:55:03,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:55:03,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:55:03,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:55:03,849 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:55:03,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:55:03,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:55:03,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:55:03,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:55:03,850 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:55:03,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:55:03,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:55:03,851 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:55:03,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:55:03,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:55:03,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:55:03,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:55:03,925 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:55:03,926 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.16.i.cil-1.c [2019-09-09 05:55:03,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63384c83/33c1520941044c4587c3fcac4514a9ae/FLAGae1b9ea3d [2019-09-09 05:55:04,643 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:55:04,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.16.i.cil-1.c [2019-09-09 05:55:04,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63384c83/33c1520941044c4587c3fcac4514a9ae/FLAGae1b9ea3d [2019-09-09 05:55:04,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63384c83/33c1520941044c4587c3fcac4514a9ae [2019-09-09 05:55:04,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:55:04,862 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:55:04,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:55:04,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:55:04,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:55:04,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:55:04" (1/1) ... [2019-09-09 05:55:04,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3b021a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:55:04, skipping insertion in model container [2019-09-09 05:55:04,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:55:04" (1/1) ... [2019-09-09 05:55:04,879 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:55:04,961 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:55:05,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:55:05,537 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:55:05,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:55:05,725 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:55:05,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:55:05 WrapperNode [2019-09-09 05:55:05,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:55:05,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:55:05,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:55:05,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:55:05,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:55:05" (1/1) ... [2019-09-09 05:55:05,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:55:05" (1/1) ... [2019-09-09 05:55:05,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:55:05" (1/1) ... [2019-09-09 05:55:05,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:55:05" (1/1) ... [2019-09-09 05:55:05,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:55:05" (1/1) ... [2019-09-09 05:55:05,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:55:05" (1/1) ... [2019-09-09 05:55:05,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:55:05" (1/1) ... [2019-09-09 05:55:05,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:55:05,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:55:05,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:55:05,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:55:05,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:55:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:55:05,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:55:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:55:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-09 05:55:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-09 05:55:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:55:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:55:05,973 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:55:05,974 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:55:05,974 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:55:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:55:05,974 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:55:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:55:05,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:55:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:55:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:55:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:55:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-09 05:55:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:55:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:55:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-09 05:55:05,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:55:05,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:55:05,979 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:55:05,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:55:05,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:55:05,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:55:05,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:55:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:55:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:55:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:55:05,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:55:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:55:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:55:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:55:05,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:55:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:55:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:55:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:55:05,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:55:06,478 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:55:07,257 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:55:07,258 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:55:07,280 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:55:07,280 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:55:07,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:55:07 BoogieIcfgContainer [2019-09-09 05:55:07,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:55:07,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:55:07,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:55:07,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:55:07,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:55:04" (1/3) ... [2019-09-09 05:55:07,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c93f3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:55:07, skipping insertion in model container [2019-09-09 05:55:07,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:55:05" (2/3) ... [2019-09-09 05:55:07,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c93f3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:55:07, skipping insertion in model container [2019-09-09 05:55:07,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:55:07" (3/3) ... [2019-09-09 05:55:07,289 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-1.c [2019-09-09 05:55:07,300 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:55:07,308 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:55:07,328 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:55:07,356 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:55:07,356 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:55:07,356 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:55:07,356 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:55:07,357 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:55:07,357 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:55:07,357 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:55:07,357 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:55:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2019-09-09 05:55:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:55:07,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:07,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:07,397 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:07,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1765805398, now seen corresponding path program 1 times [2019-09-09 05:55:07,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:07,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:07,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:07,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:07,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:07,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:07,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:07,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:07,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:07,820 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 4 states. [2019-09-09 05:55:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:08,328 INFO L93 Difference]: Finished difference Result 198 states and 326 transitions. [2019-09-09 05:55:08,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:08,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-09 05:55:08,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:08,343 INFO L225 Difference]: With dead ends: 198 [2019-09-09 05:55:08,343 INFO L226 Difference]: Without dead ends: 177 [2019-09-09 05:55:08,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-09 05:55:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2019-09-09 05:55:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-09 05:55:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2019-09-09 05:55:08,406 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 49 [2019-09-09 05:55:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,407 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2019-09-09 05:55:08,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2019-09-09 05:55:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:55:08,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:08,414 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:08,415 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:08,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2089385858, now seen corresponding path program 1 times [2019-09-09 05:55:08,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:08,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:08,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:08,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:08,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:08,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:08,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:08,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:08,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:08,578 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand 4 states. [2019-09-09 05:55:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:08,926 INFO L93 Difference]: Finished difference Result 177 states and 268 transitions. [2019-09-09 05:55:08,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:08,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-09 05:55:08,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:08,928 INFO L225 Difference]: With dead ends: 177 [2019-09-09 05:55:08,929 INFO L226 Difference]: Without dead ends: 177 [2019-09-09 05:55:08,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-09 05:55:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2019-09-09 05:55:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-09 05:55:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 247 transitions. [2019-09-09 05:55:08,941 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 247 transitions. Word has length 62 [2019-09-09 05:55:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:08,942 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 247 transitions. [2019-09-09 05:55:08,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 247 transitions. [2019-09-09 05:55:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:55:08,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:08,945 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:08,945 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:08,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1535183890, now seen corresponding path program 1 times [2019-09-09 05:55:08,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:08,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:08,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:09,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:09,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:09,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:09,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:09,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:09,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:09,064 INFO L87 Difference]: Start difference. First operand 160 states and 247 transitions. Second operand 4 states. [2019-09-09 05:55:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:09,405 INFO L93 Difference]: Finished difference Result 176 states and 266 transitions. [2019-09-09 05:55:09,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:09,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:55:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:09,408 INFO L225 Difference]: With dead ends: 176 [2019-09-09 05:55:09,409 INFO L226 Difference]: Without dead ends: 176 [2019-09-09 05:55:09,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-09 05:55:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 160. [2019-09-09 05:55:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-09 05:55:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 246 transitions. [2019-09-09 05:55:09,422 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 246 transitions. Word has length 63 [2019-09-09 05:55:09,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:09,422 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 246 transitions. [2019-09-09 05:55:09,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 246 transitions. [2019-09-09 05:55:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:55:09,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:09,431 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:09,431 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash -872879962, now seen corresponding path program 1 times [2019-09-09 05:55:09,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:09,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:09,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:09,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:09,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:09,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:55:09,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:09,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:55:09,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:55:09,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:09,532 INFO L87 Difference]: Start difference. First operand 160 states and 246 transitions. Second operand 5 states. [2019-09-09 05:55:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:10,096 INFO L93 Difference]: Finished difference Result 181 states and 274 transitions. [2019-09-09 05:55:10,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:55:10,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-09 05:55:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:10,099 INFO L225 Difference]: With dead ends: 181 [2019-09-09 05:55:10,100 INFO L226 Difference]: Without dead ends: 181 [2019-09-09 05:55:10,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:55:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-09 05:55:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2019-09-09 05:55:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-09 05:55:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 273 transitions. [2019-09-09 05:55:10,111 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 273 transitions. Word has length 63 [2019-09-09 05:55:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:10,112 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 273 transitions. [2019-09-09 05:55:10,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:55:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2019-09-09 05:55:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:55:10,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:10,114 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:10,114 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:10,115 INFO L82 PathProgramCache]: Analyzing trace with hash 309686878, now seen corresponding path program 1 times [2019-09-09 05:55:10,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:10,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:10,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:10,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:10,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:10,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:10,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:10,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:10,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:10,222 INFO L87 Difference]: Start difference. First operand 180 states and 273 transitions. Second operand 4 states. [2019-09-09 05:55:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:10,567 INFO L93 Difference]: Finished difference Result 195 states and 290 transitions. [2019-09-09 05:55:10,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:10,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:55:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:10,568 INFO L225 Difference]: With dead ends: 195 [2019-09-09 05:55:10,569 INFO L226 Difference]: Without dead ends: 195 [2019-09-09 05:55:10,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:10,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-09 05:55:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 180. [2019-09-09 05:55:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-09 05:55:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2019-09-09 05:55:10,579 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 63 [2019-09-09 05:55:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:10,579 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2019-09-09 05:55:10,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2019-09-09 05:55:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:55:10,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:10,581 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:10,581 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash 242126877, now seen corresponding path program 1 times [2019-09-09 05:55:10,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:10,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:10,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:10,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:10,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:10,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:10,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:10,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:10,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:10,651 INFO L87 Difference]: Start difference. First operand 180 states and 272 transitions. Second operand 4 states. [2019-09-09 05:55:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:10,931 INFO L93 Difference]: Finished difference Result 193 states and 287 transitions. [2019-09-09 05:55:10,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:10,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-09 05:55:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:10,933 INFO L225 Difference]: With dead ends: 193 [2019-09-09 05:55:10,933 INFO L226 Difference]: Without dead ends: 193 [2019-09-09 05:55:10,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-09 05:55:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-09 05:55:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-09 05:55:10,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 271 transitions. [2019-09-09 05:55:10,941 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 271 transitions. Word has length 63 [2019-09-09 05:55:10,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:10,941 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 271 transitions. [2019-09-09 05:55:10,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 271 transitions. [2019-09-09 05:55:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:55:10,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:10,943 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:10,943 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:10,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:10,943 INFO L82 PathProgramCache]: Analyzing trace with hash -303724929, now seen corresponding path program 1 times [2019-09-09 05:55:10,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:10,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:10,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:10,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:10,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:10,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:10,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:10,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:10,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:10,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:10,998 INFO L87 Difference]: Start difference. First operand 180 states and 271 transitions. Second operand 4 states. [2019-09-09 05:55:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:11,263 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2019-09-09 05:55:11,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:11,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:55:11,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:11,266 INFO L225 Difference]: With dead ends: 193 [2019-09-09 05:55:11,266 INFO L226 Difference]: Without dead ends: 193 [2019-09-09 05:55:11,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-09 05:55:11,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-09 05:55:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-09 05:55:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 270 transitions. [2019-09-09 05:55:11,274 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 270 transitions. Word has length 64 [2019-09-09 05:55:11,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:11,274 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 270 transitions. [2019-09-09 05:55:11,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 270 transitions. [2019-09-09 05:55:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:55:11,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:11,276 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:11,276 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:11,277 INFO L82 PathProgramCache]: Analyzing trace with hash -598835814, now seen corresponding path program 1 times [2019-09-09 05:55:11,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:11,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:11,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:11,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:11,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:11,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:11,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:11,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:11,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:11,381 INFO L87 Difference]: Start difference. First operand 180 states and 270 transitions. Second operand 4 states. [2019-09-09 05:55:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:11,691 INFO L93 Difference]: Finished difference Result 193 states and 285 transitions. [2019-09-09 05:55:11,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:11,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:55:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:11,693 INFO L225 Difference]: With dead ends: 193 [2019-09-09 05:55:11,693 INFO L226 Difference]: Without dead ends: 193 [2019-09-09 05:55:11,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-09 05:55:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-09 05:55:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-09 05:55:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 269 transitions. [2019-09-09 05:55:11,700 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 269 transitions. Word has length 65 [2019-09-09 05:55:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:11,700 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 269 transitions. [2019-09-09 05:55:11,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 269 transitions. [2019-09-09 05:55:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:55:11,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:11,702 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:11,702 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:11,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:11,702 INFO L82 PathProgramCache]: Analyzing trace with hash -604400838, now seen corresponding path program 1 times [2019-09-09 05:55:11,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:11,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:11,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:11,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:11,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:11,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:11,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:11,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:11,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:11,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:11,764 INFO L87 Difference]: Start difference. First operand 180 states and 269 transitions. Second operand 4 states. [2019-09-09 05:55:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:12,040 INFO L93 Difference]: Finished difference Result 193 states and 284 transitions. [2019-09-09 05:55:12,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:12,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:55:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:12,042 INFO L225 Difference]: With dead ends: 193 [2019-09-09 05:55:12,042 INFO L226 Difference]: Without dead ends: 193 [2019-09-09 05:55:12,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-09 05:55:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-09-09 05:55:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-09 05:55:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 268 transitions. [2019-09-09 05:55:12,052 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 268 transitions. Word has length 66 [2019-09-09 05:55:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:12,052 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 268 transitions. [2019-09-09 05:55:12,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2019-09-09 05:55:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:55:12,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:12,056 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:12,057 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:12,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:12,057 INFO L82 PathProgramCache]: Analyzing trace with hash -822498919, now seen corresponding path program 1 times [2019-09-09 05:55:12,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:12,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:12,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:12,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:12,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:12,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:12,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:12,107 INFO L87 Difference]: Start difference. First operand 180 states and 268 transitions. Second operand 4 states. [2019-09-09 05:55:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:12,432 INFO L93 Difference]: Finished difference Result 222 states and 330 transitions. [2019-09-09 05:55:12,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:12,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:55:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:12,435 INFO L225 Difference]: With dead ends: 222 [2019-09-09 05:55:12,435 INFO L226 Difference]: Without dead ends: 222 [2019-09-09 05:55:12,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-09 05:55:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2019-09-09 05:55:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-09 05:55:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 305 transitions. [2019-09-09 05:55:12,442 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 305 transitions. Word has length 66 [2019-09-09 05:55:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:12,443 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 305 transitions. [2019-09-09 05:55:12,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 305 transitions. [2019-09-09 05:55:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-09 05:55:12,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:12,444 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:12,444 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:12,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:12,445 INFO L82 PathProgramCache]: Analyzing trace with hash -223978763, now seen corresponding path program 1 times [2019-09-09 05:55:12,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:12,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:12,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:12,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:12,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:12,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:12,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:12,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:12,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:12,495 INFO L87 Difference]: Start difference. First operand 202 states and 305 transitions. Second operand 4 states. [2019-09-09 05:55:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:12,743 INFO L93 Difference]: Finished difference Result 205 states and 308 transitions. [2019-09-09 05:55:12,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:12,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-09 05:55:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:12,746 INFO L225 Difference]: With dead ends: 205 [2019-09-09 05:55:12,746 INFO L226 Difference]: Without dead ends: 205 [2019-09-09 05:55:12,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-09 05:55:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-09-09 05:55:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-09 05:55:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2019-09-09 05:55:12,753 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 304 transitions. Word has length 67 [2019-09-09 05:55:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:12,754 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 304 transitions. [2019-09-09 05:55:12,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 304 transitions. [2019-09-09 05:55:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-09 05:55:12,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:12,756 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:12,756 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:12,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1269381901, now seen corresponding path program 1 times [2019-09-09 05:55:12,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:12,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:12,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:12,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:12,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:12,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:12,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:12,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:12,819 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand 4 states. [2019-09-09 05:55:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:13,158 INFO L93 Difference]: Finished difference Result 222 states and 328 transitions. [2019-09-09 05:55:13,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:13,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-09 05:55:13,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:13,159 INFO L225 Difference]: With dead ends: 222 [2019-09-09 05:55:13,160 INFO L226 Difference]: Without dead ends: 222 [2019-09-09 05:55:13,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-09 05:55:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2019-09-09 05:55:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-09 05:55:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 303 transitions. [2019-09-09 05:55:13,166 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 303 transitions. Word has length 79 [2019-09-09 05:55:13,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:13,166 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 303 transitions. [2019-09-09 05:55:13,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 303 transitions. [2019-09-09 05:55:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:55:13,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:13,168 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:13,168 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:13,168 INFO L82 PathProgramCache]: Analyzing trace with hash -732898547, now seen corresponding path program 1 times [2019-09-09 05:55:13,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:13,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:13,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:13,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:13,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:13,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:13,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:13,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:13,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:13,229 INFO L87 Difference]: Start difference. First operand 202 states and 303 transitions. Second operand 4 states. [2019-09-09 05:55:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:13,534 INFO L93 Difference]: Finished difference Result 221 states and 326 transitions. [2019-09-09 05:55:13,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:13,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:55:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:13,536 INFO L225 Difference]: With dead ends: 221 [2019-09-09 05:55:13,536 INFO L226 Difference]: Without dead ends: 221 [2019-09-09 05:55:13,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-09 05:55:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 202. [2019-09-09 05:55:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-09 05:55:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2019-09-09 05:55:13,543 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 80 [2019-09-09 05:55:13,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:13,544 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2019-09-09 05:55:13,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2019-09-09 05:55:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:55:13,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:13,545 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:13,545 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:13,546 INFO L82 PathProgramCache]: Analyzing trace with hash -800458548, now seen corresponding path program 1 times [2019-09-09 05:55:13,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:13,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:13,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:13,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:13,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:13,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:13,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:13,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:13,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:13,600 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand 4 states. [2019-09-09 05:55:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:13,875 INFO L93 Difference]: Finished difference Result 219 states and 323 transitions. [2019-09-09 05:55:13,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:13,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-09 05:55:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:13,877 INFO L225 Difference]: With dead ends: 219 [2019-09-09 05:55:13,877 INFO L226 Difference]: Without dead ends: 219 [2019-09-09 05:55:13,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-09 05:55:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-09 05:55:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-09 05:55:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions. [2019-09-09 05:55:13,883 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 80 [2019-09-09 05:55:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:13,884 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 301 transitions. [2019-09-09 05:55:13,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 301 transitions. [2019-09-09 05:55:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:55:13,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:13,885 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:13,886 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:13,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1735865264, now seen corresponding path program 1 times [2019-09-09 05:55:13,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:13,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:13,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:13,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:13,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:13,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:13,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:13,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:13,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:13,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:13,945 INFO L87 Difference]: Start difference. First operand 202 states and 301 transitions. Second operand 4 states. [2019-09-09 05:55:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:14,379 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2019-09-09 05:55:14,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:14,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:55:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:14,382 INFO L225 Difference]: With dead ends: 219 [2019-09-09 05:55:14,382 INFO L226 Difference]: Without dead ends: 219 [2019-09-09 05:55:14,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-09 05:55:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-09 05:55:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-09 05:55:14,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 300 transitions. [2019-09-09 05:55:14,388 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 300 transitions. Word has length 81 [2019-09-09 05:55:14,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:14,389 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 300 transitions. [2019-09-09 05:55:14,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:14,389 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 300 transitions. [2019-09-09 05:55:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:55:14,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:14,390 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:14,390 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:14,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:14,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1796049271, now seen corresponding path program 1 times [2019-09-09 05:55:14,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:14,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:14,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:14,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:14,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:14,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:14,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:14,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:14,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:14,493 INFO L87 Difference]: Start difference. First operand 202 states and 300 transitions. Second operand 4 states. [2019-09-09 05:55:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:14,773 INFO L93 Difference]: Finished difference Result 219 states and 321 transitions. [2019-09-09 05:55:14,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:14,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-09 05:55:14,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:14,775 INFO L225 Difference]: With dead ends: 219 [2019-09-09 05:55:14,776 INFO L226 Difference]: Without dead ends: 219 [2019-09-09 05:55:14,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-09 05:55:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-09 05:55:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-09 05:55:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2019-09-09 05:55:14,783 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 82 [2019-09-09 05:55:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:14,783 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2019-09-09 05:55:14,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2019-09-09 05:55:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:55:14,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:14,785 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:14,785 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:14,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash 936687659, now seen corresponding path program 1 times [2019-09-09 05:55:14,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:14,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:14,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:14,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:14,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:14,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:14,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:14,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:14,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:14,843 INFO L87 Difference]: Start difference. First operand 202 states and 299 transitions. Second operand 4 states. [2019-09-09 05:55:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:15,121 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2019-09-09 05:55:15,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:15,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-09 05:55:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:15,123 INFO L225 Difference]: With dead ends: 219 [2019-09-09 05:55:15,123 INFO L226 Difference]: Without dead ends: 219 [2019-09-09 05:55:15,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-09 05:55:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 202. [2019-09-09 05:55:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-09 05:55:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 298 transitions. [2019-09-09 05:55:15,131 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 298 transitions. Word has length 83 [2019-09-09 05:55:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:15,131 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 298 transitions. [2019-09-09 05:55:15,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 298 transitions. [2019-09-09 05:55:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-09 05:55:15,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:15,133 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:15,133 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash 305124388, now seen corresponding path program 1 times [2019-09-09 05:55:15,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:15,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:15,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:55:15,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:15,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:15,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:15,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:15,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:15,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:15,210 INFO L87 Difference]: Start difference. First operand 202 states and 298 transitions. Second operand 4 states. [2019-09-09 05:55:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:15,513 INFO L93 Difference]: Finished difference Result 209 states and 307 transitions. [2019-09-09 05:55:15,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:15,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-09 05:55:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:15,516 INFO L225 Difference]: With dead ends: 209 [2019-09-09 05:55:15,516 INFO L226 Difference]: Without dead ends: 209 [2019-09-09 05:55:15,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-09 05:55:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 202. [2019-09-09 05:55:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-09 05:55:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 297 transitions. [2019-09-09 05:55:15,522 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 297 transitions. Word has length 84 [2019-09-09 05:55:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:15,522 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 297 transitions. [2019-09-09 05:55:15,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 297 transitions. [2019-09-09 05:55:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:55:15,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:15,524 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:15,524 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:15,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1695196548, now seen corresponding path program 1 times [2019-09-09 05:55:15,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:15,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:15,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:15,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:15,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:15,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:15,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:15,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:15,631 INFO L87 Difference]: Start difference. First operand 202 states and 297 transitions. Second operand 4 states. [2019-09-09 05:55:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:16,123 INFO L93 Difference]: Finished difference Result 314 states and 470 transitions. [2019-09-09 05:55:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:16,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-09 05:55:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:16,126 INFO L225 Difference]: With dead ends: 314 [2019-09-09 05:55:16,126 INFO L226 Difference]: Without dead ends: 314 [2019-09-09 05:55:16,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-09 05:55:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 243. [2019-09-09 05:55:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-09 05:55:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 370 transitions. [2019-09-09 05:55:16,136 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 370 transitions. Word has length 88 [2019-09-09 05:55:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:16,136 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 370 transitions. [2019-09-09 05:55:16,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 370 transitions. [2019-09-09 05:55:16,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:55:16,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:16,138 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:16,138 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:16,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:16,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1271549826, now seen corresponding path program 1 times [2019-09-09 05:55:16,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:16,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:16,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:16,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:16,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:16,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:16,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:16,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:16,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:16,240 INFO L87 Difference]: Start difference. First operand 243 states and 370 transitions. Second operand 4 states. [2019-09-09 05:55:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:16,600 INFO L93 Difference]: Finished difference Result 292 states and 443 transitions. [2019-09-09 05:55:16,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:16,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-09 05:55:16,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:16,602 INFO L225 Difference]: With dead ends: 292 [2019-09-09 05:55:16,602 INFO L226 Difference]: Without dead ends: 292 [2019-09-09 05:55:16,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-09 05:55:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 267. [2019-09-09 05:55:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-09 05:55:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions. [2019-09-09 05:55:16,610 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 88 [2019-09-09 05:55:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:16,611 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions. [2019-09-09 05:55:16,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2019-09-09 05:55:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:55:16,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:16,614 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:16,614 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:16,615 INFO L82 PathProgramCache]: Analyzing trace with hash 130094744, now seen corresponding path program 1 times [2019-09-09 05:55:16,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:16,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:16,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:16,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:16,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:16,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:16,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:16,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:16,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:16,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:16,768 INFO L87 Difference]: Start difference. First operand 267 states and 411 transitions. Second operand 4 states. [2019-09-09 05:55:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:17,167 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-09-09 05:55:17,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:17,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-09 05:55:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:17,169 INFO L225 Difference]: With dead ends: 330 [2019-09-09 05:55:17,169 INFO L226 Difference]: Without dead ends: 330 [2019-09-09 05:55:17,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-09 05:55:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2019-09-09 05:55:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 412 transitions. [2019-09-09 05:55:17,175 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 412 transitions. Word has length 89 [2019-09-09 05:55:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:17,175 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 412 transitions. [2019-09-09 05:55:17,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 412 transitions. [2019-09-09 05:55:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:55:17,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:17,177 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:17,177 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash 981654768, now seen corresponding path program 1 times [2019-09-09 05:55:17,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:17,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:17,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:17,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:17,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:17,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:17,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:17,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:17,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:17,249 INFO L87 Difference]: Start difference. First operand 268 states and 412 transitions. Second operand 4 states. [2019-09-09 05:55:17,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:17,743 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-09-09 05:55:17,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:17,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:55:17,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:17,745 INFO L225 Difference]: With dead ends: 330 [2019-09-09 05:55:17,746 INFO L226 Difference]: Without dead ends: 330 [2019-09-09 05:55:17,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-09 05:55:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2019-09-09 05:55:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 411 transitions. [2019-09-09 05:55:17,753 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 411 transitions. Word has length 101 [2019-09-09 05:55:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:17,754 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 411 transitions. [2019-09-09 05:55:17,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 411 transitions. [2019-09-09 05:55:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:55:17,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:17,755 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:17,756 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:17,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:17,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1857673774, now seen corresponding path program 1 times [2019-09-09 05:55:17,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:17,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:17,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:17,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:17,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:17,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:17,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:17,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:17,830 INFO L87 Difference]: Start difference. First operand 268 states and 411 transitions. Second operand 4 states. [2019-09-09 05:55:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:18,238 INFO L93 Difference]: Finished difference Result 293 states and 442 transitions. [2019-09-09 05:55:18,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:18,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-09 05:55:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:18,240 INFO L225 Difference]: With dead ends: 293 [2019-09-09 05:55:18,241 INFO L226 Difference]: Without dead ends: 293 [2019-09-09 05:55:18,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-09 05:55:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2019-09-09 05:55:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 410 transitions. [2019-09-09 05:55:18,252 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 410 transitions. Word has length 101 [2019-09-09 05:55:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:18,252 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 410 transitions. [2019-09-09 05:55:18,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 410 transitions. [2019-09-09 05:55:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:55:18,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:18,255 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:18,255 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:18,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:18,256 INFO L82 PathProgramCache]: Analyzing trace with hash 329761456, now seen corresponding path program 1 times [2019-09-09 05:55:18,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:18,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:18,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:18,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:18,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:18,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:18,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:18,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:18,354 INFO L87 Difference]: Start difference. First operand 268 states and 410 transitions. Second operand 4 states. [2019-09-09 05:55:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:18,798 INFO L93 Difference]: Finished difference Result 329 states and 495 transitions. [2019-09-09 05:55:18,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:18,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:55:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:18,800 INFO L225 Difference]: With dead ends: 329 [2019-09-09 05:55:18,801 INFO L226 Difference]: Without dead ends: 329 [2019-09-09 05:55:18,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-09 05:55:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 268. [2019-09-09 05:55:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 409 transitions. [2019-09-09 05:55:18,807 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 409 transitions. Word has length 102 [2019-09-09 05:55:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:18,807 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 409 transitions. [2019-09-09 05:55:18,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 409 transitions. [2019-09-09 05:55:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:55:18,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:18,809 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:18,809 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:18,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:18,811 INFO L82 PathProgramCache]: Analyzing trace with hash 262201455, now seen corresponding path program 1 times [2019-09-09 05:55:18,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:18,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:18,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:18,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:18,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:18,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:18,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:18,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:18,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:18,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:18,894 INFO L87 Difference]: Start difference. First operand 268 states and 409 transitions. Second operand 4 states. [2019-09-09 05:55:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:19,296 INFO L93 Difference]: Finished difference Result 327 states and 492 transitions. [2019-09-09 05:55:19,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:19,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:55:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:19,300 INFO L225 Difference]: With dead ends: 327 [2019-09-09 05:55:19,300 INFO L226 Difference]: Without dead ends: 327 [2019-09-09 05:55:19,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-09 05:55:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-09 05:55:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 408 transitions. [2019-09-09 05:55:19,308 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 408 transitions. Word has length 102 [2019-09-09 05:55:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:19,309 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 408 transitions. [2019-09-09 05:55:19,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 408 transitions. [2019-09-09 05:55:19,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:55:19,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:19,311 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:19,311 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:19,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:19,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1716546866, now seen corresponding path program 1 times [2019-09-09 05:55:19,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:19,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:19,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:19,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:19,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:19,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:19,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:19,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:19,387 INFO L87 Difference]: Start difference. First operand 268 states and 408 transitions. Second operand 4 states. [2019-09-09 05:55:19,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:19,678 INFO L93 Difference]: Finished difference Result 292 states and 438 transitions. [2019-09-09 05:55:19,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:19,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:55:19,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:19,680 INFO L225 Difference]: With dead ends: 292 [2019-09-09 05:55:19,680 INFO L226 Difference]: Without dead ends: 292 [2019-09-09 05:55:19,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-09 05:55:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2019-09-09 05:55:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 407 transitions. [2019-09-09 05:55:19,686 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 407 transitions. Word has length 102 [2019-09-09 05:55:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:19,686 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 407 transitions. [2019-09-09 05:55:19,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 407 transitions. [2019-09-09 05:55:19,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:55:19,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:19,688 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:19,688 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1648986865, now seen corresponding path program 1 times [2019-09-09 05:55:19,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:19,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:19,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:19,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:19,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:19,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:19,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:19,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:19,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:19,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:19,747 INFO L87 Difference]: Start difference. First operand 268 states and 407 transitions. Second operand 4 states. [2019-09-09 05:55:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:20,045 INFO L93 Difference]: Finished difference Result 290 states and 435 transitions. [2019-09-09 05:55:20,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:20,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-09 05:55:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:20,047 INFO L225 Difference]: With dead ends: 290 [2019-09-09 05:55:20,048 INFO L226 Difference]: Without dead ends: 290 [2019-09-09 05:55:20,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-09 05:55:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-09 05:55:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 406 transitions. [2019-09-09 05:55:20,054 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 406 transitions. Word has length 102 [2019-09-09 05:55:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:20,055 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 406 transitions. [2019-09-09 05:55:20,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 406 transitions. [2019-09-09 05:55:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:55:20,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:20,057 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:20,057 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:20,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:20,058 INFO L82 PathProgramCache]: Analyzing trace with hash 318586989, now seen corresponding path program 1 times [2019-09-09 05:55:20,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:20,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:20,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:20,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:20,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:20,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:20,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:20,154 INFO L87 Difference]: Start difference. First operand 268 states and 406 transitions. Second operand 4 states. [2019-09-09 05:55:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:20,510 INFO L93 Difference]: Finished difference Result 327 states and 489 transitions. [2019-09-09 05:55:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:20,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:55:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:20,512 INFO L225 Difference]: With dead ends: 327 [2019-09-09 05:55:20,513 INFO L226 Difference]: Without dead ends: 327 [2019-09-09 05:55:20,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-09 05:55:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-09 05:55:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 405 transitions. [2019-09-09 05:55:20,519 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 405 transitions. Word has length 103 [2019-09-09 05:55:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:20,519 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 405 transitions. [2019-09-09 05:55:20,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 405 transitions. [2019-09-09 05:55:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:55:20,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:20,521 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:20,521 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:20,521 INFO L82 PathProgramCache]: Analyzing trace with hash 359261739, now seen corresponding path program 1 times [2019-09-09 05:55:20,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:20,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:20,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:20,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:20,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:20,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:20,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:20,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:20,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:20,583 INFO L87 Difference]: Start difference. First operand 268 states and 405 transitions. Second operand 4 states. [2019-09-09 05:55:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:20,853 INFO L93 Difference]: Finished difference Result 290 states and 433 transitions. [2019-09-09 05:55:20,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:20,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:55:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:20,856 INFO L225 Difference]: With dead ends: 290 [2019-09-09 05:55:20,856 INFO L226 Difference]: Without dead ends: 290 [2019-09-09 05:55:20,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-09 05:55:20,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-09 05:55:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 404 transitions. [2019-09-09 05:55:20,867 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 404 transitions. Word has length 103 [2019-09-09 05:55:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:20,867 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 404 transitions. [2019-09-09 05:55:20,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 404 transitions. [2019-09-09 05:55:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:55:20,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:20,869 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:20,869 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:20,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:20,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1512964460, now seen corresponding path program 1 times [2019-09-09 05:55:20,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:20,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:20,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:20,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:20,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:20,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:20,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:20,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:20,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:20,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:20,922 INFO L87 Difference]: Start difference. First operand 268 states and 404 transitions. Second operand 4 states. [2019-09-09 05:55:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:21,291 INFO L93 Difference]: Finished difference Result 327 states and 487 transitions. [2019-09-09 05:55:21,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:21,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:55:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:21,296 INFO L225 Difference]: With dead ends: 327 [2019-09-09 05:55:21,296 INFO L226 Difference]: Without dead ends: 327 [2019-09-09 05:55:21,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-09 05:55:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-09 05:55:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 403 transitions. [2019-09-09 05:55:21,302 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 403 transitions. Word has length 104 [2019-09-09 05:55:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:21,302 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 403 transitions. [2019-09-09 05:55:21,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 403 transitions. [2019-09-09 05:55:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:55:21,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:21,303 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:21,304 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:21,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1521085586, now seen corresponding path program 1 times [2019-09-09 05:55:21,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:21,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:21,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:21,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:21,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:21,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:21,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:21,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:21,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:21,361 INFO L87 Difference]: Start difference. First operand 268 states and 403 transitions. Second operand 4 states. [2019-09-09 05:55:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:21,643 INFO L93 Difference]: Finished difference Result 290 states and 431 transitions. [2019-09-09 05:55:21,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:21,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:55:21,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:21,644 INFO L225 Difference]: With dead ends: 290 [2019-09-09 05:55:21,645 INFO L226 Difference]: Without dead ends: 290 [2019-09-09 05:55:21,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-09 05:55:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-09 05:55:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 402 transitions. [2019-09-09 05:55:21,650 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 402 transitions. Word has length 104 [2019-09-09 05:55:21,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:21,651 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 402 transitions. [2019-09-09 05:55:21,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 402 transitions. [2019-09-09 05:55:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:55:21,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:21,652 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:21,652 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:21,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash 436898216, now seen corresponding path program 1 times [2019-09-09 05:55:21,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:21,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:21,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:21,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:21,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:21,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:21,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:21,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:21,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:21,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:21,715 INFO L87 Difference]: Start difference. First operand 268 states and 402 transitions. Second operand 4 states. [2019-09-09 05:55:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:22,097 INFO L93 Difference]: Finished difference Result 327 states and 485 transitions. [2019-09-09 05:55:22,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:22,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:55:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:22,099 INFO L225 Difference]: With dead ends: 327 [2019-09-09 05:55:22,099 INFO L226 Difference]: Without dead ends: 327 [2019-09-09 05:55:22,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:22,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-09 05:55:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-09-09 05:55:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 401 transitions. [2019-09-09 05:55:22,106 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 401 transitions. Word has length 105 [2019-09-09 05:55:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:22,106 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 401 transitions. [2019-09-09 05:55:22,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2019-09-09 05:55:22,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:55:22,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:22,108 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:22,108 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash 870627302, now seen corresponding path program 1 times [2019-09-09 05:55:22,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:22,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:22,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:22,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:22,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:22,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:22,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:22,170 INFO L87 Difference]: Start difference. First operand 268 states and 401 transitions. Second operand 4 states. [2019-09-09 05:55:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:22,460 INFO L93 Difference]: Finished difference Result 290 states and 429 transitions. [2019-09-09 05:55:22,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:22,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:55:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:22,462 INFO L225 Difference]: With dead ends: 290 [2019-09-09 05:55:22,462 INFO L226 Difference]: Without dead ends: 290 [2019-09-09 05:55:22,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-09 05:55:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 268. [2019-09-09 05:55:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 400 transitions. [2019-09-09 05:55:22,468 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 400 transitions. Word has length 105 [2019-09-09 05:55:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:22,468 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 400 transitions. [2019-09-09 05:55:22,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 400 transitions. [2019-09-09 05:55:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:55:22,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:22,470 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:22,470 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:22,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1991520839, now seen corresponding path program 1 times [2019-09-09 05:55:22,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:22,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:22,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:22,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:22,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:22,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:22,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:22,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:22,524 INFO L87 Difference]: Start difference. First operand 268 states and 400 transitions. Second operand 4 states. [2019-09-09 05:55:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:22,874 INFO L93 Difference]: Finished difference Result 317 states and 471 transitions. [2019-09-09 05:55:22,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:22,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:55:22,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:22,876 INFO L225 Difference]: With dead ends: 317 [2019-09-09 05:55:22,877 INFO L226 Difference]: Without dead ends: 317 [2019-09-09 05:55:22,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-09 05:55:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 268. [2019-09-09 05:55:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 399 transitions. [2019-09-09 05:55:22,883 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 399 transitions. Word has length 106 [2019-09-09 05:55:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:22,883 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 399 transitions. [2019-09-09 05:55:22,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 399 transitions. [2019-09-09 05:55:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:55:22,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:22,884 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:22,885 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:22,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1742746679, now seen corresponding path program 1 times [2019-09-09 05:55:22,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:22,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:22,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:22,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:22,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:22,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:22,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:22,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:22,952 INFO L87 Difference]: Start difference. First operand 268 states and 399 transitions. Second operand 4 states. [2019-09-09 05:55:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:23,195 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2019-09-09 05:55:23,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:23,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:55:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:23,198 INFO L225 Difference]: With dead ends: 280 [2019-09-09 05:55:23,198 INFO L226 Difference]: Without dead ends: 280 [2019-09-09 05:55:23,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-09 05:55:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 268. [2019-09-09 05:55:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 398 transitions. [2019-09-09 05:55:23,204 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 398 transitions. Word has length 106 [2019-09-09 05:55:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:23,205 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 398 transitions. [2019-09-09 05:55:23,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 398 transitions. [2019-09-09 05:55:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:55:23,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:23,206 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:23,206 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:23,207 INFO L82 PathProgramCache]: Analyzing trace with hash -214368275, now seen corresponding path program 1 times [2019-09-09 05:55:23,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:23,266 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:23,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:23,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:23,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:23,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:23,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:23,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:23,269 INFO L87 Difference]: Start difference. First operand 268 states and 398 transitions. Second operand 4 states. [2019-09-09 05:55:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:23,630 INFO L93 Difference]: Finished difference Result 317 states and 469 transitions. [2019-09-09 05:55:23,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:23,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-09 05:55:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:23,632 INFO L225 Difference]: With dead ends: 317 [2019-09-09 05:55:23,632 INFO L226 Difference]: Without dead ends: 317 [2019-09-09 05:55:23,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-09 05:55:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 268. [2019-09-09 05:55:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-09 05:55:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 397 transitions. [2019-09-09 05:55:23,639 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 397 transitions. Word has length 110 [2019-09-09 05:55:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:23,639 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 397 transitions. [2019-09-09 05:55:23,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 397 transitions. [2019-09-09 05:55:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:55:23,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:23,641 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:23,641 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash -631764881, now seen corresponding path program 1 times [2019-09-09 05:55:23,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:23,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:23,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:23,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:23,723 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-09 05:55:23,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:23,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:23,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:23,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:23,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:23,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:23,725 INFO L87 Difference]: Start difference. First operand 268 states and 397 transitions. Second operand 4 states. [2019-09-09 05:55:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:24,058 INFO L93 Difference]: Finished difference Result 321 states and 477 transitions. [2019-09-09 05:55:24,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:24,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-09 05:55:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:24,061 INFO L225 Difference]: With dead ends: 321 [2019-09-09 05:55:24,061 INFO L226 Difference]: Without dead ends: 321 [2019-09-09 05:55:24,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-09 05:55:24,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 294. [2019-09-09 05:55:24,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 442 transitions. [2019-09-09 05:55:24,067 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 442 transitions. Word has length 110 [2019-09-09 05:55:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:24,068 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 442 transitions. [2019-09-09 05:55:24,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 442 transitions. [2019-09-09 05:55:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-09 05:55:24,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:24,069 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:24,070 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:24,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1079792269, now seen corresponding path program 1 times [2019-09-09 05:55:24,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:24,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:24,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:24,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:24,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:24,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:24,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:24,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:24,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:24,145 INFO L87 Difference]: Start difference. First operand 294 states and 442 transitions. Second operand 4 states. [2019-09-09 05:55:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:24,496 INFO L93 Difference]: Finished difference Result 343 states and 513 transitions. [2019-09-09 05:55:24,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:24,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-09 05:55:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:24,499 INFO L225 Difference]: With dead ends: 343 [2019-09-09 05:55:24,499 INFO L226 Difference]: Without dead ends: 343 [2019-09-09 05:55:24,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-09 05:55:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 294. [2019-09-09 05:55:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 441 transitions. [2019-09-09 05:55:24,505 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 441 transitions. Word has length 113 [2019-09-09 05:55:24,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:24,505 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 441 transitions. [2019-09-09 05:55:24,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 441 transitions. [2019-09-09 05:55:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-09 05:55:24,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:24,507 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:24,507 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:24,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:24,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1649875916, now seen corresponding path program 1 times [2019-09-09 05:55:24,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:24,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:24,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:24,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:24,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:24,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:24,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:24,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:24,584 INFO L87 Difference]: Start difference. First operand 294 states and 441 transitions. Second operand 4 states. [2019-09-09 05:55:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:24,913 INFO L93 Difference]: Finished difference Result 335 states and 499 transitions. [2019-09-09 05:55:24,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:24,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-09 05:55:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:24,914 INFO L225 Difference]: With dead ends: 335 [2019-09-09 05:55:24,915 INFO L226 Difference]: Without dead ends: 335 [2019-09-09 05:55:24,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-09 05:55:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2019-09-09 05:55:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 440 transitions. [2019-09-09 05:55:24,922 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 440 transitions. Word has length 114 [2019-09-09 05:55:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:24,922 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 440 transitions. [2019-09-09 05:55:24,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 440 transitions. [2019-09-09 05:55:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-09 05:55:24,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:24,924 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:24,924 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:24,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash 365337133, now seen corresponding path program 1 times [2019-09-09 05:55:24,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:24,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:25,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:25,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:25,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:25,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:25,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:25,008 INFO L87 Difference]: Start difference. First operand 294 states and 440 transitions. Second operand 4 states. [2019-09-09 05:55:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:25,329 INFO L93 Difference]: Finished difference Result 335 states and 498 transitions. [2019-09-09 05:55:25,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:25,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-09 05:55:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:25,332 INFO L225 Difference]: With dead ends: 335 [2019-09-09 05:55:25,332 INFO L226 Difference]: Without dead ends: 335 [2019-09-09 05:55:25,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-09 05:55:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2019-09-09 05:55:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 439 transitions. [2019-09-09 05:55:25,338 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 439 transitions. Word has length 115 [2019-09-09 05:55:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:25,338 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 439 transitions. [2019-09-09 05:55:25,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 439 transitions. [2019-09-09 05:55:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-09 05:55:25,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:25,340 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:25,340 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:25,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:25,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1808480386, now seen corresponding path program 1 times [2019-09-09 05:55:25,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:25,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:25,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:25,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:25,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:25,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:25,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:25,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:25,415 INFO L87 Difference]: Start difference. First operand 294 states and 439 transitions. Second operand 4 states. [2019-09-09 05:55:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:25,739 INFO L93 Difference]: Finished difference Result 335 states and 497 transitions. [2019-09-09 05:55:25,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:25,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-09 05:55:25,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:25,742 INFO L225 Difference]: With dead ends: 335 [2019-09-09 05:55:25,743 INFO L226 Difference]: Without dead ends: 335 [2019-09-09 05:55:25,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-09 05:55:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 294. [2019-09-09 05:55:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 438 transitions. [2019-09-09 05:55:25,748 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 438 transitions. Word has length 116 [2019-09-09 05:55:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:25,749 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 438 transitions. [2019-09-09 05:55:25,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 438 transitions. [2019-09-09 05:55:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-09 05:55:25,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:25,750 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:25,750 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:25,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1131758348, now seen corresponding path program 1 times [2019-09-09 05:55:25,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:25,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:25,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:25,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:25,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:25,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:25,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:25,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:25,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:25,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:25,856 INFO L87 Difference]: Start difference. First operand 294 states and 438 transitions. Second operand 4 states. [2019-09-09 05:55:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:26,146 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2019-09-09 05:55:26,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:26,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-09 05:55:26,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:26,148 INFO L225 Difference]: With dead ends: 333 [2019-09-09 05:55:26,148 INFO L226 Difference]: Without dead ends: 333 [2019-09-09 05:55:26,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:26,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-09 05:55:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 294. [2019-09-09 05:55:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 437 transitions. [2019-09-09 05:55:26,155 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 437 transitions. Word has length 116 [2019-09-09 05:55:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:26,155 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 437 transitions. [2019-09-09 05:55:26,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 437 transitions. [2019-09-09 05:55:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-09 05:55:26,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:26,157 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:26,157 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash 110289475, now seen corresponding path program 1 times [2019-09-09 05:55:26,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:26,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:26,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:26,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:26,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:26,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:26,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:26,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:26,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:26,232 INFO L87 Difference]: Start difference. First operand 294 states and 437 transitions. Second operand 4 states. [2019-09-09 05:55:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:26,531 INFO L93 Difference]: Finished difference Result 331 states and 490 transitions. [2019-09-09 05:55:26,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:26,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-09 05:55:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:26,534 INFO L225 Difference]: With dead ends: 331 [2019-09-09 05:55:26,534 INFO L226 Difference]: Without dead ends: 331 [2019-09-09 05:55:26,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-09 05:55:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 294. [2019-09-09 05:55:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 436 transitions. [2019-09-09 05:55:26,539 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 436 transitions. Word has length 117 [2019-09-09 05:55:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:26,540 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 436 transitions. [2019-09-09 05:55:26,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:26,540 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 436 transitions. [2019-09-09 05:55:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-09 05:55:26,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:26,541 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:26,541 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:26,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:26,542 INFO L82 PathProgramCache]: Analyzing trace with hash 656255755, now seen corresponding path program 1 times [2019-09-09 05:55:26,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:26,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:26,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:26,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:26,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:26,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:26,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:26,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:26,608 INFO L87 Difference]: Start difference. First operand 294 states and 436 transitions. Second operand 4 states. [2019-09-09 05:55:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:26,924 INFO L93 Difference]: Finished difference Result 328 states and 485 transitions. [2019-09-09 05:55:26,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:26,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-09 05:55:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:26,926 INFO L225 Difference]: With dead ends: 328 [2019-09-09 05:55:26,926 INFO L226 Difference]: Without dead ends: 328 [2019-09-09 05:55:26,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-09 05:55:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2019-09-09 05:55:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 435 transitions. [2019-09-09 05:55:26,931 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 435 transitions. Word has length 117 [2019-09-09 05:55:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:26,932 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 435 transitions. [2019-09-09 05:55:26,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 435 transitions. [2019-09-09 05:55:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-09 05:55:26,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:26,933 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:26,933 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:26,933 INFO L82 PathProgramCache]: Analyzing trace with hash 775115364, now seen corresponding path program 1 times [2019-09-09 05:55:26,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:26,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:26,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:26,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:27,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:27,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:27,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:27,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:27,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:27,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:27,002 INFO L87 Difference]: Start difference. First operand 294 states and 435 transitions. Second operand 4 states. [2019-09-09 05:55:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:27,309 INFO L93 Difference]: Finished difference Result 328 states and 484 transitions. [2019-09-09 05:55:27,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:27,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-09 05:55:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:27,311 INFO L225 Difference]: With dead ends: 328 [2019-09-09 05:55:27,311 INFO L226 Difference]: Without dead ends: 328 [2019-09-09 05:55:27,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-09 05:55:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2019-09-09 05:55:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2019-09-09 05:55:27,316 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 120 [2019-09-09 05:55:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:27,316 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2019-09-09 05:55:27,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2019-09-09 05:55:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-09 05:55:27,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:27,318 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:27,318 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash -82969504, now seen corresponding path program 1 times [2019-09-09 05:55:27,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:27,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:27,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:27,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:27,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:27,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:27,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:27,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:27,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:27,403 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand 4 states. [2019-09-09 05:55:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:27,710 INFO L93 Difference]: Finished difference Result 322 states and 474 transitions. [2019-09-09 05:55:27,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:27,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-09 05:55:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:27,714 INFO L225 Difference]: With dead ends: 322 [2019-09-09 05:55:27,714 INFO L226 Difference]: Without dead ends: 322 [2019-09-09 05:55:27,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-09 05:55:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 294. [2019-09-09 05:55:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 433 transitions. [2019-09-09 05:55:27,720 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 433 transitions. Word has length 121 [2019-09-09 05:55:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:27,720 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 433 transitions. [2019-09-09 05:55:27,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 433 transitions. [2019-09-09 05:55:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-09 05:55:27,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:27,722 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:27,722 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:27,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:27,723 INFO L82 PathProgramCache]: Analyzing trace with hash -430689443, now seen corresponding path program 1 times [2019-09-09 05:55:27,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:27,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:27,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:27,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:27,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:27,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:27,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:27,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:27,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:27,817 INFO L87 Difference]: Start difference. First operand 294 states and 433 transitions. Second operand 4 states. [2019-09-09 05:55:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:28,154 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2019-09-09 05:55:28,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:28,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-09 05:55:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:28,157 INFO L225 Difference]: With dead ends: 322 [2019-09-09 05:55:28,157 INFO L226 Difference]: Without dead ends: 322 [2019-09-09 05:55:28,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-09 05:55:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 294. [2019-09-09 05:55:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 432 transitions. [2019-09-09 05:55:28,161 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 432 transitions. Word has length 121 [2019-09-09 05:55:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:28,161 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 432 transitions. [2019-09-09 05:55:28,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 432 transitions. [2019-09-09 05:55:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-09 05:55:28,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:28,163 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:28,163 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash -38534783, now seen corresponding path program 1 times [2019-09-09 05:55:28,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:28,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:28,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:28,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:28,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:28,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:28,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:28,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:28,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:28,241 INFO L87 Difference]: Start difference. First operand 294 states and 432 transitions. Second operand 4 states. [2019-09-09 05:55:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:28,575 INFO L93 Difference]: Finished difference Result 319 states and 468 transitions. [2019-09-09 05:55:28,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:28,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-09 05:55:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:28,578 INFO L225 Difference]: With dead ends: 319 [2019-09-09 05:55:28,578 INFO L226 Difference]: Without dead ends: 319 [2019-09-09 05:55:28,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-09 05:55:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 294. [2019-09-09 05:55:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 431 transitions. [2019-09-09 05:55:28,583 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 431 transitions. Word has length 122 [2019-09-09 05:55:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:28,584 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 431 transitions. [2019-09-09 05:55:28,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 431 transitions. [2019-09-09 05:55:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-09 05:55:28,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:28,585 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:28,585 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:28,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1029717653, now seen corresponding path program 1 times [2019-09-09 05:55:28,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:28,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:28,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:28,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:28,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:28,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:28,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:28,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:28,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:28,662 INFO L87 Difference]: Start difference. First operand 294 states and 431 transitions. Second operand 4 states. [2019-09-09 05:55:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:28,970 INFO L93 Difference]: Finished difference Result 319 states and 467 transitions. [2019-09-09 05:55:28,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:28,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-09 05:55:28,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:28,973 INFO L225 Difference]: With dead ends: 319 [2019-09-09 05:55:28,973 INFO L226 Difference]: Without dead ends: 319 [2019-09-09 05:55:28,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:28,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-09 05:55:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 294. [2019-09-09 05:55:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-09 05:55:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 430 transitions. [2019-09-09 05:55:28,978 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 430 transitions. Word has length 123 [2019-09-09 05:55:28,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:28,978 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 430 transitions. [2019-09-09 05:55:28,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 430 transitions. [2019-09-09 05:55:28,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-09 05:55:28,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:28,979 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-09-09 05:55:28,979 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:28,980 INFO L82 PathProgramCache]: Analyzing trace with hash -785927715, now seen corresponding path program 1 times [2019-09-09 05:55:28,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:28,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:28,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:28,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-09 05:55:29,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:29,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:29,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:29,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:29,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:29,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:29,044 INFO L87 Difference]: Start difference. First operand 294 states and 430 transitions. Second operand 4 states. [2019-09-09 05:55:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:29,391 INFO L93 Difference]: Finished difference Result 366 states and 541 transitions. [2019-09-09 05:55:29,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:29,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-09 05:55:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:29,393 INFO L225 Difference]: With dead ends: 366 [2019-09-09 05:55:29,393 INFO L226 Difference]: Without dead ends: 366 [2019-09-09 05:55:29,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-09 05:55:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 326. [2019-09-09 05:55:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-09 05:55:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 487 transitions. [2019-09-09 05:55:29,399 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 487 transitions. Word has length 123 [2019-09-09 05:55:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:29,399 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 487 transitions. [2019-09-09 05:55:29,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 487 transitions. [2019-09-09 05:55:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-09 05:55:29,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:29,401 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:29,401 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:29,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205657, now seen corresponding path program 1 times [2019-09-09 05:55:29,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:29,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:29,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:29,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:29,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:29,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:29,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:29,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:29,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:29,482 INFO L87 Difference]: Start difference. First operand 326 states and 487 transitions. Second operand 4 states. [2019-09-09 05:55:29,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:29,778 INFO L93 Difference]: Finished difference Result 348 states and 519 transitions. [2019-09-09 05:55:29,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:29,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-09 05:55:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:29,782 INFO L225 Difference]: With dead ends: 348 [2019-09-09 05:55:29,782 INFO L226 Difference]: Without dead ends: 348 [2019-09-09 05:55:29,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-09 05:55:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 326. [2019-09-09 05:55:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-09 05:55:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 486 transitions. [2019-09-09 05:55:29,788 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 486 transitions. Word has length 124 [2019-09-09 05:55:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:29,788 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 486 transitions. [2019-09-09 05:55:29,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 486 transitions. [2019-09-09 05:55:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-09 05:55:29,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:29,790 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1] [2019-09-09 05:55:29,790 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:29,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1369279331, now seen corresponding path program 1 times [2019-09-09 05:55:29,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:29,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:29,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:29,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:29,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:29,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:29,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:29,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:29,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:29,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:29,853 INFO L87 Difference]: Start difference. First operand 326 states and 486 transitions. Second operand 4 states. [2019-09-09 05:55:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:30,289 INFO L93 Difference]: Finished difference Result 436 states and 657 transitions. [2019-09-09 05:55:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:30,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-09 05:55:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:30,291 INFO L225 Difference]: With dead ends: 436 [2019-09-09 05:55:30,291 INFO L226 Difference]: Without dead ends: 436 [2019-09-09 05:55:30,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:30,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-09 05:55:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 365. [2019-09-09 05:55:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-09-09 05:55:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 557 transitions. [2019-09-09 05:55:30,297 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 557 transitions. Word has length 124 [2019-09-09 05:55:30,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:30,297 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 557 transitions. [2019-09-09 05:55:30,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 557 transitions. [2019-09-09 05:55:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-09 05:55:30,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:30,299 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:30,299 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:30,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1816097254, now seen corresponding path program 1 times [2019-09-09 05:55:30,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:30,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:30,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:30,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:30,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:30,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:30,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:30,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:30,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:30,361 INFO L87 Difference]: Start difference. First operand 365 states and 557 transitions. Second operand 4 states. [2019-09-09 05:55:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:30,654 INFO L93 Difference]: Finished difference Result 392 states and 591 transitions. [2019-09-09 05:55:30,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:30,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-09 05:55:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:30,657 INFO L225 Difference]: With dead ends: 392 [2019-09-09 05:55:30,657 INFO L226 Difference]: Without dead ends: 392 [2019-09-09 05:55:30,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-09 05:55:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 365. [2019-09-09 05:55:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-09-09 05:55:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 556 transitions. [2019-09-09 05:55:30,661 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 556 transitions. Word has length 125 [2019-09-09 05:55:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:30,662 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 556 transitions. [2019-09-09 05:55:30,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 556 transitions. [2019-09-09 05:55:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-09 05:55:30,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:30,663 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1] [2019-09-09 05:55:30,663 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:30,664 INFO L82 PathProgramCache]: Analyzing trace with hash 639566481, now seen corresponding path program 1 times [2019-09-09 05:55:30,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:30,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:30,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:30,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:30,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:30,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:30,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:30,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:30,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:30,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:30,728 INFO L87 Difference]: Start difference. First operand 365 states and 556 transitions. Second operand 4 states. [2019-09-09 05:55:31,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:31,120 INFO L93 Difference]: Finished difference Result 428 states and 644 transitions. [2019-09-09 05:55:31,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:31,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-09 05:55:31,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:31,123 INFO L225 Difference]: With dead ends: 428 [2019-09-09 05:55:31,123 INFO L226 Difference]: Without dead ends: 428 [2019-09-09 05:55:31,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-09-09 05:55:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 364. [2019-09-09 05:55:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-09 05:55:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 555 transitions. [2019-09-09 05:55:31,127 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 555 transitions. Word has length 125 [2019-09-09 05:55:31,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:31,128 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 555 transitions. [2019-09-09 05:55:31,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 555 transitions. [2019-09-09 05:55:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:55:31,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:31,129 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:31,129 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:31,129 INFO L82 PathProgramCache]: Analyzing trace with hash -237737633, now seen corresponding path program 1 times [2019-09-09 05:55:31,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:31,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:31,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:31,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:31,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:31,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:31,189 INFO L87 Difference]: Start difference. First operand 364 states and 555 transitions. Second operand 4 states. [2019-09-09 05:55:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:31,465 INFO L93 Difference]: Finished difference Result 391 states and 589 transitions. [2019-09-09 05:55:31,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:31,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-09 05:55:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:31,467 INFO L225 Difference]: With dead ends: 391 [2019-09-09 05:55:31,467 INFO L226 Difference]: Without dead ends: 391 [2019-09-09 05:55:31,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-09 05:55:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 364. [2019-09-09 05:55:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-09 05:55:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 554 transitions. [2019-09-09 05:55:31,472 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 554 transitions. Word has length 126 [2019-09-09 05:55:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:31,473 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 554 transitions. [2019-09-09 05:55:31,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 554 transitions. [2019-09-09 05:55:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:55:31,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:31,474 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:31,474 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:31,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1999708181, now seen corresponding path program 1 times [2019-09-09 05:55:31,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:31,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:31,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:31,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:31,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:31,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:31,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:31,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:31,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:31,535 INFO L87 Difference]: Start difference. First operand 364 states and 554 transitions. Second operand 4 states. [2019-09-09 05:55:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:31,823 INFO L93 Difference]: Finished difference Result 391 states and 588 transitions. [2019-09-09 05:55:31,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:31,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-09 05:55:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:31,826 INFO L225 Difference]: With dead ends: 391 [2019-09-09 05:55:31,826 INFO L226 Difference]: Without dead ends: 391 [2019-09-09 05:55:31,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-09 05:55:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 364. [2019-09-09 05:55:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-09 05:55:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2019-09-09 05:55:31,831 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 127 [2019-09-09 05:55:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:31,831 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2019-09-09 05:55:31,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:31,832 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2019-09-09 05:55:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-09 05:55:31,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:31,833 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:31,833 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:31,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:31,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1100977798, now seen corresponding path program 1 times [2019-09-09 05:55:31,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:31,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:31,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:31,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:31,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:31,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:31,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:31,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:31,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:31,894 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand 4 states. [2019-09-09 05:55:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:32,172 INFO L93 Difference]: Finished difference Result 381 states and 575 transitions. [2019-09-09 05:55:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:32,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-09 05:55:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:32,175 INFO L225 Difference]: With dead ends: 381 [2019-09-09 05:55:32,175 INFO L226 Difference]: Without dead ends: 381 [2019-09-09 05:55:32,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:32,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-09-09 05:55:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 364. [2019-09-09 05:55:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-09 05:55:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 552 transitions. [2019-09-09 05:55:32,179 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 552 transitions. Word has length 128 [2019-09-09 05:55:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:32,179 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 552 transitions. [2019-09-09 05:55:32,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 552 transitions. [2019-09-09 05:55:32,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-09 05:55:32,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:32,181 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:32,181 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:32,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:32,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1151985996, now seen corresponding path program 1 times [2019-09-09 05:55:32,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:32,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:32,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:32,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:32,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:55:32,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:32,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:55:32,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:55:32,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:32,252 INFO L87 Difference]: Start difference. First operand 364 states and 552 transitions. Second operand 3 states. [2019-09-09 05:55:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:32,327 INFO L93 Difference]: Finished difference Result 699 states and 1056 transitions. [2019-09-09 05:55:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:55:32,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-09 05:55:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:32,331 INFO L225 Difference]: With dead ends: 699 [2019-09-09 05:55:32,332 INFO L226 Difference]: Without dead ends: 699 [2019-09-09 05:55:32,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:55:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-09-09 05:55:32,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2019-09-09 05:55:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-09 05:55:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1055 transitions. [2019-09-09 05:55:32,343 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1055 transitions. Word has length 129 [2019-09-09 05:55:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:32,343 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1055 transitions. [2019-09-09 05:55:32,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:55:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1055 transitions. [2019-09-09 05:55:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-09 05:55:32,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:32,346 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:32,346 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:32,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash -369166995, now seen corresponding path program 1 times [2019-09-09 05:55:32,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:32,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:32,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:32,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:32,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:32,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:32,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:32,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:32,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:32,448 INFO L87 Difference]: Start difference. First operand 697 states and 1055 transitions. Second operand 4 states. [2019-09-09 05:55:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:32,879 INFO L93 Difference]: Finished difference Result 913 states and 1383 transitions. [2019-09-09 05:55:32,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:32,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-09 05:55:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:32,885 INFO L225 Difference]: With dead ends: 913 [2019-09-09 05:55:32,885 INFO L226 Difference]: Without dead ends: 913 [2019-09-09 05:55:32,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-09-09 05:55:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 775. [2019-09-09 05:55:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-09-09 05:55:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1197 transitions. [2019-09-09 05:55:32,892 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1197 transitions. Word has length 131 [2019-09-09 05:55:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:32,892 INFO L475 AbstractCegarLoop]: Abstraction has 775 states and 1197 transitions. [2019-09-09 05:55:32,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1197 transitions. [2019-09-09 05:55:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-09 05:55:32,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:32,893 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:32,894 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:32,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1712662073, now seen corresponding path program 1 times [2019-09-09 05:55:32,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:32,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:32,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:32,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:32,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:32,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:32,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:32,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:32,963 INFO L87 Difference]: Start difference. First operand 775 states and 1197 transitions. Second operand 4 states. [2019-09-09 05:55:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:33,394 INFO L93 Difference]: Finished difference Result 901 states and 1366 transitions. [2019-09-09 05:55:33,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:33,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-09-09 05:55:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:33,399 INFO L225 Difference]: With dead ends: 901 [2019-09-09 05:55:33,399 INFO L226 Difference]: Without dead ends: 901 [2019-09-09 05:55:33,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-09-09 05:55:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 697. [2019-09-09 05:55:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-09 05:55:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1055 transitions. [2019-09-09 05:55:33,406 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1055 transitions. Word has length 132 [2019-09-09 05:55:33,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:33,406 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1055 transitions. [2019-09-09 05:55:33,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:33,406 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1055 transitions. [2019-09-09 05:55:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-09 05:55:33,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:33,408 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:33,408 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1341406511, now seen corresponding path program 1 times [2019-09-09 05:55:33,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:33,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:33,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:33,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:33,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:33,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:33,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:33,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:33,485 INFO L87 Difference]: Start difference. First operand 697 states and 1055 transitions. Second operand 4 states. [2019-09-09 05:55:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:33,771 INFO L93 Difference]: Finished difference Result 729 states and 1097 transitions. [2019-09-09 05:55:33,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:33,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-09 05:55:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:33,775 INFO L225 Difference]: With dead ends: 729 [2019-09-09 05:55:33,775 INFO L226 Difference]: Without dead ends: 729 [2019-09-09 05:55:33,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-09-09 05:55:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2019-09-09 05:55:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-09 05:55:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1061 transitions. [2019-09-09 05:55:33,782 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1061 transitions. Word has length 133 [2019-09-09 05:55:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:33,782 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 1061 transitions. [2019-09-09 05:55:33,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1061 transitions. [2019-09-09 05:55:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-09 05:55:33,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:33,784 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:33,784 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2100763372, now seen corresponding path program 1 times [2019-09-09 05:55:33,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:33,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:33,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:33,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:55:33,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:33,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:33,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:33,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:33,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:33,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:33,844 INFO L87 Difference]: Start difference. First operand 703 states and 1061 transitions. Second operand 4 states. [2019-09-09 05:55:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:34,113 INFO L93 Difference]: Finished difference Result 737 states and 1105 transitions. [2019-09-09 05:55:34,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:34,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-09 05:55:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:34,118 INFO L225 Difference]: With dead ends: 737 [2019-09-09 05:55:34,118 INFO L226 Difference]: Without dead ends: 737 [2019-09-09 05:55:34,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-09 05:55:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 703. [2019-09-09 05:55:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-09 05:55:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1059 transitions. [2019-09-09 05:55:34,126 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1059 transitions. Word has length 138 [2019-09-09 05:55:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:34,126 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 1059 transitions. [2019-09-09 05:55:34,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1059 transitions. [2019-09-09 05:55:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-09 05:55:34,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:34,128 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:34,128 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash -663860235, now seen corresponding path program 1 times [2019-09-09 05:55:34,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:34,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:34,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:34,193 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-09 05:55:34,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:34,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:34,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:34,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:34,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:34,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:34,194 INFO L87 Difference]: Start difference. First operand 703 states and 1059 transitions. Second operand 4 states. [2019-09-09 05:55:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:34,540 INFO L93 Difference]: Finished difference Result 829 states and 1253 transitions. [2019-09-09 05:55:34,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:34,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-09 05:55:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:34,545 INFO L225 Difference]: With dead ends: 829 [2019-09-09 05:55:34,546 INFO L226 Difference]: Without dead ends: 829 [2019-09-09 05:55:34,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-09 05:55:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 759. [2019-09-09 05:55:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-09 05:55:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1157 transitions. [2019-09-09 05:55:34,553 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1157 transitions. Word has length 138 [2019-09-09 05:55:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:34,554 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1157 transitions. [2019-09-09 05:55:34,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1157 transitions. [2019-09-09 05:55:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-09 05:55:34,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:34,557 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:34,557 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:34,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:34,557 INFO L82 PathProgramCache]: Analyzing trace with hash 462308518, now seen corresponding path program 1 times [2019-09-09 05:55:34,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:34,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:34,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:34,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:34,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:34,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:34,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:34,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:34,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:34,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:34,642 INFO L87 Difference]: Start difference. First operand 759 states and 1157 transitions. Second operand 4 states. [2019-09-09 05:55:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:35,037 INFO L93 Difference]: Finished difference Result 963 states and 1466 transitions. [2019-09-09 05:55:35,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:35,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-09 05:55:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:35,043 INFO L225 Difference]: With dead ends: 963 [2019-09-09 05:55:35,043 INFO L226 Difference]: Without dead ends: 963 [2019-09-09 05:55:35,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-09 05:55:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 783. [2019-09-09 05:55:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-09 05:55:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1191 transitions. [2019-09-09 05:55:35,051 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1191 transitions. Word has length 139 [2019-09-09 05:55:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:35,051 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1191 transitions. [2019-09-09 05:55:35,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1191 transitions. [2019-09-09 05:55:35,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-09 05:55:35,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:35,053 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:35,054 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:35,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:35,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1617694983, now seen corresponding path program 1 times [2019-09-09 05:55:35,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:35,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:35,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:35,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:35,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:55:35,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:35,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:35,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:35,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:35,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:35,128 INFO L87 Difference]: Start difference. First operand 783 states and 1191 transitions. Second operand 4 states. [2019-09-09 05:55:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:35,389 INFO L93 Difference]: Finished difference Result 813 states and 1231 transitions. [2019-09-09 05:55:35,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:35,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-09 05:55:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:35,393 INFO L225 Difference]: With dead ends: 813 [2019-09-09 05:55:35,393 INFO L226 Difference]: Without dead ends: 813 [2019-09-09 05:55:35,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2019-09-09 05:55:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 783. [2019-09-09 05:55:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-09 05:55:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1189 transitions. [2019-09-09 05:55:35,402 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1189 transitions. Word has length 139 [2019-09-09 05:55:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:35,402 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1189 transitions. [2019-09-09 05:55:35,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1189 transitions. [2019-09-09 05:55:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-09 05:55:35,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:35,404 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:35,404 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:35,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:35,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1673364563, now seen corresponding path program 1 times [2019-09-09 05:55:35,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:35,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:35,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:35,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:35,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:35,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:35,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:35,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:35,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:35,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:35,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:35,467 INFO L87 Difference]: Start difference. First operand 783 states and 1189 transitions. Second operand 4 states. [2019-09-09 05:55:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:35,866 INFO L93 Difference]: Finished difference Result 963 states and 1462 transitions. [2019-09-09 05:55:35,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:35,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-09 05:55:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:35,870 INFO L225 Difference]: With dead ends: 963 [2019-09-09 05:55:35,871 INFO L226 Difference]: Without dead ends: 963 [2019-09-09 05:55:35,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-09 05:55:35,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 785. [2019-09-09 05:55:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-09-09 05:55:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1191 transitions. [2019-09-09 05:55:35,879 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1191 transitions. Word has length 140 [2019-09-09 05:55:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:35,879 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 1191 transitions. [2019-09-09 05:55:35,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:35,879 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1191 transitions. [2019-09-09 05:55:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-09 05:55:35,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:35,880 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:35,880 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:35,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:35,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1114334113, now seen corresponding path program 1 times [2019-09-09 05:55:35,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:35,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:35,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:35,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:35,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:35,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:35,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:35,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:35,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:35,939 INFO L87 Difference]: Start difference. First operand 785 states and 1191 transitions. Second operand 4 states. [2019-09-09 05:55:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:36,328 INFO L93 Difference]: Finished difference Result 963 states and 1460 transitions. [2019-09-09 05:55:36,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:36,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-09 05:55:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:36,334 INFO L225 Difference]: With dead ends: 963 [2019-09-09 05:55:36,334 INFO L226 Difference]: Without dead ends: 963 [2019-09-09 05:55:36,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-09 05:55:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 787. [2019-09-09 05:55:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-09-09 05:55:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1193 transitions. [2019-09-09 05:55:36,344 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1193 transitions. Word has length 141 [2019-09-09 05:55:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:36,344 INFO L475 AbstractCegarLoop]: Abstraction has 787 states and 1193 transitions. [2019-09-09 05:55:36,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1193 transitions. [2019-09-09 05:55:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-09 05:55:36,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:36,346 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:36,346 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:36,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1517197166, now seen corresponding path program 1 times [2019-09-09 05:55:36,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:36,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:36,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:36,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:36,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:36,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:36,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:36,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:36,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:36,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:36,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:36,408 INFO L87 Difference]: Start difference. First operand 787 states and 1193 transitions. Second operand 4 states. [2019-09-09 05:55:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:36,793 INFO L93 Difference]: Finished difference Result 943 states and 1434 transitions. [2019-09-09 05:55:36,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:36,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-09 05:55:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:36,796 INFO L225 Difference]: With dead ends: 943 [2019-09-09 05:55:36,796 INFO L226 Difference]: Without dead ends: 943 [2019-09-09 05:55:36,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-09 05:55:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 789. [2019-09-09 05:55:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-09 05:55:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1195 transitions. [2019-09-09 05:55:36,807 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1195 transitions. Word has length 142 [2019-09-09 05:55:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:36,807 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1195 transitions. [2019-09-09 05:55:36,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1195 transitions. [2019-09-09 05:55:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-09 05:55:36,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:36,809 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:36,809 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:36,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:36,809 INFO L82 PathProgramCache]: Analyzing trace with hash -895597220, now seen corresponding path program 1 times [2019-09-09 05:55:36,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:36,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:36,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:36,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:36,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:36,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:36,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:36,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:36,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:36,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:36,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:36,876 INFO L87 Difference]: Start difference. First operand 789 states and 1195 transitions. Second operand 4 states. [2019-09-09 05:55:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:37,310 INFO L93 Difference]: Finished difference Result 963 states and 1456 transitions. [2019-09-09 05:55:37,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:37,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-09 05:55:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:37,314 INFO L225 Difference]: With dead ends: 963 [2019-09-09 05:55:37,314 INFO L226 Difference]: Without dead ends: 963 [2019-09-09 05:55:37,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-09 05:55:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2019-09-09 05:55:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-09 05:55:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1193 transitions. [2019-09-09 05:55:37,323 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1193 transitions. Word has length 146 [2019-09-09 05:55:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:37,323 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1193 transitions. [2019-09-09 05:55:37,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1193 transitions. [2019-09-09 05:55:37,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-09 05:55:37,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:37,324 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:37,325 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:37,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:37,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1767007651, now seen corresponding path program 1 times [2019-09-09 05:55:37,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:37,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:37,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:37,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:37,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:37,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:37,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:37,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:37,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:37,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:37,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:37,395 INFO L87 Difference]: Start difference. First operand 789 states and 1193 transitions. Second operand 4 states. [2019-09-09 05:55:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:37,819 INFO L93 Difference]: Finished difference Result 963 states and 1454 transitions. [2019-09-09 05:55:37,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:37,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-09 05:55:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:37,822 INFO L225 Difference]: With dead ends: 963 [2019-09-09 05:55:37,822 INFO L226 Difference]: Without dead ends: 963 [2019-09-09 05:55:37,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-09 05:55:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2019-09-09 05:55:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-09 05:55:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1191 transitions. [2019-09-09 05:55:37,831 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1191 transitions. Word has length 147 [2019-09-09 05:55:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:37,831 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1191 transitions. [2019-09-09 05:55:37,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1191 transitions. [2019-09-09 05:55:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-09 05:55:37,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:37,833 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:37,833 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:37,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1836977879, now seen corresponding path program 1 times [2019-09-09 05:55:37,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:37,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:37,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:37,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:37,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:37,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:37,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:37,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:37,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:37,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:37,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:37,904 INFO L87 Difference]: Start difference. First operand 789 states and 1191 transitions. Second operand 4 states. [2019-09-09 05:55:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:38,319 INFO L93 Difference]: Finished difference Result 963 states and 1452 transitions. [2019-09-09 05:55:38,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:38,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-09 05:55:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:38,322 INFO L225 Difference]: With dead ends: 963 [2019-09-09 05:55:38,322 INFO L226 Difference]: Without dead ends: 963 [2019-09-09 05:55:38,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-09 05:55:38,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 789. [2019-09-09 05:55:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-09-09 05:55:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1189 transitions. [2019-09-09 05:55:38,331 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1189 transitions. Word has length 148 [2019-09-09 05:55:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:38,331 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1189 transitions. [2019-09-09 05:55:38,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1189 transitions. [2019-09-09 05:55:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-09 05:55:38,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:38,332 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:38,332 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:38,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1850649864, now seen corresponding path program 1 times [2019-09-09 05:55:38,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:38,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:38,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:38,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:38,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:38,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:38,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:38,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:38,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:38,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:38,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:38,406 INFO L87 Difference]: Start difference. First operand 789 states and 1189 transitions. Second operand 4 states. [2019-09-09 05:55:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:38,799 INFO L93 Difference]: Finished difference Result 943 states and 1426 transitions. [2019-09-09 05:55:38,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:38,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-09 05:55:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:38,802 INFO L225 Difference]: With dead ends: 943 [2019-09-09 05:55:38,802 INFO L226 Difference]: Without dead ends: 943 [2019-09-09 05:55:38,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-09 05:55:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 759. [2019-09-09 05:55:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-09 05:55:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1147 transitions. [2019-09-09 05:55:38,814 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1147 transitions. Word has length 149 [2019-09-09 05:55:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:38,814 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1147 transitions. [2019-09-09 05:55:38,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1147 transitions. [2019-09-09 05:55:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-09 05:55:38,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:38,815 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:38,816 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:38,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1097081734, now seen corresponding path program 1 times [2019-09-09 05:55:38,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:38,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:38,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:38,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:38,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:38,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:38,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:38,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:38,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:38,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:38,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:38,869 INFO L87 Difference]: Start difference. First operand 759 states and 1147 transitions. Second operand 4 states. [2019-09-09 05:55:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:39,235 INFO L93 Difference]: Finished difference Result 943 states and 1424 transitions. [2019-09-09 05:55:39,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:39,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-09 05:55:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:39,238 INFO L225 Difference]: With dead ends: 943 [2019-09-09 05:55:39,238 INFO L226 Difference]: Without dead ends: 943 [2019-09-09 05:55:39,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-09 05:55:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 815. [2019-09-09 05:55:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-09-09 05:55:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1237 transitions. [2019-09-09 05:55:39,257 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1237 transitions. Word has length 149 [2019-09-09 05:55:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:39,257 INFO L475 AbstractCegarLoop]: Abstraction has 815 states and 1237 transitions. [2019-09-09 05:55:39,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1237 transitions. [2019-09-09 05:55:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:55:39,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:39,259 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:39,260 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:39,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2109117965, now seen corresponding path program 1 times [2019-09-09 05:55:39,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:39,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:39,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:39,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:39,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:39,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:39,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:39,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:39,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:39,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:39,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:39,339 INFO L87 Difference]: Start difference. First operand 815 states and 1237 transitions. Second operand 4 states. [2019-09-09 05:55:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:39,678 INFO L93 Difference]: Finished difference Result 927 states and 1396 transitions. [2019-09-09 05:55:39,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:39,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-09 05:55:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:39,681 INFO L225 Difference]: With dead ends: 927 [2019-09-09 05:55:39,681 INFO L226 Difference]: Without dead ends: 927 [2019-09-09 05:55:39,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-09 05:55:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 817. [2019-09-09 05:55:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-09 05:55:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1239 transitions. [2019-09-09 05:55:39,688 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1239 transitions. Word has length 150 [2019-09-09 05:55:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:39,688 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1239 transitions. [2019-09-09 05:55:39,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1239 transitions. [2019-09-09 05:55:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-09 05:55:39,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:39,690 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:39,690 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:39,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash -47487008, now seen corresponding path program 1 times [2019-09-09 05:55:39,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:39,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:39,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:39,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:39,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:55:39,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:39,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:39,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:39,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:39,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:39,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:39,765 INFO L87 Difference]: Start difference. First operand 817 states and 1239 transitions. Second operand 4 states. [2019-09-09 05:55:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:40,109 INFO L93 Difference]: Finished difference Result 927 states and 1394 transitions. [2019-09-09 05:55:40,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:40,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-09 05:55:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:40,113 INFO L225 Difference]: With dead ends: 927 [2019-09-09 05:55:40,114 INFO L226 Difference]: Without dead ends: 927 [2019-09-09 05:55:40,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-09 05:55:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 817. [2019-09-09 05:55:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-09-09 05:55:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1237 transitions. [2019-09-09 05:55:40,123 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1237 transitions. Word has length 152 [2019-09-09 05:55:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:40,123 INFO L475 AbstractCegarLoop]: Abstraction has 817 states and 1237 transitions. [2019-09-09 05:55:40,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1237 transitions. [2019-09-09 05:55:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:55:40,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:40,125 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:40,126 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash -848144508, now seen corresponding path program 1 times [2019-09-09 05:55:40,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:40,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:40,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:40,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:40,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:40,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:40,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:40,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:40,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:40,207 INFO L87 Difference]: Start difference. First operand 817 states and 1237 transitions. Second operand 4 states. [2019-09-09 05:55:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:40,529 INFO L93 Difference]: Finished difference Result 921 states and 1384 transitions. [2019-09-09 05:55:40,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:40,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:55:40,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:40,531 INFO L225 Difference]: With dead ends: 921 [2019-09-09 05:55:40,531 INFO L226 Difference]: Without dead ends: 921 [2019-09-09 05:55:40,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-09-09 05:55:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 823. [2019-09-09 05:55:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-09 05:55:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1247 transitions. [2019-09-09 05:55:40,539 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1247 transitions. Word has length 153 [2019-09-09 05:55:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:40,540 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1247 transitions. [2019-09-09 05:55:40,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1247 transitions. [2019-09-09 05:55:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:55:40,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:40,542 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:40,542 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:40,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:40,542 INFO L82 PathProgramCache]: Analyzing trace with hash -553557357, now seen corresponding path program 1 times [2019-09-09 05:55:40,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:40,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:40,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:40,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:40,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:55:40,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:40,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:40,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:40,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:40,617 INFO L87 Difference]: Start difference. First operand 823 states and 1247 transitions. Second operand 4 states. [2019-09-09 05:55:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:41,007 INFO L93 Difference]: Finished difference Result 917 states and 1378 transitions. [2019-09-09 05:55:41,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:41,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:55:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:41,010 INFO L225 Difference]: With dead ends: 917 [2019-09-09 05:55:41,011 INFO L226 Difference]: Without dead ends: 917 [2019-09-09 05:55:41,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-09 05:55:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 823. [2019-09-09 05:55:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-09 05:55:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1245 transitions. [2019-09-09 05:55:41,020 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1245 transitions. Word has length 153 [2019-09-09 05:55:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:41,020 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1245 transitions. [2019-09-09 05:55:41,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1245 transitions. [2019-09-09 05:55:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 05:55:41,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:41,023 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:41,023 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:41,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:41,023 INFO L82 PathProgramCache]: Analyzing trace with hash 643173844, now seen corresponding path program 1 times [2019-09-09 05:55:41,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:41,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:41,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:41,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:41,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:41,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:41,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:41,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:41,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:41,095 INFO L87 Difference]: Start difference. First operand 823 states and 1245 transitions. Second operand 4 states. [2019-09-09 05:55:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:41,426 INFO L93 Difference]: Finished difference Result 893 states and 1339 transitions. [2019-09-09 05:55:41,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:41,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-09 05:55:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:41,430 INFO L225 Difference]: With dead ends: 893 [2019-09-09 05:55:41,430 INFO L226 Difference]: Without dead ends: 893 [2019-09-09 05:55:41,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:41,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-09 05:55:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2019-09-09 05:55:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-09 05:55:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1243 transitions. [2019-09-09 05:55:41,439 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1243 transitions. Word has length 153 [2019-09-09 05:55:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:41,440 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1243 transitions. [2019-09-09 05:55:41,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1243 transitions. [2019-09-09 05:55:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-09 05:55:41,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:41,442 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:41,442 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:41,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1309744923, now seen corresponding path program 1 times [2019-09-09 05:55:41,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:41,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:41,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:41,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:41,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:41,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:41,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:41,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:41,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:41,520 INFO L87 Difference]: Start difference. First operand 823 states and 1243 transitions. Second operand 4 states. [2019-09-09 05:55:41,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:41,849 INFO L93 Difference]: Finished difference Result 893 states and 1337 transitions. [2019-09-09 05:55:41,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:41,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-09 05:55:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:41,852 INFO L225 Difference]: With dead ends: 893 [2019-09-09 05:55:41,852 INFO L226 Difference]: Without dead ends: 893 [2019-09-09 05:55:41,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-09 05:55:41,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2019-09-09 05:55:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-09 05:55:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1241 transitions. [2019-09-09 05:55:41,860 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1241 transitions. Word has length 154 [2019-09-09 05:55:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:41,860 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1241 transitions. [2019-09-09 05:55:41,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1241 transitions. [2019-09-09 05:55:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-09 05:55:41,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:41,862 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:41,862 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:41,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1167746737, now seen corresponding path program 1 times [2019-09-09 05:55:41,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:41,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:41,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:41,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:41,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:41,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:41,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:41,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:41,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:41,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:41,906 INFO L87 Difference]: Start difference. First operand 823 states and 1241 transitions. Second operand 4 states. [2019-09-09 05:55:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:42,245 INFO L93 Difference]: Finished difference Result 893 states and 1335 transitions. [2019-09-09 05:55:42,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:42,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-09 05:55:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:42,250 INFO L225 Difference]: With dead ends: 893 [2019-09-09 05:55:42,250 INFO L226 Difference]: Without dead ends: 893 [2019-09-09 05:55:42,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-09 05:55:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 823. [2019-09-09 05:55:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-09 05:55:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1239 transitions. [2019-09-09 05:55:42,259 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1239 transitions. Word has length 155 [2019-09-09 05:55:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:42,259 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1239 transitions. [2019-09-09 05:55:42,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1239 transitions. [2019-09-09 05:55:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:55:42,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:42,262 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:42,262 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:42,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:42,263 INFO L82 PathProgramCache]: Analyzing trace with hash 923482300, now seen corresponding path program 1 times [2019-09-09 05:55:42,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:42,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:42,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:42,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:42,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:42,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:42,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:42,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:42,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:42,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:42,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:42,365 INFO L87 Difference]: Start difference. First operand 823 states and 1239 transitions. Second operand 4 states. [2019-09-09 05:55:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:42,738 INFO L93 Difference]: Finished difference Result 943 states and 1408 transitions. [2019-09-09 05:55:42,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:42,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:55:42,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:42,740 INFO L225 Difference]: With dead ends: 943 [2019-09-09 05:55:42,741 INFO L226 Difference]: Without dead ends: 943 [2019-09-09 05:55:42,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-09-09 05:55:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 823. [2019-09-09 05:55:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-09-09 05:55:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1237 transitions. [2019-09-09 05:55:42,748 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1237 transitions. Word has length 156 [2019-09-09 05:55:42,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:42,748 INFO L475 AbstractCegarLoop]: Abstraction has 823 states and 1237 transitions. [2019-09-09 05:55:42,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1237 transitions. [2019-09-09 05:55:42,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:55:42,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:42,750 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:42,751 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:42,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:42,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1170614091, now seen corresponding path program 1 times [2019-09-09 05:55:42,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:42,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:42,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:42,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:42,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:42,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:42,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:42,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:42,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:42,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:42,816 INFO L87 Difference]: Start difference. First operand 823 states and 1237 transitions. Second operand 4 states. [2019-09-09 05:55:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:43,152 INFO L93 Difference]: Finished difference Result 917 states and 1368 transitions. [2019-09-09 05:55:43,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:43,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:55:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:43,154 INFO L225 Difference]: With dead ends: 917 [2019-09-09 05:55:43,155 INFO L226 Difference]: Without dead ends: 917 [2019-09-09 05:55:43,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-09 05:55:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 825. [2019-09-09 05:55:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-09 05:55:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1239 transitions. [2019-09-09 05:55:43,162 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1239 transitions. Word has length 156 [2019-09-09 05:55:43,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:43,162 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1239 transitions. [2019-09-09 05:55:43,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1239 transitions. [2019-09-09 05:55:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:55:43,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:43,164 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:43,164 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:43,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash -507832448, now seen corresponding path program 1 times [2019-09-09 05:55:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:43,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:43,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:43,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:55:43,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:43,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:43,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:43,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:43,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:43,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:43,209 INFO L87 Difference]: Start difference. First operand 825 states and 1239 transitions. Second operand 4 states. [2019-09-09 05:55:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:43,536 INFO L93 Difference]: Finished difference Result 875 states and 1309 transitions. [2019-09-09 05:55:43,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:43,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:55:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:43,538 INFO L225 Difference]: With dead ends: 875 [2019-09-09 05:55:43,538 INFO L226 Difference]: Without dead ends: 875 [2019-09-09 05:55:43,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-09-09 05:55:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 825. [2019-09-09 05:55:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-09 05:55:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1237 transitions. [2019-09-09 05:55:43,546 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1237 transitions. Word has length 156 [2019-09-09 05:55:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:43,546 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1237 transitions. [2019-09-09 05:55:43,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1237 transitions. [2019-09-09 05:55:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:55:43,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:43,548 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:43,548 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:43,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:43,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1099234173, now seen corresponding path program 1 times [2019-09-09 05:55:43,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:43,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:43,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:43,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:43,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:43,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:43,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:43,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:43,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:43,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:43,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:43,621 INFO L87 Difference]: Start difference. First operand 825 states and 1237 transitions. Second operand 4 states. [2019-09-09 05:55:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:43,970 INFO L93 Difference]: Finished difference Result 927 states and 1376 transitions. [2019-09-09 05:55:43,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:43,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:55:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:43,972 INFO L225 Difference]: With dead ends: 927 [2019-09-09 05:55:43,973 INFO L226 Difference]: Without dead ends: 927 [2019-09-09 05:55:43,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:43,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-09 05:55:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 825. [2019-09-09 05:55:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-09 05:55:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1235 transitions. [2019-09-09 05:55:43,980 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1235 transitions. Word has length 157 [2019-09-09 05:55:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:43,980 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1235 transitions. [2019-09-09 05:55:43,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1235 transitions. [2019-09-09 05:55:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:55:43,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:43,982 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:43,982 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:43,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:43,982 INFO L82 PathProgramCache]: Analyzing trace with hash -707410855, now seen corresponding path program 1 times [2019-09-09 05:55:43,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:43,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:43,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:43,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:43,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:44,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:44,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:44,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:44,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:44,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:44,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:44,050 INFO L87 Difference]: Start difference. First operand 825 states and 1235 transitions. Second operand 4 states. [2019-09-09 05:55:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:44,371 INFO L93 Difference]: Finished difference Result 905 states and 1346 transitions. [2019-09-09 05:55:44,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:44,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:55:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:44,373 INFO L225 Difference]: With dead ends: 905 [2019-09-09 05:55:44,373 INFO L226 Difference]: Without dead ends: 905 [2019-09-09 05:55:44,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-09 05:55:44,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 827. [2019-09-09 05:55:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-09-09 05:55:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1237 transitions. [2019-09-09 05:55:44,381 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1237 transitions. Word has length 157 [2019-09-09 05:55:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:44,381 INFO L475 AbstractCegarLoop]: Abstraction has 827 states and 1237 transitions. [2019-09-09 05:55:44,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1237 transitions. [2019-09-09 05:55:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:55:44,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:44,383 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:44,383 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:44,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:44,383 INFO L82 PathProgramCache]: Analyzing trace with hash -631484072, now seen corresponding path program 1 times [2019-09-09 05:55:44,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:44,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:44,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:44,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:44,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:44,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:44,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:44,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:44,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:44,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:44,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:44,450 INFO L87 Difference]: Start difference. First operand 827 states and 1237 transitions. Second operand 4 states. [2019-09-09 05:55:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:44,787 INFO L93 Difference]: Finished difference Result 905 states and 1344 transitions. [2019-09-09 05:55:44,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:44,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:55:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:44,789 INFO L225 Difference]: With dead ends: 905 [2019-09-09 05:55:44,790 INFO L226 Difference]: Without dead ends: 905 [2019-09-09 05:55:44,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-09 05:55:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 829. [2019-09-09 05:55:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-09-09 05:55:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1239 transitions. [2019-09-09 05:55:44,799 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1239 transitions. Word has length 157 [2019-09-09 05:55:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:44,799 INFO L475 AbstractCegarLoop]: Abstraction has 829 states and 1239 transitions. [2019-09-09 05:55:44,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1239 transitions. [2019-09-09 05:55:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:55:44,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:44,801 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-09 05:55:44,801 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:44,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1792700758, now seen corresponding path program 1 times [2019-09-09 05:55:44,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:44,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:44,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:44,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:44,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:44,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:44,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:44,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:44,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:44,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:44,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:44,864 INFO L87 Difference]: Start difference. First operand 829 states and 1239 transitions. Second operand 4 states. [2019-09-09 05:55:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:45,193 INFO L93 Difference]: Finished difference Result 899 states and 1335 transitions. [2019-09-09 05:55:45,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:45,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:55:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:45,195 INFO L225 Difference]: With dead ends: 899 [2019-09-09 05:55:45,196 INFO L226 Difference]: Without dead ends: 899 [2019-09-09 05:55:45,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-09 05:55:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 831. [2019-09-09 05:55:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-09 05:55:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1241 transitions. [2019-09-09 05:55:45,205 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1241 transitions. Word has length 158 [2019-09-09 05:55:45,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:45,206 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1241 transitions. [2019-09-09 05:55:45,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1241 transitions. [2019-09-09 05:55:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:55:45,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:45,208 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:45,208 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash -607600918, now seen corresponding path program 1 times [2019-09-09 05:55:45,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:45,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:45,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:45,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:55:45,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:45,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:45,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:45,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:45,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:45,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:45,288 INFO L87 Difference]: Start difference. First operand 831 states and 1241 transitions. Second operand 4 states. [2019-09-09 05:55:45,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:45,645 INFO L93 Difference]: Finished difference Result 927 states and 1368 transitions. [2019-09-09 05:55:45,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:45,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:55:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:45,647 INFO L225 Difference]: With dead ends: 927 [2019-09-09 05:55:45,647 INFO L226 Difference]: Without dead ends: 927 [2019-09-09 05:55:45,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-09 05:55:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 831. [2019-09-09 05:55:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-09 05:55:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1239 transitions. [2019-09-09 05:55:45,655 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1239 transitions. Word has length 159 [2019-09-09 05:55:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:45,655 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1239 transitions. [2019-09-09 05:55:45,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1239 transitions. [2019-09-09 05:55:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:55:45,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:45,657 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-09 05:55:45,657 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:45,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:45,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1634319792, now seen corresponding path program 1 times [2019-09-09 05:55:45,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:45,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:45,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:45,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:45,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:45,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:45,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:45,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:45,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:45,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:45,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:45,705 INFO L87 Difference]: Start difference. First operand 831 states and 1239 transitions. Second operand 4 states. [2019-09-09 05:55:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:46,023 INFO L93 Difference]: Finished difference Result 899 states and 1331 transitions. [2019-09-09 05:55:46,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:46,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:55:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:46,024 INFO L225 Difference]: With dead ends: 899 [2019-09-09 05:55:46,024 INFO L226 Difference]: Without dead ends: 899 [2019-09-09 05:55:46,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-09 05:55:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 833. [2019-09-09 05:55:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-09 05:55:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1241 transitions. [2019-09-09 05:55:46,032 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1241 transitions. Word has length 159 [2019-09-09 05:55:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:46,032 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1241 transitions. [2019-09-09 05:55:46,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1241 transitions. [2019-09-09 05:55:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:55:46,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:46,034 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:46,035 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1031806534, now seen corresponding path program 1 times [2019-09-09 05:55:46,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:46,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:46,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:46,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:46,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:46,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:46,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:46,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:46,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:46,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:46,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:46,091 INFO L87 Difference]: Start difference. First operand 833 states and 1241 transitions. Second operand 4 states. [2019-09-09 05:55:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:46,436 INFO L93 Difference]: Finished difference Result 921 states and 1356 transitions. [2019-09-09 05:55:46,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:46,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:55:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:46,438 INFO L225 Difference]: With dead ends: 921 [2019-09-09 05:55:46,438 INFO L226 Difference]: Without dead ends: 921 [2019-09-09 05:55:46,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-09-09 05:55:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 833. [2019-09-09 05:55:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-09 05:55:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1239 transitions. [2019-09-09 05:55:46,449 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1239 transitions. Word has length 160 [2019-09-09 05:55:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:46,449 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1239 transitions. [2019-09-09 05:55:46,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1239 transitions. [2019-09-09 05:55:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:55:46,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:46,451 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:46,452 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:46,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash -737219383, now seen corresponding path program 1 times [2019-09-09 05:55:46,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:46,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:46,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:46,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:46,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:55:46,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:46,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:46,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:46,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:46,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:46,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:46,523 INFO L87 Difference]: Start difference. First operand 833 states and 1239 transitions. Second operand 4 states. [2019-09-09 05:55:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:46,859 INFO L93 Difference]: Finished difference Result 917 states and 1350 transitions. [2019-09-09 05:55:46,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:46,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:55:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:46,861 INFO L225 Difference]: With dead ends: 917 [2019-09-09 05:55:46,861 INFO L226 Difference]: Without dead ends: 917 [2019-09-09 05:55:46,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-09 05:55:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 833. [2019-09-09 05:55:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-09 05:55:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1237 transitions. [2019-09-09 05:55:46,869 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1237 transitions. Word has length 160 [2019-09-09 05:55:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:46,870 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1237 transitions. [2019-09-09 05:55:46,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1237 transitions. [2019-09-09 05:55:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:55:46,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:46,871 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:46,872 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:46,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:46,872 INFO L82 PathProgramCache]: Analyzing trace with hash 350923714, now seen corresponding path program 1 times [2019-09-09 05:55:46,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:46,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:46,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:46,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:46,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-09 05:55:46,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:46,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:46,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:46,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:46,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:46,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:46,946 INFO L87 Difference]: Start difference. First operand 833 states and 1237 transitions. Second operand 4 states. [2019-09-09 05:55:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:47,275 INFO L93 Difference]: Finished difference Result 893 states and 1318 transitions. [2019-09-09 05:55:47,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:47,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:55:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:47,278 INFO L225 Difference]: With dead ends: 893 [2019-09-09 05:55:47,278 INFO L226 Difference]: Without dead ends: 893 [2019-09-09 05:55:47,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-09 05:55:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 835. [2019-09-09 05:55:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-09-09 05:55:47,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1239 transitions. [2019-09-09 05:55:47,295 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1239 transitions. Word has length 160 [2019-09-09 05:55:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:47,295 INFO L475 AbstractCegarLoop]: Abstraction has 835 states and 1239 transitions. [2019-09-09 05:55:47,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1239 transitions. [2019-09-09 05:55:47,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-09 05:55:47,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:47,297 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:47,297 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:47,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:47,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1483532629, now seen corresponding path program 1 times [2019-09-09 05:55:47,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:47,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:47,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:47,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:47,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:47,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:47,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:47,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:47,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:47,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:47,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:47,377 INFO L87 Difference]: Start difference. First operand 835 states and 1239 transitions. Second operand 4 states. [2019-09-09 05:55:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:47,714 INFO L93 Difference]: Finished difference Result 917 states and 1346 transitions. [2019-09-09 05:55:47,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:47,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-09 05:55:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:47,716 INFO L225 Difference]: With dead ends: 917 [2019-09-09 05:55:47,717 INFO L226 Difference]: Without dead ends: 917 [2019-09-09 05:55:47,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-09 05:55:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 835. [2019-09-09 05:55:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-09-09 05:55:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1237 transitions. [2019-09-09 05:55:47,725 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1237 transitions. Word has length 163 [2019-09-09 05:55:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:47,726 INFO L475 AbstractCegarLoop]: Abstraction has 835 states and 1237 transitions. [2019-09-09 05:55:47,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1237 transitions. [2019-09-09 05:55:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-09 05:55:47,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:47,728 INFO L399 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] [2019-09-09 05:55:47,728 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:47,728 INFO L82 PathProgramCache]: Analyzing trace with hash 282905396, now seen corresponding path program 1 times [2019-09-09 05:55:47,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:47,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:47,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:47,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:47,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:47,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:47,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:47,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:47,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:47,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:47,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:47,781 INFO L87 Difference]: Start difference. First operand 835 states and 1237 transitions. Second operand 4 states. [2019-09-09 05:55:48,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:48,130 INFO L93 Difference]: Finished difference Result 969 states and 1443 transitions. [2019-09-09 05:55:48,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:48,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-09 05:55:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:48,132 INFO L225 Difference]: With dead ends: 969 [2019-09-09 05:55:48,132 INFO L226 Difference]: Without dead ends: 969 [2019-09-09 05:55:48,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-09-09 05:55:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 895. [2019-09-09 05:55:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-09 05:55:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1343 transitions. [2019-09-09 05:55:48,140 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1343 transitions. Word has length 163 [2019-09-09 05:55:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:48,140 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1343 transitions. [2019-09-09 05:55:48,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1343 transitions. [2019-09-09 05:55:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:55:48,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:48,142 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:48,142 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:48,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:48,142 INFO L82 PathProgramCache]: Analyzing trace with hash 403129231, now seen corresponding path program 1 times [2019-09-09 05:55:48,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:48,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:48,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:48,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:48,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:48,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:48,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:48,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:48,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:48,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:48,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:48,224 INFO L87 Difference]: Start difference. First operand 895 states and 1343 transitions. Second operand 4 states. [2019-09-09 05:55:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:48,554 INFO L93 Difference]: Finished difference Result 965 states and 1434 transitions. [2019-09-09 05:55:48,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:48,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-09 05:55:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:48,556 INFO L225 Difference]: With dead ends: 965 [2019-09-09 05:55:48,557 INFO L226 Difference]: Without dead ends: 965 [2019-09-09 05:55:48,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-09-09 05:55:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 895. [2019-09-09 05:55:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-09 05:55:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1341 transitions. [2019-09-09 05:55:48,565 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1341 transitions. Word has length 164 [2019-09-09 05:55:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:48,566 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1341 transitions. [2019-09-09 05:55:48,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1341 transitions. [2019-09-09 05:55:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:55:48,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:48,568 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:48,568 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:48,568 INFO L82 PathProgramCache]: Analyzing trace with hash 479056014, now seen corresponding path program 1 times [2019-09-09 05:55:48,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:48,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:48,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:48,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:48,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:48,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:48,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:48,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:48,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:48,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:48,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:48,648 INFO L87 Difference]: Start difference. First operand 895 states and 1341 transitions. Second operand 4 states. [2019-09-09 05:55:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:48,961 INFO L93 Difference]: Finished difference Result 965 states and 1432 transitions. [2019-09-09 05:55:48,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:48,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-09 05:55:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:48,963 INFO L225 Difference]: With dead ends: 965 [2019-09-09 05:55:48,964 INFO L226 Difference]: Without dead ends: 965 [2019-09-09 05:55:48,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-09-09 05:55:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 895. [2019-09-09 05:55:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-09 05:55:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1339 transitions. [2019-09-09 05:55:48,971 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1339 transitions. Word has length 164 [2019-09-09 05:55:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:48,971 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1339 transitions. [2019-09-09 05:55:48,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1339 transitions. [2019-09-09 05:55:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-09 05:55:48,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:48,973 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:48,973 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:48,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1725696460, now seen corresponding path program 1 times [2019-09-09 05:55:48,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:48,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:48,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:48,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:48,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:49,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:49,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:49,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:49,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:49,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:49,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:49,024 INFO L87 Difference]: Start difference. First operand 895 states and 1339 transitions. Second operand 4 states. [2019-09-09 05:55:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:49,347 INFO L93 Difference]: Finished difference Result 959 states and 1423 transitions. [2019-09-09 05:55:49,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:49,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-09 05:55:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:49,349 INFO L225 Difference]: With dead ends: 959 [2019-09-09 05:55:49,349 INFO L226 Difference]: Without dead ends: 959 [2019-09-09 05:55:49,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-09-09 05:55:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 895. [2019-09-09 05:55:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-09 05:55:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1337 transitions. [2019-09-09 05:55:49,357 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1337 transitions. Word has length 165 [2019-09-09 05:55:49,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:49,357 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1337 transitions. [2019-09-09 05:55:49,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1337 transitions. [2019-09-09 05:55:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:55:49,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:49,358 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:49,359 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:49,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:49,359 INFO L82 PathProgramCache]: Analyzing trace with hash 442813446, now seen corresponding path program 1 times [2019-09-09 05:55:49,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:49,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:49,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:49,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:49,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:49,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:49,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:49,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:49,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:49,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:49,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:49,423 INFO L87 Difference]: Start difference. First operand 895 states and 1337 transitions. Second operand 4 states. [2019-09-09 05:55:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:49,767 INFO L93 Difference]: Finished difference Result 959 states and 1421 transitions. [2019-09-09 05:55:49,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:49,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-09 05:55:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:49,769 INFO L225 Difference]: With dead ends: 959 [2019-09-09 05:55:49,769 INFO L226 Difference]: Without dead ends: 959 [2019-09-09 05:55:49,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-09-09 05:55:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 895. [2019-09-09 05:55:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-09 05:55:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1335 transitions. [2019-09-09 05:55:49,777 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1335 transitions. Word has length 166 [2019-09-09 05:55:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:49,778 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1335 transitions. [2019-09-09 05:55:49,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1335 transitions. [2019-09-09 05:55:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:55:49,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:49,779 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:49,780 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1593288899, now seen corresponding path program 1 times [2019-09-09 05:55:49,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:49,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:49,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:49,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:49,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-09 05:55:49,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:49,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:49,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:49,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:49,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:49,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:49,830 INFO L87 Difference]: Start difference. First operand 895 states and 1335 transitions. Second operand 4 states. [2019-09-09 05:55:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:50,151 INFO L93 Difference]: Finished difference Result 953 states and 1412 transitions. [2019-09-09 05:55:50,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:50,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-09 05:55:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:50,153 INFO L225 Difference]: With dead ends: 953 [2019-09-09 05:55:50,153 INFO L226 Difference]: Without dead ends: 953 [2019-09-09 05:55:50,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-09-09 05:55:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 895. [2019-09-09 05:55:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-09 05:55:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1333 transitions. [2019-09-09 05:55:50,160 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1333 transitions. Word has length 166 [2019-09-09 05:55:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:50,161 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1333 transitions. [2019-09-09 05:55:50,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1333 transitions. [2019-09-09 05:55:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:55:50,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:50,162 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:50,162 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1494451854, now seen corresponding path program 1 times [2019-09-09 05:55:50,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:50,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:50,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:50,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-09 05:55:50,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:50,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:50,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:50,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:50,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:50,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:50,236 INFO L87 Difference]: Start difference. First operand 895 states and 1333 transitions. Second operand 4 states. [2019-09-09 05:55:50,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:50,594 INFO L93 Difference]: Finished difference Result 975 states and 1439 transitions. [2019-09-09 05:55:50,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:50,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-09 05:55:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:50,597 INFO L225 Difference]: With dead ends: 975 [2019-09-09 05:55:50,597 INFO L226 Difference]: Without dead ends: 975 [2019-09-09 05:55:50,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-09-09 05:55:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 895. [2019-09-09 05:55:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-09 05:55:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1331 transitions. [2019-09-09 05:55:50,604 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1331 transitions. Word has length 166 [2019-09-09 05:55:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:50,605 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1331 transitions. [2019-09-09 05:55:50,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1331 transitions. [2019-09-09 05:55:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-09 05:55:50,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:50,607 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:50,607 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:50,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:50,607 INFO L82 PathProgramCache]: Analyzing trace with hash 317544652, now seen corresponding path program 1 times [2019-09-09 05:55:50,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:50,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:50,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:50,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:50,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:55:50,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:50,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:50,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:50,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:50,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:50,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:50,671 INFO L87 Difference]: Start difference. First operand 895 states and 1331 transitions. Second operand 4 states. [2019-09-09 05:55:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:51,000 INFO L93 Difference]: Finished difference Result 953 states and 1408 transitions. [2019-09-09 05:55:51,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:51,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-09 05:55:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:51,002 INFO L225 Difference]: With dead ends: 953 [2019-09-09 05:55:51,002 INFO L226 Difference]: Without dead ends: 953 [2019-09-09 05:55:51,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-09-09 05:55:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 879. [2019-09-09 05:55:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-09-09 05:55:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1311 transitions. [2019-09-09 05:55:51,011 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1311 transitions. Word has length 167 [2019-09-09 05:55:51,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:51,012 INFO L475 AbstractCegarLoop]: Abstraction has 879 states and 1311 transitions. [2019-09-09 05:55:51,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:51,012 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1311 transitions. [2019-09-09 05:55:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-09 05:55:51,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:51,014 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:51,014 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1143335175, now seen corresponding path program 1 times [2019-09-09 05:55:51,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:51,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:51,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:51,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:51,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-09 05:55:51,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:51,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:51,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:51,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:51,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:51,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:51,067 INFO L87 Difference]: Start difference. First operand 879 states and 1311 transitions. Second operand 4 states. [2019-09-09 05:55:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:51,439 INFO L93 Difference]: Finished difference Result 959 states and 1417 transitions. [2019-09-09 05:55:51,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:51,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-09 05:55:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:51,442 INFO L225 Difference]: With dead ends: 959 [2019-09-09 05:55:51,442 INFO L226 Difference]: Without dead ends: 959 [2019-09-09 05:55:51,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-09-09 05:55:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 879. [2019-09-09 05:55:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-09-09 05:55:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1309 transitions. [2019-09-09 05:55:51,450 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1309 transitions. Word has length 167 [2019-09-09 05:55:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:51,450 INFO L475 AbstractCegarLoop]: Abstraction has 879 states and 1309 transitions. [2019-09-09 05:55:51,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1309 transitions. [2019-09-09 05:55:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-09 05:55:51,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:51,452 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:51,452 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:51,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1863292269, now seen corresponding path program 1 times [2019-09-09 05:55:51,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:51,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:51,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:51,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:51,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-09 05:55:51,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:51,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:51,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:51,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:51,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:51,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:51,498 INFO L87 Difference]: Start difference. First operand 879 states and 1309 transitions. Second operand 4 states. [2019-09-09 05:55:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:51,803 INFO L93 Difference]: Finished difference Result 929 states and 1379 transitions. [2019-09-09 05:55:51,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:51,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-09 05:55:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:51,805 INFO L225 Difference]: With dead ends: 929 [2019-09-09 05:55:51,805 INFO L226 Difference]: Without dead ends: 929 [2019-09-09 05:55:51,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-09 05:55:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 879. [2019-09-09 05:55:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-09-09 05:55:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1307 transitions. [2019-09-09 05:55:51,811 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1307 transitions. Word has length 168 [2019-09-09 05:55:51,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:51,812 INFO L475 AbstractCegarLoop]: Abstraction has 879 states and 1307 transitions. [2019-09-09 05:55:51,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1307 transitions. [2019-09-09 05:55:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-09 05:55:51,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:51,813 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:51,813 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash 640511377, now seen corresponding path program 1 times [2019-09-09 05:55:51,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:51,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:51,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:51,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:51,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-09 05:55:51,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:51,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:51,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:51,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:51,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:51,876 INFO L87 Difference]: Start difference. First operand 879 states and 1307 transitions. Second operand 4 states. [2019-09-09 05:55:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:52,203 INFO L93 Difference]: Finished difference Result 949 states and 1398 transitions. [2019-09-09 05:55:52,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:52,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-09 05:55:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:52,205 INFO L225 Difference]: With dead ends: 949 [2019-09-09 05:55:52,205 INFO L226 Difference]: Without dead ends: 949 [2019-09-09 05:55:52,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:52,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-09-09 05:55:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 881. [2019-09-09 05:55:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-09 05:55:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1309 transitions. [2019-09-09 05:55:52,213 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1309 transitions. Word has length 169 [2019-09-09 05:55:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:52,213 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1309 transitions. [2019-09-09 05:55:52,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1309 transitions. [2019-09-09 05:55:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-09 05:55:52,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:52,214 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:52,214 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:52,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1876057418, now seen corresponding path program 1 times [2019-09-09 05:55:52,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:52,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:52,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:52,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:52,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-09 05:55:52,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:52,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:52,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:52,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:52,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:52,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:52,266 INFO L87 Difference]: Start difference. First operand 881 states and 1309 transitions. Second operand 4 states. [2019-09-09 05:55:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:52,541 INFO L93 Difference]: Finished difference Result 909 states and 1347 transitions. [2019-09-09 05:55:52,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:52,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-09 05:55:52,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:52,544 INFO L225 Difference]: With dead ends: 909 [2019-09-09 05:55:52,544 INFO L226 Difference]: Without dead ends: 909 [2019-09-09 05:55:52,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-09 05:55:52,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 881. [2019-09-09 05:55:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-09 05:55:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1307 transitions. [2019-09-09 05:55:52,553 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1307 transitions. Word has length 169 [2019-09-09 05:55:52,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:52,554 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1307 transitions. [2019-09-09 05:55:52,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1307 transitions. [2019-09-09 05:55:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-09 05:55:52,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:52,556 INFO L399 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-09 05:55:52,556 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:52,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash 436595249, now seen corresponding path program 1 times [2019-09-09 05:55:52,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:52,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:52,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:52,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:52,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:55:52,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:52,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:55:52,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:52,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:55:52,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:55:52,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:52,715 INFO L87 Difference]: Start difference. First operand 881 states and 1307 transitions. Second operand 5 states. [2019-09-09 05:55:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:53,279 INFO L93 Difference]: Finished difference Result 1039 states and 1549 transitions. [2019-09-09 05:55:53,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:55:53,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2019-09-09 05:55:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:53,281 INFO L225 Difference]: With dead ends: 1039 [2019-09-09 05:55:53,281 INFO L226 Difference]: Without dead ends: 1039 [2019-09-09 05:55:53,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:55:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2019-09-09 05:55:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 947. [2019-09-09 05:55:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-09-09 05:55:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1425 transitions. [2019-09-09 05:55:53,290 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1425 transitions. Word has length 169 [2019-09-09 05:55:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:53,290 INFO L475 AbstractCegarLoop]: Abstraction has 947 states and 1425 transitions. [2019-09-09 05:55:53,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:55:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1425 transitions. [2019-09-09 05:55:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-09 05:55:53,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:53,292 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:53,292 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:53,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:53,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1881827196, now seen corresponding path program 1 times [2019-09-09 05:55:53,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:53,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:53,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:53,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:53,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-09 05:55:53,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:53,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:53,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:53,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:53,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:53,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:53,355 INFO L87 Difference]: Start difference. First operand 947 states and 1425 transitions. Second operand 4 states. [2019-09-09 05:55:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:53,655 INFO L93 Difference]: Finished difference Result 993 states and 1491 transitions. [2019-09-09 05:55:53,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:53,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-09 05:55:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:53,657 INFO L225 Difference]: With dead ends: 993 [2019-09-09 05:55:53,658 INFO L226 Difference]: Without dead ends: 993 [2019-09-09 05:55:53,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-09-09 05:55:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 947. [2019-09-09 05:55:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-09-09 05:55:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1423 transitions. [2019-09-09 05:55:53,664 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1423 transitions. Word has length 169 [2019-09-09 05:55:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:53,664 INFO L475 AbstractCegarLoop]: Abstraction has 947 states and 1423 transitions. [2019-09-09 05:55:53,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1423 transitions. [2019-09-09 05:55:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-09 05:55:53,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:53,666 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:53,666 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:53,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:53,666 INFO L82 PathProgramCache]: Analyzing trace with hash 918435720, now seen corresponding path program 1 times [2019-09-09 05:55:53,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:53,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:53,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:53,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:53,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-09 05:55:53,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:53,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:53,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:53,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:53,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:53,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:53,738 INFO L87 Difference]: Start difference. First operand 947 states and 1423 transitions. Second operand 4 states. [2019-09-09 05:55:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:54,051 INFO L93 Difference]: Finished difference Result 1019 states and 1514 transitions. [2019-09-09 05:55:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:54,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-09-09 05:55:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:54,052 INFO L225 Difference]: With dead ends: 1019 [2019-09-09 05:55:54,052 INFO L226 Difference]: Without dead ends: 1019 [2019-09-09 05:55:54,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-09 05:55:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 947. [2019-09-09 05:55:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-09-09 05:55:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1421 transitions. [2019-09-09 05:55:54,060 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1421 transitions. Word has length 175 [2019-09-09 05:55:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:54,060 INFO L475 AbstractCegarLoop]: Abstraction has 947 states and 1421 transitions. [2019-09-09 05:55:54,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1421 transitions. [2019-09-09 05:55:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-09 05:55:54,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:54,061 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:54,061 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:54,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:54,062 INFO L82 PathProgramCache]: Analyzing trace with hash -155464761, now seen corresponding path program 1 times [2019-09-09 05:55:54,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:54,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:54,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:54,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-09 05:55:54,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:55:54,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:55:54,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:54,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:55:54,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:55:54,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:55:54,138 INFO L87 Difference]: Start difference. First operand 947 states and 1421 transitions. Second operand 4 states. [2019-09-09 05:55:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:54,500 INFO L93 Difference]: Finished difference Result 1015 states and 1508 transitions. [2019-09-09 05:55:54,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:55:54,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-09 05:55:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:54,503 INFO L225 Difference]: With dead ends: 1015 [2019-09-09 05:55:54,503 INFO L226 Difference]: Without dead ends: 1015 [2019-09-09 05:55:54,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:55:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-09 05:55:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 885. [2019-09-09 05:55:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-09-09 05:55:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1327 transitions. [2019-09-09 05:55:54,513 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1327 transitions. Word has length 176 [2019-09-09 05:55:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:54,514 INFO L475 AbstractCegarLoop]: Abstraction has 885 states and 1327 transitions. [2019-09-09 05:55:54,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:55:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1327 transitions. [2019-09-09 05:55:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-09 05:55:54,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:55:54,516 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:55:54,516 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:55:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1080081280, now seen corresponding path program 1 times [2019-09-09 05:55:54,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:55:54,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:54,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:55:54,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:55:54,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:55:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:55:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:55:55,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:55:55,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:55:55,093 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2019-09-09 05:55:55,096 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [203], [208], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [339], [343], [548], [553], [558], [563], [578], [583], [588], [593], [598], [604], [609], [611], [616], [621], [626], [632], [635], [639], [660], [694], [696], [708], [711], [712], [724], [732], [733], [734] [2019-09-09 05:55:55,170 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:55:55,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:55:55,266 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:55:55,267 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-09 05:55:55,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:55:55,272 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:55:55,372 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 05:55:55,373 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:55:55,384 INFO L420 sIntCurrentIteration]: We unified 175 AI predicates to 175 [2019-09-09 05:55:55,385 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:55:55,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:55:55,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 10 [2019-09-09 05:55:55,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:55:55,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:55:55,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:55:55,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:55:55,388 INFO L87 Difference]: Start difference. First operand 885 states and 1327 transitions. Second operand 2 states. [2019-09-09 05:55:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:55:55,389 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 05:55:55,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:55:55,389 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 176 [2019-09-09 05:55:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:55:55,389 INFO L225 Difference]: With dead ends: 2 [2019-09-09 05:55:55,389 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:55:55,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:55:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:55:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:55:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:55:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:55:55,390 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2019-09-09 05:55:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:55:55,391 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:55:55,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:55:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:55:55,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:55:55,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:55:55 BoogieIcfgContainer [2019-09-09 05:55:55,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:55:55,398 INFO L168 Benchmark]: Toolchain (without parser) took 50535.61 ms. Allocated memory was 133.2 MB in the beginning and 753.4 MB in the end (delta: 620.2 MB). Free memory was 86.6 MB in the beginning and 570.5 MB in the end (delta: -483.9 MB). Peak memory consumption was 136.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:55,399 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:55:55,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.01 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 86.2 MB in the beginning and 156.4 MB in the end (delta: -70.2 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:55,400 INFO L168 Benchmark]: Boogie Preprocessor took 155.63 ms. Allocated memory is still 200.8 MB. Free memory was 156.4 MB in the beginning and 148.0 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:55,401 INFO L168 Benchmark]: RCFGBuilder took 1399.10 ms. Allocated memory was 200.8 MB in the beginning and 226.0 MB in the end (delta: 25.2 MB). Free memory was 148.0 MB in the beginning and 163.4 MB in the end (delta: -15.4 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:55,401 INFO L168 Benchmark]: TraceAbstraction took 48113.56 ms. Allocated memory was 226.0 MB in the beginning and 753.4 MB in the end (delta: 527.4 MB). Free memory was 163.4 MB in the beginning and 570.5 MB in the end (delta: -407.1 MB). Peak memory consumption was 120.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:55:55,404 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 863.01 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 86.2 MB in the beginning and 156.4 MB in the end (delta: -70.2 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 155.63 ms. Allocated memory is still 200.8 MB. Free memory was 156.4 MB in the beginning and 148.0 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1399.10 ms. Allocated memory was 200.8 MB in the beginning and 226.0 MB in the end (delta: 25.2 MB). Free memory was 148.0 MB in the beginning and 163.4 MB in the end (delta: -15.4 MB). Peak memory consumption was 79.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48113.56 ms. Allocated memory was 226.0 MB in the beginning and 753.4 MB in the end (delta: 527.4 MB). Free memory was 163.4 MB in the beginning and 570.5 MB in the end (delta: -407.1 MB). Peak memory consumption was 120.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1762]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 194 locations, 1 error locations. SAFE Result, 48.0s OverallTime, 110 OverallIterations, 7 TraceHistogramMax, 37.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26434 SDtfs, 7518 SDslu, 39873 SDs, 0 SdLazy, 22829 SolverSat, 815 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 771 GetRequests, 399 SyntacticMatches, 46 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=947occurred in iteration=106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.217142857142857 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 110 MinimizatonAttempts, 6591 StatesRemovedByMinimization, 109 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 13836 NumberOfCodeBlocks, 13836 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 13726 ConstructedInterpolants, 0 QuantifiedInterpolants, 4866745 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 110 InterpolantComputations, 109 PerfectInterpolantSequences, 13674/13848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...