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.15.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:06:03,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:06:03,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:06:03,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:06:03,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:06:03,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:06:03,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:06:03,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:06:03,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:06:03,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:06:03,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:06:03,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:06:03,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:06:03,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:06:03,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:06:03,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:06:03,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:06:03,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:06:03,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:06:03,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:06:03,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:06:03,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:06:03,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:06:03,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:06:03,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:06:03,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:06:03,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:06:03,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:06:03,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:06:03,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:06:03,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:06:03,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:06:03,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:06:03,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:06:03,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:06:03,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:06:03,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:06:03,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:06:03,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:06:03,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:06:03,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:06:03,445 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-16 17:06:03,467 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:06:03,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:06:03,468 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:06:03,468 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:06:03,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:06:03,469 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:06:03,470 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:06:03,470 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:06:03,470 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:06:03,470 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:06:03,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:06:03,473 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:06:03,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:06:03,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:06:03,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:06:03,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:06:03,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:06:03,475 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:06:03,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:06:03,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:06:03,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:06:03,475 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:06:03,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:06:03,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:06:03,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:06:03,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:06:03,477 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:06:03,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:06:03,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:06:03,477 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:06:03,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:06:03,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:06:03,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:06:03,560 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:06:03,561 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:06:03,562 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.15.i.cil-1.c [2019-09-16 17:06:03,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3b2bea0/34c8aeb6447b4279bd2d3bdf3156fdac/FLAGf8778cd97 [2019-09-16 17:06:04,289 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:06:04,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.15.i.cil-1.c [2019-09-16 17:06:04,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3b2bea0/34c8aeb6447b4279bd2d3bdf3156fdac/FLAGf8778cd97 [2019-09-16 17:06:04,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d3b2bea0/34c8aeb6447b4279bd2d3bdf3156fdac [2019-09-16 17:06:04,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:06:04,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:06:04,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:06:04,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:06:04,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:06:04,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:06:04" (1/1) ... [2019-09-16 17:06:04,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d4930b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:04, skipping insertion in model container [2019-09-16 17:06:04,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:06:04" (1/1) ... [2019-09-16 17:06:04,510 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:06:04,595 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:06:05,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:06:05,198 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:06:05,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:06:05,442 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:06:05,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:05 WrapperNode [2019-09-16 17:06:05,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:06:05,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:06:05,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:06:05,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:06:05,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:05" (1/1) ... [2019-09-16 17:06:05,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:05" (1/1) ... [2019-09-16 17:06:05,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:05" (1/1) ... [2019-09-16 17:06:05,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:05" (1/1) ... [2019-09-16 17:06:05,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:05" (1/1) ... [2019-09-16 17:06:05,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:05" (1/1) ... [2019-09-16 17:06:05,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:05" (1/1) ... [2019-09-16 17:06:05,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:06:05,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:06:05,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:06:05,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:06:05,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:06:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:06:05,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:06:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-16 17:06:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-16 17:06:05,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:06:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-16 17:06:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:06:05,726 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:06:05,727 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:06:05,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:06:05,727 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:06:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:06:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:06:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:06:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:06:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:06:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-16 17:06:05,732 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:06:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-16 17:06:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-16 17:06:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:06:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:06:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:06:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:06:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:06:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:06:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:06:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:06:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:06:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:06:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:06:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:06:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:06:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:06:05,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:06:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:06:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:06:05,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:06:05,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:06:06,530 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:06:07,411 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-16 17:06:07,412 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-16 17:06:07,438 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:06:07,439 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:06:07,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:06:07 BoogieIcfgContainer [2019-09-16 17:06:07,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:06:07,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:06:07,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:06:07,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:06:07,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:06:04" (1/3) ... [2019-09-16 17:06:07,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4452d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:06:07, skipping insertion in model container [2019-09-16 17:06:07,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:05" (2/3) ... [2019-09-16 17:06:07,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4452d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:06:07, skipping insertion in model container [2019-09-16 17:06:07,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:06:07" (3/3) ... [2019-09-16 17:06:07,454 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2019-09-16 17:06:07,466 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:06:07,479 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:06:07,501 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:06:07,537 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:06:07,538 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:06:07,538 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:06:07,538 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:06:07,538 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:06:07,538 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:06:07,539 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:06:07,539 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:06:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-09-16 17:06:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-16 17:06:07,592 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:07,594 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] [2019-09-16 17:06:07,597 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:07,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1890042678, now seen corresponding path program 1 times [2019-09-16 17:06:07,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:07,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:07,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:08,072 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-16 17:06:08,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:08,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:08,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:08,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:08,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:08,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:08,100 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-09-16 17:06:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:08,620 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2019-09-16 17:06:08,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:08,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-16 17:06:08,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:08,649 INFO L225 Difference]: With dead ends: 193 [2019-09-16 17:06:08,650 INFO L226 Difference]: Without dead ends: 172 [2019-09-16 17:06:08,653 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-16 17:06:08,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-16 17:06:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-09-16 17:06:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-16 17:06:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 238 transitions. [2019-09-16 17:06:08,709 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 238 transitions. Word has length 49 [2019-09-16 17:06:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:08,710 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 238 transitions. [2019-09-16 17:06:08,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2019-09-16 17:06:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-16 17:06:08,714 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:08,714 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] [2019-09-16 17:06:08,714 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:08,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1217836546, now seen corresponding path program 1 times [2019-09-16 17:06:08,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:08,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:08,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:08,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:08,892 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-16 17:06:08,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:08,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:08,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:08,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:08,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:08,896 INFO L87 Difference]: Start difference. First operand 155 states and 238 transitions. Second operand 4 states. [2019-09-16 17:06:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:09,303 INFO L93 Difference]: Finished difference Result 172 states and 258 transitions. [2019-09-16 17:06:09,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:09,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-16 17:06:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:09,306 INFO L225 Difference]: With dead ends: 172 [2019-09-16 17:06:09,306 INFO L226 Difference]: Without dead ends: 172 [2019-09-16 17:06:09,307 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-16 17:06:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-16 17:06:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-09-16 17:06:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-16 17:06:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 237 transitions. [2019-09-16 17:06:09,331 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 237 transitions. Word has length 62 [2019-09-16 17:06:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:09,332 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 237 transitions. [2019-09-16 17:06:09,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 237 transitions. [2019-09-16 17:06:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:06:09,339 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:09,339 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] [2019-09-16 17:06:09,340 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:09,341 INFO L82 PathProgramCache]: Analyzing trace with hash -947267054, now seen corresponding path program 1 times [2019-09-16 17:06:09,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:09,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:09,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:09,507 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-16 17:06:09,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:09,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:09,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:09,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:09,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:09,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:09,509 INFO L87 Difference]: Start difference. First operand 155 states and 237 transitions. Second operand 4 states. [2019-09-16 17:06:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:09,871 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2019-09-16 17:06:09,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:09,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:06:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:09,874 INFO L225 Difference]: With dead ends: 171 [2019-09-16 17:06:09,874 INFO L226 Difference]: Without dead ends: 171 [2019-09-16 17:06:09,874 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-16 17:06:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-16 17:06:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2019-09-16 17:06:09,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-16 17:06:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 236 transitions. [2019-09-16 17:06:09,885 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 236 transitions. Word has length 63 [2019-09-16 17:06:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:09,885 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 236 transitions. [2019-09-16 17:06:09,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2019-09-16 17:06:09,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:06:09,888 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:09,889 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] [2019-09-16 17:06:09,889 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash 939636390, now seen corresponding path program 1 times [2019-09-16 17:06:09,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:09,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:09,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:09,977 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-16 17:06:09,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:09,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:06:09,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:09,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:06:09,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:06:09,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:09,979 INFO L87 Difference]: Start difference. First operand 155 states and 236 transitions. Second operand 5 states. [2019-09-16 17:06:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:10,500 INFO L93 Difference]: Finished difference Result 176 states and 264 transitions. [2019-09-16 17:06:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:06:10,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-16 17:06:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:10,503 INFO L225 Difference]: With dead ends: 176 [2019-09-16 17:06:10,503 INFO L226 Difference]: Without dead ends: 176 [2019-09-16 17:06:10,503 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:06:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-16 17:06:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-16 17:06:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-16 17:06:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 263 transitions. [2019-09-16 17:06:10,514 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 263 transitions. Word has length 63 [2019-09-16 17:06:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:10,514 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 263 transitions. [2019-09-16 17:06:10,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:06:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 263 transitions. [2019-09-16 17:06:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:06:10,517 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:10,517 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] [2019-09-16 17:06:10,517 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:10,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:10,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2122203230, now seen corresponding path program 1 times [2019-09-16 17:06:10,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:10,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:10,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:10,674 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-16 17:06:10,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:10,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:10,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:10,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:10,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:10,677 INFO L87 Difference]: Start difference. First operand 175 states and 263 transitions. Second operand 4 states. [2019-09-16 17:06:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:10,958 INFO L93 Difference]: Finished difference Result 190 states and 280 transitions. [2019-09-16 17:06:10,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:10,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:06:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:10,960 INFO L225 Difference]: With dead ends: 190 [2019-09-16 17:06:10,960 INFO L226 Difference]: Without dead ends: 190 [2019-09-16 17:06:10,961 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-16 17:06:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-16 17:06:10,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2019-09-16 17:06:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-16 17:06:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 262 transitions. [2019-09-16 17:06:10,969 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 262 transitions. Word has length 63 [2019-09-16 17:06:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:10,970 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 262 transitions. [2019-09-16 17:06:10,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 262 transitions. [2019-09-16 17:06:10,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:06:10,971 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:10,972 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] [2019-09-16 17:06:10,972 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:10,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2054643229, now seen corresponding path program 1 times [2019-09-16 17:06:10,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:10,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:10,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:10,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:11,035 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-16 17:06:11,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:11,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:11,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:11,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:11,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:11,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:11,037 INFO L87 Difference]: Start difference. First operand 175 states and 262 transitions. Second operand 4 states. [2019-09-16 17:06:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:11,310 INFO L93 Difference]: Finished difference Result 188 states and 277 transitions. [2019-09-16 17:06:11,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:11,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:06:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:11,313 INFO L225 Difference]: With dead ends: 188 [2019-09-16 17:06:11,313 INFO L226 Difference]: Without dead ends: 188 [2019-09-16 17:06:11,313 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-16 17:06:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-16 17:06:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-16 17:06:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-16 17:06:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 261 transitions. [2019-09-16 17:06:11,321 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 261 transitions. Word has length 63 [2019-09-16 17:06:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:11,322 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 261 transitions. [2019-09-16 17:06:11,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 261 transitions. [2019-09-16 17:06:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:06:11,323 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:11,323 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] [2019-09-16 17:06:11,324 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:11,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1184518913, now seen corresponding path program 1 times [2019-09-16 17:06:11,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:11,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:11,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:11,386 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-16 17:06:11,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:11,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:11,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:11,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:11,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:11,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:11,388 INFO L87 Difference]: Start difference. First operand 175 states and 261 transitions. Second operand 4 states. [2019-09-16 17:06:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:11,693 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-09-16 17:06:11,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:11,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:06:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:11,695 INFO L225 Difference]: With dead ends: 188 [2019-09-16 17:06:11,695 INFO L226 Difference]: Without dead ends: 188 [2019-09-16 17:06:11,696 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-16 17:06:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-16 17:06:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-16 17:06:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-16 17:06:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 260 transitions. [2019-09-16 17:06:11,702 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 260 transitions. Word has length 64 [2019-09-16 17:06:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:11,702 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 260 transitions. [2019-09-16 17:06:11,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 260 transitions. [2019-09-16 17:06:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:06:11,703 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:11,704 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] [2019-09-16 17:06:11,704 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:11,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:11,704 INFO L82 PathProgramCache]: Analyzing trace with hash 927095706, now seen corresponding path program 1 times [2019-09-16 17:06:11,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:11,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:11,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:11,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:11,788 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-16 17:06:11,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:11,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:11,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:11,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:11,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:11,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:11,790 INFO L87 Difference]: Start difference. First operand 175 states and 260 transitions. Second operand 4 states. [2019-09-16 17:06:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:12,090 INFO L93 Difference]: Finished difference Result 188 states and 275 transitions. [2019-09-16 17:06:12,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:12,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:06:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:12,092 INFO L225 Difference]: With dead ends: 188 [2019-09-16 17:06:12,093 INFO L226 Difference]: Without dead ends: 188 [2019-09-16 17:06:12,093 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-16 17:06:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-16 17:06:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-16 17:06:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-16 17:06:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 259 transitions. [2019-09-16 17:06:12,099 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 259 transitions. Word has length 65 [2019-09-16 17:06:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:12,099 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 259 transitions. [2019-09-16 17:06:12,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 259 transitions. [2019-09-16 17:06:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-16 17:06:12,101 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:12,101 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] [2019-09-16 17:06:12,101 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:12,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1779390022, now seen corresponding path program 1 times [2019-09-16 17:06:12,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:12,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:12,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:12,184 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-16 17:06:12,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:12,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:12,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:12,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:12,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:12,186 INFO L87 Difference]: Start difference. First operand 175 states and 259 transitions. Second operand 4 states. [2019-09-16 17:06:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:12,453 INFO L93 Difference]: Finished difference Result 188 states and 274 transitions. [2019-09-16 17:06:12,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:12,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-16 17:06:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:12,455 INFO L225 Difference]: With dead ends: 188 [2019-09-16 17:06:12,455 INFO L226 Difference]: Without dead ends: 188 [2019-09-16 17:06:12,456 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-16 17:06:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-16 17:06:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-16 17:06:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-16 17:06:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2019-09-16 17:06:12,462 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 66 [2019-09-16 17:06:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:12,462 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2019-09-16 17:06:12,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2019-09-16 17:06:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-16 17:06:12,464 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:12,464 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] [2019-09-16 17:06:12,464 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1997488103, now seen corresponding path program 1 times [2019-09-16 17:06:12,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:12,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:12,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:12,527 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-16 17:06:12,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:12,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:12,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:12,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:12,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:12,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:12,529 INFO L87 Difference]: Start difference. First operand 175 states and 258 transitions. Second operand 4 states. [2019-09-16 17:06:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:12,852 INFO L93 Difference]: Finished difference Result 217 states and 320 transitions. [2019-09-16 17:06:12,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:12,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-16 17:06:12,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:12,854 INFO L225 Difference]: With dead ends: 217 [2019-09-16 17:06:12,855 INFO L226 Difference]: Without dead ends: 217 [2019-09-16 17:06:12,855 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-16 17:06:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-16 17:06:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2019-09-16 17:06:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-16 17:06:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 295 transitions. [2019-09-16 17:06:12,864 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 295 transitions. Word has length 66 [2019-09-16 17:06:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:12,864 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 295 transitions. [2019-09-16 17:06:12,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 295 transitions. [2019-09-16 17:06:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-16 17:06:12,865 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:12,866 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] [2019-09-16 17:06:12,866 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:12,866 INFO L82 PathProgramCache]: Analyzing trace with hash 771836149, now seen corresponding path program 1 times [2019-09-16 17:06:12,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:12,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:12,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:12,943 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-16 17:06:12,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:12,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:12,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:12,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:12,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:12,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:12,945 INFO L87 Difference]: Start difference. First operand 197 states and 295 transitions. Second operand 4 states. [2019-09-16 17:06:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:13,196 INFO L93 Difference]: Finished difference Result 200 states and 298 transitions. [2019-09-16 17:06:13,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:13,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-16 17:06:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:13,198 INFO L225 Difference]: With dead ends: 200 [2019-09-16 17:06:13,198 INFO L226 Difference]: Without dead ends: 200 [2019-09-16 17:06:13,199 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-16 17:06:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-16 17:06:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2019-09-16 17:06:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-16 17:06:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 294 transitions. [2019-09-16 17:06:13,205 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 294 transitions. Word has length 67 [2019-09-16 17:06:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:13,206 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 294 transitions. [2019-09-16 17:06:13,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 294 transitions. [2019-09-16 17:06:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:06:13,207 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:13,207 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] [2019-09-16 17:06:13,207 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:13,208 INFO L82 PathProgramCache]: Analyzing trace with hash -677623021, now seen corresponding path program 1 times [2019-09-16 17:06:13,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:13,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:13,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:13,270 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-16 17:06:13,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:13,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:13,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:13,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:13,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:13,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:13,272 INFO L87 Difference]: Start difference. First operand 197 states and 294 transitions. Second operand 4 states. [2019-09-16 17:06:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:13,649 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2019-09-16 17:06:13,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:13,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:06:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:13,651 INFO L225 Difference]: With dead ends: 217 [2019-09-16 17:06:13,651 INFO L226 Difference]: Without dead ends: 217 [2019-09-16 17:06:13,652 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-16 17:06:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-16 17:06:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2019-09-16 17:06:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-16 17:06:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 293 transitions. [2019-09-16 17:06:13,657 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 293 transitions. Word has length 79 [2019-09-16 17:06:13,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:13,658 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 293 transitions. [2019-09-16 17:06:13,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 293 transitions. [2019-09-16 17:06:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:06:13,659 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:13,659 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] [2019-09-16 17:06:13,659 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:13,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:13,660 INFO L82 PathProgramCache]: Analyzing trace with hash -802468499, now seen corresponding path program 1 times [2019-09-16 17:06:13,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:13,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:13,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:13,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:13,735 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-16 17:06:13,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:13,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:13,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:13,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:13,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:13,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:13,739 INFO L87 Difference]: Start difference. First operand 197 states and 293 transitions. Second operand 4 states. [2019-09-16 17:06:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:14,042 INFO L93 Difference]: Finished difference Result 216 states and 316 transitions. [2019-09-16 17:06:14,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:14,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:06:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:14,045 INFO L225 Difference]: With dead ends: 216 [2019-09-16 17:06:14,045 INFO L226 Difference]: Without dead ends: 216 [2019-09-16 17:06:14,046 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-16 17:06:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-16 17:06:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2019-09-16 17:06:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-16 17:06:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 292 transitions. [2019-09-16 17:06:14,053 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 292 transitions. Word has length 80 [2019-09-16 17:06:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:14,053 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 292 transitions. [2019-09-16 17:06:14,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 292 transitions. [2019-09-16 17:06:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:06:14,054 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:14,055 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] [2019-09-16 17:06:14,055 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash -870028500, now seen corresponding path program 1 times [2019-09-16 17:06:14,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:14,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,115 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-16 17:06:14,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,117 INFO L87 Difference]: Start difference. First operand 197 states and 292 transitions. Second operand 4 states. [2019-09-16 17:06:14,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:14,423 INFO L93 Difference]: Finished difference Result 214 states and 313 transitions. [2019-09-16 17:06:14,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:14,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:06:14,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:14,426 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:06:14,426 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:06:14,426 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-16 17:06:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:06:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-16 17:06:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-16 17:06:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 291 transitions. [2019-09-16 17:06:14,433 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 291 transitions. Word has length 80 [2019-09-16 17:06:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:14,433 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 291 transitions. [2019-09-16 17:06:14,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 291 transitions. [2019-09-16 17:06:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:06:14,434 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:14,435 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] [2019-09-16 17:06:14,435 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:14,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:14,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1655029296, now seen corresponding path program 1 times [2019-09-16 17:06:14,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:14,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:14,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,495 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-16 17:06:14,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,497 INFO L87 Difference]: Start difference. First operand 197 states and 291 transitions. Second operand 4 states. [2019-09-16 17:06:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:14,783 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-16 17:06:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:14,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:06:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:14,785 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:06:14,785 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:06:14,786 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-16 17:06:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:06:14,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-16 17:06:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-16 17:06:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 290 transitions. [2019-09-16 17:06:14,792 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 290 transitions. Word has length 81 [2019-09-16 17:06:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:14,792 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 290 transitions. [2019-09-16 17:06:14,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 290 transitions. [2019-09-16 17:06:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-16 17:06:14,793 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:14,793 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] [2019-09-16 17:06:14,794 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash -773824279, now seen corresponding path program 1 times [2019-09-16 17:06:14,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:14,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:14,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:14,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:14,862 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-16 17:06:14,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:14,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:14,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:14,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:14,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:14,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:14,864 INFO L87 Difference]: Start difference. First operand 197 states and 290 transitions. Second operand 4 states. [2019-09-16 17:06:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:15,242 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2019-09-16 17:06:15,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:15,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-16 17:06:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:15,245 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:06:15,245 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:06:15,245 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-16 17:06:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:06:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-16 17:06:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-16 17:06:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2019-09-16 17:06:15,254 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 82 [2019-09-16 17:06:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:15,254 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2019-09-16 17:06:15,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2019-09-16 17:06:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:06:15,257 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:15,257 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] [2019-09-16 17:06:15,257 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1326665291, now seen corresponding path program 1 times [2019-09-16 17:06:15,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:15,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:15,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:15,350 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-16 17:06:15,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:15,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:15,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:15,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:15,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:15,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:15,352 INFO L87 Difference]: Start difference. First operand 197 states and 289 transitions. Second operand 4 states. [2019-09-16 17:06:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:15,715 INFO L93 Difference]: Finished difference Result 214 states and 310 transitions. [2019-09-16 17:06:15,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:15,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-16 17:06:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:15,717 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:06:15,718 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:06:15,718 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-16 17:06:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:06:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-16 17:06:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-16 17:06:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 288 transitions. [2019-09-16 17:06:15,724 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 288 transitions. Word has length 83 [2019-09-16 17:06:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:15,724 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 288 transitions. [2019-09-16 17:06:15,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2019-09-16 17:06:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-16 17:06:15,726 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:15,726 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] [2019-09-16 17:06:15,726 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:15,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1724696956, now seen corresponding path program 1 times [2019-09-16 17:06:15,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:15,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:15,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:15,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:15,813 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-16 17:06:15,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:15,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:15,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:15,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:15,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:15,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:15,815 INFO L87 Difference]: Start difference. First operand 197 states and 288 transitions. Second operand 4 states. [2019-09-16 17:06:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:16,167 INFO L93 Difference]: Finished difference Result 204 states and 297 transitions. [2019-09-16 17:06:16,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:16,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-16 17:06:16,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:16,170 INFO L225 Difference]: With dead ends: 204 [2019-09-16 17:06:16,170 INFO L226 Difference]: Without dead ends: 204 [2019-09-16 17:06:16,171 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-16 17:06:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-16 17:06:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2019-09-16 17:06:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-16 17:06:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2019-09-16 17:06:16,178 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 84 [2019-09-16 17:06:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:16,179 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2019-09-16 17:06:16,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2019-09-16 17:06:16,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-16 17:06:16,181 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,182 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] [2019-09-16 17:06:16,182 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash 254389468, now seen corresponding path program 1 times [2019-09-16 17:06:16,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:16,274 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-16 17:06:16,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:16,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:16,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:16,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:16,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:16,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:16,276 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand 4 states. [2019-09-16 17:06:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:16,775 INFO L93 Difference]: Finished difference Result 305 states and 452 transitions. [2019-09-16 17:06:16,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:16,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-16 17:06:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:16,777 INFO L225 Difference]: With dead ends: 305 [2019-09-16 17:06:16,777 INFO L226 Difference]: Without dead ends: 305 [2019-09-16 17:06:16,778 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-16 17:06:16,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-16 17:06:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 238. [2019-09-16 17:06:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-16 17:06:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 360 transitions. [2019-09-16 17:06:16,785 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 360 transitions. Word has length 88 [2019-09-16 17:06:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:16,785 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 360 transitions. [2019-09-16 17:06:16,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 360 transitions. [2019-09-16 17:06:16,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-16 17:06:16,786 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,787 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] [2019-09-16 17:06:16,787 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,787 INFO L82 PathProgramCache]: Analyzing trace with hash 678036190, now seen corresponding path program 1 times [2019-09-16 17:06:16,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:16,868 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-16 17:06:16,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:16,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:16,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:16,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:16,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:16,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:16,869 INFO L87 Difference]: Start difference. First operand 238 states and 360 transitions. Second operand 4 states. [2019-09-16 17:06:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,269 INFO L93 Difference]: Finished difference Result 286 states and 431 transitions. [2019-09-16 17:06:17,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-16 17:06:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,273 INFO L225 Difference]: With dead ends: 286 [2019-09-16 17:06:17,273 INFO L226 Difference]: Without dead ends: 286 [2019-09-16 17:06:17,274 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-16 17:06:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-16 17:06:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 262. [2019-09-16 17:06:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-16 17:06:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 401 transitions. [2019-09-16 17:06:17,286 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 401 transitions. Word has length 88 [2019-09-16 17:06:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,287 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 401 transitions. [2019-09-16 17:06:17,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 401 transitions. [2019-09-16 17:06:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-16 17:06:17,289 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,290 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] [2019-09-16 17:06:17,290 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1640143096, now seen corresponding path program 1 times [2019-09-16 17:06:17,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,462 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-16 17:06:17,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:17,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:17,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:17,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:17,465 INFO L87 Difference]: Start difference. First operand 262 states and 401 transitions. Second operand 4 states. [2019-09-16 17:06:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,888 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2019-09-16 17:06:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-16 17:06:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,892 INFO L225 Difference]: With dead ends: 321 [2019-09-16 17:06:17,892 INFO L226 Difference]: Without dead ends: 321 [2019-09-16 17:06:17,892 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-16 17:06:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-16 17:06:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 263. [2019-09-16 17:06:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 402 transitions. [2019-09-16 17:06:17,900 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 402 transitions. Word has length 89 [2019-09-16 17:06:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,901 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 402 transitions. [2019-09-16 17:06:17,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 402 transitions. [2019-09-16 17:06:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-16 17:06:17,902 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,902 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] [2019-09-16 17:06:17,903 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1372359888, now seen corresponding path program 1 times [2019-09-16 17:06:17,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,969 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-16 17:06:17,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:17,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:17,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:17,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:17,971 INFO L87 Difference]: Start difference. First operand 263 states and 402 transitions. Second operand 4 states. [2019-09-16 17:06:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,384 INFO L93 Difference]: Finished difference Result 321 states and 480 transitions. [2019-09-16 17:06:18,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:18,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-16 17:06:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,387 INFO L225 Difference]: With dead ends: 321 [2019-09-16 17:06:18,387 INFO L226 Difference]: Without dead ends: 321 [2019-09-16 17:06:18,388 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-16 17:06:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-16 17:06:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 263. [2019-09-16 17:06:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 401 transitions. [2019-09-16 17:06:18,395 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 401 transitions. Word has length 101 [2019-09-16 17:06:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,395 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 401 transitions. [2019-09-16 17:06:18,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 401 transitions. [2019-09-16 17:06:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-16 17:06:18,397 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:18,397 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] [2019-09-16 17:06:18,397 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:18,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:18,398 INFO L82 PathProgramCache]: Analyzing trace with hash -496340882, now seen corresponding path program 1 times [2019-09-16 17:06:18,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:18,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:18,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,465 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-16 17:06:18,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:18,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:18,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:18,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:18,467 INFO L87 Difference]: Start difference. First operand 263 states and 401 transitions. Second operand 4 states. [2019-09-16 17:06:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,779 INFO L93 Difference]: Finished difference Result 287 states and 430 transitions. [2019-09-16 17:06:18,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:18,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-16 17:06:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,781 INFO L225 Difference]: With dead ends: 287 [2019-09-16 17:06:18,781 INFO L226 Difference]: Without dead ends: 287 [2019-09-16 17:06:18,782 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-16 17:06:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-16 17:06:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2019-09-16 17:06:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 400 transitions. [2019-09-16 17:06:18,788 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 400 transitions. Word has length 101 [2019-09-16 17:06:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,789 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 400 transitions. [2019-09-16 17:06:18,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 400 transitions. [2019-09-16 17:06:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:18,790 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:18,791 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] [2019-09-16 17:06:18,791 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:18,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash -864474896, now seen corresponding path program 1 times [2019-09-16 17:06:18,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:18,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:18,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,868 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-16 17:06:18,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:18,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:18,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:18,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:18,872 INFO L87 Difference]: Start difference. First operand 263 states and 400 transitions. Second operand 4 states. [2019-09-16 17:06:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,339 INFO L93 Difference]: Finished difference Result 320 states and 477 transitions. [2019-09-16 17:06:19,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,345 INFO L225 Difference]: With dead ends: 320 [2019-09-16 17:06:19,345 INFO L226 Difference]: Without dead ends: 320 [2019-09-16 17:06:19,346 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-16 17:06:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-16 17:06:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-09-16 17:06:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 399 transitions. [2019-09-16 17:06:19,356 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 399 transitions. Word has length 102 [2019-09-16 17:06:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,356 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 399 transitions. [2019-09-16 17:06:19,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 399 transitions. [2019-09-16 17:06:19,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:19,359 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,360 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] [2019-09-16 17:06:19,360 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash -932034897, now seen corresponding path program 1 times [2019-09-16 17:06:19,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,458 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-16 17:06:19,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,459 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,460 INFO L87 Difference]: Start difference. First operand 263 states and 399 transitions. Second operand 4 states. [2019-09-16 17:06:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,874 INFO L93 Difference]: Finished difference Result 318 states and 474 transitions. [2019-09-16 17:06:19,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,876 INFO L225 Difference]: With dead ends: 318 [2019-09-16 17:06:19,877 INFO L226 Difference]: Without dead ends: 318 [2019-09-16 17:06:19,877 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-16 17:06:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-16 17:06:19,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-16 17:06:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 398 transitions. [2019-09-16 17:06:19,884 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 398 transitions. Word has length 102 [2019-09-16 17:06:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,884 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 398 transitions. [2019-09-16 17:06:19,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 398 transitions. [2019-09-16 17:06:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:19,886 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,886 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] [2019-09-16 17:06:19,886 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,887 INFO L82 PathProgramCache]: Analyzing trace with hash 522310514, now seen corresponding path program 1 times [2019-09-16 17:06:19,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,953 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-16 17:06:19,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,955 INFO L87 Difference]: Start difference. First operand 263 states and 398 transitions. Second operand 4 states. [2019-09-16 17:06:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,258 INFO L93 Difference]: Finished difference Result 286 states and 426 transitions. [2019-09-16 17:06:20,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,261 INFO L225 Difference]: With dead ends: 286 [2019-09-16 17:06:20,261 INFO L226 Difference]: Without dead ends: 286 [2019-09-16 17:06:20,262 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-16 17:06:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-16 17:06:20,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 263. [2019-09-16 17:06:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 397 transitions. [2019-09-16 17:06:20,267 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 397 transitions. Word has length 102 [2019-09-16 17:06:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,268 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 397 transitions. [2019-09-16 17:06:20,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 397 transitions. [2019-09-16 17:06:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:20,269 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,269 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] [2019-09-16 17:06:20,270 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,270 INFO L82 PathProgramCache]: Analyzing trace with hash 454750513, now seen corresponding path program 1 times [2019-09-16 17:06:20,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,338 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-16 17:06:20,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:20,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:20,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:20,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,340 INFO L87 Difference]: Start difference. First operand 263 states and 397 transitions. Second operand 4 states. [2019-09-16 17:06:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,637 INFO L93 Difference]: Finished difference Result 284 states and 423 transitions. [2019-09-16 17:06:20,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,640 INFO L225 Difference]: With dead ends: 284 [2019-09-16 17:06:20,640 INFO L226 Difference]: Without dead ends: 284 [2019-09-16 17:06:20,640 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-16 17:06:20,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-16 17:06:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-16 17:06:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 396 transitions. [2019-09-16 17:06:20,646 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 396 transitions. Word has length 102 [2019-09-16 17:06:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,647 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 396 transitions. [2019-09-16 17:06:20,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2019-09-16 17:06:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:06:20,648 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,648 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] [2019-09-16 17:06:20,649 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash 717739693, now seen corresponding path program 1 times [2019-09-16 17:06:20,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,704 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-16 17:06:20,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:20,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:20,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:20,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,706 INFO L87 Difference]: Start difference. First operand 263 states and 396 transitions. Second operand 4 states. [2019-09-16 17:06:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,118 INFO L93 Difference]: Finished difference Result 318 states and 471 transitions. [2019-09-16 17:06:21,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:06:21,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,121 INFO L225 Difference]: With dead ends: 318 [2019-09-16 17:06:21,121 INFO L226 Difference]: Without dead ends: 318 [2019-09-16 17:06:21,121 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-16 17:06:21,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-16 17:06:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-16 17:06:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 395 transitions. [2019-09-16 17:06:21,129 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 395 transitions. Word has length 103 [2019-09-16 17:06:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,129 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 395 transitions. [2019-09-16 17:06:21,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 395 transitions. [2019-09-16 17:06:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:06:21,131 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,131 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] [2019-09-16 17:06:21,132 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,132 INFO L82 PathProgramCache]: Analyzing trace with hash 758414443, now seen corresponding path program 1 times [2019-09-16 17:06:21,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,242 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-16 17:06:21,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,244 INFO L87 Difference]: Start difference. First operand 263 states and 395 transitions. Second operand 4 states. [2019-09-16 17:06:21,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,632 INFO L93 Difference]: Finished difference Result 284 states and 421 transitions. [2019-09-16 17:06:21,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:06:21,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,635 INFO L225 Difference]: With dead ends: 284 [2019-09-16 17:06:21,635 INFO L226 Difference]: Without dead ends: 284 [2019-09-16 17:06:21,636 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-16 17:06:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-16 17:06:21,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-16 17:06:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 394 transitions. [2019-09-16 17:06:21,643 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 394 transitions. Word has length 103 [2019-09-16 17:06:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,643 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 394 transitions. [2019-09-16 17:06:21,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 394 transitions. [2019-09-16 17:06:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:06:21,645 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,645 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] [2019-09-16 17:06:21,646 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,646 INFO L82 PathProgramCache]: Analyzing trace with hash -232429652, now seen corresponding path program 1 times [2019-09-16 17:06:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,726 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-16 17:06:21,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,728 INFO L87 Difference]: Start difference. First operand 263 states and 394 transitions. Second operand 4 states. [2019-09-16 17:06:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,112 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2019-09-16 17:06:22,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:06:22,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,113 INFO L225 Difference]: With dead ends: 318 [2019-09-16 17:06:22,114 INFO L226 Difference]: Without dead ends: 318 [2019-09-16 17:06:22,114 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-16 17:06:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-16 17:06:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-16 17:06:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 393 transitions. [2019-09-16 17:06:22,120 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 393 transitions. Word has length 104 [2019-09-16 17:06:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,121 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 393 transitions. [2019-09-16 17:06:22,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 393 transitions. [2019-09-16 17:06:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:06:22,122 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,122 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] [2019-09-16 17:06:22,122 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1028487598, now seen corresponding path program 1 times [2019-09-16 17:06:22,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,186 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-16 17:06:22,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,188 INFO L87 Difference]: Start difference. First operand 263 states and 393 transitions. Second operand 4 states. [2019-09-16 17:06:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,461 INFO L93 Difference]: Finished difference Result 284 states and 419 transitions. [2019-09-16 17:06:22,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:06:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,464 INFO L225 Difference]: With dead ends: 284 [2019-09-16 17:06:22,464 INFO L226 Difference]: Without dead ends: 284 [2019-09-16 17:06:22,465 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-16 17:06:22,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-16 17:06:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-16 17:06:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 392 transitions. [2019-09-16 17:06:22,471 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 392 transitions. Word has length 104 [2019-09-16 17:06:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,471 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 392 transitions. [2019-09-16 17:06:22,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 392 transitions. [2019-09-16 17:06:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:06:22,472 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,473 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] [2019-09-16 17:06:22,473 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,473 INFO L82 PathProgramCache]: Analyzing trace with hash 930029544, now seen corresponding path program 1 times [2019-09-16 17:06:22,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,542 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-16 17:06:22,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,544 INFO L87 Difference]: Start difference. First operand 263 states and 392 transitions. Second operand 4 states. [2019-09-16 17:06:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,953 INFO L93 Difference]: Finished difference Result 318 states and 467 transitions. [2019-09-16 17:06:22,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:06:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,955 INFO L225 Difference]: With dead ends: 318 [2019-09-16 17:06:22,955 INFO L226 Difference]: Without dead ends: 318 [2019-09-16 17:06:22,956 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-16 17:06:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-16 17:06:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-16 17:06:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 391 transitions. [2019-09-16 17:06:22,962 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 391 transitions. Word has length 105 [2019-09-16 17:06:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,963 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 391 transitions. [2019-09-16 17:06:22,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 391 transitions. [2019-09-16 17:06:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:06:22,964 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,964 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] [2019-09-16 17:06:22,964 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1363758630, now seen corresponding path program 1 times [2019-09-16 17:06:22,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:23,036 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-16 17:06:23,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:23,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:23,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:23,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:23,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:23,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:23,038 INFO L87 Difference]: Start difference. First operand 263 states and 391 transitions. Second operand 4 states. [2019-09-16 17:06:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:23,325 INFO L93 Difference]: Finished difference Result 284 states and 417 transitions. [2019-09-16 17:06:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:23,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:06:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:23,327 INFO L225 Difference]: With dead ends: 284 [2019-09-16 17:06:23,328 INFO L226 Difference]: Without dead ends: 284 [2019-09-16 17:06:23,328 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-16 17:06:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-16 17:06:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-16 17:06:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2019-09-16 17:06:23,334 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 105 [2019-09-16 17:06:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:23,334 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2019-09-16 17:06:23,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2019-09-16 17:06:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:06:23,336 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:23,336 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] [2019-09-16 17:06:23,336 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:23,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1135503225, now seen corresponding path program 1 times [2019-09-16 17:06:23,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:23,437 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-16 17:06:23,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:23,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:23,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:23,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:23,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:23,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:23,439 INFO L87 Difference]: Start difference. First operand 263 states and 390 transitions. Second operand 4 states. [2019-09-16 17:06:23,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:23,894 INFO L93 Difference]: Finished difference Result 308 states and 453 transitions. [2019-09-16 17:06:23,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:23,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:06:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:23,897 INFO L225 Difference]: With dead ends: 308 [2019-09-16 17:06:23,897 INFO L226 Difference]: Without dead ends: 308 [2019-09-16 17:06:23,898 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-16 17:06:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-16 17:06:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2019-09-16 17:06:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions. [2019-09-16 17:06:23,906 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 106 [2019-09-16 17:06:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:23,906 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions. [2019-09-16 17:06:23,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions. [2019-09-16 17:06:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:06:23,908 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:23,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] [2019-09-16 17:06:23,909 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:23,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash -574803447, now seen corresponding path program 1 times [2019-09-16 17:06:23,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:23,974 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-16 17:06:23,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:23,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:23,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:23,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:23,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:23,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:23,975 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand 4 states. [2019-09-16 17:06:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,242 INFO L93 Difference]: Finished difference Result 274 states and 403 transitions. [2019-09-16 17:06:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:06:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,246 INFO L225 Difference]: With dead ends: 274 [2019-09-16 17:06:24,247 INFO L226 Difference]: Without dead ends: 274 [2019-09-16 17:06:24,247 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-16 17:06:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-16 17:06:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 263. [2019-09-16 17:06:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 388 transitions. [2019-09-16 17:06:24,252 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 388 transitions. Word has length 106 [2019-09-16 17:06:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,253 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 388 transitions. [2019-09-16 17:06:24,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 388 transitions. [2019-09-16 17:06:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-16 17:06:24,254 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,254 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:24,255 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1961804019, now seen corresponding path program 1 times [2019-09-16 17:06:24,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:24,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:24,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:24,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:24,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:24,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:24,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:24,338 INFO L87 Difference]: Start difference. First operand 263 states and 388 transitions. Second operand 4 states. [2019-09-16 17:06:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,717 INFO L93 Difference]: Finished difference Result 308 states and 451 transitions. [2019-09-16 17:06:24,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-16 17:06:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,719 INFO L225 Difference]: With dead ends: 308 [2019-09-16 17:06:24,719 INFO L226 Difference]: Without dead ends: 308 [2019-09-16 17:06:24,719 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-16 17:06:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-16 17:06:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2019-09-16 17:06:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-16 17:06:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2019-09-16 17:06:24,725 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 110 [2019-09-16 17:06:24,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,725 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2019-09-16 17:06:24,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2019-09-16 17:06:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-16 17:06:24,727 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,727 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:24,727 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1544407413, now seen corresponding path program 1 times [2019-09-16 17:06:24,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:24,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:24,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:24,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:24,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:24,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:24,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:24,798 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand 4 states. [2019-09-16 17:06:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:25,119 INFO L93 Difference]: Finished difference Result 315 states and 465 transitions. [2019-09-16 17:06:25,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:25,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-16 17:06:25,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:25,122 INFO L225 Difference]: With dead ends: 315 [2019-09-16 17:06:25,123 INFO L226 Difference]: Without dead ends: 315 [2019-09-16 17:06:25,123 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-16 17:06:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-16 17:06:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2019-09-16 17:06:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 432 transitions. [2019-09-16 17:06:25,129 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 432 transitions. Word has length 110 [2019-09-16 17:06:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:25,129 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 432 transitions. [2019-09-16 17:06:25,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 432 transitions. [2019-09-16 17:06:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-16 17:06:25,130 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:25,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:25,131 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:25,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:25,131 INFO L82 PathProgramCache]: Analyzing trace with hash 193721619, now seen corresponding path program 1 times [2019-09-16 17:06:25,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:25,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:25,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:25,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:25,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:25,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:25,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:25,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:25,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:25,236 INFO L87 Difference]: Start difference. First operand 289 states and 432 transitions. Second operand 4 states. [2019-09-16 17:06:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:25,616 INFO L93 Difference]: Finished difference Result 334 states and 495 transitions. [2019-09-16 17:06:25,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:25,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-16 17:06:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:25,619 INFO L225 Difference]: With dead ends: 334 [2019-09-16 17:06:25,620 INFO L226 Difference]: Without dead ends: 334 [2019-09-16 17:06:25,620 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-16 17:06:25,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-16 17:06:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 289. [2019-09-16 17:06:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 431 transitions. [2019-09-16 17:06:25,628 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 431 transitions. Word has length 113 [2019-09-16 17:06:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:25,629 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 431 transitions. [2019-09-16 17:06:25,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 431 transitions. [2019-09-16 17:06:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-16 17:06:25,631 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:25,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:25,631 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:25,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:25,632 INFO L82 PathProgramCache]: Analyzing trace with hash 938446418, now seen corresponding path program 1 times [2019-09-16 17:06:25,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:25,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:25,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:25,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:25,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:25,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:25,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:25,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:25,749 INFO L87 Difference]: Start difference. First operand 289 states and 431 transitions. Second operand 4 states. [2019-09-16 17:06:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:26,088 INFO L93 Difference]: Finished difference Result 326 states and 481 transitions. [2019-09-16 17:06:26,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:26,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-16 17:06:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:26,090 INFO L225 Difference]: With dead ends: 326 [2019-09-16 17:06:26,090 INFO L226 Difference]: Without dead ends: 326 [2019-09-16 17:06:26,091 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-16 17:06:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-16 17:06:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2019-09-16 17:06:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 430 transitions. [2019-09-16 17:06:26,097 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 430 transitions. Word has length 114 [2019-09-16 17:06:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:26,098 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 430 transitions. [2019-09-16 17:06:26,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 430 transitions. [2019-09-16 17:06:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-16 17:06:26,099 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:26,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:26,099 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:26,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:26,100 INFO L82 PathProgramCache]: Analyzing trace with hash -498124115, now seen corresponding path program 1 times [2019-09-16 17:06:26,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:26,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:26,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:26,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:26,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:26,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:26,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:26,197 INFO L87 Difference]: Start difference. First operand 289 states and 430 transitions. Second operand 4 states. [2019-09-16 17:06:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:26,569 INFO L93 Difference]: Finished difference Result 326 states and 480 transitions. [2019-09-16 17:06:26,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:26,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-16 17:06:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:26,573 INFO L225 Difference]: With dead ends: 326 [2019-09-16 17:06:26,573 INFO L226 Difference]: Without dead ends: 326 [2019-09-16 17:06:26,573 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-16 17:06:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-16 17:06:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2019-09-16 17:06:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:26,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 429 transitions. [2019-09-16 17:06:26,579 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 429 transitions. Word has length 115 [2019-09-16 17:06:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:26,580 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 429 transitions. [2019-09-16 17:06:26,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 429 transitions. [2019-09-16 17:06:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-16 17:06:26,581 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:26,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:26,582 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:26,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:26,582 INFO L82 PathProgramCache]: Analyzing trace with hash -9995480, now seen corresponding path program 1 times [2019-09-16 17:06:26,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:26,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:26,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:26,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:26,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:26,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:26,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:26,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:26,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:26,653 INFO L87 Difference]: Start difference. First operand 289 states and 429 transitions. Second operand 4 states. [2019-09-16 17:06:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:27,090 INFO L93 Difference]: Finished difference Result 326 states and 479 transitions. [2019-09-16 17:06:27,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:27,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-16 17:06:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:27,093 INFO L225 Difference]: With dead ends: 326 [2019-09-16 17:06:27,093 INFO L226 Difference]: Without dead ends: 326 [2019-09-16 17:06:27,093 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-16 17:06:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-16 17:06:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2019-09-16 17:06:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 428 transitions. [2019-09-16 17:06:27,099 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 428 transitions. Word has length 116 [2019-09-16 17:06:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:27,099 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 428 transitions. [2019-09-16 17:06:27,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 428 transitions. [2019-09-16 17:06:27,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-16 17:06:27,100 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:27,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:27,101 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:27,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:27,101 INFO L82 PathProgramCache]: Analyzing trace with hash 594719628, now seen corresponding path program 1 times [2019-09-16 17:06:27,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:27,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:27,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:27,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:27,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:27,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:27,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:27,185 INFO L87 Difference]: Start difference. First operand 289 states and 428 transitions. Second operand 4 states. [2019-09-16 17:06:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:27,541 INFO L93 Difference]: Finished difference Result 324 states and 476 transitions. [2019-09-16 17:06:27,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:27,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-16 17:06:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:27,544 INFO L225 Difference]: With dead ends: 324 [2019-09-16 17:06:27,544 INFO L226 Difference]: Without dead ends: 324 [2019-09-16 17:06:27,544 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-16 17:06:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-16 17:06:27,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 289. [2019-09-16 17:06:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 427 transitions. [2019-09-16 17:06:27,550 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 427 transitions. Word has length 116 [2019-09-16 17:06:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:27,551 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 427 transitions. [2019-09-16 17:06:27,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 427 transitions. [2019-09-16 17:06:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-16 17:06:27,552 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:27,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:27,552 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:27,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:27,553 INFO L82 PathProgramCache]: Analyzing trace with hash -179022615, now seen corresponding path program 1 times [2019-09-16 17:06:27,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:27,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:27,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:27,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:27,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:27,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:27,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:27,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:27,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:27,667 INFO L87 Difference]: Start difference. First operand 289 states and 427 transitions. Second operand 4 states. [2019-09-16 17:06:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,086 INFO L93 Difference]: Finished difference Result 322 states and 472 transitions. [2019-09-16 17:06:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:28,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-16 17:06:28,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,089 INFO L225 Difference]: With dead ends: 322 [2019-09-16 17:06:28,089 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 17:06:28,090 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-16 17:06:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 17:06:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 289. [2019-09-16 17:06:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 426 transitions. [2019-09-16 17:06:28,100 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 426 transitions. Word has length 117 [2019-09-16 17:06:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,100 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 426 transitions. [2019-09-16 17:06:28,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 426 transitions. [2019-09-16 17:06:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-16 17:06:28,102 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:28,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:28,102 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:28,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1648380811, now seen corresponding path program 1 times [2019-09-16 17:06:28,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:28,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:28,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:28,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:28,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:28,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:28,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:28,204 INFO L87 Difference]: Start difference. First operand 289 states and 426 transitions. Second operand 4 states. [2019-09-16 17:06:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,534 INFO L93 Difference]: Finished difference Result 319 states and 467 transitions. [2019-09-16 17:06:28,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:28,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-16 17:06:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,537 INFO L225 Difference]: With dead ends: 319 [2019-09-16 17:06:28,537 INFO L226 Difference]: Without dead ends: 319 [2019-09-16 17:06:28,538 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-16 17:06:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-16 17:06:28,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 289. [2019-09-16 17:06:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 425 transitions. [2019-09-16 17:06:28,544 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 425 transitions. Word has length 117 [2019-09-16 17:06:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,545 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 425 transitions. [2019-09-16 17:06:28,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 425 transitions. [2019-09-16 17:06:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-16 17:06:28,546 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:28,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:28,546 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,547 INFO L82 PathProgramCache]: Analyzing trace with hash -894819603, now seen corresponding path program 1 times [2019-09-16 17:06:28,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:28,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:28,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:28,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:28,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:28,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:28,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:28,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:28,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:28,632 INFO L87 Difference]: Start difference. First operand 289 states and 425 transitions. Second operand 4 states. [2019-09-16 17:06:28,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,950 INFO L93 Difference]: Finished difference Result 319 states and 466 transitions. [2019-09-16 17:06:28,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:28,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-16 17:06:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,953 INFO L225 Difference]: With dead ends: 319 [2019-09-16 17:06:28,953 INFO L226 Difference]: Without dead ends: 319 [2019-09-16 17:06:28,953 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-16 17:06:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-16 17:06:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 289. [2019-09-16 17:06:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 424 transitions. [2019-09-16 17:06:28,959 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 424 transitions. Word has length 119 [2019-09-16 17:06:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,959 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 424 transitions. [2019-09-16 17:06:28,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 424 transitions. [2019-09-16 17:06:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-16 17:06:28,961 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:28,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:28,961 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1214178959, now seen corresponding path program 1 times [2019-09-16 17:06:28,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:28,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:28,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:29,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:29,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:29,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:29,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:29,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:29,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:29,037 INFO L87 Difference]: Start difference. First operand 289 states and 424 transitions. Second operand 4 states. [2019-09-16 17:06:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:29,343 INFO L93 Difference]: Finished difference Result 315 states and 460 transitions. [2019-09-16 17:06:29,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:29,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-16 17:06:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:29,345 INFO L225 Difference]: With dead ends: 315 [2019-09-16 17:06:29,345 INFO L226 Difference]: Without dead ends: 315 [2019-09-16 17:06:29,345 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-16 17:06:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-16 17:06:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2019-09-16 17:06:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 423 transitions. [2019-09-16 17:06:29,350 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 423 transitions. Word has length 120 [2019-09-16 17:06:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:29,351 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 423 transitions. [2019-09-16 17:06:29,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 423 transitions. [2019-09-16 17:06:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-16 17:06:29,352 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:29,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:29,353 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:29,354 INFO L82 PathProgramCache]: Analyzing trace with hash -568746750, now seen corresponding path program 1 times [2019-09-16 17:06:29,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:29,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:29,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:29,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:29,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:29,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:29,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:29,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:29,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:29,430 INFO L87 Difference]: Start difference. First operand 289 states and 423 transitions. Second operand 4 states. [2019-09-16 17:06:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:29,732 INFO L93 Difference]: Finished difference Result 315 states and 459 transitions. [2019-09-16 17:06:29,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:29,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-16 17:06:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:29,735 INFO L225 Difference]: With dead ends: 315 [2019-09-16 17:06:29,735 INFO L226 Difference]: Without dead ends: 315 [2019-09-16 17:06:29,736 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-16 17:06:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-16 17:06:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2019-09-16 17:06:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 422 transitions. [2019-09-16 17:06:29,740 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 422 transitions. Word has length 120 [2019-09-16 17:06:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:29,741 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 422 transitions. [2019-09-16 17:06:29,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 422 transitions. [2019-09-16 17:06:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 17:06:29,742 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:29,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:29,742 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:29,743 INFO L82 PathProgramCache]: Analyzing trace with hash 792898142, now seen corresponding path program 1 times [2019-09-16 17:06:29,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:29,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:29,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:29,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:29,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:29,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:29,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:29,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:29,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:29,825 INFO L87 Difference]: Start difference. First operand 289 states and 422 transitions. Second operand 4 states. [2019-09-16 17:06:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:30,133 INFO L93 Difference]: Finished difference Result 313 states and 456 transitions. [2019-09-16 17:06:30,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:30,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-16 17:06:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:30,138 INFO L225 Difference]: With dead ends: 313 [2019-09-16 17:06:30,139 INFO L226 Difference]: Without dead ends: 313 [2019-09-16 17:06:30,139 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-16 17:06:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-16 17:06:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2019-09-16 17:06:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 421 transitions. [2019-09-16 17:06:30,144 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 421 transitions. Word has length 121 [2019-09-16 17:06:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:30,144 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 421 transitions. [2019-09-16 17:06:30,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 421 transitions. [2019-09-16 17:06:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-16 17:06:30,146 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:30,146 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:30,146 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1650988349, now seen corresponding path program 1 times [2019-09-16 17:06:30,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:30,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:30,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:30,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:30,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:30,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:30,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:30,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:30,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:30,227 INFO L87 Difference]: Start difference. First operand 289 states and 421 transitions. Second operand 4 states. [2019-09-16 17:06:30,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:30,598 INFO L93 Difference]: Finished difference Result 313 states and 455 transitions. [2019-09-16 17:06:30,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:30,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-16 17:06:30,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:30,600 INFO L225 Difference]: With dead ends: 313 [2019-09-16 17:06:30,600 INFO L226 Difference]: Without dead ends: 313 [2019-09-16 17:06:30,601 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-16 17:06:30,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-16 17:06:30,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2019-09-16 17:06:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 420 transitions. [2019-09-16 17:06:30,606 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 420 transitions. Word has length 122 [2019-09-16 17:06:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:30,606 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 420 transitions. [2019-09-16 17:06:30,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 420 transitions. [2019-09-16 17:06:30,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-16 17:06:30,607 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:30,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:30,607 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:30,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:30,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1396412679, now seen corresponding path program 1 times [2019-09-16 17:06:30,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:30,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:30,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:30,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:30,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:30,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:30,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:30,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:30,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:30,696 INFO L87 Difference]: Start difference. First operand 289 states and 420 transitions. Second operand 4 states. [2019-09-16 17:06:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,009 INFO L93 Difference]: Finished difference Result 311 states and 452 transitions. [2019-09-16 17:06:31,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:31,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-16 17:06:31,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,011 INFO L225 Difference]: With dead ends: 311 [2019-09-16 17:06:31,011 INFO L226 Difference]: Without dead ends: 311 [2019-09-16 17:06:31,012 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-16 17:06:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 289. [2019-09-16 17:06:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-16 17:06:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 419 transitions. [2019-09-16 17:06:31,016 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 419 transitions. Word has length 123 [2019-09-16 17:06:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:31,017 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 419 transitions. [2019-09-16 17:06:31,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 419 transitions. [2019-09-16 17:06:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-16 17:06:31,018 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:31,018 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:31,019 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:31,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:31,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1284876489, now seen corresponding path program 1 times [2019-09-16 17:06:31,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:31,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:31,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-16 17:06:31,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:31,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:31,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:31,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:31,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:31,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:31,096 INFO L87 Difference]: Start difference. First operand 289 states and 419 transitions. Second operand 4 states. [2019-09-16 17:06:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,470 INFO L93 Difference]: Finished difference Result 360 states and 528 transitions. [2019-09-16 17:06:31,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:31,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-16 17:06:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,473 INFO L225 Difference]: With dead ends: 360 [2019-09-16 17:06:31,473 INFO L226 Difference]: Without dead ends: 360 [2019-09-16 17:06:31,473 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-16 17:06:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-16 17:06:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 321. [2019-09-16 17:06:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-09-16 17:06:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 476 transitions. [2019-09-16 17:06:31,478 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 476 transitions. Word has length 123 [2019-09-16 17:06:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:31,478 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 476 transitions. [2019-09-16 17:06:31,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:31,478 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 476 transitions. [2019-09-16 17:06:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-16 17:06:31,479 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:31,480 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:31,480 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:31,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1847510473, now seen corresponding path program 1 times [2019-09-16 17:06:31,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:31,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:31,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:31,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:31,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:31,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:31,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:31,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:31,555 INFO L87 Difference]: Start difference. First operand 321 states and 476 transitions. Second operand 4 states. [2019-09-16 17:06:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,980 INFO L93 Difference]: Finished difference Result 427 states and 639 transitions. [2019-09-16 17:06:31,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:31,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-16 17:06:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,982 INFO L225 Difference]: With dead ends: 427 [2019-09-16 17:06:31,982 INFO L226 Difference]: Without dead ends: 427 [2019-09-16 17:06:31,983 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-16 17:06:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-16 17:06:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 360. [2019-09-16 17:06:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-16 17:06:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2019-09-16 17:06:31,988 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 124 [2019-09-16 17:06:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:31,989 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2019-09-16 17:06:31,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2019-09-16 17:06:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-16 17:06:31,990 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:31,990 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:31,990 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1110059788, now seen corresponding path program 1 times [2019-09-16 17:06:31,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:31,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:31,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:32,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:32,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:32,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:32,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:32,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:32,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:32,064 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 4 states. [2019-09-16 17:06:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:32,368 INFO L93 Difference]: Finished difference Result 386 states and 579 transitions. [2019-09-16 17:06:32,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:32,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-16 17:06:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:32,371 INFO L225 Difference]: With dead ends: 386 [2019-09-16 17:06:32,371 INFO L226 Difference]: Without dead ends: 386 [2019-09-16 17:06:32,372 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-16 17:06:32,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 360. [2019-09-16 17:06:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-16 17:06:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2019-09-16 17:06:32,376 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 125 [2019-09-16 17:06:32,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:32,377 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2019-09-16 17:06:32,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2019-09-16 17:06:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-16 17:06:32,378 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:32,378 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:32,378 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:32,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:32,379 INFO L82 PathProgramCache]: Analyzing trace with hash -512713301, now seen corresponding path program 1 times [2019-09-16 17:06:32,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:32,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:32,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:32,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:32,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:32,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:32,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:32,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:32,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:32,467 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand 4 states. [2019-09-16 17:06:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:32,900 INFO L93 Difference]: Finished difference Result 419 states and 626 transitions. [2019-09-16 17:06:32,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:32,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-16 17:06:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:32,903 INFO L225 Difference]: With dead ends: 419 [2019-09-16 17:06:32,903 INFO L226 Difference]: Without dead ends: 419 [2019-09-16 17:06:32,903 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-16 17:06:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-16 17:06:32,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 359. [2019-09-16 17:06:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-16 17:06:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2019-09-16 17:06:32,907 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 125 [2019-09-16 17:06:32,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:32,907 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2019-09-16 17:06:32,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2019-09-16 17:06:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-16 17:06:32,909 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:32,909 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:32,909 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:32,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1059638715, now seen corresponding path program 1 times [2019-09-16 17:06:32,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:32,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:33,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:33,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:33,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:33,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:33,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:33,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:33,018 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand 4 states. [2019-09-16 17:06:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:33,306 INFO L93 Difference]: Finished difference Result 385 states and 577 transitions. [2019-09-16 17:06:33,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:33,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-16 17:06:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:33,308 INFO L225 Difference]: With dead ends: 385 [2019-09-16 17:06:33,308 INFO L226 Difference]: Without dead ends: 385 [2019-09-16 17:06:33,308 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-16 17:06:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-16 17:06:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2019-09-16 17:06:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-16 17:06:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 544 transitions. [2019-09-16 17:06:33,312 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 544 transitions. Word has length 126 [2019-09-16 17:06:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:33,312 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 544 transitions. [2019-09-16 17:06:33,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 544 transitions. [2019-09-16 17:06:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-16 17:06:33,313 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:33,314 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:33,314 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:33,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:33,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1056352367, now seen corresponding path program 1 times [2019-09-16 17:06:33,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:33,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:33,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:33,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:33,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:33,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:33,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:33,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:33,387 INFO L87 Difference]: Start difference. First operand 359 states and 544 transitions. Second operand 4 states. [2019-09-16 17:06:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:33,683 INFO L93 Difference]: Finished difference Result 385 states and 576 transitions. [2019-09-16 17:06:33,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:33,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-16 17:06:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:33,685 INFO L225 Difference]: With dead ends: 385 [2019-09-16 17:06:33,685 INFO L226 Difference]: Without dead ends: 385 [2019-09-16 17:06:33,685 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-16 17:06:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-16 17:06:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2019-09-16 17:06:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-16 17:06:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 543 transitions. [2019-09-16 17:06:33,689 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 543 transitions. Word has length 127 [2019-09-16 17:06:33,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:33,689 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 543 transitions. [2019-09-16 17:06:33,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 543 transitions. [2019-09-16 17:06:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-16 17:06:33,690 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:33,691 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:33,691 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:33,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:33,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1514463008, now seen corresponding path program 1 times [2019-09-16 17:06:33,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:33,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:33,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:33,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:33,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:33,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:33,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:33,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:33,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:33,751 INFO L87 Difference]: Start difference. First operand 359 states and 543 transitions. Second operand 4 states. [2019-09-16 17:06:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:34,031 INFO L93 Difference]: Finished difference Result 375 states and 563 transitions. [2019-09-16 17:06:34,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:34,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-16 17:06:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:34,034 INFO L225 Difference]: With dead ends: 375 [2019-09-16 17:06:34,034 INFO L226 Difference]: Without dead ends: 375 [2019-09-16 17:06:34,035 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-16 17:06:34,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-16 17:06:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 359. [2019-09-16 17:06:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-16 17:06:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 542 transitions. [2019-09-16 17:06:34,039 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 542 transitions. Word has length 128 [2019-09-16 17:06:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:34,040 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 542 transitions. [2019-09-16 17:06:34,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2019-09-16 17:06:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-16 17:06:34,041 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:34,041 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:34,042 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:34,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1739032258, now seen corresponding path program 1 times [2019-09-16 17:06:34,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:34,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:34,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:34,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:34,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:34,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:34,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:34,121 INFO L87 Difference]: Start difference. First operand 359 states and 542 transitions. Second operand 4 states. [2019-09-16 17:06:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:34,568 INFO L93 Difference]: Finished difference Result 465 states and 705 transitions. [2019-09-16 17:06:34,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:34,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-16 17:06:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:34,572 INFO L225 Difference]: With dead ends: 465 [2019-09-16 17:06:34,572 INFO L226 Difference]: Without dead ends: 465 [2019-09-16 17:06:34,573 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-16 17:06:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-16 17:06:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 398. [2019-09-16 17:06:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-16 17:06:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 613 transitions. [2019-09-16 17:06:34,578 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 613 transitions. Word has length 129 [2019-09-16 17:06:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:34,578 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 613 transitions. [2019-09-16 17:06:34,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 613 transitions. [2019-09-16 17:06:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-16 17:06:34,579 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:34,579 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:34,579 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash -26388266, now seen corresponding path program 1 times [2019-09-16 17:06:34,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:34,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:34,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:34,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:34,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:34,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:34,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:34,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:34,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:34,653 INFO L87 Difference]: Start difference. First operand 398 states and 613 transitions. Second operand 4 states. [2019-09-16 17:06:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:35,123 INFO L93 Difference]: Finished difference Result 457 states and 693 transitions. [2019-09-16 17:06:35,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:35,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-16 17:06:35,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:35,126 INFO L225 Difference]: With dead ends: 457 [2019-09-16 17:06:35,127 INFO L226 Difference]: Without dead ends: 457 [2019-09-16 17:06:35,127 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-16 17:06:35,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-16 17:06:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 359. [2019-09-16 17:06:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-16 17:06:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 542 transitions. [2019-09-16 17:06:35,131 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 542 transitions. Word has length 130 [2019-09-16 17:06:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:35,131 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 542 transitions. [2019-09-16 17:06:35,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2019-09-16 17:06:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-16 17:06:35,132 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:35,132 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:35,133 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:35,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:35,133 INFO L82 PathProgramCache]: Analyzing trace with hash 889689834, now seen corresponding path program 1 times [2019-09-16 17:06:35,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:35,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:35,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-16 17:06:35,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:35,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:35,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:35,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:35,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:35,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:35,219 INFO L87 Difference]: Start difference. First operand 359 states and 542 transitions. Second operand 4 states. [2019-09-16 17:06:35,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:35,520 INFO L93 Difference]: Finished difference Result 374 states and 561 transitions. [2019-09-16 17:06:35,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:35,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-16 17:06:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:35,522 INFO L225 Difference]: With dead ends: 374 [2019-09-16 17:06:35,522 INFO L226 Difference]: Without dead ends: 374 [2019-09-16 17:06:35,523 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-16 17:06:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-09-16 17:06:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 362. [2019-09-16 17:06:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-16 17:06:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 545 transitions. [2019-09-16 17:06:35,528 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 545 transitions. Word has length 131 [2019-09-16 17:06:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:35,528 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 545 transitions. [2019-09-16 17:06:35,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 545 transitions. [2019-09-16 17:06:35,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-16 17:06:35,529 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:35,529 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:35,529 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:35,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:35,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1967666446, now seen corresponding path program 1 times [2019-09-16 17:06:35,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:35,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:35,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:06:35,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:35,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:35,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:35,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:35,636 INFO L87 Difference]: Start difference. First operand 362 states and 545 transitions. Second operand 4 states. [2019-09-16 17:06:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:35,921 INFO L93 Difference]: Finished difference Result 378 states and 565 transitions. [2019-09-16 17:06:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:35,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-16 17:06:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:35,924 INFO L225 Difference]: With dead ends: 378 [2019-09-16 17:06:35,925 INFO L226 Difference]: Without dead ends: 378 [2019-09-16 17:06:35,925 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-16 17:06:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-16 17:06:35,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 362. [2019-09-16 17:06:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-16 17:06:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 544 transitions. [2019-09-16 17:06:35,930 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 544 transitions. Word has length 138 [2019-09-16 17:06:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:35,930 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 544 transitions. [2019-09-16 17:06:35,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 544 transitions. [2019-09-16 17:06:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-16 17:06:35,931 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:35,931 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:35,932 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:35,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1007233089, now seen corresponding path program 1 times [2019-09-16 17:06:35,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:35,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:35,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:36,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:36,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:36,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:36,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:36,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:36,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:36,009 INFO L87 Difference]: Start difference. First operand 362 states and 544 transitions. Second operand 4 states. [2019-09-16 17:06:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:36,353 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-09-16 17:06:36,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:36,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-16 17:06:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:36,356 INFO L225 Difference]: With dead ends: 424 [2019-09-16 17:06:36,356 INFO L226 Difference]: Without dead ends: 424 [2019-09-16 17:06:36,357 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-16 17:06:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-16 17:06:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 390. [2019-09-16 17:06:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-09-16 17:06:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 593 transitions. [2019-09-16 17:06:36,361 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 593 transitions. Word has length 138 [2019-09-16 17:06:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:36,361 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 593 transitions. [2019-09-16 17:06:36,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 593 transitions. [2019-09-16 17:06:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-16 17:06:36,363 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:36,363 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:36,363 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:36,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:36,364 INFO L82 PathProgramCache]: Analyzing trace with hash -469096928, now seen corresponding path program 1 times [2019-09-16 17:06:36,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:36,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:36,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:36,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:36,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:36,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:36,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:36,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:36,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:36,433 INFO L87 Difference]: Start difference. First operand 390 states and 593 transitions. Second operand 4 states. [2019-09-16 17:06:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:36,839 INFO L93 Difference]: Finished difference Result 488 states and 743 transitions. [2019-09-16 17:06:36,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:36,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-16 17:06:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:36,842 INFO L225 Difference]: With dead ends: 488 [2019-09-16 17:06:36,842 INFO L226 Difference]: Without dead ends: 488 [2019-09-16 17:06:36,842 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-16 17:06:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-16 17:06:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 402. [2019-09-16 17:06:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-16 17:06:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 610 transitions. [2019-09-16 17:06:36,847 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 610 transitions. Word has length 139 [2019-09-16 17:06:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:36,847 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 610 transitions. [2019-09-16 17:06:36,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 610 transitions. [2019-09-16 17:06:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-16 17:06:36,848 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:36,849 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:36,849 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:36,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash 686289537, now seen corresponding path program 1 times [2019-09-16 17:06:36,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:36,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:36,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:06:36,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:36,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:36,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:36,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:36,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:36,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:36,933 INFO L87 Difference]: Start difference. First operand 402 states and 610 transitions. Second operand 4 states. [2019-09-16 17:06:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:37,181 INFO L93 Difference]: Finished difference Result 416 states and 628 transitions. [2019-09-16 17:06:37,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:37,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-16 17:06:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:37,185 INFO L225 Difference]: With dead ends: 416 [2019-09-16 17:06:37,185 INFO L226 Difference]: Without dead ends: 416 [2019-09-16 17:06:37,186 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-16 17:06:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-09-16 17:06:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 402. [2019-09-16 17:06:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-09-16 17:06:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 609 transitions. [2019-09-16 17:06:37,191 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 609 transitions. Word has length 139 [2019-09-16 17:06:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:37,192 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 609 transitions. [2019-09-16 17:06:37,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:37,192 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 609 transitions. [2019-09-16 17:06:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-16 17:06:37,193 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:37,193 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:37,194 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1630340761, now seen corresponding path program 1 times [2019-09-16 17:06:37,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:37,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:37,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:37,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:37,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:37,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:37,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:37,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:37,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:37,258 INFO L87 Difference]: Start difference. First operand 402 states and 609 transitions. Second operand 4 states. [2019-09-16 17:06:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:37,641 INFO L93 Difference]: Finished difference Result 488 states and 741 transitions. [2019-09-16 17:06:37,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:37,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-16 17:06:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:37,644 INFO L225 Difference]: With dead ends: 488 [2019-09-16 17:06:37,644 INFO L226 Difference]: Without dead ends: 488 [2019-09-16 17:06:37,645 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-16 17:06:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 403. [2019-09-16 17:06:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-16 17:06:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 610 transitions. [2019-09-16 17:06:37,651 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 610 transitions. Word has length 140 [2019-09-16 17:06:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:37,652 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 610 transitions. [2019-09-16 17:06:37,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 610 transitions. [2019-09-16 17:06:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:06:37,653 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:37,653 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:37,653 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:37,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:37,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1453629797, now seen corresponding path program 1 times [2019-09-16 17:06:37,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:37,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:37,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:37,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:37,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:37,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:37,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:37,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:37,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:37,729 INFO L87 Difference]: Start difference. First operand 403 states and 610 transitions. Second operand 4 states. [2019-09-16 17:06:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:38,120 INFO L93 Difference]: Finished difference Result 488 states and 740 transitions. [2019-09-16 17:06:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:38,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-16 17:06:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:38,123 INFO L225 Difference]: With dead ends: 488 [2019-09-16 17:06:38,123 INFO L226 Difference]: Without dead ends: 488 [2019-09-16 17:06:38,123 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-16 17:06:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-16 17:06:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 404. [2019-09-16 17:06:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-09-16 17:06:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 611 transitions. [2019-09-16 17:06:38,129 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 611 transitions. Word has length 141 [2019-09-16 17:06:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:38,129 INFO L475 AbstractCegarLoop]: Abstraction has 404 states and 611 transitions. [2019-09-16 17:06:38,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 611 transitions. [2019-09-16 17:06:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-16 17:06:38,130 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:38,130 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:38,130 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2014498764, now seen corresponding path program 1 times [2019-09-16 17:06:38,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:38,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:38,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:38,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:38,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:38,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:38,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:38,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:38,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:38,234 INFO L87 Difference]: Start difference. First operand 404 states and 611 transitions. Second operand 4 states. [2019-09-16 17:06:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:38,698 INFO L93 Difference]: Finished difference Result 478 states and 727 transitions. [2019-09-16 17:06:38,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:38,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-16 17:06:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:38,701 INFO L225 Difference]: With dead ends: 478 [2019-09-16 17:06:38,701 INFO L226 Difference]: Without dead ends: 478 [2019-09-16 17:06:38,701 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-16 17:06:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-16 17:06:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 405. [2019-09-16 17:06:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-16 17:06:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 612 transitions. [2019-09-16 17:06:38,708 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 612 transitions. Word has length 142 [2019-09-16 17:06:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:38,708 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 612 transitions. [2019-09-16 17:06:38,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 612 transitions. [2019-09-16 17:06:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-16 17:06:38,709 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:38,710 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:38,710 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash -159483381, now seen corresponding path program 1 times [2019-09-16 17:06:38,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:38,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:38,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:38,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:38,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:38,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:38,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:38,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:38,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:38,775 INFO L87 Difference]: Start difference. First operand 405 states and 612 transitions. Second operand 4 states. [2019-09-16 17:06:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:39,191 INFO L93 Difference]: Finished difference Result 488 states and 738 transitions. [2019-09-16 17:06:39,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:39,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-16 17:06:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:39,194 INFO L225 Difference]: With dead ends: 488 [2019-09-16 17:06:39,194 INFO L226 Difference]: Without dead ends: 488 [2019-09-16 17:06:39,194 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-16 17:06:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-16 17:06:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2019-09-16 17:06:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-16 17:06:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 611 transitions. [2019-09-16 17:06:39,200 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 611 transitions. Word has length 144 [2019-09-16 17:06:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:39,200 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 611 transitions. [2019-09-16 17:06:39,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 611 transitions. [2019-09-16 17:06:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:06:39,201 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:39,201 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:39,201 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:39,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1656541170, now seen corresponding path program 1 times [2019-09-16 17:06:39,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:39,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:39,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:39,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:39,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:39,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:39,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:39,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:39,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:39,284 INFO L87 Difference]: Start difference. First operand 405 states and 611 transitions. Second operand 4 states. [2019-09-16 17:06:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:39,706 INFO L93 Difference]: Finished difference Result 488 states and 737 transitions. [2019-09-16 17:06:39,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:39,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 17:06:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:39,709 INFO L225 Difference]: With dead ends: 488 [2019-09-16 17:06:39,709 INFO L226 Difference]: Without dead ends: 488 [2019-09-16 17:06:39,709 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-16 17:06:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-16 17:06:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2019-09-16 17:06:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-16 17:06:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 610 transitions. [2019-09-16 17:06:39,714 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 610 transitions. Word has length 145 [2019-09-16 17:06:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:39,714 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 610 transitions. [2019-09-16 17:06:39,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 610 transitions. [2019-09-16 17:06:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-16 17:06:39,715 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:39,715 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:39,715 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:39,716 INFO L82 PathProgramCache]: Analyzing trace with hash -267754554, now seen corresponding path program 1 times [2019-09-16 17:06:39,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:39,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:39,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:39,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:39,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:39,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:39,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:39,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:39,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:39,791 INFO L87 Difference]: Start difference. First operand 405 states and 610 transitions. Second operand 4 states. [2019-09-16 17:06:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:40,230 INFO L93 Difference]: Finished difference Result 488 states and 736 transitions. [2019-09-16 17:06:40,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:40,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-16 17:06:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:40,233 INFO L225 Difference]: With dead ends: 488 [2019-09-16 17:06:40,233 INFO L226 Difference]: Without dead ends: 488 [2019-09-16 17:06:40,233 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-16 17:06:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-16 17:06:40,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 405. [2019-09-16 17:06:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-16 17:06:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 609 transitions. [2019-09-16 17:06:40,238 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 609 transitions. Word has length 146 [2019-09-16 17:06:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:40,238 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 609 transitions. [2019-09-16 17:06:40,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2019-09-16 17:06:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-16 17:06:40,239 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:40,239 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:40,239 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:40,240 INFO L82 PathProgramCache]: Analyzing trace with hash 387895401, now seen corresponding path program 1 times [2019-09-16 17:06:40,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:40,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:40,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:40,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:40,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:40,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:40,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:40,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:40,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:40,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:40,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:40,303 INFO L87 Difference]: Start difference. First operand 405 states and 609 transitions. Second operand 4 states. [2019-09-16 17:06:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:40,695 INFO L93 Difference]: Finished difference Result 478 states and 723 transitions. [2019-09-16 17:06:40,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:40,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-16 17:06:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:40,699 INFO L225 Difference]: With dead ends: 478 [2019-09-16 17:06:40,699 INFO L226 Difference]: Without dead ends: 478 [2019-09-16 17:06:40,699 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-16 17:06:40,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-16 17:06:40,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 390. [2019-09-16 17:06:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-09-16 17:06:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 588 transitions. [2019-09-16 17:06:40,705 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 588 transitions. Word has length 147 [2019-09-16 17:06:40,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:40,705 INFO L475 AbstractCegarLoop]: Abstraction has 390 states and 588 transitions. [2019-09-16 17:06:40,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 588 transitions. [2019-09-16 17:06:40,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-16 17:06:40,706 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:40,706 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:40,706 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:40,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:40,707 INFO L82 PathProgramCache]: Analyzing trace with hash 271831238, now seen corresponding path program 1 times [2019-09-16 17:06:40,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:40,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:40,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:40,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:40,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:40,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:40,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:40,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:40,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:40,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:40,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:40,775 INFO L87 Difference]: Start difference. First operand 390 states and 588 transitions. Second operand 4 states. [2019-09-16 17:06:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:41,163 INFO L93 Difference]: Finished difference Result 478 states and 722 transitions. [2019-09-16 17:06:41,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:41,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-16 17:06:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:41,167 INFO L225 Difference]: With dead ends: 478 [2019-09-16 17:06:41,167 INFO L226 Difference]: Without dead ends: 478 [2019-09-16 17:06:41,168 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-16 17:06:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-16 17:06:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 418. [2019-09-16 17:06:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-16 17:06:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2019-09-16 17:06:41,174 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 149 [2019-09-16 17:06:41,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:41,174 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2019-09-16 17:06:41,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2019-09-16 17:06:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-16 17:06:41,176 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:41,176 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:41,176 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:41,177 INFO L82 PathProgramCache]: Analyzing trace with hash -935122689, now seen corresponding path program 1 times [2019-09-16 17:06:41,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:41,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:41,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:41,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:41,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:41,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:41,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:41,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:41,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:41,266 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand 4 states. [2019-09-16 17:06:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:41,619 INFO L93 Difference]: Finished difference Result 470 states and 708 transitions. [2019-09-16 17:06:41,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:41,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-09-16 17:06:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:41,622 INFO L225 Difference]: With dead ends: 470 [2019-09-16 17:06:41,622 INFO L226 Difference]: Without dead ends: 470 [2019-09-16 17:06:41,622 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-16 17:06:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-16 17:06:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 419. [2019-09-16 17:06:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-16 17:06:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2019-09-16 17:06:41,626 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 150 [2019-09-16 17:06:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:41,626 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2019-09-16 17:06:41,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2019-09-16 17:06:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-16 17:06:41,627 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:41,628 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:41,628 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:41,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:41,628 INFO L82 PathProgramCache]: Analyzing trace with hash 401457478, now seen corresponding path program 1 times [2019-09-16 17:06:41,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:41,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:41,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-16 17:06:41,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:41,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:41,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:41,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:41,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:41,698 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2019-09-16 17:06:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:42,056 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2019-09-16 17:06:42,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:42,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-16 17:06:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:42,058 INFO L225 Difference]: With dead ends: 470 [2019-09-16 17:06:42,058 INFO L226 Difference]: Without dead ends: 470 [2019-09-16 17:06:42,058 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-16 17:06:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-16 17:06:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 419. [2019-09-16 17:06:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-16 17:06:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 633 transitions. [2019-09-16 17:06:42,063 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 633 transitions. Word has length 152 [2019-09-16 17:06:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:42,063 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 633 transitions. [2019-09-16 17:06:42,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 633 transitions. [2019-09-16 17:06:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:06:42,064 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:42,064 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:42,064 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash -748874306, now seen corresponding path program 1 times [2019-09-16 17:06:42,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:42,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:42,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:42,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:42,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:42,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:42,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:42,141 INFO L87 Difference]: Start difference. First operand 419 states and 633 transitions. Second operand 4 states. [2019-09-16 17:06:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:42,577 INFO L93 Difference]: Finished difference Result 467 states and 702 transitions. [2019-09-16 17:06:42,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:42,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:06:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:42,581 INFO L225 Difference]: With dead ends: 467 [2019-09-16 17:06:42,581 INFO L226 Difference]: Without dead ends: 467 [2019-09-16 17:06:42,581 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-16 17:06:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-16 17:06:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 422. [2019-09-16 17:06:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-16 17:06:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 638 transitions. [2019-09-16 17:06:42,589 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 638 transitions. Word has length 153 [2019-09-16 17:06:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:42,589 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 638 transitions. [2019-09-16 17:06:42,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 638 transitions. [2019-09-16 17:06:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:06:42,592 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:42,592 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:42,592 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1114687149, now seen corresponding path program 1 times [2019-09-16 17:06:42,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:42,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:42,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-16 17:06:42,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:42,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:42,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:42,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:42,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:42,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:42,688 INFO L87 Difference]: Start difference. First operand 422 states and 638 transitions. Second operand 4 states. [2019-09-16 17:06:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:43,035 INFO L93 Difference]: Finished difference Result 465 states and 699 transitions. [2019-09-16 17:06:43,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:43,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:06:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:43,040 INFO L225 Difference]: With dead ends: 465 [2019-09-16 17:06:43,040 INFO L226 Difference]: Without dead ends: 465 [2019-09-16 17:06:43,040 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-16 17:06:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-16 17:06:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 422. [2019-09-16 17:06:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-16 17:06:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 637 transitions. [2019-09-16 17:06:43,047 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 637 transitions. Word has length 153 [2019-09-16 17:06:43,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:43,047 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 637 transitions. [2019-09-16 17:06:43,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:43,047 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 637 transitions. [2019-09-16 17:06:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-16 17:06:43,048 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:43,049 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:43,049 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:43,049 INFO L82 PathProgramCache]: Analyzing trace with hash -667974488, now seen corresponding path program 1 times [2019-09-16 17:06:43,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:43,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:43,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:43,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:43,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:43,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:43,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:43,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:43,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:43,100 INFO L87 Difference]: Start difference. First operand 422 states and 637 transitions. Second operand 4 states. [2019-09-16 17:06:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:43,434 INFO L93 Difference]: Finished difference Result 456 states and 682 transitions. [2019-09-16 17:06:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:43,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-16 17:06:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:43,438 INFO L225 Difference]: With dead ends: 456 [2019-09-16 17:06:43,438 INFO L226 Difference]: Without dead ends: 456 [2019-09-16 17:06:43,438 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-16 17:06:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-16 17:06:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 422. [2019-09-16 17:06:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-16 17:06:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 636 transitions. [2019-09-16 17:06:43,444 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 636 transitions. Word has length 153 [2019-09-16 17:06:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:43,445 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 636 transitions. [2019-09-16 17:06:43,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 636 transitions. [2019-09-16 17:06:43,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-16 17:06:43,446 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:43,446 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:43,447 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:43,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:43,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1972140785, now seen corresponding path program 1 times [2019-09-16 17:06:43,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:43,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:43,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:43,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:43,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:43,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:43,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:43,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:43,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:43,518 INFO L87 Difference]: Start difference. First operand 422 states and 636 transitions. Second operand 4 states. [2019-09-16 17:06:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:43,899 INFO L93 Difference]: Finished difference Result 478 states and 716 transitions. [2019-09-16 17:06:43,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:43,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-16 17:06:43,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:43,903 INFO L225 Difference]: With dead ends: 478 [2019-09-16 17:06:43,903 INFO L226 Difference]: Without dead ends: 478 [2019-09-16 17:06:43,904 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-16 17:06:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-16 17:06:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 422. [2019-09-16 17:06:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-16 17:06:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 635 transitions. [2019-09-16 17:06:43,910 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 635 transitions. Word has length 154 [2019-09-16 17:06:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:43,910 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 635 transitions. [2019-09-16 17:06:43,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 635 transitions. [2019-09-16 17:06:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-16 17:06:43,920 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:43,921 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:43,921 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:43,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash -239896303, now seen corresponding path program 1 times [2019-09-16 17:06:43,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:43,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:43,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:43,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:43,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:43,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:43,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:43,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:43,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:43,971 INFO L87 Difference]: Start difference. First operand 422 states and 635 transitions. Second operand 4 states. [2019-09-16 17:06:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:44,317 INFO L93 Difference]: Finished difference Result 456 states and 680 transitions. [2019-09-16 17:06:44,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:44,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-16 17:06:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:44,319 INFO L225 Difference]: With dead ends: 456 [2019-09-16 17:06:44,320 INFO L226 Difference]: Without dead ends: 456 [2019-09-16 17:06:44,320 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-16 17:06:44,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-16 17:06:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 422. [2019-09-16 17:06:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-16 17:06:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 634 transitions. [2019-09-16 17:06:44,326 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 634 transitions. Word has length 154 [2019-09-16 17:06:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:44,326 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 634 transitions. [2019-09-16 17:06:44,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 634 transitions. [2019-09-16 17:06:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:44,328 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:44,328 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:44,328 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash 234865716, now seen corresponding path program 1 times [2019-09-16 17:06:44,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:44,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:44,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:44,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:44,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:44,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:44,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:44,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:44,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:44,395 INFO L87 Difference]: Start difference. First operand 422 states and 634 transitions. Second operand 4 states. [2019-09-16 17:06:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:44,761 INFO L93 Difference]: Finished difference Result 470 states and 701 transitions. [2019-09-16 17:06:44,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:44,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:44,764 INFO L225 Difference]: With dead ends: 470 [2019-09-16 17:06:44,764 INFO L226 Difference]: Without dead ends: 470 [2019-09-16 17:06:44,764 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-16 17:06:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-16 17:06:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 422. [2019-09-16 17:06:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-16 17:06:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 633 transitions. [2019-09-16 17:06:44,769 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 633 transitions. Word has length 155 [2019-09-16 17:06:44,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:44,769 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 633 transitions. [2019-09-16 17:06:44,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:44,769 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 633 transitions. [2019-09-16 17:06:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:44,770 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:44,770 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:44,771 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:44,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:44,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1740450912, now seen corresponding path program 1 times [2019-09-16 17:06:44,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:44,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:44,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:44,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:44,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:44,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:44,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:44,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:44,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:44,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:44,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:44,831 INFO L87 Difference]: Start difference. First operand 422 states and 633 transitions. Second operand 4 states. [2019-09-16 17:06:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:45,165 INFO L93 Difference]: Finished difference Result 465 states and 694 transitions. [2019-09-16 17:06:45,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:45,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:45,168 INFO L225 Difference]: With dead ends: 465 [2019-09-16 17:06:45,168 INFO L226 Difference]: Without dead ends: 465 [2019-09-16 17:06:45,168 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-16 17:06:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-16 17:06:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 423. [2019-09-16 17:06:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-16 17:06:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 634 transitions. [2019-09-16 17:06:45,175 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 634 transitions. Word has length 155 [2019-09-16 17:06:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:45,175 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 634 transitions. [2019-09-16 17:06:45,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 634 transitions. [2019-09-16 17:06:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:45,177 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:45,177 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:45,177 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:45,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:45,178 INFO L82 PathProgramCache]: Analyzing trace with hash 698563363, now seen corresponding path program 1 times [2019-09-16 17:06:45,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:45,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:45,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:45,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:45,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:45,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:45,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:45,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:45,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:45,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:45,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:45,240 INFO L87 Difference]: Start difference. First operand 423 states and 634 transitions. Second operand 4 states. [2019-09-16 17:06:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:45,546 INFO L93 Difference]: Finished difference Result 457 states and 679 transitions. [2019-09-16 17:06:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:45,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:45,547 INFO L225 Difference]: With dead ends: 457 [2019-09-16 17:06:45,548 INFO L226 Difference]: Without dead ends: 457 [2019-09-16 17:06:45,548 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-16 17:06:45,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 423. [2019-09-16 17:06:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-16 17:06:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 633 transitions. [2019-09-16 17:06:45,557 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 633 transitions. Word has length 155 [2019-09-16 17:06:45,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:45,558 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 633 transitions. [2019-09-16 17:06:45,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:45,558 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 633 transitions. [2019-09-16 17:06:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:45,559 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:45,559 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:45,560 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:45,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:45,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1125171618, now seen corresponding path program 1 times [2019-09-16 17:06:45,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:45,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:45,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:45,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:45,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:45,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:45,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:45,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:45,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:45,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:45,632 INFO L87 Difference]: Start difference. First operand 423 states and 633 transitions. Second operand 4 states. [2019-09-16 17:06:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:45,948 INFO L93 Difference]: Finished difference Result 461 states and 687 transitions. [2019-09-16 17:06:45,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:45,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:45,951 INFO L225 Difference]: With dead ends: 461 [2019-09-16 17:06:45,951 INFO L226 Difference]: Without dead ends: 461 [2019-09-16 17:06:45,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-16 17:06:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-16 17:06:45,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 424. [2019-09-16 17:06:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-16 17:06:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 634 transitions. [2019-09-16 17:06:45,956 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 634 transitions. Word has length 156 [2019-09-16 17:06:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:45,956 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 634 transitions. [2019-09-16 17:06:45,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 634 transitions. [2019-09-16 17:06:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:45,957 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:45,957 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:45,957 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:45,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash -479739409, now seen corresponding path program 1 times [2019-09-16 17:06:45,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:45,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:45,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:45,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:45,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:46,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:46,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:46,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:46,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:46,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:46,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:46,009 INFO L87 Difference]: Start difference. First operand 424 states and 634 transitions. Second operand 4 states. [2019-09-16 17:06:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:46,336 INFO L93 Difference]: Finished difference Result 461 states and 686 transitions. [2019-09-16 17:06:46,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:46,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:46,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:46,338 INFO L225 Difference]: With dead ends: 461 [2019-09-16 17:06:46,338 INFO L226 Difference]: Without dead ends: 461 [2019-09-16 17:06:46,339 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-16 17:06:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-16 17:06:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 425. [2019-09-16 17:06:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-16 17:06:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 635 transitions. [2019-09-16 17:06:46,345 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 635 transitions. Word has length 156 [2019-09-16 17:06:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:46,346 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 635 transitions. [2019-09-16 17:06:46,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 635 transitions. [2019-09-16 17:06:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:46,347 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:46,347 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:46,347 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:46,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash 278979756, now seen corresponding path program 1 times [2019-09-16 17:06:46,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:46,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:46,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:46,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:46,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:46,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:46,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:46,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:46,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:46,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:46,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:46,437 INFO L87 Difference]: Start difference. First operand 425 states and 635 transitions. Second operand 4 states. [2019-09-16 17:06:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:46,765 INFO L93 Difference]: Finished difference Result 449 states and 668 transitions. [2019-09-16 17:06:46,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:46,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:46,767 INFO L225 Difference]: With dead ends: 449 [2019-09-16 17:06:46,767 INFO L226 Difference]: Without dead ends: 449 [2019-09-16 17:06:46,767 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-16 17:06:46,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-16 17:06:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 425. [2019-09-16 17:06:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-16 17:06:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 634 transitions. [2019-09-16 17:06:46,774 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 634 transitions. Word has length 156 [2019-09-16 17:06:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:46,774 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 634 transitions. [2019-09-16 17:06:46,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 634 transitions. [2019-09-16 17:06:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:06:46,775 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:46,775 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:46,776 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:46,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:46,776 INFO L82 PathProgramCache]: Analyzing trace with hash -521116869, now seen corresponding path program 1 times [2019-09-16 17:06:46,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:46,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:46,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:46,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:46,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:06:46,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:46,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:46,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:46,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:46,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:46,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:46,838 INFO L87 Difference]: Start difference. First operand 425 states and 634 transitions. Second operand 4 states. [2019-09-16 17:06:47,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:47,185 INFO L93 Difference]: Finished difference Result 470 states and 695 transitions. [2019-09-16 17:06:47,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:47,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:06:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:47,186 INFO L225 Difference]: With dead ends: 470 [2019-09-16 17:06:47,187 INFO L226 Difference]: Without dead ends: 470 [2019-09-16 17:06:47,187 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-16 17:06:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-16 17:06:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 425. [2019-09-16 17:06:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-16 17:06:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 633 transitions. [2019-09-16 17:06:47,193 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 633 transitions. Word has length 157 [2019-09-16 17:06:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:47,193 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 633 transitions. [2019-09-16 17:06:47,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 633 transitions. [2019-09-16 17:06:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:06:47,194 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:47,194 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:47,195 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:47,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:47,195 INFO L82 PathProgramCache]: Analyzing trace with hash -742841583, now seen corresponding path program 1 times [2019-09-16 17:06:47,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:47,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:47,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:47,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:47,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:47,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:47,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:47,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:47,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:47,247 INFO L87 Difference]: Start difference. First operand 425 states and 633 transitions. Second operand 4 states. [2019-09-16 17:06:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:47,564 INFO L93 Difference]: Finished difference Result 459 states and 681 transitions. [2019-09-16 17:06:47,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:47,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:06:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:47,566 INFO L225 Difference]: With dead ends: 459 [2019-09-16 17:06:47,566 INFO L226 Difference]: Without dead ends: 459 [2019-09-16 17:06:47,567 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-16 17:06:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-16 17:06:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 426. [2019-09-16 17:06:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-16 17:06:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 634 transitions. [2019-09-16 17:06:47,573 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 634 transitions. Word has length 157 [2019-09-16 17:06:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:47,573 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 634 transitions. [2019-09-16 17:06:47,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 634 transitions. [2019-09-16 17:06:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-16 17:06:47,574 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:47,574 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:47,575 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:47,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:47,575 INFO L82 PathProgramCache]: Analyzing trace with hash 716092009, now seen corresponding path program 1 times [2019-09-16 17:06:47,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:47,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:47,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:47,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:47,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:47,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:47,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:47,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:47,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:47,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:47,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:47,633 INFO L87 Difference]: Start difference. First operand 426 states and 634 transitions. Second operand 4 states. [2019-09-16 17:06:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:48,042 INFO L93 Difference]: Finished difference Result 467 states and 689 transitions. [2019-09-16 17:06:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:48,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-16 17:06:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:48,044 INFO L225 Difference]: With dead ends: 467 [2019-09-16 17:06:48,044 INFO L226 Difference]: Without dead ends: 467 [2019-09-16 17:06:48,044 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-16 17:06:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-16 17:06:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 426. [2019-09-16 17:06:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-16 17:06:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 633 transitions. [2019-09-16 17:06:48,050 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 633 transitions. Word has length 158 [2019-09-16 17:06:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:48,051 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 633 transitions. [2019-09-16 17:06:48,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 633 transitions. [2019-09-16 17:06:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-16 17:06:48,052 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:48,052 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:48,053 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:48,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1715313832, now seen corresponding path program 1 times [2019-09-16 17:06:48,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:48,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:48,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-16 17:06:48,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:48,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:48,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:48,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:48,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:48,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:48,131 INFO L87 Difference]: Start difference. First operand 426 states and 633 transitions. Second operand 4 states. [2019-09-16 17:06:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:48,474 INFO L93 Difference]: Finished difference Result 465 states and 686 transitions. [2019-09-16 17:06:48,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:48,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-16 17:06:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:48,476 INFO L225 Difference]: With dead ends: 465 [2019-09-16 17:06:48,476 INFO L226 Difference]: Without dead ends: 465 [2019-09-16 17:06:48,476 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-16 17:06:48,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-16 17:06:48,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 426. [2019-09-16 17:06:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-16 17:06:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 632 transitions. [2019-09-16 17:06:48,482 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 632 transitions. Word has length 158 [2019-09-16 17:06:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:48,482 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 632 transitions. [2019-09-16 17:06:48,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 632 transitions. [2019-09-16 17:06:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-16 17:06:48,483 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:48,484 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:48,484 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:48,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1287697130, now seen corresponding path program 1 times [2019-09-16 17:06:48,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:48,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:48,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:48,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:48,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:48,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:48,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:48,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:48,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:48,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:48,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:48,533 INFO L87 Difference]: Start difference. First operand 426 states and 632 transitions. Second operand 4 states. [2019-09-16 17:06:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:48,863 INFO L93 Difference]: Finished difference Result 459 states and 678 transitions. [2019-09-16 17:06:48,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:48,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-16 17:06:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:48,865 INFO L225 Difference]: With dead ends: 459 [2019-09-16 17:06:48,865 INFO L226 Difference]: Without dead ends: 459 [2019-09-16 17:06:48,865 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-16 17:06:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-16 17:06:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 427. [2019-09-16 17:06:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-09-16 17:06:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 633 transitions. [2019-09-16 17:06:48,869 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 633 transitions. Word has length 158 [2019-09-16 17:06:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:48,869 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 633 transitions. [2019-09-16 17:06:48,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2019-09-16 17:06:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:06:48,871 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:48,871 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:48,871 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:48,871 INFO L82 PathProgramCache]: Analyzing trace with hash 226461420, now seen corresponding path program 1 times [2019-09-16 17:06:48,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:48,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:48,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:48,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:48,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:06:48,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:48,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:48,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:48,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:48,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:48,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:48,943 INFO L87 Difference]: Start difference. First operand 427 states and 633 transitions. Second operand 4 states. [2019-09-16 17:06:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:49,276 INFO L93 Difference]: Finished difference Result 457 states and 675 transitions. [2019-09-16 17:06:49,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:49,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:06:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:49,278 INFO L225 Difference]: With dead ends: 457 [2019-09-16 17:06:49,278 INFO L226 Difference]: Without dead ends: 457 [2019-09-16 17:06:49,278 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-16 17:06:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-16 17:06:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 428. [2019-09-16 17:06:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-16 17:06:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 634 transitions. [2019-09-16 17:06:49,285 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 634 transitions. Word has length 159 [2019-09-16 17:06:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:49,285 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 634 transitions. [2019-09-16 17:06:49,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 634 transitions. [2019-09-16 17:06:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:06:49,286 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:49,287 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:49,287 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:49,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:49,287 INFO L82 PathProgramCache]: Analyzing trace with hash 823806539, now seen corresponding path program 1 times [2019-09-16 17:06:49,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:49,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:49,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:49,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:49,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:49,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:49,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:49,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:49,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:49,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:49,367 INFO L87 Difference]: Start difference. First operand 428 states and 634 transitions. Second operand 4 states. [2019-09-16 17:06:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:49,701 INFO L93 Difference]: Finished difference Result 465 states and 683 transitions. [2019-09-16 17:06:49,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:49,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:06:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:49,703 INFO L225 Difference]: With dead ends: 465 [2019-09-16 17:06:49,703 INFO L226 Difference]: Without dead ends: 465 [2019-09-16 17:06:49,703 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-16 17:06:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-16 17:06:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 428. [2019-09-16 17:06:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-16 17:06:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 633 transitions. [2019-09-16 17:06:49,710 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 633 transitions. Word has length 160 [2019-09-16 17:06:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:49,710 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 633 transitions. [2019-09-16 17:06:49,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 633 transitions. [2019-09-16 17:06:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-16 17:06:49,712 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:49,712 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:49,712 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:49,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:49,713 INFO L82 PathProgramCache]: Analyzing trace with hash 523623891, now seen corresponding path program 1 times [2019-09-16 17:06:49,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:49,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:49,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:49,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:49,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:49,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:49,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:49,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:49,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:49,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:49,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:49,807 INFO L87 Difference]: Start difference. First operand 428 states and 633 transitions. Second operand 4 states. [2019-09-16 17:06:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:50,155 INFO L93 Difference]: Finished difference Result 461 states and 677 transitions. [2019-09-16 17:06:50,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:50,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-16 17:06:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:50,157 INFO L225 Difference]: With dead ends: 461 [2019-09-16 17:06:50,157 INFO L226 Difference]: Without dead ends: 461 [2019-09-16 17:06:50,158 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-16 17:06:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-16 17:06:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 428. [2019-09-16 17:06:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-16 17:06:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 632 transitions. [2019-09-16 17:06:50,161 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 632 transitions. Word has length 161 [2019-09-16 17:06:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:50,162 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 632 transitions. [2019-09-16 17:06:50,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 632 transitions. [2019-09-16 17:06:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-16 17:06:50,163 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:50,163 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:50,163 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1169056100, now seen corresponding path program 1 times [2019-09-16 17:06:50,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:50,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:50,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:50,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:50,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:50,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:50,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:50,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:50,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:50,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:50,241 INFO L87 Difference]: Start difference. First operand 428 states and 632 transitions. Second operand 4 states. [2019-09-16 17:06:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:50,535 INFO L93 Difference]: Finished difference Result 461 states and 676 transitions. [2019-09-16 17:06:50,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:50,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-16 17:06:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:50,537 INFO L225 Difference]: With dead ends: 461 [2019-09-16 17:06:50,537 INFO L226 Difference]: Without dead ends: 461 [2019-09-16 17:06:50,537 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-16 17:06:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-16 17:06:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 428. [2019-09-16 17:06:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-16 17:06:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2019-09-16 17:06:50,541 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 161 [2019-09-16 17:06:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:50,542 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2019-09-16 17:06:50,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2019-09-16 17:06:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-16 17:06:50,543 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:50,543 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:50,543 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:50,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:50,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1169788356, now seen corresponding path program 1 times [2019-09-16 17:06:50,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:50,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:50,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:50,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:50,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:50,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:50,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:50,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:50,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:50,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:50,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:50,637 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand 4 states. [2019-09-16 17:06:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:50,973 INFO L93 Difference]: Finished difference Result 459 states and 673 transitions. [2019-09-16 17:06:50,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:50,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-16 17:06:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:50,975 INFO L225 Difference]: With dead ends: 459 [2019-09-16 17:06:50,975 INFO L226 Difference]: Without dead ends: 459 [2019-09-16 17:06:50,976 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-16 17:06:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-16 17:06:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 428. [2019-09-16 17:06:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-16 17:06:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 630 transitions. [2019-09-16 17:06:50,981 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 630 transitions. Word has length 162 [2019-09-16 17:06:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:50,981 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 630 transitions. [2019-09-16 17:06:50,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 630 transitions. [2019-09-16 17:06:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-16 17:06:50,982 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:50,982 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:50,982 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash 937249055, now seen corresponding path program 1 times [2019-09-16 17:06:50,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:50,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:50,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:50,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:50,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:51,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:51,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:51,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:51,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:51,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:51,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:51,073 INFO L87 Difference]: Start difference. First operand 428 states and 630 transitions. Second operand 4 states. [2019-09-16 17:06:51,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:51,409 INFO L93 Difference]: Finished difference Result 459 states and 672 transitions. [2019-09-16 17:06:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:51,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-16 17:06:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:51,412 INFO L225 Difference]: With dead ends: 459 [2019-09-16 17:06:51,412 INFO L226 Difference]: Without dead ends: 459 [2019-09-16 17:06:51,412 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-16 17:06:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-16 17:06:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 428. [2019-09-16 17:06:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-09-16 17:06:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 629 transitions. [2019-09-16 17:06:51,418 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 629 transitions. Word has length 163 [2019-09-16 17:06:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:51,418 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 629 transitions. [2019-09-16 17:06:51,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 629 transitions. [2019-09-16 17:06:51,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-16 17:06:51,420 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:51,420 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:51,420 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:51,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:51,421 INFO L82 PathProgramCache]: Analyzing trace with hash -314923698, now seen corresponding path program 1 times [2019-09-16 17:06:51,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:51,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:51,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:51,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:51,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:51,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:51,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:51,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:51,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:51,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:51,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:51,520 INFO L87 Difference]: Start difference. First operand 428 states and 629 transitions. Second operand 4 states. [2019-09-16 17:06:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:51,931 INFO L93 Difference]: Finished difference Result 494 states and 730 transitions. [2019-09-16 17:06:51,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:51,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-16 17:06:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:51,933 INFO L225 Difference]: With dead ends: 494 [2019-09-16 17:06:51,933 INFO L226 Difference]: Without dead ends: 494 [2019-09-16 17:06:51,933 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-16 17:06:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-16 17:06:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 458. [2019-09-16 17:06:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-09-16 17:06:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 682 transitions. [2019-09-16 17:06:51,940 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 682 transitions. Word has length 163 [2019-09-16 17:06:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:51,940 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 682 transitions. [2019-09-16 17:06:51,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:51,940 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 682 transitions. [2019-09-16 17:06:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-16 17:06:51,941 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:51,942 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:51,942 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:51,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:51,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2047494313, now seen corresponding path program 1 times [2019-09-16 17:06:51,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:51,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:51,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:51,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-16 17:06:52,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:52,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:52,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:52,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:52,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:52,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:52,030 INFO L87 Difference]: Start difference. First operand 458 states and 682 transitions. Second operand 4 states. [2019-09-16 17:06:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:52,347 INFO L93 Difference]: Finished difference Result 487 states and 722 transitions. [2019-09-16 17:06:52,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:52,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-16 17:06:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:52,349 INFO L225 Difference]: With dead ends: 487 [2019-09-16 17:06:52,349 INFO L226 Difference]: Without dead ends: 487 [2019-09-16 17:06:52,349 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-16 17:06:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-16 17:06:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 420. [2019-09-16 17:06:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-16 17:06:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 626 transitions. [2019-09-16 17:06:52,354 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 626 transitions. Word has length 164 [2019-09-16 17:06:52,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:52,354 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 626 transitions. [2019-09-16 17:06:52,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 626 transitions. [2019-09-16 17:06:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-16 17:06:52,355 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:52,355 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:52,355 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:52,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:52,356 INFO L82 PathProgramCache]: Analyzing trace with hash -990417559, now seen corresponding path program 1 times [2019-09-16 17:06:52,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:52,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:52,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:52,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:52,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-16 17:06:52,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:52,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:52,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:52,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:52,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:52,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:52,411 INFO L87 Difference]: Start difference. First operand 420 states and 626 transitions. Second operand 4 states. [2019-09-16 17:06:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:52,732 INFO L93 Difference]: Finished difference Result 487 states and 721 transitions. [2019-09-16 17:06:52,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:52,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-16 17:06:52,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:52,735 INFO L225 Difference]: With dead ends: 487 [2019-09-16 17:06:52,735 INFO L226 Difference]: Without dead ends: 487 [2019-09-16 17:06:52,736 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-16 17:06:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-16 17:06:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 450. [2019-09-16 17:06:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-16 17:06:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 671 transitions. [2019-09-16 17:06:52,742 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 671 transitions. Word has length 166 [2019-09-16 17:06:52,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:52,742 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 671 transitions. [2019-09-16 17:06:52,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:52,742 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 671 transitions. [2019-09-16 17:06:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-16 17:06:52,743 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:52,744 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:52,744 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:52,744 INFO L82 PathProgramCache]: Analyzing trace with hash 902053822, now seen corresponding path program 1 times [2019-09-16 17:06:52,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:52,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:52,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:52,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:52,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-16 17:06:52,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:52,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:52,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:52,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:52,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:52,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:52,832 INFO L87 Difference]: Start difference. First operand 450 states and 671 transitions. Second operand 4 states. [2019-09-16 17:06:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:53,209 INFO L93 Difference]: Finished difference Result 489 states and 722 transitions. [2019-09-16 17:06:53,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:53,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-16 17:06:53,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:53,212 INFO L225 Difference]: With dead ends: 489 [2019-09-16 17:06:53,212 INFO L226 Difference]: Without dead ends: 489 [2019-09-16 17:06:53,213 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-16 17:06:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-16 17:06:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 450. [2019-09-16 17:06:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-16 17:06:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 670 transitions. [2019-09-16 17:06:53,219 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 670 transitions. Word has length 166 [2019-09-16 17:06:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:53,220 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 670 transitions. [2019-09-16 17:06:53,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 670 transitions. [2019-09-16 17:06:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-16 17:06:53,222 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:53,222 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:53,222 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:53,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1917776931, now seen corresponding path program 1 times [2019-09-16 17:06:53,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:53,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:53,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:53,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-16 17:06:53,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:53,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:53,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:53,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:53,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:53,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:53,305 INFO L87 Difference]: Start difference. First operand 450 states and 670 transitions. Second operand 4 states. [2019-09-16 17:06:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:53,569 INFO L93 Difference]: Finished difference Result 463 states and 687 transitions. [2019-09-16 17:06:53,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:53,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-16 17:06:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:53,571 INFO L225 Difference]: With dead ends: 463 [2019-09-16 17:06:53,571 INFO L226 Difference]: Without dead ends: 463 [2019-09-16 17:06:53,571 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-16 17:06:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-16 17:06:53,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 450. [2019-09-16 17:06:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-16 17:06:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 669 transitions. [2019-09-16 17:06:53,577 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 669 transitions. Word has length 167 [2019-09-16 17:06:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:53,577 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 669 transitions. [2019-09-16 17:06:53,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 669 transitions. [2019-09-16 17:06:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-16 17:06:53,578 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:53,579 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:53,579 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:53,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:53,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1186341051, now seen corresponding path program 1 times [2019-09-16 17:06:53,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:53,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:53,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:53,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:53,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-16 17:06:53,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:53,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:53,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:53,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:53,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:53,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:53,652 INFO L87 Difference]: Start difference. First operand 450 states and 669 transitions. Second operand 4 states. [2019-09-16 17:06:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:54,007 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2019-09-16 17:06:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:54,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-16 17:06:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:54,009 INFO L225 Difference]: With dead ends: 489 [2019-09-16 17:06:54,009 INFO L226 Difference]: Without dead ends: 489 [2019-09-16 17:06:54,009 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-16 17:06:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-16 17:06:54,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 450. [2019-09-16 17:06:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-16 17:06:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 668 transitions. [2019-09-16 17:06:54,015 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 668 transitions. Word has length 167 [2019-09-16 17:06:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:54,016 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 668 transitions. [2019-09-16 17:06:54,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 668 transitions. [2019-09-16 17:06:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-16 17:06:54,017 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:54,017 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:54,017 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1962248377, now seen corresponding path program 1 times [2019-09-16 17:06:54,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:54,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:54,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:54,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:54,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-16 17:06:54,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:54,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:54,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:54,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:54,074 INFO L87 Difference]: Start difference. First operand 450 states and 668 transitions. Second operand 4 states. [2019-09-16 17:06:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:54,372 INFO L93 Difference]: Finished difference Result 474 states and 701 transitions. [2019-09-16 17:06:54,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:54,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-16 17:06:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:54,373 INFO L225 Difference]: With dead ends: 474 [2019-09-16 17:06:54,373 INFO L226 Difference]: Without dead ends: 474 [2019-09-16 17:06:54,374 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-16 17:06:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-16 17:06:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 450. [2019-09-16 17:06:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-16 17:06:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 667 transitions. [2019-09-16 17:06:54,378 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 667 transitions. Word has length 168 [2019-09-16 17:06:54,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:54,378 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 667 transitions. [2019-09-16 17:06:54,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 667 transitions. [2019-09-16 17:06:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-16 17:06:54,379 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:54,380 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:54,380 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:54,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:54,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1064728021, now seen corresponding path program 1 times [2019-09-16 17:06:54,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:54,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:54,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:54,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:54,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:54,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:54,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:06:54,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:54,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:06:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:06:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:54,543 INFO L87 Difference]: Start difference. First operand 450 states and 667 transitions. Second operand 5 states. [2019-09-16 17:06:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:55,123 INFO L93 Difference]: Finished difference Result 526 states and 783 transitions. [2019-09-16 17:06:55,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:06:55,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-09-16 17:06:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:55,124 INFO L225 Difference]: With dead ends: 526 [2019-09-16 17:06:55,124 INFO L226 Difference]: Without dead ends: 526 [2019-09-16 17:06:55,125 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:06:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-16 17:06:55,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 483. [2019-09-16 17:06:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-16 17:06:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 726 transitions. [2019-09-16 17:06:55,130 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 726 transitions. Word has length 168 [2019-09-16 17:06:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:55,130 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 726 transitions. [2019-09-16 17:06:55,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:06:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 726 transitions. [2019-09-16 17:06:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-16 17:06:55,131 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:55,131 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:55,131 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:55,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:55,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1283677808, now seen corresponding path program 1 times [2019-09-16 17:06:55,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:55,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:55,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:55,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:55,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-16 17:06:55,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:55,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:55,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:55,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:55,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:55,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:55,194 INFO L87 Difference]: Start difference. First operand 483 states and 726 transitions. Second operand 4 states. [2019-09-16 17:06:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:55,499 INFO L93 Difference]: Finished difference Result 505 states and 757 transitions. [2019-09-16 17:06:55,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:55,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-16 17:06:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:55,501 INFO L225 Difference]: With dead ends: 505 [2019-09-16 17:06:55,501 INFO L226 Difference]: Without dead ends: 505 [2019-09-16 17:06:55,501 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-16 17:06:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-09-16 17:06:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 483. [2019-09-16 17:06:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-16 17:06:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 725 transitions. [2019-09-16 17:06:55,506 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 725 transitions. Word has length 169 [2019-09-16 17:06:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:55,506 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 725 transitions. [2019-09-16 17:06:55,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 725 transitions. [2019-09-16 17:06:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-16 17:06:55,507 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:55,507 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, 1] [2019-09-16 17:06:55,507 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:55,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:55,507 INFO L82 PathProgramCache]: Analyzing trace with hash -40787640, now seen corresponding path program 1 times [2019-09-16 17:06:55,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:55,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:55,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:55,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:55,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-16 17:06:55,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:55,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:55,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:55,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:55,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:55,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:55,586 INFO L87 Difference]: Start difference. First operand 483 states and 725 transitions. Second operand 3 states. [2019-09-16 17:06:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:55,643 INFO L93 Difference]: Finished difference Result 933 states and 1401 transitions. [2019-09-16 17:06:55,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:55,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-16 17:06:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:55,645 INFO L225 Difference]: With dead ends: 933 [2019-09-16 17:06:55,645 INFO L226 Difference]: Without dead ends: 933 [2019-09-16 17:06:55,646 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-16 17:06:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-16 17:06:55,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2019-09-16 17:06:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-09-16 17:06:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1401 transitions. [2019-09-16 17:06:55,657 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1401 transitions. Word has length 172 [2019-09-16 17:06:55,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:55,657 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1401 transitions. [2019-09-16 17:06:55,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1401 transitions. [2019-09-16 17:06:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-16 17:06:55,659 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:55,659 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, 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-16 17:06:55,659 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:55,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1874456679, now seen corresponding path program 1 times [2019-09-16 17:06:55,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:55,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:55,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:55,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:55,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-16 17:06:55,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:55,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:55,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:55,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:55,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:55,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:55,736 INFO L87 Difference]: Start difference. First operand 933 states and 1401 transitions. Second operand 4 states. [2019-09-16 17:06:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:56,053 INFO L93 Difference]: Finished difference Result 1007 states and 1493 transitions. [2019-09-16 17:06:56,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:56,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-16 17:06:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:56,055 INFO L225 Difference]: With dead ends: 1007 [2019-09-16 17:06:56,055 INFO L226 Difference]: Without dead ends: 1007 [2019-09-16 17:06:56,055 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-16 17:06:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-09-16 17:06:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 873. [2019-09-16 17:06:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-09-16 17:06:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1309 transitions. [2019-09-16 17:06:56,066 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1309 transitions. Word has length 173 [2019-09-16 17:06:56,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:56,066 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1309 transitions. [2019-09-16 17:06:56,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1309 transitions. [2019-09-16 17:06:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-16 17:06:56,067 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:56,067 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, 1, 1] [2019-09-16 17:06:56,068 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:56,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1008288102, now seen corresponding path program 1 times [2019-09-16 17:06:56,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:56,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:56,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:56,144 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-16 17:06:56,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:56,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:56,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:56,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:56,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:56,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:56,146 INFO L87 Difference]: Start difference. First operand 873 states and 1309 transitions. Second operand 3 states. [2019-09-16 17:06:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:56,214 INFO L93 Difference]: Finished difference Result 1291 states and 1935 transitions. [2019-09-16 17:06:56,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:56,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-16 17:06:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:56,217 INFO L225 Difference]: With dead ends: 1291 [2019-09-16 17:06:56,217 INFO L226 Difference]: Without dead ends: 1291 [2019-09-16 17:06:56,218 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-16 17:06:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-09-16 17:06:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2019-09-16 17:06:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2019-09-16 17:06:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1934 transitions. [2019-09-16 17:06:56,238 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1934 transitions. Word has length 173 [2019-09-16 17:06:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:56,239 INFO L475 AbstractCegarLoop]: Abstraction has 1289 states and 1934 transitions. [2019-09-16 17:06:56,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1934 transitions. [2019-09-16 17:06:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-16 17:06:56,241 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:56,241 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, 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-16 17:06:56,242 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:56,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:56,242 INFO L82 PathProgramCache]: Analyzing trace with hash 2081372694, now seen corresponding path program 1 times [2019-09-16 17:06:56,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:56,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:56,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-16 17:06:56,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:56,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:56,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:56,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:56,360 INFO L87 Difference]: Start difference. First operand 1289 states and 1934 transitions. Second operand 4 states. [2019-09-16 17:06:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:56,732 INFO L93 Difference]: Finished difference Result 1480 states and 2194 transitions. [2019-09-16 17:06:56,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:56,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-09-16 17:06:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:56,738 INFO L225 Difference]: With dead ends: 1480 [2019-09-16 17:06:56,738 INFO L226 Difference]: Without dead ends: 1480 [2019-09-16 17:06:56,738 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-16 17:06:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-09-16 17:06:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1382. [2019-09-16 17:06:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-16 17:06:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2072 transitions. [2019-09-16 17:06:56,752 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2072 transitions. Word has length 174 [2019-09-16 17:06:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:56,753 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 2072 transitions. [2019-09-16 17:06:56,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2072 transitions. [2019-09-16 17:06:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-16 17:06:56,755 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:56,755 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, 1, 1, 1] [2019-09-16 17:06:56,755 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:56,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1107425607, now seen corresponding path program 1 times [2019-09-16 17:06:56,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:56,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:56,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-16 17:06:56,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:56,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:56,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:56,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:56,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:56,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:56,832 INFO L87 Difference]: Start difference. First operand 1382 states and 2072 transitions. Second operand 3 states. [2019-09-16 17:06:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:56,906 INFO L93 Difference]: Finished difference Result 1801 states and 2700 transitions. [2019-09-16 17:06:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:56,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-16 17:06:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:56,907 INFO L225 Difference]: With dead ends: 1801 [2019-09-16 17:06:56,907 INFO L226 Difference]: Without dead ends: 1801 [2019-09-16 17:06:56,908 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-16 17:06:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2019-09-16 17:06:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1795. [2019-09-16 17:06:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-09-16 17:06:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2695 transitions. [2019-09-16 17:06:56,919 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2695 transitions. Word has length 174 [2019-09-16 17:06:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:56,919 INFO L475 AbstractCegarLoop]: Abstraction has 1795 states and 2695 transitions. [2019-09-16 17:06:56,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2695 transitions. [2019-09-16 17:06:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-16 17:06:56,921 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:56,921 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, 1, 1, 1] [2019-09-16 17:06:56,921 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:56,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:56,921 INFO L82 PathProgramCache]: Analyzing trace with hash 159373641, now seen corresponding path program 1 times [2019-09-16 17:06:56,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:56,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:56,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:56,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-16 17:06:56,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:56,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:56,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:56,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:56,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:56,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:56,965 INFO L87 Difference]: Start difference. First operand 1795 states and 2695 transitions. Second operand 3 states. [2019-09-16 17:06:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:57,004 INFO L93 Difference]: Finished difference Result 1822 states and 2730 transitions. [2019-09-16 17:06:57,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:57,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-16 17:06:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:57,007 INFO L225 Difference]: With dead ends: 1822 [2019-09-16 17:06:57,007 INFO L226 Difference]: Without dead ends: 1822 [2019-09-16 17:06:57,007 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-16 17:06:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-09-16 17:06:57,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2019-09-16 17:06:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822 states. [2019-09-16 17:06:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2730 transitions. [2019-09-16 17:06:57,026 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2730 transitions. Word has length 174 [2019-09-16 17:06:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:57,027 INFO L475 AbstractCegarLoop]: Abstraction has 1822 states and 2730 transitions. [2019-09-16 17:06:57,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2730 transitions. [2019-09-16 17:06:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-16 17:06:57,029 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:57,029 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, 1, 1, 1] [2019-09-16 17:06:57,030 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash 545236043, now seen corresponding path program 1 times [2019-09-16 17:06:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:57,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:57,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-16 17:06:57,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:57,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:57,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:57,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:57,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:57,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:57,090 INFO L87 Difference]: Start difference. First operand 1822 states and 2730 transitions. Second operand 3 states. [2019-09-16 17:06:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:57,129 INFO L93 Difference]: Finished difference Result 1824 states and 2732 transitions. [2019-09-16 17:06:57,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:57,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-16 17:06:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:57,132 INFO L225 Difference]: With dead ends: 1824 [2019-09-16 17:06:57,133 INFO L226 Difference]: Without dead ends: 1824 [2019-09-16 17:06:57,133 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-16 17:06:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2019-09-16 17:06:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2019-09-16 17:06:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-16 17:06:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2732 transitions. [2019-09-16 17:06:57,157 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2732 transitions. Word has length 174 [2019-09-16 17:06:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:57,157 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2732 transitions. [2019-09-16 17:06:57,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2732 transitions. [2019-09-16 17:06:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-16 17:06:57,159 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:57,159 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:57,159 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:57,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:57,160 INFO L82 PathProgramCache]: Analyzing trace with hash 748465147, now seen corresponding path program 1 times [2019-09-16 17:06:57,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:57,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:57,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:57,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:57,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:57,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:57,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:57,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:57,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:57,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:57,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:57,265 INFO L87 Difference]: Start difference. First operand 1824 states and 2732 transitions. Second operand 4 states. [2019-09-16 17:06:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:57,649 INFO L93 Difference]: Finished difference Result 1969 states and 2915 transitions. [2019-09-16 17:06:57,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:57,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-16 17:06:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:57,652 INFO L225 Difference]: With dead ends: 1969 [2019-09-16 17:06:57,653 INFO L226 Difference]: Without dead ends: 1969 [2019-09-16 17:06:57,653 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-16 17:06:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-09-16 17:06:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2019-09-16 17:06:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-16 17:06:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2728 transitions. [2019-09-16 17:06:57,674 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2728 transitions. Word has length 178 [2019-09-16 17:06:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:57,674 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2728 transitions. [2019-09-16 17:06:57,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2728 transitions. [2019-09-16 17:06:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-16 17:06:57,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:57,677 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:57,677 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:57,678 INFO L82 PathProgramCache]: Analyzing trace with hash 720059422, now seen corresponding path program 1 times [2019-09-16 17:06:57,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:57,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:57,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:57,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:57,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:57,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:57,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:57,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:57,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:57,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:57,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:57,759 INFO L87 Difference]: Start difference. First operand 1824 states and 2728 transitions. Second operand 4 states. [2019-09-16 17:06:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:58,110 INFO L93 Difference]: Finished difference Result 1969 states and 2911 transitions. [2019-09-16 17:06:58,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:58,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-16 17:06:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:58,112 INFO L225 Difference]: With dead ends: 1969 [2019-09-16 17:06:58,113 INFO L226 Difference]: Without dead ends: 1969 [2019-09-16 17:06:58,113 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-16 17:06:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-09-16 17:06:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2019-09-16 17:06:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-16 17:06:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2724 transitions. [2019-09-16 17:06:58,133 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2724 transitions. Word has length 179 [2019-09-16 17:06:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:58,134 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2724 transitions. [2019-09-16 17:06:58,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2724 transitions. [2019-09-16 17:06:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-16 17:06:58,136 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:58,136 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:58,136 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:58,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:58,137 INFO L82 PathProgramCache]: Analyzing trace with hash 392419766, now seen corresponding path program 1 times [2019-09-16 17:06:58,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:58,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:58,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:58,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:58,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:58,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:58,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:58,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:58,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:58,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:58,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:58,222 INFO L87 Difference]: Start difference. First operand 1824 states and 2724 transitions. Second operand 4 states. [2019-09-16 17:06:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:58,558 INFO L93 Difference]: Finished difference Result 1969 states and 2907 transitions. [2019-09-16 17:06:58,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:58,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-16 17:06:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:58,562 INFO L225 Difference]: With dead ends: 1969 [2019-09-16 17:06:58,562 INFO L226 Difference]: Without dead ends: 1969 [2019-09-16 17:06:58,562 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-16 17:06:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-09-16 17:06:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1824. [2019-09-16 17:06:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-16 17:06:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2720 transitions. [2019-09-16 17:06:58,580 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2720 transitions. Word has length 180 [2019-09-16 17:06:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:58,581 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2720 transitions. [2019-09-16 17:06:58,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2720 transitions. [2019-09-16 17:06:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-16 17:06:58,583 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:58,584 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:58,584 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:58,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:58,585 INFO L82 PathProgramCache]: Analyzing trace with hash -621537159, now seen corresponding path program 1 times [2019-09-16 17:06:58,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:58,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:58,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:58,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:58,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:58,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:58,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:58,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:58,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:58,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:58,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:58,662 INFO L87 Difference]: Start difference. First operand 1824 states and 2720 transitions. Second operand 4 states. [2019-09-16 17:06:58,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:58,997 INFO L93 Difference]: Finished difference Result 1929 states and 2855 transitions. [2019-09-16 17:06:58,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:58,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-09-16 17:06:58,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:59,000 INFO L225 Difference]: With dead ends: 1929 [2019-09-16 17:06:59,000 INFO L226 Difference]: Without dead ends: 1929 [2019-09-16 17:06:59,001 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-16 17:06:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2019-09-16 17:06:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1824. [2019-09-16 17:06:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-16 17:06:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2716 transitions. [2019-09-16 17:06:59,019 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2716 transitions. Word has length 181 [2019-09-16 17:06:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:59,019 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2716 transitions. [2019-09-16 17:06:59,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2716 transitions. [2019-09-16 17:06:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-16 17:06:59,021 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:59,021 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:59,021 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:59,022 INFO L82 PathProgramCache]: Analyzing trace with hash 940953982, now seen corresponding path program 1 times [2019-09-16 17:06:59,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:59,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:59,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:59,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:59,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:06:59,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:59,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:59,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:59,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:59,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:59,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:59,207 INFO L87 Difference]: Start difference. First operand 1824 states and 2716 transitions. Second operand 4 states. [2019-09-16 17:06:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:59,600 INFO L93 Difference]: Finished difference Result 1997 states and 2935 transitions. [2019-09-16 17:06:59,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:59,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-09-16 17:06:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:59,602 INFO L225 Difference]: With dead ends: 1997 [2019-09-16 17:06:59,603 INFO L226 Difference]: Without dead ends: 1997 [2019-09-16 17:06:59,603 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-16 17:06:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-09-16 17:06:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1824. [2019-09-16 17:06:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-09-16 17:06:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2712 transitions. [2019-09-16 17:06:59,616 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2712 transitions. Word has length 183 [2019-09-16 17:06:59,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:59,616 INFO L475 AbstractCegarLoop]: Abstraction has 1824 states and 2712 transitions. [2019-09-16 17:06:59,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2712 transitions. [2019-09-16 17:06:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-16 17:06:59,617 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:59,617 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:59,618 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:59,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721285, now seen corresponding path program 1 times [2019-09-16 17:06:59,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:59,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:59,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-16 17:06:59,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:59,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:06:59,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:59,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:06:59,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:06:59,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:59,740 INFO L87 Difference]: Start difference. First operand 1824 states and 2712 transitions. Second operand 5 states. [2019-09-16 17:07:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:07:00,198 INFO L93 Difference]: Finished difference Result 2278 states and 3395 transitions. [2019-09-16 17:07:00,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:07:00,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2019-09-16 17:07:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:07:00,202 INFO L225 Difference]: With dead ends: 2278 [2019-09-16 17:07:00,202 INFO L226 Difference]: Without dead ends: 2278 [2019-09-16 17:07:00,202 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:07:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-09-16 17:07:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1983. [2019-09-16 17:07:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2019-09-16 17:07:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2999 transitions. [2019-09-16 17:07:00,217 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2999 transitions. Word has length 184 [2019-09-16 17:07:00,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:07:00,218 INFO L475 AbstractCegarLoop]: Abstraction has 1983 states and 2999 transitions. [2019-09-16 17:07:00,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:07:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2999 transitions. [2019-09-16 17:07:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-16 17:07:00,219 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:07:00,219 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:07:00,220 INFO L418 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:07:00,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:07:00,220 INFO L82 PathProgramCache]: Analyzing trace with hash -805780807, now seen corresponding path program 1 times [2019-09-16 17:07:00,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:07:00,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:00,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:07:00,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:00,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:07:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:07:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-16 17:07:00,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:07:00,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:07:00,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:07:00,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:07:00,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:07:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:07:00,345 INFO L87 Difference]: Start difference. First operand 1983 states and 2999 transitions. Second operand 5 states. [2019-09-16 17:07:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:07:00,825 INFO L93 Difference]: Finished difference Result 2390 states and 3615 transitions. [2019-09-16 17:07:00,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:07:00,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2019-09-16 17:07:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:07:00,828 INFO L225 Difference]: With dead ends: 2390 [2019-09-16 17:07:00,828 INFO L226 Difference]: Without dead ends: 2390 [2019-09-16 17:07:00,829 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:07:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2019-09-16 17:07:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2091. [2019-09-16 17:07:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2019-09-16 17:07:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3219 transitions. [2019-09-16 17:07:00,845 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 3219 transitions. Word has length 185 [2019-09-16 17:07:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:07:00,846 INFO L475 AbstractCegarLoop]: Abstraction has 2091 states and 3219 transitions. [2019-09-16 17:07:00,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:07:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3219 transitions. [2019-09-16 17:07:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-16 17:07:00,847 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:07:00,847 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:07:00,848 INFO L418 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:07:00,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:07:00,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1186104476, now seen corresponding path program 1 times [2019-09-16 17:07:00,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:07:00,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:00,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:07:00,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:07:00,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:07:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:07:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-16 17:07:01,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:07:01,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:07:01,592 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2019-09-16 17:07:01,595 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [146], [148], [153], [156], [158], [163], [166], [168], [173], [178], [183], [186], [188], [193], [198], [203], [208], [213], [218], [221], [312], [315], [323], [325], [328], [336], [341], [343], [345], [348], [357], [359], [362], [366], [369], [398], [403], [413], [415], [418], [429], [431], [441], [443], [448], [470], [472], [506], [511], [516], [521], [628], [662], [664], [676], [679], [680], [692], [700], [701], [702] [2019-09-16 17:07:01,666 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:07:01,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:07:01,730 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:07:01,732 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-16 17:07:01,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:07:01,735 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:07:01,797 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:07:01,797 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:07:01,802 INFO L420 sIntCurrentIteration]: We unified 196 AI predicates to 196 [2019-09-16 17:07:01,803 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:07:01,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:07:01,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-16 17:07:01,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:07:01,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:07:01,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:07:01,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:07:01,805 INFO L87 Difference]: Start difference. First operand 2091 states and 3219 transitions. Second operand 2 states. [2019-09-16 17:07:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:07:01,806 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:07:01,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:07:01,806 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 197 [2019-09-16 17:07:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:07:01,807 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:07:01,807 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:07:01,807 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:07:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:07:01,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:07:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:07:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:07:01,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 197 [2019-09-16 17:07:01,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:07:01,808 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:07:01,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:07:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:07:01,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:07:01,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:07:01 BoogieIcfgContainer [2019-09-16 17:07:01,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:07:01,818 INFO L168 Benchmark]: Toolchain (without parser) took 57327.96 ms. Allocated memory was 138.9 MB in the beginning and 790.6 MB in the end (delta: 651.7 MB). Free memory was 84.5 MB in the beginning and 717.1 MB in the end (delta: -632.5 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:07:01,818 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:07:01,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 952.20 ms. Allocated memory was 138.9 MB in the beginning and 199.2 MB in the end (delta: 60.3 MB). Free memory was 84.1 MB in the beginning and 155.4 MB in the end (delta: -71.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:07:01,819 INFO L168 Benchmark]: Boogie Preprocessor took 162.10 ms. Allocated memory is still 199.2 MB. Free memory was 155.4 MB in the beginning and 147.7 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:07:01,820 INFO L168 Benchmark]: RCFGBuilder took 1837.08 ms. Allocated memory was 199.2 MB in the beginning and 222.3 MB in the end (delta: 23.1 MB). Free memory was 147.7 MB in the beginning and 164.0 MB in the end (delta: -16.3 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:07:01,820 INFO L168 Benchmark]: TraceAbstraction took 54369.00 ms. Allocated memory was 222.3 MB in the beginning and 790.6 MB in the end (delta: 568.3 MB). Free memory was 164.0 MB in the beginning and 717.1 MB in the end (delta: -553.1 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:07:01,829 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 952.20 ms. Allocated memory was 138.9 MB in the beginning and 199.2 MB in the end (delta: 60.3 MB). Free memory was 84.1 MB in the beginning and 155.4 MB in the end (delta: -71.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 162.10 ms. Allocated memory is still 199.2 MB. Free memory was 155.4 MB in the beginning and 147.7 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1837.08 ms. Allocated memory was 199.2 MB in the beginning and 222.3 MB in the end (delta: 23.1 MB). Free memory was 147.7 MB in the beginning and 164.0 MB in the end (delta: -16.3 MB). Peak memory consumption was 82.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54369.00 ms. Allocated memory was 222.3 MB in the beginning and 790.6 MB in the end (delta: 568.3 MB). Free memory was 164.0 MB in the beginning and 717.1 MB in the end (delta: -553.1 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1735]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 189 locations, 1 error locations. SAFE Result, 54.2s OverallTime, 120 OverallIterations, 7 TraceHistogramMax, 41.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27608 SDtfs, 8205 SDslu, 40108 SDs, 0 SdLazy, 24223 SolverSat, 1103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 442 SyntacticMatches, 46 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2091occurred in iteration=119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.413265306122449 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 120 MinimizatonAttempts, 5415 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 15635 NumberOfCodeBlocks, 15635 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 15515 ConstructedInterpolants, 0 QuantifiedInterpolants, 5841915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 120 InterpolantComputations, 119 PerfectInterpolantSequences, 16461/16670 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...