java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.16.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:06:12,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:06:12,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:06:12,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:06:12,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:06:12,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:06:12,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:06:12,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:06:12,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:06:12,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:06:12,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:06:12,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:06:12,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:06:12,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:06:12,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:06:12,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:06:12,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:06:12,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:06:12,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:06:12,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:06:12,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:06:12,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:06:12,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:06:12,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:06:12,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:06:12,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:06:12,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:06:12,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:06:12,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:06:12,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:06:12,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:06:12,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:06:12,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:06:12,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:06:12,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:06:12,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:06:12,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:06:12,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:06:12,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:06:12,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:06:12,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:06:12,461 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:12,484 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:06:12,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:06:12,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:06:12,486 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:06:12,486 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:06:12,487 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:06:12,487 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:06:12,487 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:06:12,487 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:06:12,487 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:06:12,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:06:12,488 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:06:12,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:06:12,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:06:12,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:06:12,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:06:12,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:06:12,489 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:06:12,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:06:12,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:06:12,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:06:12,490 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:06:12,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:06:12,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:06:12,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:06:12,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:06:12,491 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:06:12,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:06:12,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:06:12,492 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:06:12,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:06:12,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:06:12,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:06:12,540 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:06:12,541 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:06:12,541 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.16.i.cil-2.c [2019-09-16 17:06:12,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0a568d7/1ea94136187c4999a0e0920af0e16ef7/FLAG9909e60fe [2019-09-16 17:06:13,153 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:06:13,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.16.i.cil-2.c [2019-09-16 17:06:13,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0a568d7/1ea94136187c4999a0e0920af0e16ef7/FLAG9909e60fe [2019-09-16 17:06:13,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0a568d7/1ea94136187c4999a0e0920af0e16ef7 [2019-09-16 17:06:13,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:06:13,438 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:06:13,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:06:13,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:06:13,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:06:13,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:06:13" (1/1) ... [2019-09-16 17:06:13,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ad117e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:13, skipping insertion in model container [2019-09-16 17:06:13,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:06:13" (1/1) ... [2019-09-16 17:06:13,454 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:06:13,525 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:06:14,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:06:14,232 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:06:14,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:06:14,435 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:06:14,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:14 WrapperNode [2019-09-16 17:06:14,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:06:14,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:06:14,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:06:14,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:06:14,451 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:14" (1/1) ... [2019-09-16 17:06:14,453 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:14" (1/1) ... [2019-09-16 17:06:14,490 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:14" (1/1) ... [2019-09-16 17:06:14,490 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:14" (1/1) ... [2019-09-16 17:06:14,572 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:14" (1/1) ... [2019-09-16 17:06:14,589 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:14" (1/1) ... [2019-09-16 17:06:14,595 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:14" (1/1) ... [2019-09-16 17:06:14,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:06:14,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:06:14,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:06:14,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:06:14,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:06:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:06:14,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:06:14,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-16 17:06:14,688 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-16 17:06:14,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:06:14,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-16 17:06:14,689 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:06:14,689 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:06:14,690 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:06:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:06:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:06:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:06:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:06:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:06:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:06:14,694 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:06:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-16 17:06:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:06:14,695 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-16 17:06:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-16 17:06:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:06:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:06:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:06:14,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:06:14,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:06:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:06:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:06:14,698 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:06:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:06:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:06:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:06:14,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:06:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:06:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:06:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:06:14,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:06:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:06:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:06:14,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:06:15,322 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:06:16,097 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-16 17:06:16,098 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-16 17:06:16,117 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:06:16,117 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:06:16,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:06:16 BoogieIcfgContainer [2019-09-16 17:06:16,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:06:16,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:06:16,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:06:16,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:06:16,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:06:13" (1/3) ... [2019-09-16 17:06:16,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41963ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:06:16, skipping insertion in model container [2019-09-16 17:06:16,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:06:14" (2/3) ... [2019-09-16 17:06:16,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41963ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:06:16, skipping insertion in model container [2019-09-16 17:06:16,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:06:16" (3/3) ... [2019-09-16 17:06:16,127 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-2.c [2019-09-16 17:06:16,136 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:06:16,146 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:06:16,163 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:06:16,193 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:06:16,193 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:06:16,194 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:06:16,194 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:06:16,194 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:06:16,194 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:06:16,194 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:06:16,194 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:06:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-09-16 17:06:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-16 17:06:16,238 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:16,239 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:16,241 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:16,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:16,247 INFO L82 PathProgramCache]: Analyzing trace with hash -779464605, now seen corresponding path program 1 times [2019-09-16 17:06:16,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:16,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:16,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:16,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:16,630 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:16,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:16,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:16,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:16,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:16,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:16,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:16,657 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 4 states. [2019-09-16 17:06:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,080 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2019-09-16 17:06:17,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-16 17:06:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,095 INFO L225 Difference]: With dead ends: 199 [2019-09-16 17:06:17,095 INFO L226 Difference]: Without dead ends: 178 [2019-09-16 17:06:17,097 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,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-16 17:06:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 161. [2019-09-16 17:06:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-16 17:06:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 250 transitions. [2019-09-16 17:06:17,146 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 250 transitions. Word has length 50 [2019-09-16 17:06:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,147 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 250 transitions. [2019-09-16 17:06:17,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 250 transitions. [2019-09-16 17:06:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:06:17,150 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,150 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:17,151 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash 347342234, now seen corresponding path program 1 times [2019-09-16 17:06:17,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,284 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:17,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:17,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:17,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:17,288 INFO L87 Difference]: Start difference. First operand 161 states and 250 transitions. Second operand 4 states. [2019-09-16 17:06:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:17,664 INFO L93 Difference]: Finished difference Result 178 states and 270 transitions. [2019-09-16 17:06:17,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:17,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:06:17,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:17,668 INFO L225 Difference]: With dead ends: 178 [2019-09-16 17:06:17,668 INFO L226 Difference]: Without dead ends: 178 [2019-09-16 17:06:17,669 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,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-16 17:06:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 161. [2019-09-16 17:06:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-16 17:06:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 249 transitions. [2019-09-16 17:06:17,681 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 249 transitions. Word has length 63 [2019-09-16 17:06:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:17,682 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 249 transitions. [2019-09-16 17:06:17,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 249 transitions. [2019-09-16 17:06:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:06:17,685 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:17,685 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:17,685 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:17,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1036215606, now seen corresponding path program 1 times [2019-09-16 17:06:17,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:17,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:17,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:17,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:17,815 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:17,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:17,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:17,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:17,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:17,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:17,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:17,818 INFO L87 Difference]: Start difference. First operand 161 states and 249 transitions. Second operand 4 states. [2019-09-16 17:06:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,098 INFO L93 Difference]: Finished difference Result 177 states and 268 transitions. [2019-09-16 17:06:18,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:18,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:06:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,100 INFO L225 Difference]: With dead ends: 177 [2019-09-16 17:06:18,100 INFO L226 Difference]: Without dead ends: 177 [2019-09-16 17:06:18,100 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,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-16 17:06:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 161. [2019-09-16 17:06:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-16 17:06:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 248 transitions. [2019-09-16 17:06:18,110 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 248 transitions. Word has length 64 [2019-09-16 17:06:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,110 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 248 transitions. [2019-09-16 17:06:18,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2019-09-16 17:06:18,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:06:18,113 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:18,113 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:18,114 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:18,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:18,114 INFO L82 PathProgramCache]: Analyzing trace with hash -599319774, now seen corresponding path program 1 times [2019-09-16 17:06:18,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:18,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:18,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,231 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:18,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:06:18,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:06:18,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:06:18,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:18,233 INFO L87 Difference]: Start difference. First operand 161 states and 248 transitions. Second operand 5 states. [2019-09-16 17:06:18,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:18,691 INFO L93 Difference]: Finished difference Result 182 states and 276 transitions. [2019-09-16 17:06:18,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:06:18,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-16 17:06:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:18,698 INFO L225 Difference]: With dead ends: 182 [2019-09-16 17:06:18,698 INFO L226 Difference]: Without dead ends: 182 [2019-09-16 17:06:18,699 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:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-16 17:06:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-16 17:06:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-16 17:06:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 275 transitions. [2019-09-16 17:06:18,709 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 275 transitions. Word has length 64 [2019-09-16 17:06:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:18,709 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 275 transitions. [2019-09-16 17:06:18,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:06:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 275 transitions. [2019-09-16 17:06:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:06:18,711 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:18,711 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:18,711 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:18,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1700513898, now seen corresponding path program 1 times [2019-09-16 17:06:18,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:18,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:18,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:18,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:18,835 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:18,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:18,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:18,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:18,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:18,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:18,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:18,839 INFO L87 Difference]: Start difference. First operand 181 states and 275 transitions. Second operand 4 states. [2019-09-16 17:06:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,096 INFO L93 Difference]: Finished difference Result 196 states and 292 transitions. [2019-09-16 17:06:19,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:06:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,099 INFO L225 Difference]: With dead ends: 196 [2019-09-16 17:06:19,100 INFO L226 Difference]: Without dead ends: 196 [2019-09-16 17:06:19,100 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,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-16 17:06:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 181. [2019-09-16 17:06:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-16 17:06:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 274 transitions. [2019-09-16 17:06:19,108 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 274 transitions. Word has length 64 [2019-09-16 17:06:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,108 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 274 transitions. [2019-09-16 17:06:19,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 274 transitions. [2019-09-16 17:06:19,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:06:19,110 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,110 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,110 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,111 INFO L82 PathProgramCache]: Analyzing trace with hash -393846133, now seen corresponding path program 1 times [2019-09-16 17:06:19,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,198 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:19,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,202 INFO L87 Difference]: Start difference. First operand 181 states and 274 transitions. Second operand 4 states. [2019-09-16 17:06:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,475 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2019-09-16 17:06:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:06:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,477 INFO L225 Difference]: With dead ends: 194 [2019-09-16 17:06:19,477 INFO L226 Difference]: Without dead ends: 194 [2019-09-16 17:06:19,478 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,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-16 17:06:19,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-09-16 17:06:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-16 17:06:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 273 transitions. [2019-09-16 17:06:19,484 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 273 transitions. Word has length 64 [2019-09-16 17:06:19,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,485 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 273 transitions. [2019-09-16 17:06:19,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 273 transitions. [2019-09-16 17:06:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:06:19,487 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,487 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,488 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash -242998339, now seen corresponding path program 1 times [2019-09-16 17:06:19,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,580 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:19,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,583 INFO L87 Difference]: Start difference. First operand 181 states and 273 transitions. Second operand 4 states. [2019-09-16 17:06:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:19,867 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2019-09-16 17:06:19,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:19,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-16 17:06:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:19,870 INFO L225 Difference]: With dead ends: 194 [2019-09-16 17:06:19,870 INFO L226 Difference]: Without dead ends: 194 [2019-09-16 17:06:19,870 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,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-16 17:06:19,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-09-16 17:06:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-16 17:06:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 272 transitions. [2019-09-16 17:06:19,879 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 272 transitions. Word has length 65 [2019-09-16 17:06:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:19,879 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 272 transitions. [2019-09-16 17:06:19,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 272 transitions. [2019-09-16 17:06:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-16 17:06:19,881 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:19,881 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:19,881 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:19,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:19,882 INFO L82 PathProgramCache]: Analyzing trace with hash 157388590, now seen corresponding path program 1 times [2019-09-16 17:06:19,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:19,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:19,956 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:19,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:19,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:19,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:19,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:19,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:19,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:19,960 INFO L87 Difference]: Start difference. First operand 181 states and 272 transitions. Second operand 4 states. [2019-09-16 17:06:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,236 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2019-09-16 17:06:20,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-16 17:06:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,238 INFO L225 Difference]: With dead ends: 194 [2019-09-16 17:06:20,239 INFO L226 Difference]: Without dead ends: 194 [2019-09-16 17:06:20,239 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,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-16 17:06:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-09-16 17:06:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-16 17:06:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2019-09-16 17:06:20,244 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 66 [2019-09-16 17:06:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,245 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2019-09-16 17:06:20,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2019-09-16 17:06:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-16 17:06:20,246 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,246 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,246 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -354315294, now seen corresponding path program 1 times [2019-09-16 17:06:20,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,300 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:20,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:20,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:20,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:20,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,302 INFO L87 Difference]: Start difference. First operand 181 states and 271 transitions. Second operand 4 states. [2019-09-16 17:06:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,543 INFO L93 Difference]: Finished difference Result 194 states and 286 transitions. [2019-09-16 17:06:20,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-16 17:06:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,545 INFO L225 Difference]: With dead ends: 194 [2019-09-16 17:06:20,546 INFO L226 Difference]: Without dead ends: 194 [2019-09-16 17:06:20,546 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,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-16 17:06:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2019-09-16 17:06:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-16 17:06:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 270 transitions. [2019-09-16 17:06:20,551 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 270 transitions. Word has length 67 [2019-09-16 17:06:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,551 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 270 transitions. [2019-09-16 17:06:20,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2019-09-16 17:06:20,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-16 17:06:20,552 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,553 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,553 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1474578787, now seen corresponding path program 1 times [2019-09-16 17:06:20,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,605 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:20,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:20,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:20,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:20,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,607 INFO L87 Difference]: Start difference. First operand 181 states and 270 transitions. Second operand 4 states. [2019-09-16 17:06:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:20,872 INFO L93 Difference]: Finished difference Result 223 states and 332 transitions. [2019-09-16 17:06:20,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:20,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-16 17:06:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:20,875 INFO L225 Difference]: With dead ends: 223 [2019-09-16 17:06:20,875 INFO L226 Difference]: Without dead ends: 223 [2019-09-16 17:06:20,875 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:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-16 17:06:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2019-09-16 17:06:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-16 17:06:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 307 transitions. [2019-09-16 17:06:20,882 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 307 transitions. Word has length 67 [2019-09-16 17:06:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:20,883 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 307 transitions. [2019-09-16 17:06:20,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 307 transitions. [2019-09-16 17:06:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-16 17:06:20,884 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:20,884 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:20,884 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:20,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:20,885 INFO L82 PathProgramCache]: Analyzing trace with hash 923936691, now seen corresponding path program 1 times [2019-09-16 17:06:20,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:20,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:20,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:20,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:20,940 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:20,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:20,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:20,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:20,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:20,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:20,942 INFO L87 Difference]: Start difference. First operand 203 states and 307 transitions. Second operand 4 states. [2019-09-16 17:06:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,159 INFO L93 Difference]: Finished difference Result 206 states and 310 transitions. [2019-09-16 17:06:21,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-16 17:06:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,162 INFO L225 Difference]: With dead ends: 206 [2019-09-16 17:06:21,162 INFO L226 Difference]: Without dead ends: 206 [2019-09-16 17:06:21,162 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:06:21,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-16 17:06:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2019-09-16 17:06:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-16 17:06:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 306 transitions. [2019-09-16 17:06:21,169 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 306 transitions. Word has length 68 [2019-09-16 17:06:21,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,169 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 306 transitions. [2019-09-16 17:06:21,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 306 transitions. [2019-09-16 17:06:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:06:21,170 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,170 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,171 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,171 INFO L82 PathProgramCache]: Analyzing trace with hash 538356890, now seen corresponding path program 1 times [2019-09-16 17:06:21,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,232 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:21,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,234 INFO L87 Difference]: Start difference. First operand 203 states and 306 transitions. Second operand 4 states. [2019-09-16 17:06:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,506 INFO L93 Difference]: Finished difference Result 223 states and 330 transitions. [2019-09-16 17:06:21,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:06:21,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,508 INFO L225 Difference]: With dead ends: 223 [2019-09-16 17:06:21,508 INFO L226 Difference]: Without dead ends: 223 [2019-09-16 17:06:21,509 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:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-16 17:06:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 203. [2019-09-16 17:06:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-16 17:06:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 305 transitions. [2019-09-16 17:06:21,533 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 305 transitions. Word has length 80 [2019-09-16 17:06:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,533 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 305 transitions. [2019-09-16 17:06:21,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,533 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 305 transitions. [2019-09-16 17:06:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:06:21,534 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,534 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,535 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,535 INFO L82 PathProgramCache]: Analyzing trace with hash -967966358, now seen corresponding path program 1 times [2019-09-16 17:06:21,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,619 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:21,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,621 INFO L87 Difference]: Start difference. First operand 203 states and 305 transitions. Second operand 4 states. [2019-09-16 17:06:21,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:21,885 INFO L93 Difference]: Finished difference Result 222 states and 328 transitions. [2019-09-16 17:06:21,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:21,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:06:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:21,887 INFO L225 Difference]: With dead ends: 222 [2019-09-16 17:06:21,888 INFO L226 Difference]: Without dead ends: 222 [2019-09-16 17:06:21,888 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:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-16 17:06:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 203. [2019-09-16 17:06:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-16 17:06:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 304 transitions. [2019-09-16 17:06:21,893 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 304 transitions. Word has length 81 [2019-09-16 17:06:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:21,894 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 304 transitions. [2019-09-16 17:06:21,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 304 transitions. [2019-09-16 17:06:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:06:21,895 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:21,895 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:21,895 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:21,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:21,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1232640907, now seen corresponding path program 1 times [2019-09-16 17:06:21,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:21,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:21,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:21,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:21,947 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:21,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:21,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:21,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:21,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:21,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:21,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:21,948 INFO L87 Difference]: Start difference. First operand 203 states and 304 transitions. Second operand 4 states. [2019-09-16 17:06:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,186 INFO L93 Difference]: Finished difference Result 220 states and 325 transitions. [2019-09-16 17:06:22,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:06:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,188 INFO L225 Difference]: With dead ends: 220 [2019-09-16 17:06:22,189 INFO L226 Difference]: Without dead ends: 220 [2019-09-16 17:06:22,189 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:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-16 17:06:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2019-09-16 17:06:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-16 17:06:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 303 transitions. [2019-09-16 17:06:22,194 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 303 transitions. Word has length 81 [2019-09-16 17:06:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,195 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 303 transitions. [2019-09-16 17:06:22,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 303 transitions. [2019-09-16 17:06:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-16 17:06:22,196 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,196 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:22,196 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1361507651, now seen corresponding path program 1 times [2019-09-16 17:06:22,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,261 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:22,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,263 INFO L87 Difference]: Start difference. First operand 203 states and 303 transitions. Second operand 4 states. [2019-09-16 17:06:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,502 INFO L93 Difference]: Finished difference Result 220 states and 324 transitions. [2019-09-16 17:06:22,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-16 17:06:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,504 INFO L225 Difference]: With dead ends: 220 [2019-09-16 17:06:22,504 INFO L226 Difference]: Without dead ends: 220 [2019-09-16 17:06:22,505 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:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-16 17:06:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2019-09-16 17:06:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-16 17:06:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 302 transitions. [2019-09-16 17:06:22,510 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 302 transitions. Word has length 82 [2019-09-16 17:06:22,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,511 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 302 transitions. [2019-09-16 17:06:22,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,511 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 302 transitions. [2019-09-16 17:06:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:06:22,512 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,512 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:22,512 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,513 INFO L82 PathProgramCache]: Analyzing trace with hash -156661714, now seen corresponding path program 1 times [2019-09-16 17:06:22,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,570 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:22,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,572 INFO L87 Difference]: Start difference. First operand 203 states and 302 transitions. Second operand 4 states. [2019-09-16 17:06:22,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:22,825 INFO L93 Difference]: Finished difference Result 220 states and 323 transitions. [2019-09-16 17:06:22,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:22,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-16 17:06:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:22,827 INFO L225 Difference]: With dead ends: 220 [2019-09-16 17:06:22,827 INFO L226 Difference]: Without dead ends: 220 [2019-09-16 17:06:22,827 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:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-16 17:06:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2019-09-16 17:06:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-16 17:06:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 301 transitions. [2019-09-16 17:06:22,832 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 301 transitions. Word has length 83 [2019-09-16 17:06:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:22,833 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 301 transitions. [2019-09-16 17:06:22,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 301 transitions. [2019-09-16 17:06:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-16 17:06:22,834 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:22,834 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:22,835 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:22,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1499940126, now seen corresponding path program 1 times [2019-09-16 17:06:22,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:22,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:22,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:22,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:22,910 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:22,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:22,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:22,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:22,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:22,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:22,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:22,912 INFO L87 Difference]: Start difference. First operand 203 states and 301 transitions. Second operand 4 states. [2019-09-16 17:06:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:23,189 INFO L93 Difference]: Finished difference Result 220 states and 322 transitions. [2019-09-16 17:06:23,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:23,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-16 17:06:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:23,192 INFO L225 Difference]: With dead ends: 220 [2019-09-16 17:06:23,192 INFO L226 Difference]: Without dead ends: 220 [2019-09-16 17:06:23,193 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:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-16 17:06:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2019-09-16 17:06:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-16 17:06:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 300 transitions. [2019-09-16 17:06:23,201 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 300 transitions. Word has length 84 [2019-09-16 17:06:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:23,202 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 300 transitions. [2019-09-16 17:06:23,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:23,202 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 300 transitions. [2019-09-16 17:06:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-16 17:06:23,204 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:23,204 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:23,204 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:23,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:23,205 INFO L82 PathProgramCache]: Analyzing trace with hash -230694733, now seen corresponding path program 1 times [2019-09-16 17:06:23,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:23,292 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:23,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:23,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:23,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:23,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:23,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:23,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:23,295 INFO L87 Difference]: Start difference. First operand 203 states and 300 transitions. Second operand 4 states. [2019-09-16 17:06:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:23,706 INFO L93 Difference]: Finished difference Result 210 states and 309 transitions. [2019-09-16 17:06:23,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:23,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-16 17:06:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:23,708 INFO L225 Difference]: With dead ends: 210 [2019-09-16 17:06:23,708 INFO L226 Difference]: Without dead ends: 210 [2019-09-16 17:06:23,708 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:23,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-16 17:06:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2019-09-16 17:06:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-16 17:06:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 299 transitions. [2019-09-16 17:06:23,713 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 299 transitions. Word has length 85 [2019-09-16 17:06:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:23,714 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 299 transitions. [2019-09-16 17:06:23,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 299 transitions. [2019-09-16 17:06:23,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-16 17:06:23,715 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:23,716 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:23,716 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:23,716 INFO L82 PathProgramCache]: Analyzing trace with hash -851043621, now seen corresponding path program 1 times [2019-09-16 17:06:23,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:23,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:23,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:23,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:23,787 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:23,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:23,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:23,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:23,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:23,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:23,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:23,789 INFO L87 Difference]: Start difference. First operand 203 states and 299 transitions. Second operand 4 states. [2019-09-16 17:06:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,186 INFO L93 Difference]: Finished difference Result 316 states and 474 transitions. [2019-09-16 17:06:24,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-16 17:06:24,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,189 INFO L225 Difference]: With dead ends: 316 [2019-09-16 17:06:24,189 INFO L226 Difference]: Without dead ends: 316 [2019-09-16 17:06:24,189 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,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-16 17:06:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 244. [2019-09-16 17:06:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-09-16 17:06:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 372 transitions. [2019-09-16 17:06:24,196 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 372 transitions. Word has length 89 [2019-09-16 17:06:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,196 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 372 transitions. [2019-09-16 17:06:24,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 372 transitions. [2019-09-16 17:06:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-16 17:06:24,198 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,198 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:24,198 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,199 INFO L82 PathProgramCache]: Analyzing trace with hash -602897127, now seen corresponding path program 1 times [2019-09-16 17:06:24,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:24,270 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:24,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:24,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:24,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:24,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:24,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:24,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:24,272 INFO L87 Difference]: Start difference. First operand 244 states and 372 transitions. Second operand 4 states. [2019-09-16 17:06:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:24,652 INFO L93 Difference]: Finished difference Result 293 states and 445 transitions. [2019-09-16 17:06:24,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:24,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-16 17:06:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:24,655 INFO L225 Difference]: With dead ends: 293 [2019-09-16 17:06:24,655 INFO L226 Difference]: Without dead ends: 293 [2019-09-16 17:06:24,656 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,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-16 17:06:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2019-09-16 17:06:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-16 17:06:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 413 transitions. [2019-09-16 17:06:24,666 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 413 transitions. Word has length 89 [2019-09-16 17:06:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:24,666 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 413 transitions. [2019-09-16 17:06:24,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2019-09-16 17:06:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-16 17:06:24,669 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:24,669 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:24,669 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:24,670 INFO L82 PathProgramCache]: Analyzing trace with hash 416809407, now seen corresponding path program 1 times [2019-09-16 17:06:24,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:24,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:24,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:24,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:24,844 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:24,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:24,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:24,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:24,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:24,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:24,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:24,845 INFO L87 Difference]: Start difference. First operand 268 states and 413 transitions. Second operand 4 states. [2019-09-16 17:06:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:25,229 INFO L93 Difference]: Finished difference Result 331 states and 501 transitions. [2019-09-16 17:06:25,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:25,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-16 17:06:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:25,232 INFO L225 Difference]: With dead ends: 331 [2019-09-16 17:06:25,232 INFO L226 Difference]: Without dead ends: 331 [2019-09-16 17:06:25,233 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,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-16 17:06:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 269. [2019-09-16 17:06:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 414 transitions. [2019-09-16 17:06:25,242 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 414 transitions. Word has length 90 [2019-09-16 17:06:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:25,242 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 414 transitions. [2019-09-16 17:06:25,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 414 transitions. [2019-09-16 17:06:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:25,244 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:25,244 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:25,244 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:25,245 INFO L82 PathProgramCache]: Analyzing trace with hash 568786466, now seen corresponding path program 1 times [2019-09-16 17:06:25,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:25,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:25,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:25,326 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:25,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:25,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:25,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:25,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:25,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:25,328 INFO L87 Difference]: Start difference. First operand 269 states and 414 transitions. Second operand 4 states. [2019-09-16 17:06:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:25,697 INFO L93 Difference]: Finished difference Result 331 states and 500 transitions. [2019-09-16 17:06:25,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:25,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:25,700 INFO L225 Difference]: With dead ends: 331 [2019-09-16 17:06:25,700 INFO L226 Difference]: Without dead ends: 331 [2019-09-16 17:06:25,700 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,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-16 17:06:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 269. [2019-09-16 17:06:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 413 transitions. [2019-09-16 17:06:25,707 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 413 transitions. Word has length 102 [2019-09-16 17:06:25,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:25,707 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 413 transitions. [2019-09-16 17:06:25,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 413 transitions. [2019-09-16 17:06:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:06:25,709 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:25,709 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:25,709 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:25,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:25,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1955571876, now seen corresponding path program 1 times [2019-09-16 17:06:25,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:25,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:25,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:25,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:25,771 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:25,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:25,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:25,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:25,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:25,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:25,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:25,773 INFO L87 Difference]: Start difference. First operand 269 states and 413 transitions. Second operand 4 states. [2019-09-16 17:06:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:26,150 INFO L93 Difference]: Finished difference Result 294 states and 444 transitions. [2019-09-16 17:06:26,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:26,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-16 17:06:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:26,153 INFO L225 Difference]: With dead ends: 294 [2019-09-16 17:06:26,153 INFO L226 Difference]: Without dead ends: 294 [2019-09-16 17:06:26,154 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,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-16 17:06:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 269. [2019-09-16 17:06:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 412 transitions. [2019-09-16 17:06:26,160 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 412 transitions. Word has length 102 [2019-09-16 17:06:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:26,161 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 412 transitions. [2019-09-16 17:06:26,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 412 transitions. [2019-09-16 17:06:26,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:06:26,163 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:26,164 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:26,164 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:26,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:26,164 INFO L82 PathProgramCache]: Analyzing trace with hash -24649502, now seen corresponding path program 1 times [2019-09-16 17:06:26,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:26,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:26,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:26,250 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:26,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:26,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:26,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:26,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:26,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:26,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:26,253 INFO L87 Difference]: Start difference. First operand 269 states and 412 transitions. Second operand 4 states. [2019-09-16 17:06:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:26,635 INFO L93 Difference]: Finished difference Result 330 states and 497 transitions. [2019-09-16 17:06:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:26,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:06:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:26,637 INFO L225 Difference]: With dead ends: 330 [2019-09-16 17:06:26,638 INFO L226 Difference]: Without dead ends: 330 [2019-09-16 17:06:26,638 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,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-16 17:06:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 269. [2019-09-16 17:06:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 411 transitions. [2019-09-16 17:06:26,644 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 411 transitions. Word has length 103 [2019-09-16 17:06:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:26,645 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 411 transitions. [2019-09-16 17:06:26,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 411 transitions. [2019-09-16 17:06:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:06:26,646 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:26,646 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:26,647 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:26,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:26,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2119009533, now seen corresponding path program 1 times [2019-09-16 17:06:26,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:26,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:26,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:26,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:26,743 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:26,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:26,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:26,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:26,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:26,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:26,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:26,744 INFO L87 Difference]: Start difference. First operand 269 states and 411 transitions. Second operand 4 states. [2019-09-16 17:06:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:27,115 INFO L93 Difference]: Finished difference Result 328 states and 494 transitions. [2019-09-16 17:06:27,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:27,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:06:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:27,118 INFO L225 Difference]: With dead ends: 328 [2019-09-16 17:06:27,118 INFO L226 Difference]: Without dead ends: 328 [2019-09-16 17:06:27,119 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,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-16 17:06:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2019-09-16 17:06:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 410 transitions. [2019-09-16 17:06:27,125 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 410 transitions. Word has length 103 [2019-09-16 17:06:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:27,125 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 410 transitions. [2019-09-16 17:06:27,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 410 transitions. [2019-09-16 17:06:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:06:27,127 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:27,127 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:27,127 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:27,127 INFO L82 PathProgramCache]: Analyzing trace with hash 16025248, now seen corresponding path program 1 times [2019-09-16 17:06:27,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:27,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:27,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:27,199 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:27,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:27,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:27,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:27,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:27,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:27,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:27,200 INFO L87 Difference]: Start difference. First operand 269 states and 410 transitions. Second operand 4 states. [2019-09-16 17:06:27,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:27,535 INFO L93 Difference]: Finished difference Result 293 states and 440 transitions. [2019-09-16 17:06:27,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:27,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:06:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:27,539 INFO L225 Difference]: With dead ends: 293 [2019-09-16 17:06:27,539 INFO L226 Difference]: Without dead ends: 293 [2019-09-16 17:06:27,539 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,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-16 17:06:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 269. [2019-09-16 17:06:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 409 transitions. [2019-09-16 17:06:27,547 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 409 transitions. Word has length 103 [2019-09-16 17:06:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:27,547 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 409 transitions. [2019-09-16 17:06:27,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 409 transitions. [2019-09-16 17:06:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:06:27,550 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:27,550 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:27,551 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:27,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2078334783, now seen corresponding path program 1 times [2019-09-16 17:06:27,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:27,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:27,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:27,635 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:27,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:27,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:27,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:27,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:27,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:27,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:27,637 INFO L87 Difference]: Start difference. First operand 269 states and 409 transitions. Second operand 4 states. [2019-09-16 17:06:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:27,899 INFO L93 Difference]: Finished difference Result 291 states and 437 transitions. [2019-09-16 17:06:27,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:27,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-16 17:06:27,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:27,902 INFO L225 Difference]: With dead ends: 291 [2019-09-16 17:06:27,902 INFO L226 Difference]: Without dead ends: 291 [2019-09-16 17:06:27,902 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,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-16 17:06:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 269. [2019-09-16 17:06:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 408 transitions. [2019-09-16 17:06:27,909 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 408 transitions. Word has length 103 [2019-09-16 17:06:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:27,909 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 408 transitions. [2019-09-16 17:06:27,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 408 transitions. [2019-09-16 17:06:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:06:27,911 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:27,911 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:27,911 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:27,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2111511109, now seen corresponding path program 1 times [2019-09-16 17:06:27,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:27,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:27,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:27,968 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:27,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:27,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:27,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:27,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:27,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:27,970 INFO L87 Difference]: Start difference. First operand 269 states and 408 transitions. Second operand 4 states. [2019-09-16 17:06:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,335 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2019-09-16 17:06:28,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:28,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:06:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,338 INFO L225 Difference]: With dead ends: 328 [2019-09-16 17:06:28,339 INFO L226 Difference]: Without dead ends: 328 [2019-09-16 17:06:28,339 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,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-16 17:06:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2019-09-16 17:06:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 407 transitions. [2019-09-16 17:06:28,345 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 407 transitions. Word has length 104 [2019-09-16 17:06:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,346 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 407 transitions. [2019-09-16 17:06:28,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 407 transitions. [2019-09-16 17:06:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:06:28,347 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:28,347 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:28,347 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,348 INFO L82 PathProgramCache]: Analyzing trace with hash -922538937, now seen corresponding path program 1 times [2019-09-16 17:06:28,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:28,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:28,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:28,413 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:28,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:28,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:28,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:28,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:28,415 INFO L87 Difference]: Start difference. First operand 269 states and 407 transitions. Second operand 4 states. [2019-09-16 17:06:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:28,677 INFO L93 Difference]: Finished difference Result 291 states and 435 transitions. [2019-09-16 17:06:28,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:28,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-16 17:06:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:28,680 INFO L225 Difference]: With dead ends: 291 [2019-09-16 17:06:28,680 INFO L226 Difference]: Without dead ends: 291 [2019-09-16 17:06:28,681 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,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-16 17:06:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 269. [2019-09-16 17:06:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 406 transitions. [2019-09-16 17:06:28,687 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 406 transitions. Word has length 104 [2019-09-16 17:06:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:28,688 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 406 transitions. [2019-09-16 17:06:28,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 406 transitions. [2019-09-16 17:06:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:06:28,689 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:28,690 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:28,690 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:28,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:28,690 INFO L82 PathProgramCache]: Analyzing trace with hash 132737446, now seen corresponding path program 1 times [2019-09-16 17:06:28,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:28,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:28,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:28,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:28,775 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:28,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:28,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:28,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:28,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:28,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:28,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:28,776 INFO L87 Difference]: Start difference. First operand 269 states and 406 transitions. Second operand 4 states. [2019-09-16 17:06:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:29,167 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2019-09-16 17:06:29,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:29,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:06:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:29,169 INFO L225 Difference]: With dead ends: 328 [2019-09-16 17:06:29,170 INFO L226 Difference]: Without dead ends: 328 [2019-09-16 17:06:29,170 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,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-16 17:06:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2019-09-16 17:06:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 405 transitions. [2019-09-16 17:06:29,176 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 405 transitions. Word has length 105 [2019-09-16 17:06:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:29,176 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 405 transitions. [2019-09-16 17:06:29,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 405 transitions. [2019-09-16 17:06:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-16 17:06:29,178 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:29,178 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:29,179 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:29,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:29,180 INFO L82 PathProgramCache]: Analyzing trace with hash 566466532, now seen corresponding path program 1 times [2019-09-16 17:06:29,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:29,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:29,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:29,249 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:29,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:29,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:29,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:29,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:29,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:29,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:29,250 INFO L87 Difference]: Start difference. First operand 269 states and 405 transitions. Second operand 4 states. [2019-09-16 17:06:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:29,515 INFO L93 Difference]: Finished difference Result 291 states and 433 transitions. [2019-09-16 17:06:29,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:29,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-16 17:06:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:29,521 INFO L225 Difference]: With dead ends: 291 [2019-09-16 17:06:29,521 INFO L226 Difference]: Without dead ends: 291 [2019-09-16 17:06:29,522 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,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-16 17:06:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 269. [2019-09-16 17:06:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 404 transitions. [2019-09-16 17:06:29,527 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 404 transitions. Word has length 105 [2019-09-16 17:06:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:29,528 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 404 transitions. [2019-09-16 17:06:29,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 404 transitions. [2019-09-16 17:06:29,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:06:29,529 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:29,529 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:29,530 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:29,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:29,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1118500758, now seen corresponding path program 1 times [2019-09-16 17:06:29,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:29,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:29,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:29,601 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:29,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:29,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:29,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:29,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:29,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:29,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:29,602 INFO L87 Difference]: Start difference. First operand 269 states and 404 transitions. Second operand 4 states. [2019-09-16 17:06:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:29,966 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2019-09-16 17:06:29,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:29,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:06:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:29,969 INFO L225 Difference]: With dead ends: 328 [2019-09-16 17:06:29,969 INFO L226 Difference]: Without dead ends: 328 [2019-09-16 17:06:29,970 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,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-09-16 17:06:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2019-09-16 17:06:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 403 transitions. [2019-09-16 17:06:29,976 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 403 transitions. Word has length 106 [2019-09-16 17:06:29,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:29,976 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 403 transitions. [2019-09-16 17:06:29,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 403 transitions. [2019-09-16 17:06:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-16 17:06:29,978 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:29,978 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:29,978 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:29,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:29,979 INFO L82 PathProgramCache]: Analyzing trace with hash -557800980, now seen corresponding path program 1 times [2019-09-16 17:06:29,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:29,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:29,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:29,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:30,040 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:30,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:30,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:30,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:30,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:30,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:30,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:30,044 INFO L87 Difference]: Start difference. First operand 269 states and 403 transitions. Second operand 4 states. [2019-09-16 17:06:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:30,313 INFO L93 Difference]: Finished difference Result 291 states and 431 transitions. [2019-09-16 17:06:30,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:30,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-16 17:06:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:30,315 INFO L225 Difference]: With dead ends: 291 [2019-09-16 17:06:30,316 INFO L226 Difference]: Without dead ends: 291 [2019-09-16 17:06:30,316 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,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-16 17:06:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 269. [2019-09-16 17:06:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 402 transitions. [2019-09-16 17:06:30,323 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 402 transitions. Word has length 106 [2019-09-16 17:06:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:30,323 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 402 transitions. [2019-09-16 17:06:30,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 402 transitions. [2019-09-16 17:06:30,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-16 17:06:30,325 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:30,325 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:30,325 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:30,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:30,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1290976213, now seen corresponding path program 1 times [2019-09-16 17:06:30,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:30,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:30,392 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:30,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:30,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:30,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:30,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:30,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:30,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:30,394 INFO L87 Difference]: Start difference. First operand 269 states and 402 transitions. Second operand 4 states. [2019-09-16 17:06:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:30,747 INFO L93 Difference]: Finished difference Result 318 states and 473 transitions. [2019-09-16 17:06:30,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:30,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-16 17:06:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:30,750 INFO L225 Difference]: With dead ends: 318 [2019-09-16 17:06:30,751 INFO L226 Difference]: Without dead ends: 318 [2019-09-16 17:06:30,751 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,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-16 17:06:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 269. [2019-09-16 17:06:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 401 transitions. [2019-09-16 17:06:30,756 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 401 transitions. Word has length 107 [2019-09-16 17:06:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:30,757 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 401 transitions. [2019-09-16 17:06:30,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 401 transitions. [2019-09-16 17:06:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-16 17:06:30,758 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:30,759 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:30,759 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:30,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1089152279, now seen corresponding path program 1 times [2019-09-16 17:06:30,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:30,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:30,828 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:30,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:30,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:30,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:30,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:30,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:30,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:30,829 INFO L87 Difference]: Start difference. First operand 269 states and 401 transitions. Second operand 4 states. [2019-09-16 17:06:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,066 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2019-09-16 17:06:31,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:31,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-16 17:06:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,069 INFO L225 Difference]: With dead ends: 281 [2019-09-16 17:06:31,069 INFO L226 Difference]: Without dead ends: 281 [2019-09-16 17:06:31,069 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,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-16 17:06:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 269. [2019-09-16 17:06:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 400 transitions. [2019-09-16 17:06:31,075 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 400 transitions. Word has length 107 [2019-09-16 17:06:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:31,076 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 400 transitions. [2019-09-16 17:06:31,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 400 transitions. [2019-09-16 17:06:31,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-16 17:06:31,077 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:31,077 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:31,078 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:31,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:31,078 INFO L82 PathProgramCache]: Analyzing trace with hash 406195013, now seen corresponding path program 1 times [2019-09-16 17:06:31,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:31,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:31,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:31,187 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:31,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:31,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:31,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:31,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:31,189 INFO L87 Difference]: Start difference. First operand 269 states and 400 transitions. Second operand 4 states. [2019-09-16 17:06:31,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,662 INFO L93 Difference]: Finished difference Result 318 states and 471 transitions. [2019-09-16 17:06:31,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:31,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-16 17:06:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,665 INFO L225 Difference]: With dead ends: 318 [2019-09-16 17:06:31,665 INFO L226 Difference]: Without dead ends: 318 [2019-09-16 17:06:31,665 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,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-16 17:06:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 269. [2019-09-16 17:06:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:06:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 399 transitions. [2019-09-16 17:06:31,671 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 399 transitions. Word has length 111 [2019-09-16 17:06:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:31,672 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 399 transitions. [2019-09-16 17:06:31,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 399 transitions. [2019-09-16 17:06:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-16 17:06:31,673 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:31,673 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:31,673 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash 351802115, now seen corresponding path program 1 times [2019-09-16 17:06:31,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:31,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:31,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-16 17:06:31,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:31,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:31,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:31,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:31,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:31,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:31,751 INFO L87 Difference]: Start difference. First operand 269 states and 399 transitions. Second operand 3 states. [2019-09-16 17:06:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,818 INFO L93 Difference]: Finished difference Result 511 states and 753 transitions. [2019-09-16 17:06:31,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:31,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-16 17:06:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,821 INFO L225 Difference]: With dead ends: 511 [2019-09-16 17:06:31,821 INFO L226 Difference]: Without dead ends: 511 [2019-09-16 17:06:31,821 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:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-16 17:06:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2019-09-16 17:06:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-09-16 17:06:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 753 transitions. [2019-09-16 17:06:31,829 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 753 transitions. Word has length 111 [2019-09-16 17:06:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:31,831 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 753 transitions. [2019-09-16 17:06:31,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:31,832 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 753 transitions. [2019-09-16 17:06:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-16 17:06:31,833 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:31,833 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:31,834 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:31,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:31,834 INFO L82 PathProgramCache]: Analyzing trace with hash -458839463, now seen corresponding path program 1 times [2019-09-16 17:06:31,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:31,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:31,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:31,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:31,909 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:31,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:31,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:31,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:31,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:31,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:31,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:31,911 INFO L87 Difference]: Start difference. First operand 511 states and 753 transitions. Second operand 3 states. [2019-09-16 17:06:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:31,990 INFO L93 Difference]: Finished difference Result 753 states and 1108 transitions. [2019-09-16 17:06:31,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:31,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-16 17:06:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:31,994 INFO L225 Difference]: With dead ends: 753 [2019-09-16 17:06:31,995 INFO L226 Difference]: Without dead ends: 753 [2019-09-16 17:06:31,995 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:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-16 17:06:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2019-09-16 17:06:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-09-16 17:06:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1108 transitions. [2019-09-16 17:06:32,008 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1108 transitions. Word has length 113 [2019-09-16 17:06:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:32,008 INFO L475 AbstractCegarLoop]: Abstraction has 753 states and 1108 transitions. [2019-09-16 17:06:32,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:32,008 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1108 transitions. [2019-09-16 17:06:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-16 17:06:32,010 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:32,011 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, 1, 1, 1, 1] [2019-09-16 17:06:32,011 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:32,011 INFO L82 PathProgramCache]: Analyzing trace with hash -89101365, now seen corresponding path program 1 times [2019-09-16 17:06:32,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:32,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:32,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:32,087 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:32,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:32,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:32,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:32,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:32,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:32,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:32,089 INFO L87 Difference]: Start difference. First operand 753 states and 1108 transitions. Second operand 4 states. [2019-09-16 17:06:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:32,426 INFO L93 Difference]: Finished difference Result 942 states and 1399 transitions. [2019-09-16 17:06:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:32,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-16 17:06:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:32,430 INFO L225 Difference]: With dead ends: 942 [2019-09-16 17:06:32,430 INFO L226 Difference]: Without dead ends: 942 [2019-09-16 17:06:32,430 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,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-16 17:06:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 837. [2019-09-16 17:06:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-16 17:06:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1255 transitions. [2019-09-16 17:06:32,444 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1255 transitions. Word has length 142 [2019-09-16 17:06:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:32,444 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1255 transitions. [2019-09-16 17:06:32,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1255 transitions. [2019-09-16 17:06:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:06:32,446 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:32,447 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2019-09-16 17:06:32,447 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:32,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:32,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1616137422, now seen corresponding path program 1 times [2019-09-16 17:06:32,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:32,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:32,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:32,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:32,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:32,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:32,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:32,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:32,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:32,567 INFO L87 Difference]: Start difference. First operand 837 states and 1255 transitions. Second operand 4 states. [2019-09-16 17:06:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:32,905 INFO L93 Difference]: Finished difference Result 942 states and 1396 transitions. [2019-09-16 17:06:32,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:32,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:06:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:32,909 INFO L225 Difference]: With dead ends: 942 [2019-09-16 17:06:32,909 INFO L226 Difference]: Without dead ends: 942 [2019-09-16 17:06:32,910 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,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-16 17:06:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 837. [2019-09-16 17:06:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-16 17:06:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1252 transitions. [2019-09-16 17:06:32,923 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1252 transitions. Word has length 155 [2019-09-16 17:06:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:32,924 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1252 transitions. [2019-09-16 17:06:32,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1252 transitions. [2019-09-16 17:06:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:32,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:32,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,926 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:32,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:32,927 INFO L82 PathProgramCache]: Analyzing trace with hash 962186706, now seen corresponding path program 1 times [2019-09-16 17:06:32,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:32,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:32,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:32,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:33,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:33,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:33,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:33,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:33,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:33,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:33,022 INFO L87 Difference]: Start difference. First operand 837 states and 1252 transitions. Second operand 4 states. [2019-09-16 17:06:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:33,359 INFO L93 Difference]: Finished difference Result 939 states and 1390 transitions. [2019-09-16 17:06:33,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:33,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:33,365 INFO L225 Difference]: With dead ends: 939 [2019-09-16 17:06:33,365 INFO L226 Difference]: Without dead ends: 939 [2019-09-16 17:06:33,365 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,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-09-16 17:06:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 837. [2019-09-16 17:06:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-16 17:06:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1249 transitions. [2019-09-16 17:06:33,378 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1249 transitions. Word has length 156 [2019-09-16 17:06:33,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:33,379 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1249 transitions. [2019-09-16 17:06:33,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1249 transitions. [2019-09-16 17:06:33,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:06:33,381 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:33,382 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-09-16 17:06:33,382 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:33,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:33,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1132173325, now seen corresponding path program 1 times [2019-09-16 17:06:33,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:33,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:33,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:33,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:33,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:33,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:33,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:33,459 INFO L87 Difference]: Start difference. First operand 837 states and 1249 transitions. Second operand 4 states. [2019-09-16 17:06:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:33,789 INFO L93 Difference]: Finished difference Result 933 states and 1381 transitions. [2019-09-16 17:06:33,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:33,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:06:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:33,795 INFO L225 Difference]: With dead ends: 933 [2019-09-16 17:06:33,795 INFO L226 Difference]: Without dead ends: 933 [2019-09-16 17:06:33,796 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,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-16 17:06:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 837. [2019-09-16 17:06:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-16 17:06:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1246 transitions. [2019-09-16 17:06:33,809 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1246 transitions. Word has length 156 [2019-09-16 17:06:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:33,809 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1246 transitions. [2019-09-16 17:06:33,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1246 transitions. [2019-09-16 17:06:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:06:33,812 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:33,814 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, 1, 1, 1, 1] [2019-09-16 17:06:33,814 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:33,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1656304811, now seen corresponding path program 1 times [2019-09-16 17:06:33,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:33,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:33,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:33,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:33,915 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:33,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:33,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:33,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:33,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:33,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:33,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:33,917 INFO L87 Difference]: Start difference. First operand 837 states and 1246 transitions. Second operand 4 states. [2019-09-16 17:06:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:34,246 INFO L93 Difference]: Finished difference Result 933 states and 1378 transitions. [2019-09-16 17:06:34,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:34,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:06:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:34,251 INFO L225 Difference]: With dead ends: 933 [2019-09-16 17:06:34,251 INFO L226 Difference]: Without dead ends: 933 [2019-09-16 17:06:34,251 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:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-16 17:06:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 837. [2019-09-16 17:06:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-16 17:06:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1243 transitions. [2019-09-16 17:06:34,264 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1243 transitions. Word has length 157 [2019-09-16 17:06:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:34,265 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1243 transitions. [2019-09-16 17:06:34,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1243 transitions. [2019-09-16 17:06:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-16 17:06:34,267 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:34,267 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, 1, 1, 1, 1] [2019-09-16 17:06:34,268 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:34,268 INFO L82 PathProgramCache]: Analyzing trace with hash -705439082, now seen corresponding path program 1 times [2019-09-16 17:06:34,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:34,383 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:34,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:34,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:34,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:34,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:34,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:34,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:34,385 INFO L87 Difference]: Start difference. First operand 837 states and 1243 transitions. Second operand 4 states. [2019-09-16 17:06:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:34,705 INFO L93 Difference]: Finished difference Result 933 states and 1375 transitions. [2019-09-16 17:06:34,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:34,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-16 17:06:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:34,711 INFO L225 Difference]: With dead ends: 933 [2019-09-16 17:06:34,711 INFO L226 Difference]: Without dead ends: 933 [2019-09-16 17:06:34,711 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:34,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-16 17:06:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 837. [2019-09-16 17:06:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-16 17:06:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1240 transitions. [2019-09-16 17:06:34,724 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1240 transitions. Word has length 158 [2019-09-16 17:06:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:34,724 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1240 transitions. [2019-09-16 17:06:34,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1240 transitions. [2019-09-16 17:06:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:06:34,727 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:34,727 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, 1, 1, 1, 1] [2019-09-16 17:06:34,727 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:34,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:34,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1332169350, now seen corresponding path program 1 times [2019-09-16 17:06:34,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:34,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:34,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:34,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:34,818 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:34,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:34,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:34,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:34,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:34,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:34,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:34,820 INFO L87 Difference]: Start difference. First operand 837 states and 1240 transitions. Second operand 4 states. [2019-09-16 17:06:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:35,115 INFO L93 Difference]: Finished difference Result 933 states and 1372 transitions. [2019-09-16 17:06:35,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:35,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:06:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:35,119 INFO L225 Difference]: With dead ends: 933 [2019-09-16 17:06:35,119 INFO L226 Difference]: Without dead ends: 933 [2019-09-16 17:06:35,120 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:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-16 17:06:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 837. [2019-09-16 17:06:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-16 17:06:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1237 transitions. [2019-09-16 17:06:35,131 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1237 transitions. Word has length 159 [2019-09-16 17:06:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:35,132 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1237 transitions. [2019-09-16 17:06:35,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1237 transitions. [2019-09-16 17:06:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-16 17:06:35,134 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:35,134 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, 1, 1, 1, 1] [2019-09-16 17:06:35,134 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:35,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:35,135 INFO L82 PathProgramCache]: Analyzing trace with hash 675232027, now seen corresponding path program 1 times [2019-09-16 17:06:35,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:35,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:35,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:35,220 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:35,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:35,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:35,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:35,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:35,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:35,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:35,221 INFO L87 Difference]: Start difference. First operand 837 states and 1237 transitions. Second operand 4 states. [2019-09-16 17:06:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:35,502 INFO L93 Difference]: Finished difference Result 903 states and 1333 transitions. [2019-09-16 17:06:35,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:35,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-16 17:06:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:35,506 INFO L225 Difference]: With dead ends: 903 [2019-09-16 17:06:35,506 INFO L226 Difference]: Without dead ends: 903 [2019-09-16 17:06:35,506 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:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-09-16 17:06:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 837. [2019-09-16 17:06:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-16 17:06:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1234 transitions. [2019-09-16 17:06:35,518 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1234 transitions. Word has length 160 [2019-09-16 17:06:35,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:35,518 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1234 transitions. [2019-09-16 17:06:35,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1234 transitions. [2019-09-16 17:06:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-16 17:06:35,521 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:35,521 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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:35,521 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:35,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash 142870581, now seen corresponding path program 1 times [2019-09-16 17:06:35,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:35,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:35,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:35,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:35,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:35,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:35,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:35,603 INFO L87 Difference]: Start difference. First operand 837 states and 1234 transitions. Second operand 4 states. [2019-09-16 17:06:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:35,904 INFO L93 Difference]: Finished difference Result 903 states and 1330 transitions. [2019-09-16 17:06:35,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:35,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-16 17:06:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:35,909 INFO L225 Difference]: With dead ends: 903 [2019-09-16 17:06:35,909 INFO L226 Difference]: Without dead ends: 903 [2019-09-16 17:06:35,909 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,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-09-16 17:06:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 837. [2019-09-16 17:06:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-16 17:06:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1231 transitions. [2019-09-16 17:06:35,921 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1231 transitions. Word has length 164 [2019-09-16 17:06:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:35,922 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1231 transitions. [2019-09-16 17:06:35,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1231 transitions. [2019-09-16 17:06:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-16 17:06:35,924 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:35,924 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:35,925 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:35,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1799652844, now seen corresponding path program 1 times [2019-09-16 17:06:35,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:35,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-16 17:06:36,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:36,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:36,006 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,008 INFO L87 Difference]: Start difference. First operand 837 states and 1231 transitions. Second operand 4 states. [2019-09-16 17:06:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:36,329 INFO L93 Difference]: Finished difference Result 888 states and 1306 transitions. [2019-09-16 17:06:36,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:36,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-16 17:06:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:36,335 INFO L225 Difference]: With dead ends: 888 [2019-09-16 17:06:36,335 INFO L226 Difference]: Without dead ends: 888 [2019-09-16 17:06:36,335 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,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-09-16 17:06:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 837. [2019-09-16 17:06:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-16 17:06:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1228 transitions. [2019-09-16 17:06:36,373 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1228 transitions. Word has length 165 [2019-09-16 17:06:36,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:36,373 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1228 transitions. [2019-09-16 17:06:36,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1228 transitions. [2019-09-16 17:06:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-16 17:06:36,376 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:36,376 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] [2019-09-16 17:06:36,376 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:36,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1234843957, now seen corresponding path program 1 times [2019-09-16 17:06:36,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:36,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:36,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-16 17:06:36,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:36,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:36,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:36,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:36,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:36,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:36,465 INFO L87 Difference]: Start difference. First operand 837 states and 1228 transitions. Second operand 3 states. [2019-09-16 17:06:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:36,567 INFO L93 Difference]: Finished difference Result 1107 states and 1624 transitions. [2019-09-16 17:06:36,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:36,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-16 17:06:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:36,574 INFO L225 Difference]: With dead ends: 1107 [2019-09-16 17:06:36,575 INFO L226 Difference]: Without dead ends: 1107 [2019-09-16 17:06:36,576 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:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-09-16 17:06:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2019-09-16 17:06:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1107 states. [2019-09-16 17:06:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1624 transitions. [2019-09-16 17:06:36,596 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1624 transitions. Word has length 167 [2019-09-16 17:06:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:36,597 INFO L475 AbstractCegarLoop]: Abstraction has 1107 states and 1624 transitions. [2019-09-16 17:06:36,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1624 transitions. [2019-09-16 17:06:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-16 17:06:36,601 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:36,602 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:36,602 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:36,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:36,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1296530854, now seen corresponding path program 1 times [2019-09-16 17:06:36,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:36,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:36,720 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:36,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:36,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:36,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:36,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:36,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:36,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:36,723 INFO L87 Difference]: Start difference. First operand 1107 states and 1624 transitions. Second operand 3 states. [2019-09-16 17:06:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:36,798 INFO L93 Difference]: Finished difference Result 1377 states and 2021 transitions. [2019-09-16 17:06:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:36,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-16 17:06:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:36,805 INFO L225 Difference]: With dead ends: 1377 [2019-09-16 17:06:36,805 INFO L226 Difference]: Without dead ends: 1377 [2019-09-16 17:06:36,808 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:36,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2019-09-16 17:06:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1377. [2019-09-16 17:06:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2019-09-16 17:06:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2021 transitions. [2019-09-16 17:06:36,825 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2021 transitions. Word has length 173 [2019-09-16 17:06:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:36,826 INFO L475 AbstractCegarLoop]: Abstraction has 1377 states and 2021 transitions. [2019-09-16 17:06:36,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2021 transitions. [2019-09-16 17:06:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-16 17:06:36,829 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:36,829 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,830 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:36,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:36,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1052214699, now seen corresponding path program 1 times [2019-09-16 17:06:36,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:36,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:36,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-16 17:06:36,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:36,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:36,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:36,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:36,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:36,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:36,927 INFO L87 Difference]: Start difference. First operand 1377 states and 2021 transitions. Second operand 3 states. [2019-09-16 17:06:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:37,008 INFO L93 Difference]: Finished difference Result 1647 states and 2419 transitions. [2019-09-16 17:06:37,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:37,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-16 17:06:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:37,018 INFO L225 Difference]: With dead ends: 1647 [2019-09-16 17:06:37,018 INFO L226 Difference]: Without dead ends: 1647 [2019-09-16 17:06:37,018 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:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2019-09-16 17:06:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2019-09-16 17:06:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-09-16 17:06:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2419 transitions. [2019-09-16 17:06:37,042 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2419 transitions. Word has length 205 [2019-09-16 17:06:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:37,042 INFO L475 AbstractCegarLoop]: Abstraction has 1647 states and 2419 transitions. [2019-09-16 17:06:37,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2419 transitions. [2019-09-16 17:06:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-16 17:06:37,048 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:37,048 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,048 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:37,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:37,049 INFO L82 PathProgramCache]: Analyzing trace with hash -596392427, now seen corresponding path program 1 times [2019-09-16 17:06:37,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:37,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:37,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-16 17:06:37,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:37,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:37,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:37,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:37,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:37,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:37,151 INFO L87 Difference]: Start difference. First operand 1647 states and 2419 transitions. Second operand 3 states. [2019-09-16 17:06:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:37,232 INFO L93 Difference]: Finished difference Result 1917 states and 2818 transitions. [2019-09-16 17:06:37,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:37,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-16 17:06:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:37,249 INFO L225 Difference]: With dead ends: 1917 [2019-09-16 17:06:37,252 INFO L226 Difference]: Without dead ends: 1917 [2019-09-16 17:06:37,253 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:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2019-09-16 17:06:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1917. [2019-09-16 17:06:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1917 states. [2019-09-16 17:06:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2818 transitions. [2019-09-16 17:06:37,278 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2818 transitions. Word has length 207 [2019-09-16 17:06:37,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:37,278 INFO L475 AbstractCegarLoop]: Abstraction has 1917 states and 2818 transitions. [2019-09-16 17:06:37,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2818 transitions. [2019-09-16 17:06:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-16 17:06:37,283 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:37,283 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:37,283 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:37,284 INFO L82 PathProgramCache]: Analyzing trace with hash -347653797, now seen corresponding path program 1 times [2019-09-16 17:06:37,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:37,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-16 17:06:37,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:37,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:37,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:37,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:37,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:37,447 INFO L87 Difference]: Start difference. First operand 1917 states and 2818 transitions. Second operand 3 states. [2019-09-16 17:06:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:37,527 INFO L93 Difference]: Finished difference Result 2187 states and 3218 transitions. [2019-09-16 17:06:37,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:37,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-16 17:06:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:37,539 INFO L225 Difference]: With dead ends: 2187 [2019-09-16 17:06:37,540 INFO L226 Difference]: Without dead ends: 2187 [2019-09-16 17:06:37,540 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:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-09-16 17:06:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2187. [2019-09-16 17:06:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2019-09-16 17:06:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3218 transitions. [2019-09-16 17:06:37,579 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3218 transitions. Word has length 240 [2019-09-16 17:06:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:37,580 INFO L475 AbstractCegarLoop]: Abstraction has 2187 states and 3218 transitions. [2019-09-16 17:06:37,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3218 transitions. [2019-09-16 17:06:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-16 17:06:37,587 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:37,588 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:37,588 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:37,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:37,588 INFO L82 PathProgramCache]: Analyzing trace with hash -869870947, now seen corresponding path program 1 times [2019-09-16 17:06:37,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:37,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:37,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-16 17:06:37,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:37,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:37,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:37,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:37,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:37,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:37,733 INFO L87 Difference]: Start difference. First operand 2187 states and 3218 transitions. Second operand 3 states. [2019-09-16 17:06:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:37,809 INFO L93 Difference]: Finished difference Result 2450 states and 3601 transitions. [2019-09-16 17:06:37,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:37,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 275 [2019-09-16 17:06:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:37,815 INFO L225 Difference]: With dead ends: 2450 [2019-09-16 17:06:37,815 INFO L226 Difference]: Without dead ends: 2450 [2019-09-16 17:06:37,815 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:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2019-09-16 17:06:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2019-09-16 17:06:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2019-09-16 17:06:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3601 transitions. [2019-09-16 17:06:37,844 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3601 transitions. Word has length 275 [2019-09-16 17:06:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:37,844 INFO L475 AbstractCegarLoop]: Abstraction has 2450 states and 3601 transitions. [2019-09-16 17:06:37,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3601 transitions. [2019-09-16 17:06:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-16 17:06:37,852 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:37,854 INFO L407 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:37,854 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:37,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -135036714, now seen corresponding path program 1 times [2019-09-16 17:06:37,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:37,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:37,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:37,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-09-16 17:06:38,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:38,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:38,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:38,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:38,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:38,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:38,011 INFO L87 Difference]: Start difference. First operand 2450 states and 3601 transitions. Second operand 3 states. [2019-09-16 17:06:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:38,098 INFO L93 Difference]: Finished difference Result 2720 states and 4003 transitions. [2019-09-16 17:06:38,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:38,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-16 17:06:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:38,105 INFO L225 Difference]: With dead ends: 2720 [2019-09-16 17:06:38,105 INFO L226 Difference]: Without dead ends: 2720 [2019-09-16 17:06:38,105 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:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2019-09-16 17:06:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2720. [2019-09-16 17:06:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2720 states. [2019-09-16 17:06:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 4003 transitions. [2019-09-16 17:06:38,133 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 4003 transitions. Word has length 314 [2019-09-16 17:06:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:38,134 INFO L475 AbstractCegarLoop]: Abstraction has 2720 states and 4003 transitions. [2019-09-16 17:06:38,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 4003 transitions. [2019-09-16 17:06:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-16 17:06:38,140 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:38,140 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:06:38,140 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:38,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:38,141 INFO L82 PathProgramCache]: Analyzing trace with hash -210562296, now seen corresponding path program 1 times [2019-09-16 17:06:38,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:38,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:38,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-09-16 17:06:38,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:38,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:38,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:38,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:38,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:38,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:38,404 INFO L87 Difference]: Start difference. First operand 2720 states and 4003 transitions. Second operand 3 states. [2019-09-16 17:06:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:38,511 INFO L93 Difference]: Finished difference Result 2990 states and 4406 transitions. [2019-09-16 17:06:38,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:38,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 355 [2019-09-16 17:06:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:38,516 INFO L225 Difference]: With dead ends: 2990 [2019-09-16 17:06:38,517 INFO L226 Difference]: Without dead ends: 2990 [2019-09-16 17:06:38,517 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:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2019-09-16 17:06:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2990. [2019-09-16 17:06:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-09-16 17:06:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 4406 transitions. [2019-09-16 17:06:38,553 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 4406 transitions. Word has length 355 [2019-09-16 17:06:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:38,554 INFO L475 AbstractCegarLoop]: Abstraction has 2990 states and 4406 transitions. [2019-09-16 17:06:38,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 4406 transitions. [2019-09-16 17:06:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-16 17:06:38,560 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:38,560 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,561 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:38,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:38,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1213458592, now seen corresponding path program 1 times [2019-09-16 17:06:38,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:38,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:38,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-16 17:06:38,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:38,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:38,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:38,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:38,779 INFO L87 Difference]: Start difference. First operand 2990 states and 4406 transitions. Second operand 3 states. [2019-09-16 17:06:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:38,861 INFO L93 Difference]: Finished difference Result 3254 states and 4790 transitions. [2019-09-16 17:06:38,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:38,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-09-16 17:06:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:38,871 INFO L225 Difference]: With dead ends: 3254 [2019-09-16 17:06:38,871 INFO L226 Difference]: Without dead ends: 3254 [2019-09-16 17:06:38,871 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:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2019-09-16 17:06:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3254. [2019-09-16 17:06:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2019-09-16 17:06:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 4790 transitions. [2019-09-16 17:06:38,907 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 4790 transitions. Word has length 398 [2019-09-16 17:06:38,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:38,908 INFO L475 AbstractCegarLoop]: Abstraction has 3254 states and 4790 transitions. [2019-09-16 17:06:38,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 4790 transitions. [2019-09-16 17:06:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-09-16 17:06:38,914 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:38,914 INFO L407 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 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,915 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:38,915 INFO L82 PathProgramCache]: Analyzing trace with hash 474023189, now seen corresponding path program 1 times [2019-09-16 17:06:38,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:38,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:38,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:38,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2019-09-16 17:06:39,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:39,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:39,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:39,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:39,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:39,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:39,199 INFO L87 Difference]: Start difference. First operand 3254 states and 4790 transitions. Second operand 3 states. [2019-09-16 17:06:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:39,290 INFO L93 Difference]: Finished difference Result 3524 states and 5195 transitions. [2019-09-16 17:06:39,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:39,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2019-09-16 17:06:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:39,298 INFO L225 Difference]: With dead ends: 3524 [2019-09-16 17:06:39,298 INFO L226 Difference]: Without dead ends: 3524 [2019-09-16 17:06:39,298 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:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2019-09-16 17:06:39,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3524. [2019-09-16 17:06:39,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-09-16 17:06:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 5195 transitions. [2019-09-16 17:06:39,338 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 5195 transitions. Word has length 438 [2019-09-16 17:06:39,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:39,339 INFO L475 AbstractCegarLoop]: Abstraction has 3524 states and 5195 transitions. [2019-09-16 17:06:39,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 5195 transitions. [2019-09-16 17:06:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-16 17:06:39,348 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:39,348 INFO L407 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,349 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:39,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:39,349 INFO L82 PathProgramCache]: Analyzing trace with hash -501243775, now seen corresponding path program 1 times [2019-09-16 17:06:39,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:39,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:39,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 1772 trivial. 0 not checked. [2019-09-16 17:06:39,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:39,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:39,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:39,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:39,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:39,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:39,636 INFO L87 Difference]: Start difference. First operand 3524 states and 5195 transitions. Second operand 3 states. [2019-09-16 17:06:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:39,755 INFO L93 Difference]: Finished difference Result 3794 states and 5601 transitions. [2019-09-16 17:06:39,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:39,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 480 [2019-09-16 17:06:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:39,761 INFO L225 Difference]: With dead ends: 3794 [2019-09-16 17:06:39,762 INFO L226 Difference]: Without dead ends: 3794 [2019-09-16 17:06:39,762 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:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2019-09-16 17:06:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3794. [2019-09-16 17:06:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-09-16 17:06:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5601 transitions. [2019-09-16 17:06:39,803 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5601 transitions. Word has length 480 [2019-09-16 17:06:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:39,804 INFO L475 AbstractCegarLoop]: Abstraction has 3794 states and 5601 transitions. [2019-09-16 17:06:39,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5601 transitions. [2019-09-16 17:06:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-16 17:06:39,813 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:39,813 INFO L407 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,814 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:39,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:39,814 INFO L82 PathProgramCache]: Analyzing trace with hash 184524699, now seen corresponding path program 1 times [2019-09-16 17:06:39,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:39,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:39,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:39,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1047 proven. 0 refuted. 0 times theorem prover too weak. 1481 trivial. 0 not checked. [2019-09-16 17:06:40,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:40,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:06:40,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:40,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:06:40,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:06:40,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:06:40,121 INFO L87 Difference]: Start difference. First operand 3794 states and 5601 transitions. Second operand 4 states. [2019-09-16 17:06:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:40,552 INFO L93 Difference]: Finished difference Result 5313 states and 7886 transitions. [2019-09-16 17:06:40,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:06:40,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 524 [2019-09-16 17:06:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:40,564 INFO L225 Difference]: With dead ends: 5313 [2019-09-16 17:06:40,564 INFO L226 Difference]: Without dead ends: 5313 [2019-09-16 17:06:40,565 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:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2019-09-16 17:06:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 4368. [2019-09-16 17:06:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4368 states. [2019-09-16 17:06:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4368 states to 4368 states and 6651 transitions. [2019-09-16 17:06:40,619 INFO L78 Accepts]: Start accepts. Automaton has 4368 states and 6651 transitions. Word has length 524 [2019-09-16 17:06:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:40,619 INFO L475 AbstractCegarLoop]: Abstraction has 4368 states and 6651 transitions. [2019-09-16 17:06:40,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:06:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4368 states and 6651 transitions. [2019-09-16 17:06:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-09-16 17:06:40,629 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:40,629 INFO L407 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,630 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:40,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash -672301545, now seen corresponding path program 1 times [2019-09-16 17:06:40,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:40,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:40,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:40,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 2135 trivial. 0 not checked. [2019-09-16 17:06:40,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:40,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:40,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:40,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:40,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:41,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:41,000 INFO L87 Difference]: Start difference. First operand 4368 states and 6651 transitions. Second operand 3 states. [2019-09-16 17:06:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:41,088 INFO L93 Difference]: Finished difference Result 4674 states and 7111 transitions. [2019-09-16 17:06:41,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:41,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 524 [2019-09-16 17:06:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:41,094 INFO L225 Difference]: With dead ends: 4674 [2019-09-16 17:06:41,095 INFO L226 Difference]: Without dead ends: 4674 [2019-09-16 17:06:41,095 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:41,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2019-09-16 17:06:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 4674. [2019-09-16 17:06:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4674 states. [2019-09-16 17:06:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 7111 transitions. [2019-09-16 17:06:41,145 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 7111 transitions. Word has length 524 [2019-09-16 17:06:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:41,146 INFO L475 AbstractCegarLoop]: Abstraction has 4674 states and 7111 transitions. [2019-09-16 17:06:41,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 7111 transitions. [2019-09-16 17:06:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-09-16 17:06:41,156 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:41,156 INFO L407 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,157 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:41,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:41,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1140866295, now seen corresponding path program 1 times [2019-09-16 17:06:41,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:41,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:41,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2962 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 2528 trivial. 0 not checked. [2019-09-16 17:06:41,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:41,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:41,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:41,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:41,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:41,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:41,567 INFO L87 Difference]: Start difference. First operand 4674 states and 7111 transitions. Second operand 3 states. [2019-09-16 17:06:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:41,653 INFO L93 Difference]: Finished difference Result 4985 states and 7594 transitions. [2019-09-16 17:06:41,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:41,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 565 [2019-09-16 17:06:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:41,660 INFO L225 Difference]: With dead ends: 4985 [2019-09-16 17:06:41,661 INFO L226 Difference]: Without dead ends: 4985 [2019-09-16 17:06:41,661 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:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2019-09-16 17:06:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 4985. [2019-09-16 17:06:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4985 states. [2019-09-16 17:06:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 7594 transitions. [2019-09-16 17:06:41,713 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 7594 transitions. Word has length 565 [2019-09-16 17:06:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:41,714 INFO L475 AbstractCegarLoop]: Abstraction has 4985 states and 7594 transitions. [2019-09-16 17:06:41,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 7594 transitions. [2019-09-16 17:06:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-09-16 17:06:41,724 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:41,725 INFO L407 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,725 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:41,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash 219902030, now seen corresponding path program 1 times [2019-09-16 17:06:41,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:41,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:41,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:41,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2019-09-16 17:06:42,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:06:42,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:06:42,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:42,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:06:42,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:06:42,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:06:42,096 INFO L87 Difference]: Start difference. First operand 4985 states and 7594 transitions. Second operand 3 states. [2019-09-16 17:06:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:42,182 INFO L93 Difference]: Finished difference Result 5296 states and 8078 transitions. [2019-09-16 17:06:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:06:42,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 608 [2019-09-16 17:06:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:42,189 INFO L225 Difference]: With dead ends: 5296 [2019-09-16 17:06:42,189 INFO L226 Difference]: Without dead ends: 5296 [2019-09-16 17:06:42,189 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:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2019-09-16 17:06:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 5296. [2019-09-16 17:06:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5296 states. [2019-09-16 17:06:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 8078 transitions. [2019-09-16 17:06:42,229 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 8078 transitions. Word has length 608 [2019-09-16 17:06:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:42,229 INFO L475 AbstractCegarLoop]: Abstraction has 5296 states and 8078 transitions. [2019-09-16 17:06:42,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:06:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 8078 transitions. [2019-09-16 17:06:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-09-16 17:06:42,240 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:06:42,241 INFO L407 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,241 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:06:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:42,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1338299445, now seen corresponding path program 1 times [2019-09-16 17:06:42,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:06:42,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:06:42,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:06:42,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:06:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:06:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 2390 proven. 81 refuted. 0 times theorem prover too weak. 1475 trivial. 0 not checked. [2019-09-16 17:06:43,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:06:43,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:06:43,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 654 with the following transitions: [2019-09-16 17:06:43,112 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], [188], [191], [193], [198], [201], [203], [208], [211], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [341], [343], [345], [350], [353], [361], [363], [365], [368], [372], [375], [404], [407], [415], [425], [427], [430], [441], [443], [453], [455], [458], [466], [492], [495], [503], [508], [511], [519], [522], [525], [533], [535], [538], [546], [548], [551], [553], [556], [558], [561], [563], [566], [574], [579], [581], [583], [588], [591], [593], [596], [598], [601], [609], [614], [616], [619], [621], [624], [626], [629], [637], [640], [644], [665], [699], [701], [713], [716], [717], [729], [737], [738], [739] [2019-09-16 17:06:43,190 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:06:43,191 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:06:43,321 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:06:43,323 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:06:43,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:06:43,329 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:06:43,536 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:06:43,536 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:06:43,555 INFO L420 sIntCurrentIteration]: We unified 652 AI predicates to 652 [2019-09-16 17:06:43,555 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:06:43,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:06:43,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2019-09-16 17:06:43,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:06:43,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:06:43,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:06:43,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:06:43,561 INFO L87 Difference]: Start difference. First operand 5296 states and 8078 transitions. Second operand 2 states. [2019-09-16 17:06:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:06:43,561 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:06:43,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:06:43,562 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 653 [2019-09-16 17:06:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:06:43,562 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:06:43,562 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:06:43,563 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 652 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:06:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:06:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:06:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:06:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:06:43,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 653 [2019-09-16 17:06:43,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:06:43,566 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:06:43,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:06:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:06:43,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:06:43,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:06:43 BoogieIcfgContainer [2019-09-16 17:06:43,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:06:43,576 INFO L168 Benchmark]: Toolchain (without parser) took 30136.71 ms. Allocated memory was 132.1 MB in the beginning and 967.3 MB in the end (delta: 835.2 MB). Free memory was 85.0 MB in the beginning and 863.1 MB in the end (delta: -778.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:43,578 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 106.1 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:06:43,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 997.92 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 84.8 MB in the beginning and 154.9 MB in the end (delta: -70.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:43,580 INFO L168 Benchmark]: Boogie Preprocessor took 170.33 ms. Allocated memory is still 199.8 MB. Free memory was 154.9 MB in the beginning and 146.4 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:43,581 INFO L168 Benchmark]: RCFGBuilder took 1511.08 ms. Allocated memory was 199.8 MB in the beginning and 222.3 MB in the end (delta: 22.5 MB). Free memory was 146.4 MB in the beginning and 161.1 MB in the end (delta: -14.7 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:43,588 INFO L168 Benchmark]: TraceAbstraction took 27452.99 ms. Allocated memory was 222.3 MB in the beginning and 967.3 MB in the end (delta: 745.0 MB). Free memory was 161.1 MB in the beginning and 863.1 MB in the end (delta: -702.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:06:43,597 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.16 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 997.92 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 84.8 MB in the beginning and 154.9 MB in the end (delta: -70.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 170.33 ms. Allocated memory is still 199.8 MB. Free memory was 154.9 MB in the beginning and 146.4 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1511.08 ms. Allocated memory was 199.8 MB in the beginning and 222.3 MB in the end (delta: 22.5 MB). Free memory was 146.4 MB in the beginning and 161.1 MB in the end (delta: -14.7 MB). Peak memory consumption was 81.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27452.99 ms. Allocated memory was 222.3 MB in the beginning and 967.3 MB in the end (delta: 745.0 MB). Free memory was 161.1 MB in the beginning and 863.1 MB in the end (delta: -702.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1766]: 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, 195 locations, 1 error locations. SAFE Result, 27.3s OverallTime, 64 OverallIterations, 18 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14848 SDtfs, 5346 SDslu, 18692 SDs, 0 SdLazy, 9922 SolverSat, 759 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 981 GetRequests, 792 SyntacticMatches, 37 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5296occurred in iteration=63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.1288343558282208 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 64 MinimizatonAttempts, 2844 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 11039 NumberOfCodeBlocks, 11039 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 10975 ConstructedInterpolants, 0 QuantifiedInterpolants, 5543234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 63 PerfectInterpolantSequences, 28767/28848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...