About the Execution of ITS-Tools for Referendum-PT-0015
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
329.030 | 4248.00 | 6366.00 | 337.20 | FFFTFTFFFFTTTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r140-smll-155284912600213.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3817
Executing tool itstools
Input is Referendum-PT-0015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-smll-155284912600213
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 11K Feb 12 12:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 12 12:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 8 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 8 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.8K Feb 5 01:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 01:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 4 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 4 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 1 11:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 1 11:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 16K Mar 10 17:31 model.pnml
--------------------
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-PT-0015-LTLCardinality-00
FORMULA_NAME Referendum-PT-0015-LTLCardinality-01
FORMULA_NAME Referendum-PT-0015-LTLCardinality-02
FORMULA_NAME Referendum-PT-0015-LTLCardinality-03
FORMULA_NAME Referendum-PT-0015-LTLCardinality-04
FORMULA_NAME Referendum-PT-0015-LTLCardinality-05
FORMULA_NAME Referendum-PT-0015-LTLCardinality-06
FORMULA_NAME Referendum-PT-0015-LTLCardinality-07
FORMULA_NAME Referendum-PT-0015-LTLCardinality-08
FORMULA_NAME Referendum-PT-0015-LTLCardinality-09
FORMULA_NAME Referendum-PT-0015-LTLCardinality-10
FORMULA_NAME Referendum-PT-0015-LTLCardinality-11
FORMULA_NAME Referendum-PT-0015-LTLCardinality-12
FORMULA_NAME Referendum-PT-0015-LTLCardinality-13
FORMULA_NAME Referendum-PT-0015-LTLCardinality-14
FORMULA_NAME Referendum-PT-0015-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552979678541
Working with output stream class java.io.PrintStream
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.201903111103/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.201903111103/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 : !((X("(((((((((((((((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)+voted_yes_15)>=3)")))
Formula 0 simplified : !X"(((((((((((((((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)+voted_yes_15)>=3)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 32768 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.036936,17052,1,0,23,3223,20,32,707,2872,65
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(X("(((((((((((((((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)+voting_15)>=1)"))))
Formula 1 simplified : !GX"(((((((((((((((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)+voting_15)>=1)"
Computing Next relation with stutter on 32768 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.064107,17924,1,0,51,5249,26,64,946,7477,148
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(("(((((((((((((((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_no_15)>=2)"))
Formula 2 simplified : !"(((((((((((((((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_no_15)>=2)"
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.06543,18188,1,0,51,5249,29,66,962,7487,158
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("(ready>=1)"))
Formula 3 simplified : !"(ready>=1)"
Computing Next relation with stutter on 32768 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,0.065709,18188,1,0,51,5249,32,66,963,7487,160
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("(ready<=((((((((((((((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)+voted_yes_15))"))
Formula 4 simplified : !"(ready<=((((((((((((((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)+voted_yes_15))"
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.066473,18188,1,0,51,5249,35,66,980,7487,162
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(G(G(X("(ready<=((((((((((((((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_no_15))"))))))
Formula 5 simplified : !GX"(ready<=((((((((((((((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_no_15))"
Computing Next relation with stutter on 32768 deadlock states
17 unique states visited
0 strongly connected components in search stack
17 transitions explored
17 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.093814,18452,1,0,51,5249,41,78,1222,8657,272
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G("(((((((((((((((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)+voted_yes_15)<=((((((((((((((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)+voting_15))")))
Formula 6 simplified : !G"(((((((((((((((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)+voted_yes_15)<=((((((((((((((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)+voting_15))"
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
invariant :voting_2 + -1'voting_15 + voted_yes_2 + -1'voted_yes_15 + voted_no_2 + -1'voted_no_15 = 0
invariant :voting_14 + -1'voting_15 + voted_yes_14 + -1'voted_yes_15 + voted_no_14 + -1'voted_no_15 = 0
invariant :voting_7 + -1'voting_15 + voted_yes_7 + -1'voted_yes_15 + voted_no_7 + -1'voted_no_15 = 0
invariant :voting_6 + -1'voting_15 + voted_yes_6 + -1'voted_yes_15 + voted_no_6 + -1'voted_no_15 = 0
invariant :voting_13 + -1'voting_15 + voted_yes_13 + -1'voted_yes_15 + voted_no_13 + -1'voted_no_15 = 0
invariant :voting_1 + -1'voting_15 + voted_yes_1 + -1'voted_yes_15 + voted_no_1 + -1'voted_no_15 = 0
invariant :voting_11 + -1'voting_15 + voted_yes_11 + -1'voted_yes_15 + voted_no_11 + -1'voted_no_15 = 0
invariant :ready + voting_15 + voted_yes_15 + voted_no_15 = 1
invariant :voting_9 + -1'voting_15 + voted_yes_9 + -1'voted_yes_15 + voted_no_9 + -1'voted_no_15 = 0
invariant :voting_10 + -1'voting_15 + voted_yes_10 + -1'voted_yes_15 + voted_no_10 + -1'voted_no_15 = 0
invariant :voting_3 + -1'voting_15 + voted_yes_3 + -1'voted_yes_15 + voted_no_3 + -1'voted_no_15 = 0
invariant :voting_12 + -1'voting_15 + voted_yes_12 + -1'voted_yes_15 + voted_no_12 + -1'voted_no_15 = 0
invariant :voting_4 + -1'voting_15 + voted_yes_4 + -1'voted_yes_15 + voted_no_4 + -1'voted_no_15 = 0
invariant :voting_8 + -1'voting_15 + voted_yes_8 + -1'voted_yes_15 + voted_no_8 + -1'voted_no_15 = 0
invariant :voting_5 + -1'voting_15 + voted_yes_5 + -1'voted_yes_15 + voted_no_5 + -1'voted_no_15 = 0
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,0.33592,22384,1,0,102,19489,47,131,3738,31560,397
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("(((((((((((((((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)+voting_15)>=1)"))
Formula 7 simplified : !"(((((((((((((((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)+voting_15)>=1)"
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.336776,22384,1,0,102,19489,47,131,3738,31560,399
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F((X("(voted_no_14<=voted_yes_12)"))U(F("(ready>=3)")))))
Formula 8 simplified : !F(X"(voted_no_14<=voted_yes_12)" U F"(ready>=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
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.33833,22648,1,0,107,19494,56,147,3740,31672,495
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X("(voting_5<=voted_no_6)")))
Formula 9 simplified : !X"(voting_5<=voted_no_6)"
Computing Next relation with stutter on 32768 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.338698,22648,1,0,107,19494,59,147,3744,31672,497
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("(voting_3<=voted_yes_9)"))
Formula 10 simplified : !"(voting_3<=voted_yes_9)"
Computing Next relation with stutter on 32768 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,0.339055,22648,1,0,107,19494,62,147,3748,31673,499
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X("(voted_yes_14<=voted_no_8)")))
Formula 11 simplified : !X"(voted_yes_14<=voted_no_8)"
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
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.339398,22648,1,0,107,19494,65,147,3751,31675,501
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(("(voted_no_3<=voting_8)"))
Formula 12 simplified : !"(voted_no_3<=voting_8)"
Computing Next relation with stutter on 32768 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,0.339724,22648,1,0,107,19494,68,147,3755,31676,503
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X(X("(voted_no_12<=voted_no_9)"))))
Formula 13 simplified : !XX"(voted_no_12<=voted_no_9)"
Computing Next relation with stutter on 32768 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.343291,22648,1,0,123,20200,71,175,3760,32734,560
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(X(G(X("(voted_no_4<=voted_yes_9)"))))))
Formula 14 simplified : !GXGX"(voted_no_4<=voted_yes_9)"
Computing Next relation with stutter on 32768 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.365836,23364,1,0,169,24569,77,236,3766,40384,698
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(F(G(X("(voting_13<=voted_no_10)"))))))
Formula 15 simplified : !FGX"(voting_13<=voted_no_10)"
Computing Next relation with stutter on 32768 deadlock states
62 unique states visited
0 strongly connected components in search stack
120 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,0.392709,24012,1,0,212,27155,82,308,3771,46105,980
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1552979682789
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /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 -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
Mar 19, 2019 7:14:40 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]
Mar 19, 2019 7:14:40 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 19, 2019 7:14:40 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 36 ms
Mar 19, 2019 7:14:40 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 46 places.
Mar 19, 2019 7:14:41 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 31 transitions.
Mar 19, 2019 7:14:41 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
Mar 19, 2019 7:14:41 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 51 ms
Mar 19, 2019 7:14:41 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
Mar 19, 2019 7:14:41 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Mar 19, 2019 7:14:41 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 31 transitions.
Mar 19, 2019 7:14:41 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 15 place invariants in 11 ms
Mar 19, 2019 7:14:41 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 46 variables to be positive in 147 ms
Mar 19, 2019 7:14:41 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 31 transitions.
Mar 19, 2019 7:14:41 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/31 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 19, 2019 7:14:41 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 19, 2019 7:14:41 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 31 transitions.
Mar 19, 2019 7:14:41 AM 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)
Mar 19, 2019 7:14:41 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (>= (select s0 6) 1) (= (store (store s0 6 (- (select s0 6) 1)) 36 (+ (select s0 36) 1)) s1))) with error
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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)
Mar 19, 2019 7:14:41 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 410ms 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-PT-0015"
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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3817"
echo " Executing tool itstools"
echo " Input is Referendum-PT-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 r140-smll-155284912600213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0015.tgz
mv Referendum-PT-0015 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
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 '
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 ;