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.01.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:12,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:12,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:12,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:12,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:12,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:12,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:12,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:12,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:12,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:12,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:12,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:12,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:12,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:12,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:12,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:12,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:12,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:12,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:12,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:12,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:12,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:12,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:12,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:12,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:12,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:12,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:12,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:12,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:12,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:12,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:12,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:12,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:12,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:12,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:12,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:12,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:12,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:12,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:12,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:12,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:12,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:12,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:12,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:12,652 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:12,653 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:12,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:12,654 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:12,654 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:12,654 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:12,654 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:12,654 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:12,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:12,656 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:12,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:12,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:12,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:12,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:12,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:12,658 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:12,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:12,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:12,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:12,659 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:12,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:12,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:12,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:12,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:12,660 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:12,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:12,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:12,661 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:12,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:12,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:12,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:12,721 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:12,722 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:12,723 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.01.i.cil-1.c [2019-09-20 13:27:12,799 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a6be54a/2e37b77d22fc4ae1ac286487eb6d22ba/FLAG88843b5e2 [2019-09-20 13:27:13,449 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:13,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.01.i.cil-1.c [2019-09-20 13:27:13,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a6be54a/2e37b77d22fc4ae1ac286487eb6d22ba/FLAG88843b5e2 [2019-09-20 13:27:13,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a6be54a/2e37b77d22fc4ae1ac286487eb6d22ba [2019-09-20 13:27:13,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:13,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:13,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:13,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:13,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:13,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:13" (1/1) ... [2019-09-20 13:27:13,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230fcc1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:13, skipping insertion in model container [2019-09-20 13:27:13,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:13" (1/1) ... [2019-09-20 13:27:13,672 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:13,741 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:14,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:14,396 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:14,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:14,635 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:14,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:14 WrapperNode [2019-09-20 13:27:14,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:14,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:14,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:14,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:14,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:14" (1/1) ... [2019-09-20 13:27:14,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:14" (1/1) ... [2019-09-20 13:27:14,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:14" (1/1) ... [2019-09-20 13:27:14,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:14" (1/1) ... [2019-09-20 13:27:14,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:14" (1/1) ... [2019-09-20 13:27:14,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:14" (1/1) ... [2019-09-20 13:27:14,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:14" (1/1) ... [2019-09-20 13:27:14,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:14,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:14,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:14,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:14,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:14,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:14,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:14,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:14,922 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:14,922 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:14,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:14,925 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:14,925 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:14,925 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:14,925 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:14,925 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:14,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:14,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:14,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:14,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:14,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:15,397 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:16,151 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:16,152 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:16,175 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:16,176 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:16,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:16 BoogieIcfgContainer [2019-09-20 13:27:16,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:16,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:16,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:16,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:16,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:13" (1/3) ... [2019-09-20 13:27:16,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700c1eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:16, skipping insertion in model container [2019-09-20 13:27:16,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:14" (2/3) ... [2019-09-20 13:27:16,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700c1eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:16, skipping insertion in model container [2019-09-20 13:27:16,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:16" (3/3) ... [2019-09-20 13:27:16,189 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-1.c [2019-09-20 13:27:16,199 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:16,211 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:16,229 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:16,263 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:16,263 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:16,264 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:16,264 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:16,264 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:16,264 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:16,264 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:16,264 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-20 13:27:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:27:16,312 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,313 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:16,317 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1829522431, now seen corresponding path program 1 times [2019-09-20 13:27:16,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:16,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:16,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:16,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:16,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:16,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:16,794 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2019-09-20 13:27:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:17,258 INFO L93 Difference]: Finished difference Result 187 states and 301 transitions. [2019-09-20 13:27:17,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:17,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-09-20 13:27:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:17,280 INFO L225 Difference]: With dead ends: 187 [2019-09-20 13:27:17,281 INFO L226 Difference]: Without dead ends: 166 [2019-09-20 13:27:17,284 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:17,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-20 13:27:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-09-20 13:27:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-20 13:27:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2019-09-20 13:27:17,361 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 52 [2019-09-20 13:27:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:17,362 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2019-09-20 13:27:17,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2019-09-20 13:27:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:17,365 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:17,366 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:17,366 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:17,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash 311974229, now seen corresponding path program 1 times [2019-09-20 13:27:17,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:17,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:17,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:17,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:17,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:17,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:17,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:17,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:17,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:17,531 INFO L87 Difference]: Start difference. First operand 149 states and 225 transitions. Second operand 4 states. [2019-09-20 13:27:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:17,912 INFO L93 Difference]: Finished difference Result 166 states and 245 transitions. [2019-09-20 13:27:17,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:17,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:17,916 INFO L225 Difference]: With dead ends: 166 [2019-09-20 13:27:17,916 INFO L226 Difference]: Without dead ends: 166 [2019-09-20 13:27:17,917 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:17,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-09-20 13:27:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-09-20 13:27:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-20 13:27:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-09-20 13:27:17,939 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 65 [2019-09-20 13:27:17,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:17,940 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-09-20 13:27:17,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:17,941 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-09-20 13:27:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:17,947 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:17,947 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:17,947 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:17,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1967400435, now seen corresponding path program 1 times [2019-09-20 13:27:17,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:17,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:18,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:18,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:18,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:18,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:18,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:18,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:18,061 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 4 states. [2019-09-20 13:27:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:18,425 INFO L93 Difference]: Finished difference Result 165 states and 243 transitions. [2019-09-20 13:27:18,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:18,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:18,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:18,428 INFO L225 Difference]: With dead ends: 165 [2019-09-20 13:27:18,428 INFO L226 Difference]: Without dead ends: 165 [2019-09-20 13:27:18,428 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-20 13:27:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2019-09-20 13:27:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-20 13:27:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 223 transitions. [2019-09-20 13:27:18,450 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 223 transitions. Word has length 66 [2019-09-20 13:27:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:18,450 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 223 transitions. [2019-09-20 13:27:18,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 223 transitions. [2019-09-20 13:27:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:18,452 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,453 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:18,453 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash -503920014, now seen corresponding path program 1 times [2019-09-20 13:27:18,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:18,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:18,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:18,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:18,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:18,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:18,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:18,635 INFO L87 Difference]: Start difference. First operand 149 states and 223 transitions. Second operand 4 states. [2019-09-20 13:27:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:18,955 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2019-09-20 13:27:18,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:18,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:18,957 INFO L225 Difference]: With dead ends: 163 [2019-09-20 13:27:18,958 INFO L226 Difference]: Without dead ends: 163 [2019-09-20 13:27:18,958 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-20 13:27:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2019-09-20 13:27:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-20 13:27:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 222 transitions. [2019-09-20 13:27:18,967 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 222 transitions. Word has length 66 [2019-09-20 13:27:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:18,967 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 222 transitions. [2019-09-20 13:27:18,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 222 transitions. [2019-09-20 13:27:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:27:18,969 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:18,969 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:18,969 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:18,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1019437979, now seen corresponding path program 1 times [2019-09-20 13:27:18,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:18,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:18,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:18,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:19,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:19,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:19,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:19,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:19,054 INFO L87 Difference]: Start difference. First operand 149 states and 222 transitions. Second operand 4 states. [2019-09-20 13:27:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,405 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2019-09-20 13:27:19,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:19,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:27:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,407 INFO L225 Difference]: With dead ends: 162 [2019-09-20 13:27:19,408 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 13:27:19,408 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 13:27:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-09-20 13:27:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-20 13:27:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 221 transitions. [2019-09-20 13:27:19,415 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 221 transitions. Word has length 67 [2019-09-20 13:27:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,415 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 221 transitions. [2019-09-20 13:27:19,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 221 transitions. [2019-09-20 13:27:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:27:19,417 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,417 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:19,417 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1150029561, now seen corresponding path program 1 times [2019-09-20 13:27:19,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:19,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:19,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:19,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:19,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:19,487 INFO L87 Difference]: Start difference. First operand 149 states and 221 transitions. Second operand 4 states. [2019-09-20 13:27:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:19,789 INFO L93 Difference]: Finished difference Result 162 states and 237 transitions. [2019-09-20 13:27:19,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:19,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:27:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:19,792 INFO L225 Difference]: With dead ends: 162 [2019-09-20 13:27:19,792 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 13:27:19,792 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 13:27:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-09-20 13:27:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-20 13:27:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 220 transitions. [2019-09-20 13:27:19,799 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 220 transitions. Word has length 67 [2019-09-20 13:27:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:19,799 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 220 transitions. [2019-09-20 13:27:19,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 220 transitions. [2019-09-20 13:27:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:27:19,800 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:19,801 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:19,801 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:19,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:19,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1816493162, now seen corresponding path program 1 times [2019-09-20 13:27:19,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:19,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:19,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:19,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:19,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:19,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:19,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:19,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:19,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:19,863 INFO L87 Difference]: Start difference. First operand 149 states and 220 transitions. Second operand 4 states. [2019-09-20 13:27:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,175 INFO L93 Difference]: Finished difference Result 162 states and 236 transitions. [2019-09-20 13:27:20,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:20,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:27:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,178 INFO L225 Difference]: With dead ends: 162 [2019-09-20 13:27:20,178 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 13:27:20,178 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 13:27:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-09-20 13:27:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-20 13:27:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2019-09-20 13:27:20,184 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 68 [2019-09-20 13:27:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,185 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2019-09-20 13:27:20,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2019-09-20 13:27:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 13:27:20,186 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,186 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:20,187 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2081568606, now seen corresponding path program 1 times [2019-09-20 13:27:20,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:20,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:20,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:20,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:20,279 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand 4 states. [2019-09-20 13:27:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,569 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2019-09-20 13:27:20,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:20,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-20 13:27:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,571 INFO L225 Difference]: With dead ends: 162 [2019-09-20 13:27:20,571 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 13:27:20,572 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 13:27:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-09-20 13:27:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-20 13:27:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 218 transitions. [2019-09-20 13:27:20,577 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 218 transitions. Word has length 69 [2019-09-20 13:27:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:20,577 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 218 transitions. [2019-09-20 13:27:20,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 218 transitions. [2019-09-20 13:27:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 13:27:20,579 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:20,579 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:20,579 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash -705069094, now seen corresponding path program 1 times [2019-09-20 13:27:20,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:20,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:20,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:20,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:20,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:20,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:20,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:20,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:20,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:20,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:20,638 INFO L87 Difference]: Start difference. First operand 149 states and 218 transitions. Second operand 4 states. [2019-09-20 13:27:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:20,993 INFO L93 Difference]: Finished difference Result 192 states and 283 transitions. [2019-09-20 13:27:20,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:20,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-20 13:27:20,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:20,996 INFO L225 Difference]: With dead ends: 192 [2019-09-20 13:27:20,996 INFO L226 Difference]: Without dead ends: 192 [2019-09-20 13:27:20,996 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-20 13:27:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-09-20 13:27:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-20 13:27:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2019-09-20 13:27:21,002 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 69 [2019-09-20 13:27:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:21,003 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2019-09-20 13:27:21,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2019-09-20 13:27:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-20 13:27:21,004 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,004 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:21,005 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash -261582501, now seen corresponding path program 1 times [2019-09-20 13:27:21,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:21,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:21,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:21,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:21,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:21,075 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand 4 states. [2019-09-20 13:27:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:21,328 INFO L93 Difference]: Finished difference Result 174 states and 259 transitions. [2019-09-20 13:27:21,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:21,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-09-20 13:27:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:21,330 INFO L225 Difference]: With dead ends: 174 [2019-09-20 13:27:21,330 INFO L226 Difference]: Without dead ends: 174 [2019-09-20 13:27:21,331 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-20 13:27:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-09-20 13:27:21,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-20 13:27:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 255 transitions. [2019-09-20 13:27:21,336 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 255 transitions. Word has length 70 [2019-09-20 13:27:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:21,337 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 255 transitions. [2019-09-20 13:27:21,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2019-09-20 13:27:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:21,338 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,338 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:21,339 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1162772134, now seen corresponding path program 1 times [2019-09-20 13:27:21,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:21,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:21,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:21,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:21,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:21,411 INFO L87 Difference]: Start difference. First operand 171 states and 255 transitions. Second operand 4 states. [2019-09-20 13:27:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:21,733 INFO L93 Difference]: Finished difference Result 192 states and 281 transitions. [2019-09-20 13:27:21,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:21,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:21,736 INFO L225 Difference]: With dead ends: 192 [2019-09-20 13:27:21,736 INFO L226 Difference]: Without dead ends: 192 [2019-09-20 13:27:21,737 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-20 13:27:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-09-20 13:27:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-20 13:27:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2019-09-20 13:27:21,744 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 254 transitions. Word has length 82 [2019-09-20 13:27:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:21,744 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 254 transitions. [2019-09-20 13:27:21,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 254 transitions. [2019-09-20 13:27:21,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:21,746 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:21,747 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:21,747 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:21,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:21,748 INFO L82 PathProgramCache]: Analyzing trace with hash -439897432, now seen corresponding path program 1 times [2019-09-20 13:27:21,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:21,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:21,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:21,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:21,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:21,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:21,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:21,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:21,872 INFO L87 Difference]: Start difference. First operand 171 states and 254 transitions. Second operand 4 states. [2019-09-20 13:27:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,159 INFO L93 Difference]: Finished difference Result 191 states and 279 transitions. [2019-09-20 13:27:22,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:22,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:27:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,161 INFO L225 Difference]: With dead ends: 191 [2019-09-20 13:27:22,161 INFO L226 Difference]: Without dead ends: 191 [2019-09-20 13:27:22,161 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-20 13:27:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2019-09-20 13:27:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-20 13:27:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 253 transitions. [2019-09-20 13:27:22,166 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 253 transitions. Word has length 83 [2019-09-20 13:27:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,167 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 253 transitions. [2019-09-20 13:27:22,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 253 transitions. [2019-09-20 13:27:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:22,168 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,168 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,169 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1023582989, now seen corresponding path program 1 times [2019-09-20 13:27:22,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:22,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:22,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:22,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:22,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:22,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:22,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:22,233 INFO L87 Difference]: Start difference. First operand 171 states and 253 transitions. Second operand 4 states. [2019-09-20 13:27:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,574 INFO L93 Difference]: Finished difference Result 189 states and 276 transitions. [2019-09-20 13:27:22,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:22,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:27:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,577 INFO L225 Difference]: With dead ends: 189 [2019-09-20 13:27:22,577 INFO L226 Difference]: Without dead ends: 189 [2019-09-20 13:27:22,577 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-20 13:27:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2019-09-20 13:27:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-20 13:27:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 252 transitions. [2019-09-20 13:27:22,584 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 252 transitions. Word has length 83 [2019-09-20 13:27:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,585 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 252 transitions. [2019-09-20 13:27:22,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 252 transitions. [2019-09-20 13:27:22,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:27:22,586 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,587 INFO L407 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,587 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,587 INFO L82 PathProgramCache]: Analyzing trace with hash -911485142, now seen corresponding path program 1 times [2019-09-20 13:27:22,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 13:27:22,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:22,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:22,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:22,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:22,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:22,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:22,655 INFO L87 Difference]: Start difference. First operand 171 states and 252 transitions. Second operand 4 states. [2019-09-20 13:27:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:22,950 INFO L93 Difference]: Finished difference Result 200 states and 294 transitions. [2019-09-20 13:27:22,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:22,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:27:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:22,953 INFO L225 Difference]: With dead ends: 200 [2019-09-20 13:27:22,953 INFO L226 Difference]: Without dead ends: 200 [2019-09-20 13:27:22,953 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-20 13:27:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2019-09-20 13:27:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-20 13:27:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 278 transitions. [2019-09-20 13:27:22,960 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 278 transitions. Word has length 84 [2019-09-20 13:27:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:22,960 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 278 transitions. [2019-09-20 13:27:22,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 278 transitions. [2019-09-20 13:27:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-20 13:27:22,961 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:22,962 INFO L407 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:22,962 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1374970765, now seen corresponding path program 1 times [2019-09-20 13:27:22,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:22,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:22,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:22,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:27:23,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:23,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:23,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:23,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:23,076 INFO L87 Difference]: Start difference. First operand 187 states and 278 transitions. Second operand 5 states. [2019-09-20 13:27:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:23,443 INFO L93 Difference]: Finished difference Result 196 states and 289 transitions. [2019-09-20 13:27:23,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:27:23,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-20 13:27:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:23,445 INFO L225 Difference]: With dead ends: 196 [2019-09-20 13:27:23,445 INFO L226 Difference]: Without dead ends: 196 [2019-09-20 13:27:23,446 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:27:23,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-20 13:27:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-09-20 13:27:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 289 transitions. [2019-09-20 13:27:23,452 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 289 transitions. Word has length 85 [2019-09-20 13:27:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:23,452 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 289 transitions. [2019-09-20 13:27:23,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 289 transitions. [2019-09-20 13:27:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-20 13:27:23,453 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,454 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:23,454 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1454013535, now seen corresponding path program 1 times [2019-09-20 13:27:23,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:23,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,523 INFO L87 Difference]: Start difference. First operand 196 states and 289 transitions. Second operand 4 states. [2019-09-20 13:27:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:23,900 INFO L93 Difference]: Finished difference Result 223 states and 323 transitions. [2019-09-20 13:27:23,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:23,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-20 13:27:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:23,902 INFO L225 Difference]: With dead ends: 223 [2019-09-20 13:27:23,903 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:27:23,903 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:27:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2019-09-20 13:27:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2019-09-20 13:27:23,909 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 85 [2019-09-20 13:27:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:23,909 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2019-09-20 13:27:23,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2019-09-20 13:27:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 13:27:23,910 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:23,911 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:23,911 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1298012940, now seen corresponding path program 1 times [2019-09-20 13:27:23,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:23,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:23,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:23,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:23,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:23,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:23,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:23,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:23,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:23,985 INFO L87 Difference]: Start difference. First operand 196 states and 288 transitions. Second operand 4 states. [2019-09-20 13:27:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,265 INFO L93 Difference]: Finished difference Result 223 states and 322 transitions. [2019-09-20 13:27:24,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-20 13:27:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,267 INFO L225 Difference]: With dead ends: 223 [2019-09-20 13:27:24,267 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:27:24,267 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:27:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2019-09-20 13:27:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 287 transitions. [2019-09-20 13:27:24,273 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 287 transitions. Word has length 86 [2019-09-20 13:27:24,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,273 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 287 transitions. [2019-09-20 13:27:24,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 287 transitions. [2019-09-20 13:27:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:27:24,275 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,275 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,275 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash 307844570, now seen corresponding path program 1 times [2019-09-20 13:27:24,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,337 INFO L87 Difference]: Start difference. First operand 196 states and 287 transitions. Second operand 4 states. [2019-09-20 13:27:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:24,687 INFO L93 Difference]: Finished difference Result 223 states and 321 transitions. [2019-09-20 13:27:24,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:24,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:27:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:24,689 INFO L225 Difference]: With dead ends: 223 [2019-09-20 13:27:24,689 INFO L226 Difference]: Without dead ends: 223 [2019-09-20 13:27:24,690 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:24,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-20 13:27:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2019-09-20 13:27:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 286 transitions. [2019-09-20 13:27:24,698 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 286 transitions. Word has length 87 [2019-09-20 13:27:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:24,698 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 286 transitions. [2019-09-20 13:27:24,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 286 transitions. [2019-09-20 13:27:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:27:24,701 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:24,701 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:24,701 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:24,702 INFO L82 PathProgramCache]: Analyzing trace with hash -771721049, now seen corresponding path program 1 times [2019-09-20 13:27:24,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:24,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:24,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:24,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:24,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:24,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:24,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:24,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:24,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:24,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:24,793 INFO L87 Difference]: Start difference. First operand 196 states and 286 transitions. Second operand 4 states. [2019-09-20 13:27:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,078 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2019-09-20 13:27:25,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:27:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,081 INFO L225 Difference]: With dead ends: 213 [2019-09-20 13:27:25,081 INFO L226 Difference]: Without dead ends: 213 [2019-09-20 13:27:25,082 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-20 13:27:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2019-09-20 13:27:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-20 13:27:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 285 transitions. [2019-09-20 13:27:25,088 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 285 transitions. Word has length 88 [2019-09-20 13:27:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,089 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 285 transitions. [2019-09-20 13:27:25,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 285 transitions. [2019-09-20 13:27:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-20 13:27:25,090 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,091 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,091 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2134538601, now seen corresponding path program 1 times [2019-09-20 13:27:25,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:25,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,214 INFO L87 Difference]: Start difference. First operand 196 states and 285 transitions. Second operand 4 states. [2019-09-20 13:27:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:25,676 INFO L93 Difference]: Finished difference Result 255 states and 371 transitions. [2019-09-20 13:27:25,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:25,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-20 13:27:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:25,679 INFO L225 Difference]: With dead ends: 255 [2019-09-20 13:27:25,679 INFO L226 Difference]: Without dead ends: 255 [2019-09-20 13:27:25,680 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-20 13:27:25,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 221. [2019-09-20 13:27:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-20 13:27:25,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 328 transitions. [2019-09-20 13:27:25,689 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 328 transitions. Word has length 91 [2019-09-20 13:27:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:25,690 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 328 transitions. [2019-09-20 13:27:25,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 328 transitions. [2019-09-20 13:27:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-20 13:27:25,692 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:25,693 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:25,693 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:25,694 INFO L82 PathProgramCache]: Analyzing trace with hash -85150759, now seen corresponding path program 1 times [2019-09-20 13:27:25,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:25,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:25,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:25,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:25,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:25,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:25,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:25,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:25,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:25,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:25,824 INFO L87 Difference]: Start difference. First operand 221 states and 328 transitions. Second operand 4 states. [2019-09-20 13:27:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,301 INFO L93 Difference]: Finished difference Result 326 states and 487 transitions. [2019-09-20 13:27:26,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-20 13:27:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,304 INFO L225 Difference]: With dead ends: 326 [2019-09-20 13:27:26,304 INFO L226 Difference]: Without dead ends: 326 [2019-09-20 13:27:26,304 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-20 13:27:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 263. [2019-09-20 13:27:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 405 transitions. [2019-09-20 13:27:26,312 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 405 transitions. Word has length 91 [2019-09-20 13:27:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,312 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 405 transitions. [2019-09-20 13:27:26,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 405 transitions. [2019-09-20 13:27:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-20 13:27:26,314 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,314 INFO L407 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-09-20 13:27:26,314 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash -854356982, now seen corresponding path program 1 times [2019-09-20 13:27:26,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:26,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,400 INFO L87 Difference]: Start difference. First operand 263 states and 405 transitions. Second operand 4 states. [2019-09-20 13:27:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:26,731 INFO L93 Difference]: Finished difference Result 280 states and 426 transitions. [2019-09-20 13:27:26,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:26,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-20 13:27:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:26,733 INFO L225 Difference]: With dead ends: 280 [2019-09-20 13:27:26,734 INFO L226 Difference]: Without dead ends: 270 [2019-09-20 13:27:26,734 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-20 13:27:26,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 263. [2019-09-20 13:27:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 404 transitions. [2019-09-20 13:27:26,742 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 404 transitions. Word has length 97 [2019-09-20 13:27:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:26,742 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 404 transitions. [2019-09-20 13:27:26,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 404 transitions. [2019-09-20 13:27:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:26,744 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:26,745 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:26,745 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:26,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:26,746 INFO L82 PathProgramCache]: Analyzing trace with hash -287500867, now seen corresponding path program 1 times [2019-09-20 13:27:26,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:26,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:26,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:26,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:26,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:26,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:26,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:26,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:26,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:26,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:26,835 INFO L87 Difference]: Start difference. First operand 263 states and 404 transitions. Second operand 4 states. [2019-09-20 13:27:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,198 INFO L93 Difference]: Finished difference Result 297 states and 446 transitions. [2019-09-20 13:27:27,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:27,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,201 INFO L225 Difference]: With dead ends: 297 [2019-09-20 13:27:27,201 INFO L226 Difference]: Without dead ends: 297 [2019-09-20 13:27:27,202 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-20 13:27:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 263. [2019-09-20 13:27:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 403 transitions. [2019-09-20 13:27:27,209 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 403 transitions. Word has length 104 [2019-09-20 13:27:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,210 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 403 transitions. [2019-09-20 13:27:27,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 403 transitions. [2019-09-20 13:27:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:27,211 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,211 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,212 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1548418117, now seen corresponding path program 1 times [2019-09-20 13:27:27,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:27,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,279 INFO L87 Difference]: Start difference. First operand 263 states and 403 transitions. Second operand 4 states. [2019-09-20 13:27:27,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:27,729 INFO L93 Difference]: Finished difference Result 326 states and 484 transitions. [2019-09-20 13:27:27,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:27,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:27,732 INFO L225 Difference]: With dead ends: 326 [2019-09-20 13:27:27,733 INFO L226 Difference]: Without dead ends: 326 [2019-09-20 13:27:27,733 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-20 13:27:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 263. [2019-09-20 13:27:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 402 transitions. [2019-09-20 13:27:27,741 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 402 transitions. Word has length 104 [2019-09-20 13:27:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:27,741 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 402 transitions. [2019-09-20 13:27:27,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 402 transitions. [2019-09-20 13:27:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:27,743 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:27,743 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:27,744 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:27,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:27,744 INFO L82 PathProgramCache]: Analyzing trace with hash 923708069, now seen corresponding path program 1 times [2019-09-20 13:27:27,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:27,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:27,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:27,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:27,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:27,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:27,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:27,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:27,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:27,830 INFO L87 Difference]: Start difference. First operand 263 states and 402 transitions. Second operand 4 states. [2019-09-20 13:27:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,141 INFO L93 Difference]: Finished difference Result 296 states and 443 transitions. [2019-09-20 13:27:28,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,145 INFO L225 Difference]: With dead ends: 296 [2019-09-20 13:27:28,145 INFO L226 Difference]: Without dead ends: 296 [2019-09-20 13:27:28,146 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-20 13:27:28,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 263. [2019-09-20 13:27:28,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 401 transitions. [2019-09-20 13:27:28,154 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 401 transitions. Word has length 105 [2019-09-20 13:27:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,154 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 401 transitions. [2019-09-20 13:27:28,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 401 transitions. [2019-09-20 13:27:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:28,156 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,156 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:28,156 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1907778806, now seen corresponding path program 1 times [2019-09-20 13:27:28,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,228 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:28,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,230 INFO L87 Difference]: Start difference. First operand 263 states and 401 transitions. Second operand 4 states. [2019-09-20 13:27:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:28,534 INFO L93 Difference]: Finished difference Result 294 states and 440 transitions. [2019-09-20 13:27:28,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:28,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:28,536 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:27:28,537 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:27:28,537 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:27:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 263. [2019-09-20 13:27:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 400 transitions. [2019-09-20 13:27:28,544 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 400 transitions. Word has length 105 [2019-09-20 13:27:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:28,545 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 400 transitions. [2019-09-20 13:27:28,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 400 transitions. [2019-09-20 13:27:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:28,546 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,546 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:28,547 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,547 INFO L82 PathProgramCache]: Analyzing trace with hash 489978983, now seen corresponding path program 1 times [2019-09-20 13:27:28,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:28,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,618 INFO L87 Difference]: Start difference. First operand 263 states and 400 transitions. Second operand 4 states. [2019-09-20 13:27:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,068 INFO L93 Difference]: Finished difference Result 325 states and 480 transitions. [2019-09-20 13:27:29,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,071 INFO L225 Difference]: With dead ends: 325 [2019-09-20 13:27:29,071 INFO L226 Difference]: Without dead ends: 325 [2019-09-20 13:27:29,072 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-20 13:27:29,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 263. [2019-09-20 13:27:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 399 transitions. [2019-09-20 13:27:29,078 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 399 transitions. Word has length 105 [2019-09-20 13:27:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,079 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 399 transitions. [2019-09-20 13:27:29,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 399 transitions. [2019-09-20 13:27:29,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:29,080 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,080 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,080 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1953459404, now seen corresponding path program 1 times [2019-09-20 13:27:29,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:29,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,150 INFO L87 Difference]: Start difference. First operand 263 states and 399 transitions. Second operand 4 states. [2019-09-20 13:27:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,587 INFO L93 Difference]: Finished difference Result 323 states and 477 transitions. [2019-09-20 13:27:29,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,590 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:27:29,590 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:27:29,590 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:27:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 263. [2019-09-20 13:27:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 398 transitions. [2019-09-20 13:27:29,598 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 398 transitions. Word has length 105 [2019-09-20 13:27:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,598 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 398 transitions. [2019-09-20 13:27:29,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 398 transitions. [2019-09-20 13:27:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:29,600 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,600 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,600 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1913874716, now seen corresponding path program 1 times [2019-09-20 13:27:29,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:29,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,679 INFO L87 Difference]: Start difference. First operand 263 states and 398 transitions. Second operand 4 states. [2019-09-20 13:27:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,000 INFO L93 Difference]: Finished difference Result 294 states and 437 transitions. [2019-09-20 13:27:30,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,003 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:27:30,003 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:27:30,004 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:27:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 263. [2019-09-20 13:27:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 397 transitions. [2019-09-20 13:27:30,017 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 397 transitions. Word has length 107 [2019-09-20 13:27:30,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,017 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 397 transitions. [2019-09-20 13:27:30,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,017 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 397 transitions. [2019-09-20 13:27:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:27:30,019 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,019 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:30,019 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1712050782, now seen corresponding path program 1 times [2019-09-20 13:27:30,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:30,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,079 INFO L87 Difference]: Start difference. First operand 263 states and 397 transitions. Second operand 4 states. [2019-09-20 13:27:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,494 INFO L93 Difference]: Finished difference Result 323 states and 475 transitions. [2019-09-20 13:27:30,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:27:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,497 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:27:30,498 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:27:30,498 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:30,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:27:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 263. [2019-09-20 13:27:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 396 transitions. [2019-09-20 13:27:30,505 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 396 transitions. Word has length 107 [2019-09-20 13:27:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,506 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 396 transitions. [2019-09-20 13:27:30,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2019-09-20 13:27:30,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:30,507 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,507 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:30,508 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1626159633, now seen corresponding path program 1 times [2019-09-20 13:27:30,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:30,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,576 INFO L87 Difference]: Start difference. First operand 263 states and 396 transitions. Second operand 4 states. [2019-09-20 13:27:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,880 INFO L93 Difference]: Finished difference Result 294 states and 435 transitions. [2019-09-20 13:27:30,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,882 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:27:30,882 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:27:30,883 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:27:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 263. [2019-09-20 13:27:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 395 transitions. [2019-09-20 13:27:30,889 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 395 transitions. Word has length 108 [2019-09-20 13:27:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,889 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 395 transitions. [2019-09-20 13:27:30,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 395 transitions. [2019-09-20 13:27:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:30,890 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,890 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:30,891 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 707233005, now seen corresponding path program 1 times [2019-09-20 13:27:30,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:30,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,976 INFO L87 Difference]: Start difference. First operand 263 states and 395 transitions. Second operand 4 states. [2019-09-20 13:27:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,395 INFO L93 Difference]: Finished difference Result 323 states and 473 transitions. [2019-09-20 13:27:31,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-20 13:27:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,398 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:27:31,398 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:27:31,398 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:27:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 263. [2019-09-20 13:27:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 394 transitions. [2019-09-20 13:27:31,405 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 394 transitions. Word has length 108 [2019-09-20 13:27:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,405 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 394 transitions. [2019-09-20 13:27:31,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 394 transitions. [2019-09-20 13:27:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:27:31,407 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,407 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:31,407 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,408 INFO L82 PathProgramCache]: Analyzing trace with hash -147191977, now seen corresponding path program 1 times [2019-09-20 13:27:31,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:31,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,474 INFO L87 Difference]: Start difference. First operand 263 states and 394 transitions. Second operand 4 states. [2019-09-20 13:27:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,839 INFO L93 Difference]: Finished difference Result 294 states and 433 transitions. [2019-09-20 13:27:31,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-20 13:27:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,843 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:27:31,843 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:27:31,845 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:27:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 263. [2019-09-20 13:27:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 393 transitions. [2019-09-20 13:27:31,853 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 393 transitions. Word has length 109 [2019-09-20 13:27:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,854 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 393 transitions. [2019-09-20 13:27:31,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,854 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 393 transitions. [2019-09-20 13:27:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:27:31,856 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,857 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:31,857 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash -826464231, now seen corresponding path program 1 times [2019-09-20 13:27:31,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:31,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,962 INFO L87 Difference]: Start difference. First operand 263 states and 393 transitions. Second operand 4 states. [2019-09-20 13:27:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,386 INFO L93 Difference]: Finished difference Result 323 states and 471 transitions. [2019-09-20 13:27:32,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-20 13:27:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,389 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:27:32,389 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:27:32,389 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:27:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 263. [2019-09-20 13:27:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 392 transitions. [2019-09-20 13:27:32,402 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 392 transitions. Word has length 109 [2019-09-20 13:27:32,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,403 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 392 transitions. [2019-09-20 13:27:32,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 392 transitions. [2019-09-20 13:27:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:27:32,406 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,406 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:32,406 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1992952118, now seen corresponding path program 1 times [2019-09-20 13:27:32,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:32,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,502 INFO L87 Difference]: Start difference. First operand 263 states and 392 transitions. Second operand 4 states. [2019-09-20 13:27:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,893 INFO L93 Difference]: Finished difference Result 284 states and 418 transitions. [2019-09-20 13:27:32,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-20 13:27:32,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,896 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:27:32,896 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:27:32,897 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:27:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-20 13:27:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 391 transitions. [2019-09-20 13:27:32,905 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 391 transitions. Word has length 110 [2019-09-20 13:27:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,906 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 391 transitions. [2019-09-20 13:27:32,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 391 transitions. [2019-09-20 13:27:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:27:32,908 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,908 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:32,908 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1575555512, now seen corresponding path program 1 times [2019-09-20 13:27:32,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:33,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,023 INFO L87 Difference]: Start difference. First operand 263 states and 391 transitions. Second operand 4 states. [2019-09-20 13:27:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,573 INFO L93 Difference]: Finished difference Result 313 states and 456 transitions. [2019-09-20 13:27:33,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-20 13:27:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,576 INFO L225 Difference]: With dead ends: 313 [2019-09-20 13:27:33,576 INFO L226 Difference]: Without dead ends: 313 [2019-09-20 13:27:33,576 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-20 13:27:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 263. [2019-09-20 13:27:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:27:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2019-09-20 13:27:33,581 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 110 [2019-09-20 13:27:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,582 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2019-09-20 13:27:33,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2019-09-20 13:27:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-20 13:27:33,583 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,583 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,583 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,584 INFO L82 PathProgramCache]: Analyzing trace with hash -671143358, now seen corresponding path program 1 times [2019-09-20 13:27:33,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:27:33,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:33,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:33,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:33,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:33,656 INFO L87 Difference]: Start difference. First operand 263 states and 390 transitions. Second operand 3 states. [2019-09-20 13:27:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,684 INFO L93 Difference]: Finished difference Result 499 states and 748 transitions. [2019-09-20 13:27:33,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:33,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-20 13:27:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,687 INFO L225 Difference]: With dead ends: 499 [2019-09-20 13:27:33,688 INFO L226 Difference]: Without dead ends: 499 [2019-09-20 13:27:33,688 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:33,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-20 13:27:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-09-20 13:27:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-20 13:27:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 748 transitions. [2019-09-20 13:27:33,701 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 748 transitions. Word has length 113 [2019-09-20 13:27:33,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,702 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 748 transitions. [2019-09-20 13:27:33,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 748 transitions. [2019-09-20 13:27:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-20 13:27:33,704 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,704 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,705 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,705 INFO L82 PathProgramCache]: Analyzing trace with hash -90474240, now seen corresponding path program 1 times [2019-09-20 13:27:33,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:33,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:33,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:33,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:33,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:33,775 INFO L87 Difference]: Start difference. First operand 499 states and 748 transitions. Second operand 3 states. [2019-09-20 13:27:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,806 INFO L93 Difference]: Finished difference Result 735 states and 1107 transitions. [2019-09-20 13:27:33,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:33,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-20 13:27:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,810 INFO L225 Difference]: With dead ends: 735 [2019-09-20 13:27:33,811 INFO L226 Difference]: Without dead ends: 735 [2019-09-20 13:27:33,811 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-20 13:27:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2019-09-20 13:27:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-09-20 13:27:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1107 transitions. [2019-09-20 13:27:33,825 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1107 transitions. Word has length 132 [2019-09-20 13:27:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,826 INFO L475 AbstractCegarLoop]: Abstraction has 735 states and 1107 transitions. [2019-09-20 13:27:33,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1107 transitions. [2019-09-20 13:27:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-20 13:27:33,828 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,828 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,829 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1873790542, now seen corresponding path program 1 times [2019-09-20 13:27:33,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:33,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,937 INFO L87 Difference]: Start difference. First operand 735 states and 1107 transitions. Second operand 4 states. [2019-09-20 13:27:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,455 INFO L93 Difference]: Finished difference Result 1070 states and 1610 transitions. [2019-09-20 13:27:34,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-09-20 13:27:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,464 INFO L225 Difference]: With dead ends: 1070 [2019-09-20 13:27:34,464 INFO L226 Difference]: Without dead ends: 1070 [2019-09-20 13:27:34,465 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2019-09-20 13:27:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 852. [2019-09-20 13:27:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2019-09-20 13:27:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1323 transitions. [2019-09-20 13:27:34,491 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1323 transitions. Word has length 171 [2019-09-20 13:27:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,492 INFO L475 AbstractCegarLoop]: Abstraction has 852 states and 1323 transitions. [2019-09-20 13:27:34,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1323 transitions. [2019-09-20 13:27:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-20 13:27:34,494 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,495 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-20 13:27:34,495 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash -720049784, now seen corresponding path program 1 times [2019-09-20 13:27:34,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:34,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,645 INFO L87 Difference]: Start difference. First operand 852 states and 1323 transitions. Second operand 4 states. [2019-09-20 13:27:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,130 INFO L93 Difference]: Finished difference Result 1058 states and 1590 transitions. [2019-09-20 13:27:35,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-09-20 13:27:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,135 INFO L225 Difference]: With dead ends: 1058 [2019-09-20 13:27:35,135 INFO L226 Difference]: Without dead ends: 1058 [2019-09-20 13:27:35,135 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-09-20 13:27:35,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 855. [2019-09-20 13:27:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1326 transitions. [2019-09-20 13:27:35,153 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1326 transitions. Word has length 172 [2019-09-20 13:27:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,154 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1326 transitions. [2019-09-20 13:27:35,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,154 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1326 transitions. [2019-09-20 13:27:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-20 13:27:35,182 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,183 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2019-09-20 13:27:35,183 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,183 INFO L82 PathProgramCache]: Analyzing trace with hash -966443302, now seen corresponding path program 1 times [2019-09-20 13:27:35,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:35,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,269 INFO L87 Difference]: Start difference. First operand 855 states and 1326 transitions. Second operand 4 states. [2019-09-20 13:27:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,708 INFO L93 Difference]: Finished difference Result 1058 states and 1587 transitions. [2019-09-20 13:27:35,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-09-20 13:27:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,714 INFO L225 Difference]: With dead ends: 1058 [2019-09-20 13:27:35,714 INFO L226 Difference]: Without dead ends: 1058 [2019-09-20 13:27:35,714 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-09-20 13:27:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 855. [2019-09-20 13:27:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1323 transitions. [2019-09-20 13:27:35,732 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1323 transitions. Word has length 184 [2019-09-20 13:27:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,733 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1323 transitions. [2019-09-20 13:27:35,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1323 transitions. [2019-09-20 13:27:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-20 13:27:35,736 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,736 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:35,736 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,737 INFO L82 PathProgramCache]: Analyzing trace with hash -41422272, now seen corresponding path program 1 times [2019-09-20 13:27:35,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:35,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,835 INFO L87 Difference]: Start difference. First operand 855 states and 1323 transitions. Second operand 4 states. [2019-09-20 13:27:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,331 INFO L93 Difference]: Finished difference Result 1055 states and 1581 transitions. [2019-09-20 13:27:36,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-09-20 13:27:36,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,337 INFO L225 Difference]: With dead ends: 1055 [2019-09-20 13:27:36,337 INFO L226 Difference]: Without dead ends: 1055 [2019-09-20 13:27:36,338 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-09-20 13:27:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 855. [2019-09-20 13:27:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1320 transitions. [2019-09-20 13:27:36,358 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1320 transitions. Word has length 185 [2019-09-20 13:27:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,359 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1320 transitions. [2019-09-20 13:27:36,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1320 transitions. [2019-09-20 13:27:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-20 13:27:36,362 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,362 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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] [2019-09-20 13:27:36,362 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,363 INFO L82 PathProgramCache]: Analyzing trace with hash -911275461, now seen corresponding path program 1 times [2019-09-20 13:27:36,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:36,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,462 INFO L87 Difference]: Start difference. First operand 855 states and 1320 transitions. Second operand 4 states. [2019-09-20 13:27:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,888 INFO L93 Difference]: Finished difference Result 1049 states and 1572 transitions. [2019-09-20 13:27:36,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-09-20 13:27:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,896 INFO L225 Difference]: With dead ends: 1049 [2019-09-20 13:27:36,896 INFO L226 Difference]: Without dead ends: 1049 [2019-09-20 13:27:36,896 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-09-20 13:27:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 855. [2019-09-20 13:27:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1317 transitions. [2019-09-20 13:27:36,914 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1317 transitions. Word has length 185 [2019-09-20 13:27:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,915 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1317 transitions. [2019-09-20 13:27:36,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1317 transitions. [2019-09-20 13:27:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-20 13:27:36,917 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,918 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,918 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,918 INFO L82 PathProgramCache]: Analyzing trace with hash -577111511, now seen corresponding path program 1 times [2019-09-20 13:27:36,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:37,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,045 INFO L87 Difference]: Start difference. First operand 855 states and 1317 transitions. Second operand 4 states. [2019-09-20 13:27:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,499 INFO L93 Difference]: Finished difference Result 1049 states and 1569 transitions. [2019-09-20 13:27:37,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-09-20 13:27:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,504 INFO L225 Difference]: With dead ends: 1049 [2019-09-20 13:27:37,505 INFO L226 Difference]: Without dead ends: 1049 [2019-09-20 13:27:37,505 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-09-20 13:27:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 855. [2019-09-20 13:27:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1314 transitions. [2019-09-20 13:27:37,522 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1314 transitions. Word has length 187 [2019-09-20 13:27:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,522 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1314 transitions. [2019-09-20 13:27:37,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1314 transitions. [2019-09-20 13:27:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-20 13:27:37,525 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,525 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,526 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash -857834008, now seen corresponding path program 1 times [2019-09-20 13:27:37,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:37,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,611 INFO L87 Difference]: Start difference. First operand 855 states and 1314 transitions. Second operand 4 states. [2019-09-20 13:27:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,040 INFO L93 Difference]: Finished difference Result 1049 states and 1566 transitions. [2019-09-20 13:27:38,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-09-20 13:27:38,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,048 INFO L225 Difference]: With dead ends: 1049 [2019-09-20 13:27:38,049 INFO L226 Difference]: Without dead ends: 1049 [2019-09-20 13:27:38,049 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-09-20 13:27:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 855. [2019-09-20 13:27:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1311 transitions. [2019-09-20 13:27:38,064 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1311 transitions. Word has length 188 [2019-09-20 13:27:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,064 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1311 transitions. [2019-09-20 13:27:38,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1311 transitions. [2019-09-20 13:27:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-20 13:27:38,067 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,068 INFO L407 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, 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, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,068 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1526784562, now seen corresponding path program 1 times [2019-09-20 13:27:38,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:38,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,151 INFO L87 Difference]: Start difference. First operand 855 states and 1311 transitions. Second operand 4 states. [2019-09-20 13:27:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,582 INFO L93 Difference]: Finished difference Result 1049 states and 1563 transitions. [2019-09-20 13:27:38,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-09-20 13:27:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,588 INFO L225 Difference]: With dead ends: 1049 [2019-09-20 13:27:38,588 INFO L226 Difference]: Without dead ends: 1049 [2019-09-20 13:27:38,589 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-09-20 13:27:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 855. [2019-09-20 13:27:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1308 transitions. [2019-09-20 13:27:38,605 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1308 transitions. Word has length 189 [2019-09-20 13:27:38,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,606 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1308 transitions. [2019-09-20 13:27:38,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1308 transitions. [2019-09-20 13:27:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-20 13:27:38,609 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,609 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,609 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1345902995, now seen corresponding path program 1 times [2019-09-20 13:27:38,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:38,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,688 INFO L87 Difference]: Start difference. First operand 855 states and 1308 transitions. Second operand 4 states. [2019-09-20 13:27:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,245 INFO L93 Difference]: Finished difference Result 1019 states and 1521 transitions. [2019-09-20 13:27:39,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:39,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-20 13:27:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,253 INFO L225 Difference]: With dead ends: 1019 [2019-09-20 13:27:39,253 INFO L226 Difference]: Without dead ends: 1019 [2019-09-20 13:27:39,253 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-20 13:27:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 855. [2019-09-20 13:27:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1305 transitions. [2019-09-20 13:27:39,270 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1305 transitions. Word has length 190 [2019-09-20 13:27:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,271 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1305 transitions. [2019-09-20 13:27:39,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1305 transitions. [2019-09-20 13:27:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-20 13:27:39,274 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,274 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:39,274 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,276 INFO L82 PathProgramCache]: Analyzing trace with hash 31493361, now seen corresponding path program 1 times [2019-09-20 13:27:39,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:39,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,361 INFO L87 Difference]: Start difference. First operand 855 states and 1305 transitions. Second operand 4 states. [2019-09-20 13:27:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,780 INFO L93 Difference]: Finished difference Result 1019 states and 1518 transitions. [2019-09-20 13:27:39,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:39,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-09-20 13:27:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,789 INFO L225 Difference]: With dead ends: 1019 [2019-09-20 13:27:39,790 INFO L226 Difference]: Without dead ends: 1019 [2019-09-20 13:27:39,791 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-20 13:27:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 855. [2019-09-20 13:27:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1302 transitions. [2019-09-20 13:27:39,806 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1302 transitions. Word has length 193 [2019-09-20 13:27:39,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,806 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1302 transitions. [2019-09-20 13:27:39,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1302 transitions. [2019-09-20 13:27:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-20 13:27:39,809 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,810 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-09-20 13:27:39,810 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,810 INFO L82 PathProgramCache]: Analyzing trace with hash 463086851, now seen corresponding path program 1 times [2019-09-20 13:27:39,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:39,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,904 INFO L87 Difference]: Start difference. First operand 855 states and 1302 transitions. Second operand 4 states. [2019-09-20 13:27:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,324 INFO L93 Difference]: Finished difference Result 1019 states and 1515 transitions. [2019-09-20 13:27:40,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-09-20 13:27:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,333 INFO L225 Difference]: With dead ends: 1019 [2019-09-20 13:27:40,333 INFO L226 Difference]: Without dead ends: 1019 [2019-09-20 13:27:40,334 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-09-20 13:27:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 855. [2019-09-20 13:27:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1299 transitions. [2019-09-20 13:27:40,352 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1299 transitions. Word has length 193 [2019-09-20 13:27:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,352 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1299 transitions. [2019-09-20 13:27:40,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1299 transitions. [2019-09-20 13:27:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-20 13:27:40,358 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,359 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-20 13:27:40,359 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash 18505872, now seen corresponding path program 1 times [2019-09-20 13:27:40,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:40,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,476 INFO L87 Difference]: Start difference. First operand 855 states and 1299 transitions. Second operand 4 states. [2019-09-20 13:27:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,877 INFO L93 Difference]: Finished difference Result 1007 states and 1494 transitions. [2019-09-20 13:27:40,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-20 13:27:40,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,883 INFO L225 Difference]: With dead ends: 1007 [2019-09-20 13:27:40,883 INFO L226 Difference]: Without dead ends: 1007 [2019-09-20 13:27:40,883 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-09-20 13:27:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 855. [2019-09-20 13:27:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1296 transitions. [2019-09-20 13:27:40,899 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1296 transitions. Word has length 194 [2019-09-20 13:27:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,899 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1296 transitions. [2019-09-20 13:27:40,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1296 transitions. [2019-09-20 13:27:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-20 13:27:40,902 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,902 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-09-20 13:27:40,903 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash 244869442, now seen corresponding path program 1 times [2019-09-20 13:27:40,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:41,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:41,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:41,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:41,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:41,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:41,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,051 INFO L87 Difference]: Start difference. First operand 855 states and 1296 transitions. Second operand 4 states. [2019-09-20 13:27:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,432 INFO L93 Difference]: Finished difference Result 995 states and 1476 transitions. [2019-09-20 13:27:41,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-20 13:27:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,436 INFO L225 Difference]: With dead ends: 995 [2019-09-20 13:27:41,436 INFO L226 Difference]: Without dead ends: 995 [2019-09-20 13:27:41,437 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:41,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-09-20 13:27:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 855. [2019-09-20 13:27:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1293 transitions. [2019-09-20 13:27:41,450 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1293 transitions. Word has length 194 [2019-09-20 13:27:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,450 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1293 transitions. [2019-09-20 13:27:41,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1293 transitions. [2019-09-20 13:27:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-20 13:27:41,452 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,453 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-09-20 13:27:41,453 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1712963197, now seen corresponding path program 1 times [2019-09-20 13:27:41,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:41,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:41,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:41,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:41,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:41,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:41,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,541 INFO L87 Difference]: Start difference. First operand 855 states and 1293 transitions. Second operand 4 states. [2019-09-20 13:27:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,936 INFO L93 Difference]: Finished difference Result 995 states and 1473 transitions. [2019-09-20 13:27:41,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-09-20 13:27:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,951 INFO L225 Difference]: With dead ends: 995 [2019-09-20 13:27:41,951 INFO L226 Difference]: Without dead ends: 995 [2019-09-20 13:27:41,951 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-09-20 13:27:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 855. [2019-09-20 13:27:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1290 transitions. [2019-09-20 13:27:41,971 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1290 transitions. Word has length 196 [2019-09-20 13:27:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,972 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1290 transitions. [2019-09-20 13:27:41,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1290 transitions. [2019-09-20 13:27:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-20 13:27:41,975 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,977 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-20 13:27:41,978 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1304837278, now seen corresponding path program 1 times [2019-09-20 13:27:41,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:42,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,070 INFO L87 Difference]: Start difference. First operand 855 states and 1290 transitions. Second operand 4 states. [2019-09-20 13:27:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,417 INFO L93 Difference]: Finished difference Result 971 states and 1431 transitions. [2019-09-20 13:27:42,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-09-20 13:27:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,422 INFO L225 Difference]: With dead ends: 971 [2019-09-20 13:27:42,422 INFO L226 Difference]: Without dead ends: 971 [2019-09-20 13:27:42,423 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-09-20 13:27:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 855. [2019-09-20 13:27:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1287 transitions. [2019-09-20 13:27:42,436 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1287 transitions. Word has length 197 [2019-09-20 13:27:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,436 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1287 transitions. [2019-09-20 13:27:42,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1287 transitions. [2019-09-20 13:27:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-20 13:27:42,439 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,439 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-20 13:27:42,439 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1123035177, now seen corresponding path program 1 times [2019-09-20 13:27:42,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:42,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,524 INFO L87 Difference]: Start difference. First operand 855 states and 1287 transitions. Second operand 4 states. [2019-09-20 13:27:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,886 INFO L93 Difference]: Finished difference Result 971 states and 1428 transitions. [2019-09-20 13:27:42,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-09-20 13:27:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,890 INFO L225 Difference]: With dead ends: 971 [2019-09-20 13:27:42,890 INFO L226 Difference]: Without dead ends: 971 [2019-09-20 13:27:42,891 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-09-20 13:27:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 855. [2019-09-20 13:27:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1284 transitions. [2019-09-20 13:27:42,903 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1284 transitions. Word has length 198 [2019-09-20 13:27:42,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,904 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1284 transitions. [2019-09-20 13:27:42,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1284 transitions. [2019-09-20 13:27:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-20 13:27:42,906 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,906 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:42,907 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,907 INFO L82 PathProgramCache]: Analyzing trace with hash 751737118, now seen corresponding path program 1 times [2019-09-20 13:27:42,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-20 13:27:43,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,030 INFO L87 Difference]: Start difference. First operand 855 states and 1284 transitions. Second operand 4 states. [2019-09-20 13:27:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,357 INFO L93 Difference]: Finished difference Result 941 states and 1389 transitions. [2019-09-20 13:27:43,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-09-20 13:27:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,363 INFO L225 Difference]: With dead ends: 941 [2019-09-20 13:27:43,364 INFO L226 Difference]: Without dead ends: 941 [2019-09-20 13:27:43,364 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-09-20 13:27:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 855. [2019-09-20 13:27:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1281 transitions. [2019-09-20 13:27:43,377 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1281 transitions. Word has length 199 [2019-09-20 13:27:43,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,378 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1281 transitions. [2019-09-20 13:27:43,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1281 transitions. [2019-09-20 13:27:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-20 13:27:43,380 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,380 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1] [2019-09-20 13:27:43,381 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1298069304, now seen corresponding path program 1 times [2019-09-20 13:27:43,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:43,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,469 INFO L87 Difference]: Start difference. First operand 855 states and 1281 transitions. Second operand 4 states. [2019-09-20 13:27:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,817 INFO L93 Difference]: Finished difference Result 941 states and 1386 transitions. [2019-09-20 13:27:43,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-09-20 13:27:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,820 INFO L225 Difference]: With dead ends: 941 [2019-09-20 13:27:43,820 INFO L226 Difference]: Without dead ends: 941 [2019-09-20 13:27:43,820 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-09-20 13:27:43,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 855. [2019-09-20 13:27:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1278 transitions. [2019-09-20 13:27:43,834 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1278 transitions. Word has length 199 [2019-09-20 13:27:43,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,834 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1278 transitions. [2019-09-20 13:27:43,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1278 transitions. [2019-09-20 13:27:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-20 13:27:43,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,837 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-20 13:27:43,837 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1798327576, now seen corresponding path program 1 times [2019-09-20 13:27:43,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:43,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,932 INFO L87 Difference]: Start difference. First operand 855 states and 1278 transitions. Second operand 4 states. [2019-09-20 13:27:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,276 INFO L93 Difference]: Finished difference Result 935 states and 1377 transitions. [2019-09-20 13:27:44,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:44,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-09-20 13:27:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,279 INFO L225 Difference]: With dead ends: 935 [2019-09-20 13:27:44,279 INFO L226 Difference]: Without dead ends: 935 [2019-09-20 13:27:44,280 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-09-20 13:27:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 855. [2019-09-20 13:27:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-09-20 13:27:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1275 transitions. [2019-09-20 13:27:44,294 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1275 transitions. Word has length 199 [2019-09-20 13:27:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,294 INFO L475 AbstractCegarLoop]: Abstraction has 855 states and 1275 transitions. [2019-09-20 13:27:44,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1275 transitions. [2019-09-20 13:27:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-20 13:27:44,297 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,297 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2019-09-20 13:27:44,297 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1528688855, now seen corresponding path program 1 times [2019-09-20 13:27:44,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-20 13:27:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,392 INFO L87 Difference]: Start difference. First operand 855 states and 1275 transitions. Second operand 4 states.