RedisCI

Details for run #187 (err)

redis-unstable-valgrind (202c2eb)

Sat Aug 12 12:10:38 CEST 2017

Error in: tclsh8.5 tests/test_helper.tcl --valgrind --clients 1

@!/usr/bin/killall -9 memcheck-amd64-

memcheck-amd64: no process found
child process exited abnormally

@cd /ssd/ci/redis

Working dir is now '/ssd/ci/redis'

@git reset --hard

HEAD is now at b2ab1e0 Remove Lua state reference from buffers in lua_cmsgpack.

@git checkout unstable

Switched to branch 'unstable'
Your branch is up-to-date with 'origin/unstable'.

@git pull origin unstable

From git://github.com/antirez/redis
 * branch            unstable   -> FETCH_HEAD
Already up-to-date.

@make distclean

cd src && make distclean
make[1]: Entering directory '/ssd/ci/redis/src'
rm -rf redis-server redis-sentinel redis-cli redis-benchmark redis-check-rdb redis-check-aof *.o *.gcda *.gcno *.gcov redis.info lcov-html Makefile.dep dict-benchmark
(cd ../deps && make distclean)
make[2]: Entering directory '/ssd/ci/redis/deps'
(cd hiredis && make clean) > /dev/null || true
(cd linenoise && make clean) > /dev/null || true
(cd lua && make clean) > /dev/null || true
(cd jemalloc && [ -f Makefile ] && make distclean) > /dev/null || true
(rm -f .make-*)
make[2]: Leaving directory '/ssd/ci/redis/deps'
(rm -f .make-*)
make[1]: Leaving directory '/ssd/ci/redis/src'

@make OPTIMIZATION=-O0 MALLOC=libc

cd src && make all
make[1]: Entering directory '/ssd/ci/redis/src'
    CC Makefile.dep
rm -rf redis-server redis-sentinel redis-cli redis-benchmark redis-check-rdb redis-check-aof *.o *.gcda *.gcno *.gcov redis.info lcov-html Makefile.dep dict-benchmark
(cd ../deps && make distclean)
make[2]: Entering directory '/ssd/ci/redis/deps'
(cd hiredis && make clean) > /dev/null || true
(cd linenoise && make clean) > /dev/null || true
(cd lua && make clean) > /dev/null || true
(cd jemalloc && [ -f Makefile ] && make distclean) > /dev/null || true
(rm -f .make-*)
make[2]: Leaving directory '/ssd/ci/redis/deps'
(rm -f .make-*)
echo STD=-std=c99 -pedantic -DREDIS_STATIC='' >> .make-settings
echo WARN=-Wall -W -Wno-missing-field-initializers >> .make-settings
echo OPT=-O0 >> .make-settings
echo MALLOC=libc >> .make-settings
echo CFLAGS= >> .make-settings
echo LDFLAGS= >> .make-settings
echo REDIS_CFLAGS= >> .make-settings
echo REDIS_LDFLAGS= >> .make-settings
echo PREV_FINAL_CFLAGS=-std=c99 -pedantic -DREDIS_STATIC='' -Wall -W -Wno-missing-field-initializers -O0 -g -ggdb   -I../deps/hiredis -I../deps/linenoise -I../deps/lua/src >> .make-settings
echo PREV_FINAL_LDFLAGS=  -g -ggdb -rdynamic >> .make-settings
(cd ../deps && make hiredis linenoise lua)
make[2]: Entering directory '/ssd/ci/redis/deps'
(cd hiredis && make clean) > /dev/null || true
(cd linenoise && make clean) > /dev/null || true
(cd lua && make clean) > /dev/null || true
(cd jemalloc && [ -f Makefile ] && make distclean) > /dev/null || true
(rm -f .make-*)
(echo "" > .make-cflags)
(echo "" > .make-ldflags)
MAKE hiredis
cd hiredis && make static
make[3]: Entering directory '/ssd/ci/redis/deps/hiredis'
cc -std=c99 -pedantic -c -O0 -fPIC  -Wall -W -Wstrict-prototypes -Wwrite-strings -g -ggdb  net.c
cc -std=c99 -pedantic -c -O0 -fPIC  -Wall -W -Wstrict-prototypes -Wwrite-strings -g -ggdb  hiredis.c
cc -std=c99 -pedantic -c -O0 -fPIC  -Wall -W -Wstrict-prototypes -Wwrite-strings -g -ggdb  sds.c
cc -std=c99 -pedantic -c -O0 -fPIC  -Wall -W -Wstrict-prototypes -Wwrite-strings -g -ggdb  async.c
cc -std=c99 -pedantic -c -O0 -fPIC  -Wall -W -Wstrict-prototypes -Wwrite-strings -g -ggdb  read.c
ar rcs libhiredis.a net.o hiredis.o sds.o async.o read.o
make[3]: Leaving directory '/ssd/ci/redis/deps/hiredis'
MAKE linenoise
cd linenoise && make
make[3]: Entering directory '/ssd/ci/redis/deps/linenoise'
cc  -Wall -Os -g  -c linenoise.c
make[3]: Leaving directory '/ssd/ci/redis/deps/linenoise'
MAKE lua
cd lua/src && make all CFLAGS="-O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC='' " MYLDFLAGS="" AR="ar rcu"
make[3]: Entering directory '/ssd/ci/redis/deps/lua/src'
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lapi.o lapi.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lcode.o lcode.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o ldebug.o ldebug.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o ldo.o ldo.c
ldo.c: In function ‘f_parser’:
ldo.c:496:7: warning: unused variable ‘c’ [-Wunused-variable]
   int c = luaZ_lookahead(p->z);
       ^
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o ldump.o ldump.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lfunc.o lfunc.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lgc.o lgc.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o llex.o llex.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lmem.o lmem.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lobject.o lobject.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lopcodes.o lopcodes.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lparser.o lparser.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lstate.o lstate.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lstring.o lstring.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o ltable.o ltable.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o ltm.o ltm.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lundump.o lundump.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lvm.o lvm.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lzio.o lzio.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o strbuf.o strbuf.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o fpconv.o fpconv.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lauxlib.o lauxlib.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lbaselib.o lbaselib.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o ldblib.o ldblib.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o liolib.o liolib.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lmathlib.o lmathlib.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o loslib.o loslib.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o ltablib.o ltablib.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lstrlib.o lstrlib.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o loadlib.o loadlib.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o linit.o linit.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lua_cjson.o lua_cjson.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lua_struct.o lua_struct.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lua_cmsgpack.o lua_cmsgpack.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lua_bit.o lua_bit.c
ar rcu liblua.a lapi.o lcode.o ldebug.o ldo.o ldump.o lfunc.o lgc.o llex.o lmem.o lobject.o lopcodes.o lparser.o lstate.o lstring.o ltable.o ltm.o lundump.o lvm.o lzio.o strbuf.o fpconv.o lauxlib.o lbaselib.o ldblib.o liolib.o lmathlib.o loslib.o ltablib.o lstrlib.o loadlib.o linit.o lua_cjson.o lua_struct.o lua_cmsgpack.o lua_bit.o	# DLL needs all object files
ar: `u' modifier ignored since `D' is the default (see `U')
ranlib liblua.a
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o lua.o lua.c
cc -o lua  lua.o liblua.a -lm 
liblua.a(loslib.o): In function `os_tmpname':
loslib.c:(.text+0x28c): warning: the use of `tmpnam' is dangerous, better use `mkstemp'
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o luac.o luac.c
cc -O2 -Wall -DLUA_ANSI -DENABLE_CJSON_GLOBAL -DREDIS_STATIC=''    -c -o print.o print.c
cc -o luac  luac.o print.o liblua.a -lm 
make[3]: Leaving directory '/ssd/ci/redis/deps/lua/src'
make[2]: Leaving directory '/ssd/ci/redis/deps'
    CC adlist.o
    CC quicklist.o
    CC ae.o
    CC anet.o
    CC dict.o
    CC server.o
    CC sds.o
    CC zmalloc.o
    CC lzf_c.o
    CC lzf_d.o
    CC pqsort.o
    CC zipmap.o
    CC sha1.o
    CC ziplist.o
    CC release.o
    CC networking.o
    CC util.o
    CC object.o
    CC db.o
    CC replication.o
    CC rdb.o
    CC t_string.o
    CC t_list.o
    CC t_set.o
    CC t_zset.o
    CC t_hash.o
    CC config.o
    CC aof.o
    CC pubsub.o
    CC multi.o
    CC debug.o
    CC sort.o
    CC intset.o
    CC syncio.o
    CC cluster.o
    CC crc16.o
    CC endianconv.o
    CC slowlog.o
    CC scripting.o
    CC bio.o
    CC rio.o
    CC rand.o
    CC memtest.o
    CC crc64.o
    CC bitops.o
    CC sentinel.o
    CC notify.o
    CC setproctitle.o
    CC blocked.o
    CC hyperloglog.o
    CC latency.o
    CC sparkline.o
    CC redis-check-rdb.o
    CC redis-check-aof.o
    CC geo.o
    CC lazyfree.o
    CC module.o
    CC evict.o
    CC expire.o
    CC geohash.o
    CC geohash_helper.o
    CC childinfo.o
    CC defrag.o
    CC siphash.o
    CC rax.o
    LINK redis-server
    INSTALL redis-sentinel
    CC redis-cli.o
    LINK redis-cli
    CC redis-benchmark.o
    LINK redis-benchmark
    INSTALL redis-check-rdb
    INSTALL redis-check-aof

Hint: It's a good idea to run 'make test' ;)

make[1]: Leaving directory '/ssd/ci/redis/src'

@tclsh8.5 tests/test_helper.tcl --valgrind --clients 1


Cleanup: may take some time... OK
Starting test server at port 11111
[ready]: 14715
Testing unit/printver
Testing Redis version 999.999.999 (202c2ebe)
[1/46 done]: unit/printver (3 seconds)
Testing unit/dump
[ok]: DUMP / RESTORE are able to serialize / unserialize a simple key
[ok]: RESTORE can set an arbitrary expire to the materialized key
[ok]: RESTORE can set an expire that overflows a 32 bit integer
[ok]: RESTORE returns an error of the key already exists
[ok]: RESTORE can overwrite an existing key with REPLACE
[ok]: RESTORE can detect a syntax error for unrecongized options
[ok]: DUMP of non existing key returns nil
[ok]: MIGRATE is caching connections
[ok]: MIGRATE cached connections are released after some time
[ok]: MIGRATE is able to migrate a key between two instances
[ok]: MIGRATE is able to copy a key between two instances
[ok]: MIGRATE will not overwrite existing keys, unless REPLACE is used
[ok]: MIGRATE propagates TTL correctly
[ok]: MIGRATE can correctly transfer large values
[ok]: MIGRATE can correctly transfer hashes
[ok]: MIGRATE timeout actually works
[ok]: MIGRATE can migrate multiple keys at once
[ok]: MIGRATE with multiple keys must have empty key arg
[ok]: MIGRATE with mutliple keys migrate just existing ones
[ok]: MIGRATE with multiple keys: stress command rewriting
[ok]: MIGRATE with multiple keys: delete just ack keys
[2/46 done]: unit/dump (129 seconds)
Testing unit/auth
[ok]: AUTH fails if there is no password configured server side
[ok]: AUTH fails when a wrong password is given
[ok]: Arbitrary command gives an error when AUTH is required
[ok]: AUTH succeeds when the right password is given
[ok]: Once AUTH succeeded we can actually send commands to the server
[3/46 done]: unit/auth (4 seconds)
Testing unit/protocol
[ok]: Handle an empty query
[ok]: Negative multibulk length
[ok]: Out of range multibulk length
[ok]: Wrong multibulk payload header
[ok]: Negative multibulk payload length
[ok]: Out of range multibulk payload length
[ok]: Non-number multibulk payload length
[ok]: Multi bulk request not followed by bulk arguments
[ok]: Generic wrong number of args
[ok]: Unbalanced number of quotes
[ok]: Protocol desync regression test #1
[ok]: Protocol desync regression test #2
[ok]: Protocol desync regression test #3
[ok]: Regression for a crash with blocking ops and pipelining
[4/46 done]: unit/protocol (5 seconds)
Testing unit/keyspace
[ok]: DEL against a single item
[ok]: Vararg DEL
[ok]: KEYS with pattern
[ok]: KEYS to get all keys
[ok]: DBSIZE
[ok]: DEL all keys
[ok]: DEL against expired key
[ok]: EXISTS
[ok]: Zero length value in key. SET/GET/EXISTS
[ok]: Commands pipelining
[ok]: Non existing command
[ok]: RENAME basic usage
[ok]: RENAME source key should no longer exist
[ok]: RENAME against already existing key
[ok]: RENAMENX basic usage
[ok]: RENAMENX against already existing key
[ok]: RENAMENX against already existing key (2)
[ok]: RENAME against non existing source key
[ok]: RENAME where source and dest key are the same (existing)
[ok]: RENAMENX where source and dest key are the same (existing)
[ok]: RENAME where source and dest key are the same (non existing)
[ok]: RENAME with volatile key, should move the TTL as well
[ok]: RENAME with volatile key, should not inherit TTL of target key
[ok]: DEL all keys again (DB 0)
[ok]: DEL all keys again (DB 1)
[ok]: MOVE basic usage
[ok]: MOVE against key existing in the target DB
[ok]: MOVE against non-integer DB (#1428)
[ok]: MOVE can move key expire metadata as well
[ok]: MOVE does not create an expire if it does not exist
[ok]: SET/GET keys in different DBs
[ok]: RANDOMKEY
[ok]: RANDOMKEY against empty DB
[ok]: RANDOMKEY regression 1
[ok]: KEYS * two times with long key, Github issue #1208
[5/46 done]: unit/keyspace (4 seconds)
Testing unit/scan
[ok]: SCAN basic
[ok]: SCAN COUNT
[ok]: SCAN MATCH
[ok]: SSCAN with encoding intset
[ok]: SSCAN with encoding hashtable
[ok]: HSCAN with encoding ziplist
[ok]: HSCAN with encoding hashtable
[ok]: ZSCAN with encoding ziplist
[ok]: ZSCAN with encoding skiplist
[ok]: SCAN guarantees check under write load
[ok]: SSCAN with integer encoded object (issue #1345)
[ok]: SSCAN with PATTERN
[ok]: HSCAN with PATTERN
[ok]: ZSCAN with PATTERN
[ok]: ZSCAN scores: regression test for issue #2175
[6/46 done]: unit/scan (5 seconds)
Testing unit/type/string
[ok]: SET and GET an item
[ok]: SET and GET an empty item
[ok]: Very big payload in GET/SET
[ok]: Very big payload random access
[ok]: SET 10000 numeric keys and access all them in reverse order
[ok]: DBSIZE should be 10000 now
[ok]: SETNX target key missing
[ok]: SETNX target key exists
[ok]: SETNX against not-expired volatile key
[ok]: SETNX against expired volatile key
[ok]: MGET
[ok]: MGET against non existing key
[ok]: MGET against non-string key
[ok]: GETSET (set new value)
[ok]: GETSET (replace old value)
[ok]: MSET base case
[ok]: MSET wrong number of args
[ok]: MSETNX with already existent key
[ok]: MSETNX with not existing keys
[ok]: STRLEN against non-existing key
[ok]: STRLEN against integer-encoded value
[ok]: STRLEN against plain string
[ok]: SETBIT against non-existing key
[ok]: SETBIT against string-encoded key
[ok]: SETBIT against integer-encoded key
[ok]: SETBIT against key with wrong type
[ok]: SETBIT with out of range bit offset
[ok]: SETBIT with non-bit argument
[ok]: SETBIT fuzzing
[ok]: GETBIT against non-existing key
[ok]: GETBIT against string-encoded key
[ok]: GETBIT against integer-encoded key
[ok]: SETRANGE against non-existing key
[ok]: SETRANGE against string-encoded key
[ok]: SETRANGE against integer-encoded key
[ok]: SETRANGE against key with wrong type
[ok]: SETRANGE with out of range offset
[ok]: GETRANGE against non-existing key
[ok]: GETRANGE against string value
[ok]: GETRANGE against integer-encoded value
[ok]: GETRANGE fuzzing
[ok]: Extended SET can detect syntax errors
[ok]: Extended SET NX option
[ok]: Extended SET XX option
[ok]: Extended SET EX option
[ok]: Extended SET PX option
[ok]: Extended SET using multiple options at once
[ok]: GETRANGE with huge ranges, Github issue #1844
[7/46 done]: unit/type/string (30 seconds)
Testing unit/type/incr
[ok]: INCR against non existing key
[ok]: INCR against key created by incr itself
[ok]: INCR against key originally set with SET
[ok]: INCR over 32bit value
[ok]: INCRBY over 32bit value with over 32bit increment
[ok]: INCR fails against key with spaces (left)
[ok]: INCR fails against key with spaces (right)
[ok]: INCR fails against key with spaces (both)
[ok]: INCR fails against a key holding a list
[ok]: DECRBY over 32bit value with over 32bit increment, negative res
[ok]: INCR uses shared objects in the 0-9999 range
[ok]: INCR can modify objects in-place
[ok]: INCRBYFLOAT against non existing key
[ok]: INCRBYFLOAT against key originally set with SET
[ok]: INCRBYFLOAT over 32bit value
[ok]: INCRBYFLOAT over 32bit value with over 32bit increment
[ok]: INCRBYFLOAT fails against key with spaces (left)
[ok]: INCRBYFLOAT fails against key with spaces (right)
[ok]: INCRBYFLOAT fails against key with spaces (both)
[ok]: INCRBYFLOAT fails against a key holding a list
[ok]: INCRBYFLOAT does not allow NaN or Infinity
[ok]: INCRBYFLOAT decrement
[8/46 done]: unit/type/incr (3 seconds)
Testing unit/type/list
[ok]: LPUSH, RPUSH, LLENGTH, LINDEX, LPOP - ziplist
[ok]: LPUSH, RPUSH, LLENGTH, LINDEX, LPOP - regular list
[ok]: R/LPOP against empty list
[ok]: Variadic RPUSH/LPUSH
[ok]: DEL a list
[ok]: BLPOP, BRPOP: single existing list - linkedlist
[ok]: BLPOP, BRPOP: multiple existing lists - linkedlist
[ok]: BLPOP, BRPOP: second list has an entry - linkedlist
[ok]: BRPOPLPUSH - linkedlist
[ok]: BLPOP, BRPOP: single existing list - ziplist
[ok]: BLPOP, BRPOP: multiple existing lists - ziplist
[ok]: BLPOP, BRPOP: second list has an entry - ziplist
[ok]: BRPOPLPUSH - ziplist
[ok]: BLPOP, LPUSH + DEL should not awake blocked client
[ok]: BLPOP, LPUSH + DEL + SET should not awake blocked client
[ok]: BLPOP with same key multiple times should work (issue #801)
[ok]: MULTI/EXEC is isolated from the point of view of BLPOP
[ok]: BLPOP with variadic LPUSH
[ok]: BRPOPLPUSH with zero timeout should block indefinitely
[ok]: BRPOPLPUSH with a client BLPOPing the target list
[ok]: BRPOPLPUSH with wrong source type
[ok]: BRPOPLPUSH with wrong destination type
[ok]: BRPOPLPUSH maintains order of elements after failure
[ok]: BRPOPLPUSH with multiple blocked clients
[ok]: Linked BRPOPLPUSH
[ok]: Circular BRPOPLPUSH
[ok]: Self-referential BRPOPLPUSH
[ok]: BRPOPLPUSH inside a transaction
[ok]: PUSH resulting from BRPOPLPUSH affect WATCH
[ok]: BRPOPLPUSH does not affect WATCH while still blocked
[ok]: BRPOPLPUSH timeout
[ok]: BLPOP when new key is moved into place
[ok]: BLPOP when result key is created by SORT..STORE
[ok]: BLPOP: with single empty list argument
[ok]: BLPOP: with negative timeout
[ok]: BLPOP: with non-integer timeout
[ok]: BLPOP: with zero timeout should block indefinitely
[ok]: BLPOP: second argument is not a list
[ok]: BLPOP: timeout
[ok]: BLPOP: arguments are empty
[ok]: BRPOP: with single empty list argument
[ok]: BRPOP: with negative timeout
[ok]: BRPOP: with non-integer timeout
[ok]: BRPOP: with zero timeout should block indefinitely
[ok]: BRPOP: second argument is not a list
[ok]: BRPOP: timeout
[ok]: BRPOP: arguments are empty
[ok]: BLPOP inside a transaction
[ok]: LPUSHX, RPUSHX - generic
[ok]: LPUSHX, RPUSHX - linkedlist
[ok]: LINSERT - linkedlist
[ok]: LPUSHX, RPUSHX - ziplist
[ok]: LINSERT - ziplist
[ok]: LINSERT raise error on bad syntax
[ok]: LINDEX consistency test - quicklist
[ok]: LINDEX random access - quicklist
[ok]: Check if list is still ok after a DEBUG RELOAD - quicklist
[ok]: LINDEX consistency test - quicklist
[ok]: LINDEX random access - quicklist
[ok]: Check if list is still ok after a DEBUG RELOAD - quicklist
[ok]: LLEN against non-list value error
[ok]: LLEN against non existing key
[ok]: LINDEX against non-list value error
[ok]: LINDEX against non existing key
[ok]: LPUSH against non-list value error
[ok]: RPUSH against non-list value error
[ok]: RPOPLPUSH base case - linkedlist
[ok]: RPOPLPUSH with the same list as src and dst - linkedlist
[ok]: RPOPLPUSH with linkedlist source and existing target linkedlist
[ok]: RPOPLPUSH with linkedlist source and existing target ziplist
[ok]: RPOPLPUSH base case - ziplist
[ok]: RPOPLPUSH with the same list as src and dst - ziplist
[ok]: RPOPLPUSH with ziplist source and existing target linkedlist
[ok]: RPOPLPUSH with ziplist source and existing target ziplist
[ok]: RPOPLPUSH against non existing key
[ok]: RPOPLPUSH against non list src key
[ok]: RPOPLPUSH against non list dst key
[ok]: RPOPLPUSH against non existing src key
[ok]: Basic LPOP/RPOP - linkedlist
[ok]: Basic LPOP/RPOP - ziplist
[ok]: LPOP/RPOP against non list value
[ok]: Mass RPOP/LPOP - quicklist
[ok]: Mass RPOP/LPOP - quicklist
[ok]: LRANGE basics - linkedlist
[ok]: LRANGE inverted indexes - linkedlist
[ok]: LRANGE out of range indexes including the full list - linkedlist
[ok]: LRANGE out of range negative end index - linkedlist
[ok]: LRANGE basics - ziplist
[ok]: LRANGE inverted indexes - ziplist
[ok]: LRANGE out of range indexes including the full list - ziplist
[ok]: LRANGE out of range negative end index - ziplist
[ok]: LRANGE against non existing key
[ok]: LTRIM basics - linkedlist
[ok]: LTRIM out of range negative end index - linkedlist
[ok]: LTRIM basics - ziplist
[ok]: LTRIM out of range negative end index - ziplist
[ok]: LSET - linkedlist
[ok]: LSET out of range index - linkedlist
[ok]: LSET - ziplist
[ok]: LSET out of range index - ziplist
[ok]: LSET against non existing key
[ok]: LSET against non list value
[ok]: LREM remove all the occurrences - linkedlist
[ok]: LREM remove the first occurrence - linkedlist
[ok]: LREM remove non existing element - linkedlist
[ok]: LREM starting from tail with negative count - linkedlist
[ok]: LREM starting from tail with negative count (2) - linkedlist
[ok]: LREM deleting objects that may be int encoded - linkedlist
[ok]: LREM remove all the occurrences - ziplist
[ok]: LREM remove the first occurrence - ziplist
[ok]: LREM remove non existing element - ziplist
[ok]: LREM starting from tail with negative count - ziplist
[ok]: LREM starting from tail with negative count (2) - ziplist
[ok]: LREM deleting objects that may be int encoded - ziplist
[ok]: Regression for bug 593 - chaining BRPOPLPUSH with other blocking cmds
[9/46 done]: unit/type/list (19 seconds)
Testing unit/type/list-2
[ok]: LTRIM stress testing - linkedlist
[ok]: LTRIM stress testing - ziplist
[10/46 done]: unit/type/list-2 (81 seconds)
Testing unit/type/list-3
[ok]: Explicit regression for a list bug
[ok]: Regression for quicklist #3343 bug
[ok]: Stress tester for #3343-alike bugs
[ok]: ziplist implementation: value encoding and backlink
[ok]: ziplist implementation: encoding stress testing
[11/46 done]: unit/type/list-3 (137 seconds)
Testing unit/type/set
[ok]: SADD, SCARD, SISMEMBER, SMEMBERS basics - regular set
[ok]: SADD, SCARD, SISMEMBER, SMEMBERS basics - intset
[ok]: SADD against non set
[ok]: SADD a non-integer against an intset
[ok]: SADD an integer larger than 64 bits
[ok]: SADD overflows the maximum allowed integers in an intset
[ok]: Variadic SADD
[ok]: Set encoding after DEBUG RELOAD
[ok]: SREM basics - regular set
[ok]: SREM basics - intset
[ok]: SREM with multiple arguments
[ok]: SREM variadic version with more args needed to destroy the key
[ok]: Generated sets must be encoded as hashtable
[ok]: SINTER with two sets - hashtable
[ok]: SINTERSTORE with two sets - hashtable
[ok]: SINTERSTORE with two sets, after a DEBUG RELOAD - hashtable
[ok]: SUNION with two sets - hashtable
[ok]: SUNIONSTORE with two sets - hashtable
[ok]: SINTER against three sets - hashtable
[ok]: SINTERSTORE with three sets - hashtable
[ok]: SUNION with non existing keys - hashtable
[ok]: SDIFF with two sets - hashtable
[ok]: SDIFF with three sets - hashtable
[ok]: SDIFFSTORE with three sets - hashtable
[ok]: Generated sets must be encoded as intset
[ok]: SINTER with two sets - intset
[ok]: SINTERSTORE with two sets - intset
[ok]: SINTERSTORE with two sets, after a DEBUG RELOAD - intset
[ok]: SUNION with two sets - intset
[ok]: SUNIONSTORE with two sets - intset
[ok]: SINTER against three sets - intset
[ok]: SINTERSTORE with three sets - intset
[ok]: SUNION with non existing keys - intset
[ok]: SDIFF with two sets - intset
[ok]: SDIFF with three sets - intset
[ok]: SDIFFSTORE with three sets - intset
[ok]: SDIFF with first set empty
[ok]: SDIFF with same set two times
[ok]: SDIFF fuzzing
[ok]: SINTER against non-set should throw error
[ok]: SUNION against non-set should throw error
[ok]: SINTER should handle non existing key as empty
[ok]: SINTER with same integer elements but different encoding
[ok]: SINTERSTORE against non existing keys should delete dstkey
[ok]: SUNIONSTORE against non existing keys should delete dstkey
[ok]: SPOP basics - hashtable
[ok]: SPOP with =1 - hashtable
[ok]: SRANDMEMBER - hashtable
[ok]: SPOP basics - intset
[ok]: SPOP with =1 - intset
[ok]: SRANDMEMBER - intset
[ok]: SPOP with 
[ok]: SPOP with 
[ok]: SPOP using integers, testing Knuth's and Floyd's algorithm
[ok]: SPOP using integers with Knuth's algorithm
[ok]: SPOP new implementation: code path #1
[ok]: SPOP new implementation: code path #2
[ok]: SPOP new implementation: code path #3
[ok]: SRANDMEMBER with  against non existing key
[ok]: SRANDMEMBER with  - hashtable
[ok]: SRANDMEMBER with  - intset
[ok]: SMOVE basics - from regular set to intset
[ok]: SMOVE basics - from intset to regular set
[ok]: SMOVE non existing key
[ok]: SMOVE non existing src set
[ok]: SMOVE from regular set to non existing destination set
[ok]: SMOVE from intset to non existing destination set
[ok]: SMOVE wrong src key type
[ok]: SMOVE wrong dst key type
[ok]: SMOVE with identical source and destination
[ok]: intsets implementation stress testing
[12/46 done]: unit/type/set (33 seconds)
Testing unit/type/zset
[ok]: Check encoding - ziplist
[ok]: ZSET basic ZADD and score update - ziplist
[ok]: ZSET element can't be set to NaN with ZADD - ziplist
[ok]: ZSET element can't be set to NaN with ZINCRBY
[ok]: ZADD with options syntax error with incomplete pair
[ok]: ZADD XX option without key - ziplist
[ok]: ZADD XX existing key - ziplist
[ok]: ZADD XX returns the number of elements actually added
[ok]: ZADD XX updates existing elements score
[ok]: ZADD XX and NX are not compatible
[ok]: ZADD NX with non exisitng key
[ok]: ZADD NX only add new elements without updating old ones
[ok]: ZADD INCR works like ZINCRBY
[ok]: ZADD INCR works with a single score-elemenet pair
[ok]: ZADD CH option changes return value to all changed elements
[ok]: ZINCRBY calls leading to NaN result in error
[ok]: ZADD - Variadic version base case
[ok]: ZADD - Return value is the number of actually added items
[ok]: ZADD - Variadic version does not add nothing on single parsing err
[ok]: ZADD - Variadic version will raise error on missing arg
[ok]: ZINCRBY does not work variadic even if shares ZADD implementation
[ok]: ZCARD basics - ziplist
[ok]: ZREM removes key after last element is removed
[ok]: ZREM variadic version
[ok]: ZREM variadic version -- remove elements after key deletion
[ok]: ZRANGE basics - ziplist
[ok]: ZREVRANGE basics - ziplist
[ok]: ZRANK/ZREVRANK basics - ziplist
[ok]: ZRANK - after deletion - ziplist
[ok]: ZINCRBY - can create a new sorted set - ziplist
[ok]: ZINCRBY - increment and decrement - ziplist
[ok]: ZINCRBY return value
[ok]: ZRANGEBYSCORE/ZREVRANGEBYSCORE/ZCOUNT basics
[ok]: ZRANGEBYSCORE with WITHSCORES
[ok]: ZRANGEBYSCORE with LIMIT
[ok]: ZRANGEBYSCORE with LIMIT and WITHSCORES
[ok]: ZRANGEBYSCORE with non-value min or max
[ok]: ZRANGEBYLEX/ZREVRANGEBYLEX/ZCOUNT basics
[ok]: ZRANGEBYSLEX with LIMIT
[ok]: ZRANGEBYLEX with invalid lex range specifiers
[ok]: ZREMRANGEBYSCORE basics
[ok]: ZREMRANGEBYSCORE with non-value min or max
[ok]: ZREMRANGEBYRANK basics
[ok]: ZUNIONSTORE against non-existing key doesn't set destination - ziplist
[ok]: ZUNIONSTORE with empty set - ziplist
[ok]: ZUNIONSTORE basics - ziplist
[ok]: ZUNIONSTORE with weights - ziplist
[ok]: ZUNIONSTORE with a regular set and weights - ziplist
[ok]: ZUNIONSTORE with AGGREGATE MIN - ziplist
[ok]: ZUNIONSTORE with AGGREGATE MAX - ziplist
[ok]: ZINTERSTORE basics - ziplist
[ok]: ZINTERSTORE with weights - ziplist
[ok]: ZINTERSTORE with a regular set and weights - ziplist
[ok]: ZINTERSTORE with AGGREGATE MIN - ziplist
[ok]: ZINTERSTORE with AGGREGATE MAX - ziplist
[ok]: ZUNIONSTORE with +inf/-inf scores - ziplist
[ok]: ZUNIONSTORE with NaN weights ziplist
[ok]: ZINTERSTORE with +inf/-inf scores - ziplist
[ok]: ZINTERSTORE with NaN weights ziplist
[ok]: Check encoding - skiplist
[ok]: ZSET basic ZADD and score update - skiplist
[ok]: ZSET element can't be set to NaN with ZADD - skiplist
[ok]: ZSET element can't be set to NaN with ZINCRBY
[ok]: ZADD with options syntax error with incomplete pair
[ok]: ZADD XX option without key - skiplist
[ok]: ZADD XX existing key - skiplist
[ok]: ZADD XX returns the number of elements actually added
[ok]: ZADD XX updates existing elements score
[ok]: ZADD XX and NX are not compatible
[ok]: ZADD NX with non exisitng key
[ok]: ZADD NX only add new elements without updating old ones
[ok]: ZADD INCR works like ZINCRBY
[ok]: ZADD INCR works with a single score-elemenet pair
[ok]: ZADD CH option changes return value to all changed elements
[ok]: ZINCRBY calls leading to NaN result in error
[ok]: ZADD - Variadic version base case
[ok]: ZADD - Return value is the number of actually added items
[ok]: ZADD - Variadic version does not add nothing on single parsing err
[ok]: ZADD - Variadic version will raise error on missing arg
[ok]: ZINCRBY does not work variadic even if shares ZADD implementation
[ok]: ZCARD basics - skiplist
[ok]: ZREM removes key after last element is removed
[ok]: ZREM variadic version
[ok]: ZREM variadic version -- remove elements after key deletion
[ok]: ZRANGE basics - skiplist
[ok]: ZREVRANGE basics - skiplist
[ok]: ZRANK/ZREVRANK basics - skiplist
[ok]: ZRANK - after deletion - skiplist
[ok]: ZINCRBY - can create a new sorted set - skiplist
[ok]: ZINCRBY - increment and decrement - skiplist
[ok]: ZINCRBY return value
[ok]: ZRANGEBYSCORE/ZREVRANGEBYSCORE/ZCOUNT basics
[ok]: ZRANGEBYSCORE with WITHSCORES
[ok]: ZRANGEBYSCORE with LIMIT
[ok]: ZRANGEBYSCORE with LIMIT and WITHSCORES
[ok]: ZRANGEBYSCORE with non-value min or max
[ok]: ZRANGEBYLEX/ZREVRANGEBYLEX/ZCOUNT basics
[ok]: ZRANGEBYSLEX with LIMIT
[ok]: ZRANGEBYLEX with invalid lex range specifiers
[ok]: ZREMRANGEBYSCORE basics
[ok]: ZREMRANGEBYSCORE with non-value min or max
[ok]: ZREMRANGEBYRANK basics
[ok]: ZUNIONSTORE against non-existing key doesn't set destination - skiplist
[ok]: ZUNIONSTORE with empty set - skiplist
[ok]: ZUNIONSTORE basics - skiplist
[ok]: ZUNIONSTORE with weights - skiplist
[ok]: ZUNIONSTORE with a regular set and weights - skiplist
[ok]: ZUNIONSTORE with AGGREGATE MIN - skiplist
[ok]: ZUNIONSTORE with AGGREGATE MAX - skiplist
[ok]: ZINTERSTORE basics - skiplist
[ok]: ZINTERSTORE with weights - skiplist
[ok]: ZINTERSTORE with a regular set and weights - skiplist
[ok]: ZINTERSTORE with AGGREGATE MIN - skiplist
[ok]: ZINTERSTORE with AGGREGATE MAX - skiplist
[ok]: ZUNIONSTORE with +inf/-inf scores - skiplist
[ok]: ZUNIONSTORE with NaN weights skiplist
[ok]: ZINTERSTORE with +inf/-inf scores - skiplist
[ok]: ZINTERSTORE with NaN weights skiplist
[ok]: ZINTERSTORE regression with two sets, intset+hashtable
[ok]: ZUNIONSTORE regression, should not create NaN in scores
[ok]: ZINTERSTORE #516 regression, mixed sets and ziplist zsets
[ok]: ZUNIONSTORE result is sorted
[ok]: ZSCORE - ziplist
[ok]: ZSCORE after a DEBUG RELOAD - ziplist
[ok]: ZSET sorting stresser - ziplist
[ok]: ZRANGEBYSCORE fuzzy test, 100 ranges in 128 element sorted set - ziplist
[ok]: ZRANGEBYLEX fuzzy test, 100 ranges in 128 element sorted set - ziplist
[ok]: ZREMRANGEBYLEX fuzzy test, 100 ranges in 128 element sorted set - ziplist
[ok]: ZSETs skiplist implementation backlink consistency test - ziplist
[ok]: ZSETs ZRANK augmented skip list stress testing - ziplist
[ok]: ZSCORE - skiplist
[ok]: ZSCORE after a DEBUG RELOAD - skiplist
[ok]: ZSET sorting stresser - skiplist
[ok]: ZRANGEBYSCORE fuzzy test, 100 ranges in 100 element sorted set - skiplist
[ok]: ZRANGEBYLEX fuzzy test, 100 ranges in 100 element sorted set - skiplist
[ok]: ZREMRANGEBYLEX fuzzy test, 100 ranges in 100 element sorted set - skiplist
[ok]: ZSETs skiplist implementation backlink consistency test - skiplist
[ok]: ZSETs ZRANK augmented skip list stress testing - skiplist
[13/46 done]: unit/type/zset (73 seconds)
Testing unit/type/hash
[ok]: HSET/HLEN - Small hash creation
[ok]: Is the small hash encoded with a ziplist?
[ok]: HSET/HLEN - Big hash creation
[ok]: Is the big hash encoded with an hash table?
[ok]: HGET against the small hash
[ok]: HGET against the big hash
[ok]: HGET against non existing key
[ok]: HSET in update and insert mode
[ok]: HSETNX target key missing - small hash
[ok]: HSETNX target key exists - small hash
[ok]: HSETNX target key missing - big hash
[ok]: HSETNX target key exists - big hash
[ok]: HMSET wrong number of args
[ok]: HMSET - small hash
[ok]: HMSET - big hash
[ok]: HMGET against non existing key and fields
[ok]: HMGET against wrong type
[ok]: HMGET - small hash
[ok]: HMGET - big hash
[ok]: HKEYS - small hash
[ok]: HKEYS - big hash
[ok]: HVALS - small hash
[ok]: HVALS - big hash
[ok]: HGETALL - small hash
[ok]: HGETALL - big hash
[ok]: HDEL and return value
[ok]: HDEL - more than a single value
[ok]: HDEL - hash becomes empty before deleting all specified fields
[ok]: HEXISTS
[ok]: Is a ziplist encoded Hash promoted on big payload?
[ok]: HINCRBY against non existing database key
[ok]: HINCRBY against non existing hash key
[ok]: HINCRBY against hash key created by hincrby itself
[ok]: HINCRBY against hash key originally set with HSET
[ok]: HINCRBY over 32bit value
[ok]: HINCRBY over 32bit value with over 32bit increment
[ok]: HINCRBY fails against hash value with spaces (left)
[ok]: HINCRBY fails against hash value with spaces (right)
[ok]: HINCRBY can detect overflows
[ok]: HINCRBYFLOAT against non existing database key
[ok]: HINCRBYFLOAT against non existing hash key
[ok]: HINCRBYFLOAT against hash key created by hincrby itself
[ok]: HINCRBYFLOAT against hash key originally set with HSET
[ok]: HINCRBYFLOAT over 32bit value
[ok]: HINCRBYFLOAT over 32bit value with over 32bit increment
[ok]: HINCRBYFLOAT fails against hash value with spaces (left)
[ok]: HINCRBYFLOAT fails against hash value with spaces (right)
[ok]: HSTRLEN against the small hash
[ok]: HSTRLEN against the big hash
[ok]: HSTRLEN against non existing field
[ok]: HSTRLEN corner cases
[ok]: Hash ziplist regression test for large keys
[ok]: Hash fuzzing #1 - 10 fields
[ok]: Hash fuzzing #2 - 10 fields
[ok]: Hash fuzzing #1 - 512 fields
[ok]: Hash fuzzing #2 - 512 fields
[ok]: Stress test the hash ziplist -> hashtable encoding conversion
[14/46 done]: unit/type/hash (22 seconds)
Testing unit/sort
[ok]: Old Ziplist: SORT BY key
[ok]: Old Ziplist: SORT BY key with limit
[ok]: Old Ziplist: SORT BY hash field
[ok]: Old Linked list: SORT BY key
[ok]: Old Linked list: SORT BY key with limit
[ok]: Old Linked list: SORT BY hash field
[ok]: Old Big Linked list: SORT BY key
[ok]: Old Big Linked list: SORT BY key with limit
[ok]: Old Big Linked list: SORT BY hash field
[ok]: Intset: SORT BY key
[ok]: Intset: SORT BY key with limit
[ok]: Intset: SORT BY hash field
[ok]: Hash table: SORT BY key
[ok]: Hash table: SORT BY key with limit
[ok]: Hash table: SORT BY hash field
[ok]: Big Hash table: SORT BY key
[ok]: Big Hash table: SORT BY key with limit
[ok]: Big Hash table: SORT BY hash field
[ok]: SORT GET #
[ok]: SORT GET 
[ok]: SORT GET (key and hash) with sanity check
[ok]: SORT BY key STORE
[ok]: SORT BY hash field STORE
[ok]: SORT extracts STORE correctly
[ok]: SORT extracts multiple STORE correctly
[ok]: SORT DESC
[ok]: SORT ALPHA against integer encoded strings
[ok]: SORT sorted set
[ok]: SORT sorted set BY nosort should retain ordering
[ok]: SORT sorted set BY nosort + LIMIT
[ok]: SORT sorted set BY nosort works as expected from scripts
[ok]: SORT sorted set: +inf and -inf handling
[ok]: SORT regression for issue #19, sorting floats
[ok]: SORT with STORE returns zero if result is empty (github issue 224)
[ok]: SORT with STORE does not create empty lists (github issue 224)
[ok]: SORT with STORE removes key if result is empty (github issue 227)
[ok]: SORT with BY  and STORE should still order output
[ok]: SORT will complain with numerical sorting and bad doubles (1)
[ok]: SORT will complain with numerical sorting and bad doubles (2)
[ok]: SORT BY sub-sorts lexicographically if score is the same
[ok]: SORT GET with pattern ending with just -> does not get hash field
[ok]: SORT by nosort retains native order for lists
[ok]: SORT by nosort plus store retains native order for lists
[ok]: SORT by nosort with limit returns based on original list order
[ok]: SORT speed, 100 element list BY key, 100 times
[ok]: SORT speed, 100 element list BY hash field, 100 times
[ok]: SORT speed, 100 element list directly, 100 times
[ok]: SORT speed, 100 element list BY , 100 times
[15/46 done]: unit/sort (52 seconds)
Testing unit/expire
[ok]: EXPIRE - set timeouts multiple times
[ok]: EXPIRE - It should be still possible to read 'x'
[ok]: EXPIRE - After 2.1 seconds the key should no longer be here
[ok]: EXPIRE - write on expire should work
[ok]: EXPIREAT - Check for EXPIRE alike behavior
[ok]: SETEX - Set + Expire combo operation. Check for TTL
[ok]: SETEX - Check value
[ok]: SETEX - Overwrite old key
[ok]: SETEX - Wait for the key to expire
[ok]: SETEX - Wrong time parameter
[ok]: PERSIST can undo an EXPIRE
[ok]: PERSIST returns 0 against non existing or non volatile keys
[ok]: EXPIRE pricision is now the millisecond
[ok]: PEXPIRE/PSETEX/PEXPIREAT can set sub-second expires
[ok]: TTL returns tiem to live in seconds
[ok]: PTTL returns time to live in milliseconds
[ok]: TTL / PTTL return -1 if key has no expire
[ok]: TTL / PTTL return -2 if key does not exit
[ok]: Redis should actively expire keys incrementally
[ok]: Redis should lazy expire keys
[ok]: EXPIRE should not resurrect keys (issue #1026)
[ok]: 5 keys in, 5 keys out
[ok]: EXPIRE with empty string as TTL should report an error
[ok]: SET - use EX/PX option, TTL should not be reseted after loadaof
[16/46 done]: unit/expire (16 seconds)
Testing unit/other
[ok]: SAVE - make sure there are all the types as values
[ok]: FUZZ stresser with data model binary
[ok]: FUZZ stresser with data model alpha
[ok]: FUZZ stresser with data model compr
[ok]: BGSAVE
[ok]: SELECT an out of range DB
[ok]: Check consistency of different data types after a reload
[ok]: Same dataset digest if saving/reloading as AOF?
[ok]: EXPIRES after a reload (snapshot + append only file rewrite)
[ok]: EXPIRES after AOF reload (without rewrite)
[ok]: PIPELINING stresser (also a regression for the old epoll bug)
[ok]: APPEND basics
[ok]: APPEND basics, integer encoded values
[ok]: APPEND fuzzing
[ok]: FLUSHDB
[ok]: Perform a final SAVE to leave a clean DB on disk
[17/46 done]: unit/other (137 seconds)
Testing unit/multi
[ok]: MUTLI / EXEC basics
[ok]: DISCARD
[ok]: Nested MULTI are not allowed
[ok]: MULTI where commands alter argc/argv
[ok]: WATCH inside MULTI is not allowed
[ok]: EXEC fails if there are errors while queueing commands #1
[ok]: EXEC fails if there are errors while queueing commands #2
[ok]: If EXEC aborts, the client MULTI state is cleared
[ok]: EXEC works on WATCHed key not modified
[ok]: EXEC fail on WATCHed key modified (1 key of 1 watched)
[ok]: EXEC fail on WATCHed key modified (1 key of 5 watched)
[ok]: EXEC fail on WATCHed key modified by SORT with STORE even if the result is empty
[ok]: After successful EXEC key is no longer watched
[ok]: After failed EXEC key is no longer watched
[ok]: It is possible to UNWATCH
[ok]: UNWATCH when there is nothing watched works as expected
[ok]: FLUSHALL is able to touch the watched keys
[ok]: FLUSHALL does not touch non affected keys
[ok]: FLUSHDB is able to touch the watched keys
[ok]: FLUSHDB does not touch non affected keys
[ok]: WATCH is able to remember the DB a key belongs to
[ok]: WATCH will consider touched keys target of EXPIRE
[ok]: WATCH will not consider touched expired keys
[ok]: DISCARD should clear the WATCH dirty flag on the client
[ok]: DISCARD should UNWATCH all the keys
[ok]: MULTI / EXEC is propagated correctly (single write command)
[ok]: MULTI / EXEC is propagated correctly (empty transaction)
[ok]: MULTI / EXEC is propagated correctly (read-only commands)
[ok]: MULTI / EXEC is propagated correctly (write command, no effect)
[18/46 done]: unit/multi (4 seconds)
Testing unit/quit
[ok]: QUIT returns OK
[ok]: Pipelined commands after QUIT must not be executed
[ok]: Pipelined commands after QUIT that exceed read buffer size
[19/46 done]: unit/quit (3 seconds)
Testing unit/aofrw
[ok]: AOF rewrite during write load: RDB preamble=yes
[ok]: AOF rewrite during write load: RDB preamble=no
Waiting for process 15820 to exit...
[ok]: Turning off AOF kills the background writing child if any
[ok]: AOF rewrite of list with quicklist encoding, string data
[ok]: AOF rewrite of list with quicklist encoding, int data
[ok]: AOF rewrite of set with intset encoding, string data
[ok]: AOF rewrite of set with hashtable encoding, string data
[ok]: AOF rewrite of set with intset encoding, int data
[ok]: AOF rewrite of set with hashtable encoding, int data
[ok]: AOF rewrite of hash with ziplist encoding, string data
[ok]: AOF rewrite of hash with hashtable encoding, string data
[ok]: AOF rewrite of hash with ziplist encoding, int data
[ok]: AOF rewrite of hash with hashtable encoding, int data
[ok]: AOF rewrite of zset with ziplist encoding, string data
[ok]: AOF rewrite of zset with skiplist encoding, string data
[ok]: AOF rewrite of zset with ziplist encoding, int data
[ok]: AOF rewrite of zset with skiplist encoding, int data
[ok]: BGREWRITEAOF is delayed if BGSAVE is in progress
[ok]: BGREWRITEAOF is refused if already in progress
[err]: Valgrind error: ==15987== Memcheck, a memory error detector
==15987== Copyright (C) 2002-2015, and GNU GPL'd, by Julian Seward et al.
==15987== Using Valgrind-3.11.0 and LibVEX; rerun with -h for copyright info
==15987== Command: src/redis-server ./tests/tmp/redis.conf.14715.70
==15987== 
==15995== 
==15995== HEAP SUMMARY:
==15995==     in use at exit: 457,999 bytes in 11,715 blocks
==15995==   total heap usage: 12,344 allocs, 629 frees, 597,367 bytes allocated
==15995== 
==15995== LEAK SUMMARY:
==15995==    definitely lost: 0 bytes in 0 blocks
==15995==    indirectly lost: 0 bytes in 0 blocks
==15995==      possibly lost: 46,825 bytes in 493 blocks
==15995==    still reachable: 411,174 bytes in 11,222 blocks
==15995==                       of which reachable via heuristic:
==15995==                         length64           : 371,675 bytes in 10,739 blocks
==15995==         suppressed: 0 bytes in 0 blocks
==15995== Reachable blocks (those to which a pointer was found) are not shown.
==15995== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==15995== 
==15995== For counts of detected and suppressed errors, rerun with: -v
==15995== ERROR SUMMARY: 49 errors from 49 contexts (suppressed: 0 from 0)
==15996== 
==15996== Process terminating with default action of signal 10 (SIGUSR1)
==15996==    at 0x565B02B: ??? (syscall-template.S:84)
==15996==    by 0x55DDACD: _IO_file_open (fileops.c:221)
==15996==    by 0x55DDD34: _IO_file_fopen@@GLIBC_2.2.5 (fileops.c:328)
==15996==    by 0x55D1D33: __fopen_internal (iofopen.c:86)
==15996==    by 0x46F6D6: rewriteAppendOnlyFile (aof.c:1158)
==15996==    by 0x46FE6F: rewriteAppendOnlyFileBackground (aof.c:1352)
==15996==    by 0x4700DE: bgrewriteaofCommand (aof.c:1403)
==15996==    by 0x429D21: call (server.c:2202)
==15996==    by 0x471DAD: execCommand (multi.c:161)
==15996==    by 0x429D21: call (server.c:2202)
==15996==    by 0x42A894: processCommand (server.c:2482)
==15996==    by 0x43AC19: processInputBuffer (networking.c:1330)
==15996== 
==15996== HEAP SUMMARY:
==15996==     in use at exit: 465,980 bytes in 11,752 blocks
==15996==   total heap usage: 12,419 allocs, 667 frees, 659,691 bytes allocated
==15996== 
==15996== LEAK SUMMARY:
==15996==    definitely lost: 0 bytes in 0 blocks
==15996==    indirectly lost: 0 bytes in 0 blocks
==15996==      possibly lost: 46,912 bytes in 497 blocks
==15996==    still reachable: 419,068 bytes in 11,255 blocks
==15996==                       of which reachable via heuristic:
==15996==                         length64           : 379,017 bytes in 10,771 blocks
==15996==         suppressed: 0 bytes in 0 blocks
==15996== Reachable blocks (those to which a pointer was found) are not shown.
==15996== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==15996== 
==15996== For counts of detected and suppressed errors, rerun with: -v
==15996== ERROR SUMMARY: 51 errors from 51 contexts (suppressed: 0 from 0)
==15998== 
==15998== HEAP SUMMARY:
==15998==     in use at exit: 475,364 bytes in 11,781 blocks
==15998==   total heap usage: 26,508 allocs, 14,727 frees, 4,947,100 bytes allocated
==15998== 
==15998== LEAK SUMMARY:
==15998==    definitely lost: 0 bytes in 0 blocks
==15998==    indirectly lost: 0 bytes in 0 blocks
==15998==      possibly lost: 47,085 bytes in 507 blocks
==15998==    still reachable: 428,279 bytes in 11,274 blocks
==15998==                       of which reachable via heuristic:
==15998==                         length64           : 388,780 bytes in 10,791 blocks
==15998==         suppressed: 0 bytes in 0 blocks
==15998== Reachable blocks (those to which a pointer was found) are not shown.
==15998== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==15998== 
==15998== For counts of detected and suppressed errors, rerun with: -v
==15998== ERROR SUMMARY: 55 errors from 55 contexts (suppressed: 69 from 2)
==15999== 
==15999== HEAP SUMMARY:
==15999==     in use at exit: 473,866 bytes in 11,800 blocks
==15999==   total heap usage: 45,840 allocs, 34,040 frees, 13,372,071 bytes allocated
==15999== 
==15999== LEAK SUMMARY:
==15999==    definitely lost: 0 bytes in 0 blocks
==15999==    indirectly lost: 0 bytes in 0 blocks
==15999==      possibly lost: 47,196 bytes in 513 blocks
==15999==    still reachable: 426,670 bytes in 11,287 blocks
==15999==                       of which reachable via heuristic:
==15999==                         length64           : 387,171 bytes in 10,804 blocks
==15999==         suppressed: 0 bytes in 0 blocks
==15999== Reachable blocks (those to which a pointer was found) are not shown.
==15999== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==15999== 
==15999== For counts of detected and suppressed errors, rerun with: -v
==15999== ERROR SUMMARY: 55 errors from 55 contexts (suppressed: 104 from 2)
==16000== 
==16000== HEAP SUMMARY:
==16000==     in use at exit: 467,358 bytes in 11,841 blocks
==16000==   total heap usage: 51,302 allocs, 39,461 frees, 17,582,748 bytes allocated
==16000== 
==16000== LEAK SUMMARY:
==16000==    definitely lost: 0 bytes in 0 blocks
==16000==    indirectly lost: 0 bytes in 0 blocks
==16000==      possibly lost: 47,501 bytes in 529 blocks
==16000==    still reachable: 419,857 bytes in 11,312 blocks
==16000==                       of which reachable via heuristic:
==16000==                         length64           : 380,358 bytes in 10,829 blocks
==16000==         suppressed: 0 bytes in 0 blocks
==16000== Reachable blocks (those to which a pointer was found) are not shown.
==16000== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16000== 
==16000== For counts of detected and suppressed errors, rerun with: -v
==16000== ERROR SUMMARY: 56 errors from 56 contexts (suppressed: 139 from 2)
==16001== 
==16001== HEAP SUMMARY:
==16001==     in use at exit: 522,290 bytes in 13,697 blocks
==16001==   total heap usage: 65,844 allocs, 52,147 frees, 18,290,619 bytes allocated
==16001== 
==16001== LEAK SUMMARY:
==16001==    definitely lost: 0 bytes in 0 blocks
==16001==    indirectly lost: 0 bytes in 0 blocks
==16001==      possibly lost: 64,654 bytes in 1,456 blocks
==16001==    still reachable: 457,636 bytes in 12,241 blocks
==16001==                       of which reachable via heuristic:
==16001==                         length64           : 418,137 bytes in 11,758 blocks
==16001==         suppressed: 0 bytes in 0 blocks
==16001== Reachable blocks (those to which a pointer was found) are not shown.
==16001== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16001== 
==16001== For counts of detected and suppressed errors, rerun with: -v
==16001== ERROR SUMMARY: 56 errors from 56 contexts (suppressed: 174 from 2)
==16002== 
==16002== HEAP SUMMARY:
==16002==     in use at exit: 467,486 bytes in 11,846 blocks
==16002==   total heap usage: 70,966 allocs, 59,120 frees, 18,544,617 bytes allocated
==16002== 
==16002== LEAK SUMMARY:
==16002==    definitely lost: 0 bytes in 0 blocks
==16002==    indirectly lost: 0 bytes in 0 blocks
==16002==      possibly lost: 47,455 bytes in 527 blocks
==16002==    still reachable: 420,031 bytes in 11,319 blocks
==16002==                       of which reachable via heuristic:
==16002==                         length64           : 380,532 bytes in 10,836 blocks
==16002==         suppressed: 0 bytes in 0 blocks
==16002== Reachable blocks (those to which a pointer was found) are not shown.
==16002== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16002== 
==16002== For counts of detected and suppressed errors, rerun with: -v
==16002== ERROR SUMMARY: 55 errors from 55 contexts (suppressed: 209 from 2)
==16003== 
==16003== HEAP SUMMARY:
==16003==     in use at exit: 527,889 bytes in 13,862 blocks
==16003==   total heap usage: 86,660 allocs, 72,798 frees, 20,328,465 bytes allocated
==16003== 
==16003== LEAK SUMMARY:
==16003==    definitely lost: 0 bytes in 0 blocks
==16003==    indirectly lost: 0 bytes in 0 blocks
==16003==      possibly lost: 67,234 bytes in 1,531 blocks
==16003==    still reachable: 460,655 bytes in 12,331 blocks
==16003==                       of which reachable via heuristic:
==16003==                         length64           : 421,156 bytes in 11,848 blocks
==16003==         suppressed: 0 bytes in 0 blocks
==16003== Reachable blocks (those to which a pointer was found) are not shown.
==16003== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16003== 
==16003== For counts of detected and suppressed errors, rerun with: -v
==16003== ERROR SUMMARY: 57 errors from 57 contexts (suppressed: 244 from 2)
==16004== 
==16004== HEAP SUMMARY:
==16004==     in use at exit: 468,947 bytes in 11,888 blocks
==16004==   total heap usage: 92,666 allocs, 80,778 frees, 21,684,284 bytes allocated
==16004== 
==16004== LEAK SUMMARY:
==16004==    definitely lost: 0 bytes in 0 blocks
==16004==    indirectly lost: 0 bytes in 0 blocks
==16004==      possibly lost: 47,677 bytes in 539 blocks
==16004==    still reachable: 421,270 bytes in 11,349 blocks
==16004==                       of which reachable via heuristic:
==16004==                         length64           : 381,771 bytes in 10,866 blocks
==16004==         suppressed: 0 bytes in 0 blocks
==16004== Reachable blocks (those to which a pointer was found) are not shown.
==16004== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16004== 
==16004== For counts of detected and suppressed errors, rerun with: -v
==16004== ERROR SUMMARY: 55 errors from 55 contexts (suppressed: 279 from 2)
==16005== 
==16005== HEAP SUMMARY:
==16005==     in use at exit: 540,646 bytes in 14,656 blocks
==16005==   total heap usage: 111,633 allocs, 96,977 frees, 28,253,920 bytes allocated
==16005== 
==16005== LEAK SUMMARY:
==16005==    definitely lost: 0 bytes in 0 blocks
==16005==    indirectly lost: 0 bytes in 0 blocks
==16005==      possibly lost: 81,467 bytes in 2,377 blocks
==16005==    still reachable: 459,179 bytes in 12,279 blocks
==16005==                       of which reachable via heuristic:
==16005==                         length64           : 419,680 bytes in 11,796 blocks
==16005==         suppressed: 0 bytes in 0 blocks
==16005== Reachable blocks (those to which a pointer was found) are not shown.
==16005== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16005== 
==16005== For counts of detected and suppressed errors, rerun with: -v
==16005== ERROR SUMMARY: 62 errors from 62 contexts (suppressed: 314 from 2)
==16008== 
==16008== HEAP SUMMARY:
==16008==     in use at exit: 470,095 bytes in 11,924 blocks
==16008==   total heap usage: 121,393 allocs, 109,469 frees, 34,221,803 bytes allocated
==16008== 
==16008== LEAK SUMMARY:
==16008==    definitely lost: 0 bytes in 0 blocks
==16008==    indirectly lost: 0 bytes in 0 blocks
==16008==      possibly lost: 47,862 bytes in 549 blocks
==16008==    still reachable: 422,233 bytes in 11,375 blocks
==16008==                       of which reachable via heuristic:
==16008==                         length64           : 382,734 bytes in 10,892 blocks
==16008==         suppressed: 0 bytes in 0 blocks
==16008== Reachable blocks (those to which a pointer was found) are not shown.
==16008== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16008== 
==16008== For counts of detected and suppressed errors, rerun with: -v
==16008== ERROR SUMMARY: 55 errors from 55 contexts (suppressed: 349 from 2)
==16009== 
==16009== HEAP SUMMARY:
==16009==     in use at exit: 550,240 bytes in 14,941 blocks
==16009==   total heap usage: 140,658 allocs, 125,717 frees, 39,324,883 bytes allocated
==16009== 
==16009== LEAK SUMMARY:
==16009==    definitely lost: 0 bytes in 0 blocks
==16009==    indirectly lost: 0 bytes in 0 blocks
==16009==      possibly lost: 87,420 bytes in 2,553 blocks
==16009==    still reachable: 462,820 bytes in 12,388 blocks
==16009==                       of which reachable via heuristic:
==16009==                         length64           : 423,321 bytes in 11,905 blocks
==16009==         suppressed: 0 bytes in 0 blocks
==16009== Reachable blocks (those to which a pointer was found) are not shown.
==16009== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16009== 
==16009== For counts of detected and suppressed errors, rerun with: -v
==16009== ERROR SUMMARY: 59 errors from 59 contexts (suppressed: 384 from 2)
==16010== 
==16010== HEAP SUMMARY:
==16010==     in use at exit: 472,141 bytes in 11,982 blocks
==16010==   total heap usage: 151,180 allocs, 139,198 frees, 43,796,342 bytes allocated
==16010== 
==16010== LEAK SUMMARY:
==16010==    definitely lost: 0 bytes in 0 blocks
==16010==    indirectly lost: 0 bytes in 0 blocks
==16010==      possibly lost: 48,158 bytes in 565 blocks
==16010==    still reachable: 423,983 bytes in 11,417 blocks
==16010==                       of which reachable via heuristic:
==16010==                         length64           : 384,484 bytes in 10,934 blocks
==16010==         suppressed: 0 bytes in 0 blocks
==16010== Reachable blocks (those to which a pointer was found) are not shown.
==16010== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16010== 
==16010== For counts of detected and suppressed errors, rerun with: -v
==16010== ERROR SUMMARY: 55 errors from 55 contexts (suppressed: 419 from 2)
==16011== 
==16011== HEAP SUMMARY:
==16011==     in use at exit: 578,229 bytes in 14,807 blocks
==16011==   total heap usage: 168,534 allocs, 153,727 frees, 45,275,643 bytes allocated
==16011== 
==16011== LEAK SUMMARY:
==16011==    definitely lost: 0 bytes in 0 blocks
==16011==    indirectly lost: 0 bytes in 0 blocks
==16011==      possibly lost: 65,807 bytes in 1,504 blocks
==16011==    still reachable: 512,422 bytes in 13,303 blocks
==16011==                       of which reachable via heuristic:
==16011==                         length64           : 472,923 bytes in 12,820 blocks
==16011==         suppressed: 0 bytes in 0 blocks
==16011== Reachable blocks (those to which a pointer was found) are not shown.
==16011== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16011== 
==16011== For counts of detected and suppressed errors, rerun with: -v
==16011== ERROR SUMMARY: 58 errors from 58 contexts (suppressed: 454 from 2)
==16012== 
==16012== HEAP SUMMARY:
==16012==     in use at exit: 473,478 bytes in 12,024 blocks
==16012==   total heap usage: 175,809 allocs, 163,785 frees, 46,200,283 bytes allocated
==16012== 
==16012== LEAK SUMMARY:
==16012==    definitely lost: 0 bytes in 0 blocks
==16012==    indirectly lost: 0 bytes in 0 blocks
==16012==      possibly lost: 48,380 bytes in 577 blocks
==16012==    still reachable: 425,098 bytes in 11,447 blocks
==16012==                       of which reachable via heuristic:
==16012==                         length64           : 385,599 bytes in 10,964 blocks
==16012==         suppressed: 0 bytes in 0 blocks
==16012== Reachable blocks (those to which a pointer was found) are not shown.
==16012== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16012== 
==16012== For counts of detected and suppressed errors, rerun with: -v
==16012== ERROR SUMMARY: 55 errors from 55 contexts (suppressed: 489 from 2)
==16013== 
==16013== HEAP SUMMARY:
==16013==     in use at exit: 587,574 bytes in 15,044 blocks
==16013==   total heap usage: 193,285 allocs, 178,241 frees, 47,626,197 bytes allocated
==16013== 
==16013== LEAK SUMMARY:
==16013==    definitely lost: 0 bytes in 0 blocks
==16013==    indirectly lost: 0 bytes in 0 blocks
==16013==      possibly lost: 68,158 bytes in 1,581 blocks
==16013==    still reachable: 519,416 bytes in 13,463 blocks
==16013==                       of which reachable via heuristic:
==16013==                         length64           : 479,917 bytes in 12,980 blocks
==16013==         suppressed: 0 bytes in 0 blocks
==16013== Reachable blocks (those to which a pointer was found) are not shown.
==16013== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16013== 
==16013== For counts of detected and suppressed errors, rerun with: -v
==16013== ERROR SUMMARY: 57 errors from 57 contexts (suppressed: 524 from 2)
==16014== 
==16014== HEAP SUMMARY:
==16014==     in use at exit: 588,716 bytes in 15,066 blocks
==16014==   total heap usage: 200,867 allocs, 185,801 frees, 48,506,814 bytes allocated
==16014== 
==16014== LEAK SUMMARY:
==16014==    definitely lost: 0 bytes in 0 blocks
==16014==    indirectly lost: 0 bytes in 0 blocks
==16014==      possibly lost: 68,220 bytes in 1,584 blocks
==16014==    still reachable: 520,496 bytes in 13,482 blocks
==16014==                       of which reachable via heuristic:
==16014==                         length64           : 480,997 bytes in 12,999 blocks
==16014==         suppressed: 0 bytes in 0 blocks
==16014== Reachable blocks (those to which a pointer was found) are not shown.
==16014== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==16014== 
==16014== For counts of detected and suppressed errors, rerun with: -v
==16014== ERROR SUMMARY: 56 errors from 56 contexts (suppressed: 593 from 2)
==15987== 
==15987== HEAP SUMMARY:
==15987==     in use at exit: 589,378 bytes in 15,065 blocks
==15987==   total heap usage: 200,942 allocs, 185,877 frees, 48,644,375 bytes allocated
==15987== 
==15987== LEAK SUMMARY:
==15987==    definitely lost: 0 bytes in 0 blocks
==15987==    indirectly lost: 0 bytes in 0 blocks
==15987==      possibly lost: 69,073 bytes in 1,589 blocks
==15987==    still reachable: 520,305 bytes in 13,476 blocks
==15987==                       of which reachable via heuristic:
==15987==                         length64           : 480,806 bytes in 12,993 blocks
==15987==         suppressed: 0 bytes in 0 blocks
==15987== Reachable blocks (those to which a pointer was found) are not shown.
==15987== To see them, rerun with: --leak-check=full --show-leak-kinds=all
==15987== 
==15987== For counts of detected and suppressed errors, rerun with: -v
==15987== ERROR SUMMARY: 57 errors from 57 contexts (suppressed: 594 from 3)


[20/46 done]: unit/aofrw (137 seconds)
Testing integration/replication
[ok]: Slave enters handshake
[ok]: Slave is able to detect timeout during handshake
[ok]: Set instance A as slave of B
[ok]: BRPOPLPUSH replication, when blocking against empty list
[ok]: BRPOPLPUSH replication, list exists
[ok]: BLPOP followed by role change, issue #2473
[ok]: Second server should have role master at first
[ok]: SLAVEOF should start with link status "down"
[ok]: The role should immediately be changed to "slave"
[ok]: Sync should have transferred keys from master
[ok]: The link status should be up
[ok]: SET on the master should immediately propagate
[ok]: FLUSHALL should replicate
[ok]: ROLE in master reports master with a slave
[ok]: ROLE in slave reports slave in connected state
[ok]: Connect multiple slaves at the same time (issue #141), diskless=no
Waiting for process 16231 to exit...
Waiting for process 16222 to exit...
Waiting for process 16213 to exit...
Waiting for process 16199 to exit...
[ok]: Connect multiple slaves at the same time (issue #141), diskless=yes
Waiting for process 16717 to exit...
Waiting for process 16708 to exit...
Waiting for process 16699 to exit...
Waiting for process 16685 to exit...
[21/46 done]: integration/replication (290 seconds)
Testing integration/replication-2
[ok]: First server should have role slave after SLAVEOF

Logged warnings (pid 17225):
(none)


Logged warnings (pid 17216):
(none)

[exception]: Executing test client: NOREPLICAS Not enough good slaves to write..
NOREPLICAS Not enough good slaves to write.
    while executing
"[srv $level "client"] {*}$args"
    (procedure "r" line 7)
    invoked from within
"r set foo 12345"
    ("uplevel" body line 4)
    invoked from within
"uplevel 1 $code"
    (procedure "test" line 29)
    invoked from within
"test {If min-slaves-to-write is honored, write is accepted} {
            r config set min-slaves-to-write 1
            r config set min-slaves-max-l..."
    ("uplevel" body line 8)
    invoked from within
"uplevel 1 $code "
    (procedure "start_server" line 3)
    invoked from within
"start_server {} {
        test {First server should have role slave after SLAVEOF} {
            r -1 slaveof [srv 0 host] [srv 0 port]
            af..."
    ("uplevel" body line 2)
    invoked from within
"uplevel 1 $code "
    (procedure "start_server" line 3)
    invoked from within
"start_server {tags {"repl"}} {
    start_server {} {
        test {First server should have role slave after SLAVEOF} {
            r -1 slaveof [srv ..."
    (file "tests/integration/replication-2.tcl" line 1)
    invoked from within
"source $path"
    (procedure "execute_tests" line 4)
    invoked from within
"execute_tests $data"
    (procedure "test_client_main" line 10)
    invoked from within
"test_client_main $::test_server_port "
child process exited abnormally