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 260K
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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.5K 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 2.8K 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 8.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K 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 4.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K 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 11K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Referendum-PT-0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r190-qhx2-152732141900114
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528363006119


BK_STOP 1528363030743

--------------------
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-0010 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': 212, 'Memory': 106.39, 'Tool': 'lola'}, {'Time': 4947, 'Memory': 269.16, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 23.33490566037736x far from the best tool lola.
LTLFireability itstools Referendum-PT-0010...
Jun 07, 2018 9:17:06 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:17:06 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
Jun 07, 2018 9:17:06 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 96 ms
Jun 07, 2018 9:17:06 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 31 places.
Jun 07, 2018 9:17:07 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 21 transitions.
Jun 07, 2018 9:17:07 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 19 ms
Jun 07, 2018 9:17:07 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 39 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
Jun 07, 2018 9:17:07 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLFireability.pnml.gal : 2 ms
Jun 07, 2018 9:17:07 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLFireability.ltl : 36 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 : !((("((((((((((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))")U(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))")))))
Formula 0 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))" U XX"((((((((((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))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1024 deadlock states
Jun 07, 2018 9:17:08 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 21 transitions.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.200681,16940,1,0,9,877,15,4,473,383,14
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(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))")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))"))))))
Formula 1 simplified : !GXX"((((((((((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))"
Computing Next relation with stutter on 1024 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.218562,17152,1,0,28,2189,23,25,494,3590,78
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((("((((((((((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))")U(G(F(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))"))))))
Formula 2 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))" U GFX"((((((((((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))")
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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.244837,17368,1,0,35,2577,29,47,494,4644,151
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G((G(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))")))U(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))"))))))
Formula 3 simplified : !G(GX"((((((((((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))" U 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))")
Computing Next relation with stutter on 1024 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.263962,17948,1,0,44,2664,29,67,494,4993,204
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X((G(G("(ready>=1)")))U("(ready>=1)"))))
Formula 4 simplified : !X(G"(ready>=1)" U "(ready>=1)")
Computing Next relation with stutter on 1024 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.265791,18168,1,0,44,2664,32,67,495,4993,209
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((X("(ready>=1)"))U(G(G(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))"))))))
Formula 5 simplified : !(X"(ready>=1)" U GX"((((((((((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))")
Computing Next relation with stutter on 1024 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 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.285961,18564,1,0,44,2664,38,67,499,4994,213
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("(ready>=1)"))
Formula 6 simplified : !"(ready>=1)"
Computing Next relation with stutter on 1024 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.286613,18564,1,0,44,2664,38,67,499,4994,215
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((("(ready>=1)")U(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))")))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))")U("(ready>=1)")))))
Formula 7 simplified : !(("(ready>=1)" U 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))") 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))" U "(ready>=1)"))
Computing Next relation with stutter on 1024 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.30267,18832,1,0,44,2664,40,67,499,5004,245
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((F("(voting_9>=1)"))U("(voting_10>=1)")))
Formula 8 simplified : !(F"(voting_9>=1)" U "(voting_10>=1)")
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
0 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.304625,18832,1,0,44,2664,54,67,501,5004,258
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("(voting_7>=1)"))
Formula 9 simplified : !"(voting_7>=1)"
Computing Next relation with stutter on 1024 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.305705,18832,1,0,44,2664,57,67,501,5004,263
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X("(voting_3>=1)")))
Formula 10 simplified : !X"(voting_3>=1)"
Computing Next relation with stutter on 1024 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.306205,18832,1,0,44,2664,60,67,501,5004,265
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(("(voting_7>=1)")U(G(X("(voting_2>=1)"))))))
Formula 11 simplified : !F("(voting_7>=1)" U GX"(voting_2>=1)")
Computing Next relation with stutter on 1024 deadlock states
13 unique states visited
12 strongly connected components in search stack
14 transitions explored
13 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.317799,18832,1,0,53,3459,65,93,501,6444,325
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G("(voting_8>=1)")))
Formula 12 simplified : !G"(voting_8>=1)"
Computing Next relation with stutter on 1024 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.321403,18832,1,0,53,3459,71,93,501,6444,330
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(G(("(voting_10>=1)")U(G("(voting_8>=1)"))))))
Formula 13 simplified : !FG("(voting_10>=1)" U G"(voting_8>=1)")
Computing Next relation with stutter on 1024 deadlock states
10 unique states visited
10 strongly connected components in search stack
10 transitions explored
10 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.337371,19012,1,0,63,3682,87,110,510,6785,478
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(G(F("(voting_5>=1)")))))
Formula 14 simplified : !GF"(voting_5>=1)"
Computing Next relation with stutter on 1024 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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.342356,19148,1,0,74,4221,96,129,510,7452,536
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((X((F(G("(voting_2>=1)")))U(X("(voting_9>=1)")))))
Formula 15 simplified : !X(FG"(voting_2>=1)" U X"(voting_9>=1)")
Computing Next relation with stutter on 1024 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.359963,19388,1,0,121,5518,106,177,510,9942,676
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-PT-0010-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 21 rows 31 cols
invariant :voted_no_5 + -1'voted_no_10 + voted_yes_5 + -1'voted_yes_10 + voting_5 + -1'voting_10 = 0
invariant :voted_no_7 + -1'voted_no_10 + voted_yes_7 + -1'voted_yes_10 + voting_7 + -1'voting_10 = 0
invariant :voted_no_4 + -1'voted_no_10 + voted_yes_4 + -1'voted_yes_10 + voting_4 + -1'voting_10 = 0
invariant :voted_no_2 + -1'voted_no_10 + voted_yes_2 + -1'voted_yes_10 + voting_2 + -1'voting_10 = 0
invariant :voted_no_3 + -1'voted_no_10 + voted_yes_3 + -1'voted_yes_10 + voting_3 + -1'voting_10 = 0
invariant :voted_no_9 + -1'voted_no_10 + voted_yes_9 + -1'voted_yes_10 + voting_9 + -1'voting_10 = 0
invariant :voted_no_1 + -1'voted_no_10 + voted_yes_1 + -1'voted_yes_10 + voting_1 + -1'voting_10 = 0
invariant :voted_no_6 + -1'voted_no_10 + voted_yes_6 + -1'voted_yes_10 + voting_6 + -1'voting_10 = 0
invariant :ready + voted_no_10 + voted_yes_10 + voting_10 = 1
invariant :voted_no_8 + -1'voted_no_10 + voted_yes_8 + -1'voted_yes_10 + voting_8 + -1'voting_10 = 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-0010"
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-0010.tgz
mv Referendum-PT-0010 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-0010, 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-152732141900114"
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 ;