fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r224-ebro-152732378800113
Last Updated
June 26, 2018

About the Execution of ITS-Tools for CSRepetitions-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15752.480 9708.00 22212.00 202.90 FFTTFFTTFFFFFFFT normal

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 itstools
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 r224-ebro-152732378800113
=====================================================================


--------------------
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 1527573485637

05:58:09.447 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
05:58:09.453 [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.201805151631/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.201805151631/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, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2/10/12
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
67 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.710598,25632,1,0,68,50941,50,69,638,65456,140
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
16 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.86663,27808,1,0,69,58896,62,70,687,79479,156
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,0.867422,28064,1,0,69,58896,65,70,694,79479,158
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
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,0.878207,28460,1,0,69,58896,76,70,718,79479,165
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,0.885031,28460,1,0,69,59342,85,70,740,79993,173
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
36 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.25152,33540,1,0,100,84167,91,111,745,114762,271
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
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.25515,34204,1,0,100,84167,108,111,759,114762,277
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
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.25641,34204,1,0,100,84167,117,111,768,114762,281
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
46 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.71721,43112,1,0,198,134967,130,201,791,187713,496
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
63 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.34449,56044,1,0,269,208405,137,269,906,286333,656
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
12 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.46695,57528,1,0,273,214752,143,272,926,292096,678
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
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,2.47596,57792,1,0,273,214830,152,272,930,292231,725
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
36 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.83567,65928,1,0,354,258086,165,356,948,357371,918
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
81 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.64931,79796,1,0,436,333582,178,430,1102,461160,1103
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,3.66015,80060,1,0,437,334577,187,432,1104,462447,1114
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
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.67183,80324,1,0,453,335912,196,443,1124,464223,1152
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]
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Could not compile executable .CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]

BK_STOP 1527573495345

--------------------
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/ -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/ -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 5:58:08 AM 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/, -smt]
May 29, 2018 5:58:08 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 29, 2018 5:58:08 AM 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 5:58:10 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1252 ms
May 29, 2018 5:58:10 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 6 places.
May 29, 2018 5:58:10 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 29, 2018 5:58:10 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

May 29, 2018 5:58:10 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
May 29, 2018 5:58:10 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 29, 2018 5:58:10 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 8 ms
May 29, 2018 5:58:10 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 63 ms
May 29, 2018 5:58:10 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
May 29, 2018 5:58:10 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
May 29, 2018 5:58:10 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 12 transitions. Expanding to a total of 34 deterministic transitions.
May 29, 2018 5:58:10 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 4 ms.
May 29, 2018 5:58:11 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 6 place invariants in 38 ms
May 29, 2018 5:58:11 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 23 variables to be positive in 295 ms
May 29, 2018 5:58:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 28 transitions.
May 29, 2018 5:58:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/28 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 5:58:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 29, 2018 5:58:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 28 transitions.
May 29, 2018 5:58:11 AM 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 5:58:13 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 28 transitions.
May 29, 2018 5:58:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 528 ms. Total solver calls (SAT/UNSAT): 98(42/56)
May 29, 2018 5:58:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 28 transitions.
May 29, 2018 5:58:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 259 ms. Total solver calls (SAT/UNSAT): 48(0/48)
May 29, 2018 5:58:14 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 4071ms conformant to PINS in folder :/home/mcc/execution
gcc: internal compiler error: Terminated (program cc1)
Please submit a full bug report,
with preprocessed source if appropriate.
See for instructions.
java.lang.RuntimeException: Could not compile executable .CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
at fr.lip6.move.gal.application.LTSminRunner.compilePINS(LTSminRunner.java:241)
at fr.lip6.move.gal.application.LTSminRunner.access$6(LTSminRunner.java:224)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:75)
at java.lang.Thread.run(Thread.java:748)

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="itstools"
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 itstools"
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 r224-ebro-152732378800113"
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 ;