fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r189-qhx2-152732140900099
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for Referendum-COL-0015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15738.160 31773.00 29973.00 431.20 FFFFTTFFTFFFFTFF 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 176K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.7K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Referendum-COL-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-qhx2-152732140900099
=====================================================================


--------------------
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 Referendum-COL-0015-LTLCardinality-00
FORMULA_NAME Referendum-COL-0015-LTLCardinality-01
FORMULA_NAME Referendum-COL-0015-LTLCardinality-02
FORMULA_NAME Referendum-COL-0015-LTLCardinality-03
FORMULA_NAME Referendum-COL-0015-LTLCardinality-04
FORMULA_NAME Referendum-COL-0015-LTLCardinality-05
FORMULA_NAME Referendum-COL-0015-LTLCardinality-06
FORMULA_NAME Referendum-COL-0015-LTLCardinality-07
FORMULA_NAME Referendum-COL-0015-LTLCardinality-08
FORMULA_NAME Referendum-COL-0015-LTLCardinality-09
FORMULA_NAME Referendum-COL-0015-LTLCardinality-10
FORMULA_NAME Referendum-COL-0015-LTLCardinality-11
FORMULA_NAME Referendum-COL-0015-LTLCardinality-12
FORMULA_NAME Referendum-COL-0015-LTLCardinality-13
FORMULA_NAME Referendum-COL-0015-LTLCardinality-14
FORMULA_NAME Referendum-COL-0015-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1528320205517

21:23:49.962 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
21:23:50.008 [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 : !(("(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=1)"))
Formula 0 simplified : !"(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 32768 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 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.108329,17080,1,0,23,3027,20,33,705,2731,65
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(G(F("(((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)<=((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14))")))))
Formula 1 simplified : !GF"(((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)<=((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14))"
Computing Next relation with stutter on 32768 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 31 rows 46 cols
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 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,0.359219,20432,1,0,51,13341,29,63,2188,19157,200
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G("(ready_0<=((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14))")))
Formula 2 simplified : !G"(ready_0<=((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14))"
Computing Next relation with stutter on 32768 deadlock states
3 unique states visited
3 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,0.365409,20672,1,0,51,13341,35,63,2222,19158,205
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(ready_0<=((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14))"))
Formula 3 simplified : !"(ready_0<=((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14))"
Computing Next relation with stutter on 32768 deadlock states
3 unique states visited
3 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,0.368483,20672,1,0,51,13341,38,63,2239,19158,207
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(F("(((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)>=2)")))U(X("(ready_0<=((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14))"))))
Formula 4 simplified : !(F"(((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)>=2)" U X"(ready_0<=((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14))")
invariant :voting_13 + voted_yes_13 + voted_no_13 + ready_0 = 1
Computing Next relation with stutter on 32768 deadlock states
3 unique states visited
0 strongly connected components in search stack
invariant :voting_1 + voted_yes_1 + voted_no_1 + ready_0 = 1
invariant :voting_11 + voted_yes_11 + voted_no_11 + ready_0 = 1
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,0.373419,20928,1,0,51,13341,46,63,2257,19158,214
invariant :voting_7 + voted_yes_7 + voted_no_7 + ready_0 = 1
no accepting run found
Formula 4 is TRUE no accepting run found.
invariant :voting_4 + voted_yes_4 + voted_no_4 + ready_0 = 1
invariant :voting_12 + voted_yes_12 + voted_no_12 + ready_0 = 1
FORMULA Referendum-COL-0015-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X("(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=1)")))
Formula 5 simplified : !X"(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=1)"
Computing Next relation with stutter on 32768 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
invariant :voting_10 + voted_yes_10 + voted_no_10 + ready_0 = 1
invariant :voting_3 + voted_yes_3 + voted_no_3 + ready_0 = 1
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.374572,20928,1,0,51,13341,46,63,2271,19158,216
invariant :voting_0 + voted_yes_0 + voted_no_0 + ready_0 = 1
invariant :voting_9 + voted_yes_9 + voted_no_9 + ready_0 = 1
invariant :voting_6 + voted_yes_6 + voted_no_6 + ready_0 = 1
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G("(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=3)")))
invariant :voting_2 + voted_yes_2 + voted_no_2 + ready_0 = 1
Formula 6 simplified : !G"(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=3)"
Computing Next relation with stutter on 32768 deadlock states
3 unique states visited
3 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
invariant :voting_14 + voted_yes_14 + voted_no_14 + ready_0 = 1
invariant :voting_5 + voted_yes_5 + voted_no_5 + ready_0 = 1
STATS,0,0.376523,20928,1,0,51,13341,52,63,2301,19158,221
invariant :voting_8 + voted_yes_8 + voted_no_8 + ready_0 = 1
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(F(F("(((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)<=((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14))")))))
Formula 7 simplified : !GF"(((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)<=((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14))"
Computing Next relation with stutter on 32768 deadlock states
19 unique states visited
19 strongly connected components in search stack
20 transitions explored
19 items max in DFS search stack
18 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.563749,22416,1,0,72,17861,61,78,3649,25387,285
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X("(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)<=((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14))"))))
Formula 8 simplified : !FX"(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)<=((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14))"
Computing Next relation with stutter on 32768 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
34 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.903285,26376,1,0,137,35862,70,123,4860,50010,436
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((F("(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=3)"))U(X("(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=2)")))))
Formula 9 simplified : !G(F"(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=3)" U X"(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=2)")
Computing Next relation with stutter on 32768 deadlock states
20 unique states visited
20 strongly connected components in search stack
21 transitions explored
20 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,0.924925,27020,1,0,139,35876,81,125,4983,50027,479
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F("(((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)>=3)")))
Formula 10 simplified : !F"(((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)>=3)"
Computing Next relation with stutter on 32768 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 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.00106,28340,1,0,211,44509,90,190,5038,65795,649
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(X(("(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=1)")U("(((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)>=2)")))))
Formula 11 simplified : !XX("(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=1)" U "(((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)>=2)")
Computing Next relation with stutter on 32768 deadlock states
19 unique states visited
19 strongly connected components in search stack
19 transitions explored
19 items max in DFS search stack
21 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.2014,31712,1,0,276,54525,100,243,5294,90313,835
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G("(((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)<=((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14))")))
Formula 12 simplified : !G"(((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)<=((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14))"
Computing Next relation with stutter on 32768 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
43 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.64166,35312,1,0,323,66650,106,289,7810,112288,951
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(G(X(F("(ready_0<=((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14))"))))))
Formula 13 simplified : !GXF"(ready_0<=((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14))"
Computing Next relation with stutter on 32768 deadlock states
33 unique states visited
0 strongly connected components in search stack
34 transitions explored
18 items max in DFS search stack
3 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.66614,35564,1,0,323,66650,115,289,7948,112288,1015
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((F("(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=2)"))U(X(X("(((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)<=ready_0)")))))
Formula 14 simplified : !(F"(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)>=2)" U XX"(((((((((((((((voted_no_0+voted_no_1)+voted_no_2)+voted_no_3)+voted_no_4)+voted_no_5)+voted_no_6)+voted_no_7)+voted_no_8)+voted_no_9)+voted_no_10)+voted_no_11)+voted_no_12)+voted_no_13)+voted_no_14)<=ready_0)")
Computing Next relation with stutter on 32768 deadlock states
8 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
6 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.72867,36652,1,0,367,69392,127,324,8195,119796,1112
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((F(G("(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)<=((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14))")))U(X(G("(((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)<=ready_0)")))))
Formula 15 simplified : !(FG"(((((((((((((((voting_0+voting_1)+voting_2)+voting_3)+voting_4)+voting_5)+voting_6)+voting_7)+voting_8)+voting_9)+voting_10)+voting_11)+voting_12)+voting_13)+voting_14)<=((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14))" U XG"(((((((((((((((voted_yes_0+voted_yes_1)+voted_yes_2)+voted_yes_3)+voted_yes_4)+voted_yes_5)+voted_yes_6)+voted_yes_7)+voted_yes_8)+voted_yes_9)+voted_yes_10)+voted_yes_11)+voted_yes_12)+voted_yes_13)+voted_yes_14)<=ready_0)")
Computing Next relation with stutter on 32768 deadlock states
44 unique states visited
16 strongly connected components in search stack
46 transitions explored
16 items max in DFS search stack
119 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.92681,52136,1,0,532,121996,146,508,11406,264113,1619
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-COL-0015-LTLCardinality-15 FALSE 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 1528320237290

--------------------
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
Jun 06, 2018 9:23:29 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]
Jun 06, 2018 9:23:29 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 9:23:29 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
Jun 06, 2018 9:23:52 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 22788 ms
Jun 06, 2018 9:23:52 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 4 places.
Jun 06, 2018 9:23:52 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 06, 2018 9:23:52 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Voters->voting,voted_yes,voted_no,
Dot->ready,

Jun 06, 2018 9:23:52 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 3 transitions.
Jun 06, 2018 9:23:52 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 06, 2018 9:23:52 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 5 ms
Jun 06, 2018 9:23:52 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 47 ms
Jun 06, 2018 9:23:52 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
Jun 06, 2018 9:23:52 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 7 ms
Jun 06, 2018 9:23:52 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 31 transitions.
Jun 06, 2018 9:23:53 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 15 place invariants in 66 ms
Jun 06, 2018 9:23:53 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 46 variables to be positive in 542 ms
Jun 06, 2018 9:23:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 31 transitions.
Jun 06, 2018 9:23:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/31 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 9:23:53 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)
Jun 06, 2018 9:23:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 31 transitions.
Jun 06, 2018 9:23:53 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 9:23:56 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
Jun 06, 2018 9:23:56 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Jun 06, 2018 9:23:56 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 0) 1) (= (store (store s0 0 (- (select s0 0) 1)) 15 (+ (select s0 15) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (>= (select s0 0) 1) (= (store (store s0 0 (- (select s0 0) 1)) 15 (+ (select s0 15) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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)
Jun 06, 2018 9:23:56 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 3394ms 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="Referendum-COL-0015"
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/Referendum-COL-0015.tgz
mv Referendum-COL-0015 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 Referendum-COL-0015, 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 r189-qhx2-152732140900099"
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 ;