Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 13K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is CSRepetitions-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r225-ebro-152732379600113
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-00
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-01
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-02
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-03
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-04
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-05
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-06
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-07
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-08
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-09
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527622711053

19:38:35.947 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
19:38:35.950 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F(("((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)<=(((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3))")U("(requestBufferSlots_0>=3)"))))
Formula 0 simplified : !F("((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)<=(((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3))" U "(requestBufferSlots_0>=3)")
Reverse transition relation is NOT exact ! Due to transitions prepareRequest_0, prepareRequest_1, prepareRequest_2, prepareRequest_3, loseRequest_0, loseRequest_1, loseRequest_2, loseRequest_3, sendAnswer_0, sendAnswer_1, sendAnswer_2, sendAnswer_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2/12/14
Computing Next relation with stutter on 1 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 28 rows 23 cols
invariant :clientSending_2 + clientWaiting_2 = 1
invariant :clientSending_3 + clientWaiting_3 = 1
invariant :clientSending_0 + clientWaiting_0 = 1
invariant :serverWaiting_1 + serverAnwering_1 + serverAnwering_3 + serverAnwering_5 + serverAnwering_7 = 1
invariant :clientSending_1 + clientWaiting_1 = 1
invariant :serverWaiting_0 + serverAnwering_0 + serverAnwering_2 + serverAnwering_4 + serverAnwering_6 = 1
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
64 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.831946,24724,1,0,74,46684,54,71,642,57634,144
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X("((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)<=(((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3))"))))
Formula 1 simplified : !GX"((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)<=(((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
19 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.02841,27432,1,0,75,57702,66,72,691,73249,160
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X("((((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3)<=requestBufferSlots_0)")))
Formula 2 simplified : !X"((((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3)<=requestBufferSlots_0)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.02932,27684,1,0,75,57702,69,72,698,73249,162
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((F("((serverWaiting_0+serverWaiting_1)<=(((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3))"))U(X("(requestBufferSlots_0<=(((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3))")))))
Formula 3 simplified : !X(F"((serverWaiting_0+serverWaiting_1)<=(((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3))" U X"(requestBufferSlots_0<=(((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3))")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.03166,27832,1,0,75,57702,80,72,722,73249,169
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F("((((((((serverAnwering_0+serverAnwering_1)+serverAnwering_2)+serverAnwering_3)+serverAnwering_4)+serverAnwering_5)+serverAnwering_6)+serverAnwering_7)>=3)"))))
Formula 4 simplified : !GF"((((((((serverAnwering_0+serverAnwering_1)+serverAnwering_2)+serverAnwering_3)+serverAnwering_4)+serverAnwering_5)+serverAnwering_6)+serverAnwering_7)>=3)"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.04757,27832,1,0,75,57812,89,72,753,73402,177
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((F("((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)>=1)"))U(G("((serverWaiting_0+serverWaiting_1)>=1)")))))
Formula 5 simplified : !X(F"((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)>=1)" U G"((serverWaiting_0+serverWaiting_1)>=1)")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
24 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.289,31528,1,0,106,77442,95,113,758,97117,275
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("((((clientWaiting_0+clientWaiting_1)+clientWaiting_2)+clientWaiting_3)<=(((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3))")U(("((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)<=requestBufferSlots_0)")U("((serverWaiting_0+serverWaiting_1)>=1)"))))
Formula 6 simplified : !("((((clientWaiting_0+clientWaiting_1)+clientWaiting_2)+clientWaiting_3)<=(((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3))" U ("((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)<=requestBufferSlots_0)" U "((serverWaiting_0+serverWaiting_1)>=1)"))
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.29209,31928,1,0,106,77442,112,113,772,97117,281
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F((G("((((clientWaiting_0+clientWaiting_1)+clientWaiting_2)+clientWaiting_3)<=requestBufferSlots_0)"))U(F("((((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3)<=(((clientWaiting_0+clientWaiting_1)+clientWaiting_2)+clientWaiting_3))")))))
Formula 7 simplified : !F(G"((((clientWaiting_0+clientWaiting_1)+clientWaiting_2)+clientWaiting_3)<=requestBufferSlots_0)" U F"((((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3)<=(((clientWaiting_0+clientWaiting_1)+clientWaiting_2)+clientWaiting_3))")
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.29325,31928,1,0,106,77442,121,113,781,97117,285
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((F("((((((((serverAnwering_0+serverAnwering_1)+serverAnwering_2)+serverAnwering_3)+serverAnwering_4)+serverAnwering_5)+serverAnwering_6)+serverAnwering_7)<=(serverWaiting_0+serverWaiting_1))"))U(G("((((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3)>=1)")))))
Formula 8 simplified : !F(F"((((((((serverAnwering_0+serverAnwering_1)+serverAnwering_2)+serverAnwering_3)+serverAnwering_4)+serverAnwering_5)+serverAnwering_6)+serverAnwering_7)<=(serverWaiting_0+serverWaiting_1))" U G"((((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3)>=1)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
73 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.02604,41888,1,0,204,134488,134,203,804,170051,500
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(G(G(G("((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)<=(((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3))"))))))
Formula 9 simplified : !FG"((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)<=(((requestBuffer_0+requestBuffer_1)+requestBuffer_2)+requestBuffer_3))"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
90 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.92665,53236,1,0,273,202172,141,268,919,256092,655
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G((X("(requestBufferSlots_0>=2)"))U(G("((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)>=2)")))))
Formula 10 simplified : !G(X"(requestBufferSlots_0>=2)" U G"((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)>=2)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.99193,54192,1,0,277,205415,147,271,939,259285,677
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("((serverWaiting_0+serverWaiting_1)>=3)")))
Formula 11 simplified : !F"((serverWaiting_0+serverWaiting_1)>=3)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.00978,54456,1,0,277,205565,156,271,943,259569,724
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F((G("((((clientWaiting_0+clientWaiting_1)+clientWaiting_2)+clientWaiting_3)<=(serverWaiting_0+serverWaiting_1))"))U(G("((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)>=1)")))))
Formula 12 simplified : !F(G"((((clientWaiting_0+clientWaiting_1)+clientWaiting_2)+clientWaiting_3)<=(serverWaiting_0+serverWaiting_1))" U G"((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)>=1)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
80 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.80812,61536,1,0,356,243546,169,353,961,316160,912
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G(G(G("((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)<=(((((((serverAnwering_0+serverAnwering_1)+serverAnwering_2)+serverAnwering_3)+serverAnwering_4)+serverAnwering_5)+serverAnwering_6)+serverAnwering_7))"))))))
Formula 13 simplified : !FG"((((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3)<=(((((((serverAnwering_0+serverAnwering_1)+serverAnwering_2)+serverAnwering_3)+serverAnwering_4)+serverAnwering_5)+serverAnwering_6)+serverAnwering_7))"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
97 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.78428,74300,1,0,438,312877,182,427,1161,411373,1095
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(F("(requestBufferSlots_0>=2)"))))
Formula 14 simplified : !GF"(requestBufferSlots_0>=2)"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.79147,74300,1,0,439,313238,191,429,1163,411975,1106
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(X(X(F("((serverWaiting_0+serverWaiting_1)<=(((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3))"))))))
Formula 15 simplified : !FXXF"((serverWaiting_0+serverWaiting_1)<=(((clientSending_0+clientSending_1)+clientSending_2)+clientSending_3))"
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.80808,74564,1,0,455,314457,200,440,1183,413742,1144
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-02-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527622724047

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 29, 2018 7:38:35 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
May 29, 2018 7:38:35 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 29, 2018 7:38:35 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 29, 2018 7:38:36 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1283 ms
May 29, 2018 7:38:36 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 6 places.
May 29, 2018 7:38:36 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 29, 2018 7:38:36 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

May 29, 2018 7:38:36 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
May 29, 2018 7:38:36 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 29, 2018 7:38:36 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
May 29, 2018 7:38:36 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 104 ms
May 29, 2018 7:38:37 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 22 ms
May 29, 2018 7:38:37 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
May 29, 2018 7:38:38 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 14 transitions. Expanding to a total of 38 deterministic transitions.
May 29, 2018 7:38:38 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 5 ms.
May 29, 2018 7:38:38 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 16 ms
May 29, 2018 7:38:38 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 23 variables to be positive in 117 ms
May 29, 2018 7:38:38 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 28 transitions.
May 29, 2018 7:38:38 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/28 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 7:38:38 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 7:38:38 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 28 transitions.
May 29, 2018 7:38:38 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 7:38:42 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 28 transitions.
May 29, 2018 7:38:42 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/28) took 18 ms. Total solver calls (SAT/UNSAT): 6(5/1)
May 29, 2018 7:38:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 734 ms. Total solver calls (SAT/UNSAT): 98(42/56)
May 29, 2018 7:38:43 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 28 transitions.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:628)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 29, 2018 7:38:43 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 6200ms conformant to PINS in folder :/home/mcc/execution

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-COL-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstoolsl"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is CSRepetitions-COL-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r225-ebro-152732379600113"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;