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 300K
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K 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 4.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 16K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Referendum-PT-0015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r190-qhx2-152732141900116
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528363072249


BK_STOP 1528363102064

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Referendum-PT-0015 as instance name.
Using Referendum as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 221, 'Memory': 106.65, 'Tool': 'lola'}, {'Time': 21065, 'Memory': 347.85, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 95.31674208144797x far from the best tool lola.
LTLFireability itstools Referendum-PT-0015...
Jun 07, 2018 9:18:16 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-z3path, /usr/bin/z3, -yices2path, /usr/bin/yices, -ltsminpath, /usr/bin, -smt, -its, -pnfolder, /mcc-data, -examination, LTLFireability]
Jun 07, 2018 9:18:16 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
Jun 07, 2018 9:18:16 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 62 ms
Jun 07, 2018 9:18:16 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 46 places.
Jun 07, 2018 9:18:16 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 31 transitions.
Jun 07, 2018 9:18:16 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 71 ms
Using solver Z3 to compute partial order matrices.
Jun 07, 2018 9:18:17 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 43 ms
Built C files in :
/mcc-data
Jun 07, 2018 9:18:17 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLFireability.pnml.gal : 28 ms
Jun 07, 2018 9:18:17 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLFireability.ltl : 73 ms
Invoking ITS tools like this :CommandLine [args=[/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /mcc-data/LTLFireability.pnml.gal, -t, CGAL, -LTL, /mcc-data/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/mcc-data]

its-ltl command run as :

/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64 --gc-threshold 2000000 -i /mcc-data/LTLFireability.pnml.gal -t CGAL -LTL /mcc-data/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G(X("(ready>=1)"))))
Formula 0 simplified : !GX"(ready>=1)"
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
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.243859,16804,1,0,23,3223,23,32,692,2872,68
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((((G("(ready>=1)"))U(X("(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))")))U(G(G(G("(ready>=1)"))))))
Formula 1 simplified : !((G"(ready>=1)" U X"(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))") U G"(ready>=1)")
Computing Next relation with stutter on 32768 deadlock states
16 unique states visited
16 strongly connected components in search stack
16 transitions explored
16 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.272484,17800,1,0,24,3224,23,34,692,3515,174
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(X(X(("(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))")U("(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))"))))))
Formula 2 simplified : !XXX"(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))"
Computing Next relation with stutter on 32768 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 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.283692,18064,1,0,25,3362,26,35,722,3614,179
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))"))
Formula 3 simplified : !"(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(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.287261,18064,1,0,26,3370,26,37,722,3630,189
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(("(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))")U(G(G("(ready>=1)"))))))
Formula 4 simplified : !X("(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))" U G"(ready>=1)")
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
9 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.377397,18844,1,0,63,5985,43,90,743,12440,441
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X("(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))")))
Formula 5 simplified : !X"(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=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
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.379929,18844,1,0,63,5985,43,90,743,12440,443
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((X(("(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))")U("(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))")))U("(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))")))
Formula 6 simplified : !(X"(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))" U "(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=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
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.385154,19108,1,0,63,5985,43,90,743,12440,443
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G(G("(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(voting_15>=1))"))))
Formula 7 simplified : !G"(((((((((((((((voting_1>=1)||(voting_2>=1))||(voting_3>=1))||(voting_4>=1))||(voting_5>=1))||(voting_6>=1))||(voting_7>=1))||(voting_8>=1))||(voting_9>=1))||(voting_10>=1))||(voting_11>=1))||(voting_12>=1))||(voting_13>=1))||(voting_14>=1))||(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
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.38832,19108,1,0,63,5985,43,90,743,12440,446
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F("(voting_3>=1)")))
Formula 8 simplified : !F"(voting_3>=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.389119,19108,1,0,63,5985,52,90,743,12440,454
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((F(G(X(F(F("(ready>=1)")))))))
Formula 9 simplified : !FGXF"(ready>=1)"
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
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.391294,19108,1,0,63,5985,58,92,743,12487,467
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("(voting_11>=1)"))
Formula 10 simplified : !"(voting_11>=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.391767,19108,1,0,63,5985,61,92,743,12487,469
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((("(voting_12>=1)")U(G(F(X("(voting_8>=1)"))))))
Formula 11 simplified : !("(voting_12>=1)" U GFX"(voting_8>=1)")
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
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.39525,19108,1,0,63,5985,70,92,743,12487,475
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(F(X(("(voting_13>=1)")U("(voting_11>=1)"))))))
Formula 12 simplified : !FX("(voting_13>=1)" U "(voting_11>=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
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.395887,19108,1,0,63,5985,76,92,743,12487,479
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X("(voting_3>=1)")))
Formula 13 simplified : !X"(voting_3>=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
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.39633,19108,1,0,63,5985,76,92,743,12487,479
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X("(voting_8>=1)")))
Formula 14 simplified : !X"(voting_8>=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
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.396812,19108,1,0,63,5985,76,92,743,12487,481
no accepting run found
Jun 07, 2018 9:18:18 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 31 transitions.
Formula 14 is TRUE no accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((("(voting_6>=1)")U(G(("(voting_4>=1)")U("(voting_5>=1)")))))
Formula 15 simplified : !("(voting_6>=1)" U G("(voting_4>=1)" U "(voting_5>=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.421651,19860,1,0,63,5985,109,92,762,12487,494
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-PT-0015-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
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

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="LTLFireability"
export BK_TOOL="mcc4mcc-full"
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-PT-0015.tgz
mv Referendum-PT-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 mcc4mcc-full"
echo " Input is Referendum-PT-0015, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r190-qhx2-152732141900116"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;