fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089415900514
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Referendum-PT-0010

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
224.735 2838.00 5255.00 47.80 FFFTFFFFTTFTTFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415900514.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-PT-0010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415900514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 132K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 12K May 5 16:51 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-0010-CTLFireability-00
FORMULA_NAME Referendum-PT-0010-CTLFireability-01
FORMULA_NAME Referendum-PT-0010-CTLFireability-02
FORMULA_NAME Referendum-PT-0010-CTLFireability-03
FORMULA_NAME Referendum-PT-0010-CTLFireability-04
FORMULA_NAME Referendum-PT-0010-CTLFireability-05
FORMULA_NAME Referendum-PT-0010-CTLFireability-06
FORMULA_NAME Referendum-PT-0010-CTLFireability-07
FORMULA_NAME Referendum-PT-0010-CTLFireability-08
FORMULA_NAME Referendum-PT-0010-CTLFireability-09
FORMULA_NAME Referendum-PT-0010-CTLFireability-10
FORMULA_NAME Referendum-PT-0010-CTLFireability-11
FORMULA_NAME Referendum-PT-0010-CTLFireability-12
FORMULA_NAME Referendum-PT-0010-CTLFireability-13
FORMULA_NAME Referendum-PT-0010-CTLFireability-14
FORMULA_NAME Referendum-PT-0010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621260473667

Running Version 0
[2021-05-17 14:07:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 14:07:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:07:55] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-17 14:07:55] [INFO ] Transformed 31 places.
[2021-05-17 14:07:55] [INFO ] Transformed 21 transitions.
[2021-05-17 14:07:55] [INFO ] Found NUPN structural information;
[2021-05-17 14:07:55] [INFO ] Parsed PT model containing 31 places and 21 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 10 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 14:07:55] [INFO ] Reduced 1 identical enabling conditions.
Support contains 11 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 11 transition count 11
Applied a total of 30 rules in 8 ms. Remains 11 /31 variables (removed 20) and now considering 11/21 (removed 10) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:07:55] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:07:55] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:07:55] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:07:55] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-17 14:07:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:07:55] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/31 places, 11/21 transitions.
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 35 ms
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 5 ms
[2021-05-17 14:07:55] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 93 steps, including 7 resets, run visited all 75 properties in 3 ms. (steps per millisecond=31 )
Applied a total of 0 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Input system was already deterministic with 11 transitions.
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13689004024316431698.gal : 1 ms
[2021-05-17 14:07:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6546086110919482674.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13689004024316431698.gal, -t, CGAL, -ctl, /tmp/CTLFireability6546086110919482674.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13689004024316431698.gal -t CGAL -ctl /tmp/CTLFireability6546086110919482674.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1025,0.00788,4248,2,22,5,85,6,0,47,72,0


Converting to forward existential form...Done !
original formula: !(EF(((((((((((((((((!(EG(((((((((((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)))) * !(A(((((((((((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)||(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))))) * (((((((((((ready==1)||(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))) * (((((((((((ready==1)||(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_1==0)) * (voting_2==0)) * (voting_3==0)) * (voting_4==0)) * (voting_5==0)) * (voting_6==0)) * (voting_7==0)) * (voting_8==0)) * (voting_9==0)) * (voting_10==0)) * !(EF((((((((((((ready==1)||(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))))) * (!(EF((ready==1))) + !(AF(((((((((((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)))))) * (((((((((((ready==1)||(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)))))
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (((((((((((ready==1)||(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))) * ((((((((((((((!(EG(((((((((((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)))) * !(!((E(!((((((((((((ready==1)||(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))) * !((((((((((((ready==1)||(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))))) + EG(!((((((((((((ready==1)||(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)))))))) * (((((((((((ready==1)||(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))) * (((((((((((ready==1)||(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_1==0)) * (voting_2==0)) * (voting_3==0)) * (voting_4==0)) * (voting_5==0)) * (voting_6==0)) * (voting_7==0)) * (voting_8==0)) * (voting_9==0)) * (voting_10==0)) * !(E(TRUE U (((((((((((ready==1)||(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)))))) * !(E(TRUE U (ready==1))))] = FALSE * [FwdG(((FwdU(Init,TRUE) * (((((((((((ready==1)||(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))) * ((((((((((((((!(EG(((((((((((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)))) * !(!((E(!((((((((((((ready==1)||(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))) * !((((((((((((ready==1)||(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))))) + EG(!((((((((((((ready==1)||(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)))))))) * (((((((((((ready==1)||(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))) * (((((((((((ready==1)||(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_1==0)) * (voting_2==0)) * (voting_3==0)) * (voting_4==0)) * (voting_5==0)) * (voting_6==0)) * (voting_7==0)) * (voting_8==0)) * (voting_9==0)) * (voting_10==0)) * !(E(TRUE U (((((((((((ready==1)||(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_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))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/10/11
(forward)formula 0,1,0.044104,4964,1,0,66,616,70,23,331,632,71
FORMULA Referendum-PT-0010-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Input system was already deterministic with 11 transitions.
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Time to serialize gal into /tmp/CTLFireability2653648960547277277.gal : 0 ms
[2021-05-17 14:07:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3460528567897658513.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2653648960547277277.gal, -t, CGAL, -ctl, /tmp/CTLFireability3460528567897658513.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2653648960547277277.gal -t CGAL -ctl /tmp/CTLFireability3460528567897658513.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1025,0.002446,4272,2,22,5,85,6,0,47,72,0


Converting to forward existential form...Done !
original formula: EG((EG(A(AF((((((((((((ready==1)||(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 A((((((((((((ready==1)||(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)))) + ((A(((((((((((voting_1==0)&&(voting_2==0))&&(voting_3==0))&&(voting_4==0))&&(voting_5==0))&&(voting_6==0))&&(voting_7==0))&&(voting_8==0))&&(voting_9==0))&&(voting_10==0)) U EG((((((((((((ready==0)&&(voting_1==0))&&(voting_2==0))&&(voting_3==0))&&(voting_4==0))&&(voting_5==0))&&(voting_6==0))&&(voting_7==0))&&(voting_8==0))&&(voting_9==0))&&(voting_10==0)))) * A((((((((((((((ready==1)||(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))||(ready==1)) * EF(((((((((((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 AG((((((((((((ready==1)||(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_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)))))
=> equivalent forward existential formula: [FwdG(Init,(EG(!((E(!(!((E(!((ready==1)) U (!((((((((((((ready==1)||(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))) * !((ready==1)))) + EG(!((ready==1)))))) U (!(!(EG(!((((((((((((ready==1)||(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)))))) * !(!((E(!((ready==1)) U (!((((((((((((ready==1)||(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))) * !((ready==1)))) + EG(!((ready==1)))))))) + EG(!(!((E(!((ready==1)) U (!((((((((((((ready==1)||(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))) * !((ready==1)))) + EG(!((ready==1)))))))))) + ((!((E(!(EG((((((((((((ready==0)&&(voting_1==0))&&(voting_2==0))&&(voting_3==0))&&(voting_4==0))&&(voting_5==0))&&(voting_6==0))&&(voting_7==0))&&(voting_8==0))&&(voting_9==0))&&(voting_10==0)))) U (!(((((((((((voting_1==0)&&(voting_2==0))&&(voting_3==0))&&(voting_4==0))&&(voting_5==0))&&(voting_6==0))&&(voting_7==0))&&(voting_8==0))&&(voting_9==0))&&(voting_10==0))) * !(EG((((((((((((ready==0)&&(voting_1==0))&&(voting_2==0))&&(voting_3==0))&&(voting_4==0))&&(voting_5==0))&&(voting_6==0))&&(voting_7==0))&&(voting_8==0))&&(voting_9==0))&&(voting_10==0)))))) + EG(!(EG((((((((((((ready==0)&&(voting_1==0))&&(voting_2==0))&&(voting_3==0))&&(voting_4==0))&&(voting_5==0))&&(voting_6==0))&&(voting_7==0))&&(voting_8==0))&&(voting_9==0))&&(voting_10==0))))))) * !((E(!(!(E(TRUE U !((((((((((((ready==1)||(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)||(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))||(ready==1)) * E(TRUE 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))))) * !(!(E(TRUE U !((((((((((((ready==1)||(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)))))))) + EG(!(!(E(TRUE U !((((((((((((ready==1)||(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_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)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/10/11
dead was empty
(forward)formula 0,0,0.026063,4976,1,0,64,824,62,56,321,1176,165
FORMULA Referendum-PT-0010-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6 transition count 6
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 5 transition count 5
Applied a total of 12 rules in 12 ms. Remains 5 /11 variables (removed 6) and now considering 5/11 (removed 6) transitions.
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Input system was already deterministic with 5 transitions.
Finished random walk after 6 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA Referendum-PT-0010-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 5 transition count 5
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 3 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Input system was already deterministic with 4 transitions.
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 0 ms
[2021-05-17 14:07:55] [INFO ] Time to serialize gal into /tmp/CTLFireability10969738159091842153.gal : 0 ms
[2021-05-17 14:07:55] [INFO ] Time to serialize properties into /tmp/CTLFireability8151423055094436852.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability10969738159091842153.gal, -t, CGAL, -ctl, /tmp/CTLFireability8151423055094436852.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability10969738159091842153.gal -t CGAL -ctl /tmp/CTLFireability8151423055094436852.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9,0.001943,4288,2,8,5,29,6,0,19,23,0


Converting to forward existential form...Done !
original formula: EF(AG((((voting_1==0)&&(voting_2==0))&&(voting_8==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((voting_1==0)&&(voting_2==0))&&(voting_8==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/3/4
(forward)formula 0,1,0.003406,4664,1,0,23,101,28,9,97,101,18
FORMULA Referendum-PT-0010-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2021-05-17 14:07:55] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:07:55] [INFO ] Applying decomposition
[2021-05-17 14:07:55] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10366066412082791620.txt, -o, /tmp/graph10366066412082791620.bin, -w, /tmp/graph10366066412082791620.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10366066412082791620.bin, -l, -1, -v, -w, /tmp/graph10366066412082791620.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 14:07:56] [INFO ] Decomposing Gal with order
[2021-05-17 14:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 14:07:56] [INFO ] Flatten gal took : 5 ms
[2021-05-17 14:07:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 14:07:56] [INFO ] Time to serialize gal into /tmp/CTLFireability5564439583202356799.gal : 1 ms
[2021-05-17 14:07:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14687249593802080422.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5564439583202356799.gal, -t, CGAL, -ctl, /tmp/CTLFireability14687249593802080422.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5564439583202356799.gal -t CGAL -ctl /tmp/CTLFireability14687249593802080422.ctl
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1025,0.0036,4280,2,22,5,85,6,0,47,72,0


Converting to forward existential form...Done !
original formula: ((!(EG((((((((((((((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)) + (((((((((((A((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)) U ((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * (u0.ready==0)) * (u0.voting_1==0)) * (u0.voting_2==0)) * (u0.voting_3==0)) * (u0.voting_4==0)) * (u0.voting_5==0)) * (u0.voting_6==0)) * (u0.voting_7==0)) * (u0.voting_8==0)) * (u0.voting_9==0)) * (u0.voting_10==0))) + !(EG((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))))) * !(EX(AX(((((((((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0))||((((((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0))))))) * EX(EX(EF((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))))
=> equivalent forward existential formula: (([FwdG(Init,(((((((((((((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)) + (((((((((((!((E(!(((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) U (!((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * !(((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))) + EG(!(((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))))) * (u0.ready==0)) * (u0.voting_1==0)) * (u0.voting_2==0)) * (u0.voting_3==0)) * (u0.voting_4==0)) * (u0.voting_5==0)) * (u0.voting_6==0)) * (u0.voting_7==0)) * (u0.voting_8==0)) * (u0.voting_9==0)) * (u0.voting_10==0))) + !(EG((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))))] = FALSE * [(EY(Init) * !(EX(!(((((((((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0))||((((((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0)))))))] = FALSE) * [(Init * !(EX(EX(E(TRUE U (((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions u0.t1, u0.t2, u0.t3, u0.t4, u0.t5, u0.t6, u0.t7, u0.t8, u0.t9, u0.t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/10/11
(forward)formula 0,0,0.033022,5308,1,0,78,718,134,41,420,849,78
FORMULA Referendum-PT-0010-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AG(!(E(EF((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) U ((((((((((((((((((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0))&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0)) + (AG((u0.ready==1)) * (((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))))) * E(AG((((((((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0))) U (((((((((((AX((AX(((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * (((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))) + (u0.ready==1)) + (u0.voting_1==1)) + (u0.voting_2==1)) + (u0.voting_3==1)) + (u0.voting_4==1)) + (u0.voting_5==1)) + (u0.voting_6==1)) + (u0.voting_7==1)) + (u0.voting_8==1)) + (u0.voting_9==1)) + (u0.voting_10==1))))
=> equivalent forward existential formula: (([(FwdU(FwdU(Init,TRUE),E(TRUE U (((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))) * (((((((((((((((((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0))&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0)))] = FALSE * [((FwdU(FwdU(Init,TRUE),E(TRUE U (((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))) * (((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * !(E(TRUE U !((u0.ready==1)))))] = FALSE) * [(Init * !(E(!(E(TRUE U !((((((((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0))))) U (((((((((((!(EX(!((!(EX(!(((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))) * (((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))))) + (u0.ready==1)) + (u0.voting_1==1)) + (u0.voting_2==1)) + (u0.voting_3==1)) + (u0.voting_4==1)) + (u0.voting_5==1)) + (u0.voting_6==1)) + (u0.voting_7==1)) + (u0.voting_8==1)) + (u0.voting_9==1)) + (u0.voting_10==1)))))] = FALSE)
(forward)formula 1,0,0.044938,5572,1,0,102,1114,163,62,450,1612,114
FORMULA Referendum-PT-0010-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(EF((E(((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)) U ((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * EX((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E(((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)) U ((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * EX((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))))))] = FALSE
(forward)formula 2,0,0.048919,5572,1,0,102,1123,166,66,450,1646,122
FORMULA Referendum-PT-0010-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EX((AG((EF((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * AF((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))) + (u0.ready==1)))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((E(TRUE U (((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * !(EG(!((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))))))))] != FALSE + [(EY(Init) * (u0.ready==1))] != FALSE)
(forward)formula 3,0,0.052896,5572,1,0,109,1294,169,85,450,2128,172
FORMULA Referendum-PT-0010-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(EG((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) U (EG(AX(((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))) * (((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,EG((((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))) * (((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))),!(EX(!(((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))))] != FALSE
(forward)formula 4,0,0.055931,5572,1,0,122,1456,176,109,450,2559,195
FORMULA Referendum-PT-0010-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(EG((AX(((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * ((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(EX(!(((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))) * ((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))))] = FALSE
(forward)formula 5,0,0.058348,5572,1,0,122,1456,179,110,450,2560,195
FORMULA Referendum-PT-0010-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EG((((((AF((EG(EF(((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_9==1))||(u0.voting_10==1)))) * E(EX((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_10==1))) U (((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_7==1))||(u0.voting_9==1))))) + !(EX(EF(((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1)))))) + !(AX(((((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))) + ((u0.voting_2==0)&&(u0.voting_4==0))) + (((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_10==0))) + ((A((((u0.ready==1)||(u0.voting_2==1))||(u0.voting_7==1)) U (((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1))) * (((((u0.voting_4==1)||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_9==1))||(u0.voting_10==1))) * (E(((((u0.voting_1==1)||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_10==1)) U ((u0.voting_2==1)||(u0.voting_8==1))) + (((u0.voting_3==0)&&(u0.voting_6==0))&&(u0.voting_8==0))))))
=> equivalent forward existential formula: [FwdG(Init,(((((!(EG(!((EG(E(TRUE U ((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_9==1))||(u0.voting_10==1)))) * E(EX((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_10==1))) U (((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_7==1))||(u0.voting_9==1))))))) + !(EX(E(TRUE U ((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1)))))) + !(!(EX(!(((((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))))) + ((u0.voting_2==0)&&(u0.voting_4==0))) + (((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_10==0))) + ((!((E(!((((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1))) U (!((((u0.ready==1)||(u0.voting_2==1))||(u0.voting_7==1))) * !((((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1))))) + EG(!((((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1)))))) * (((((u0.voting_4==1)||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_9==1))||(u0.voting_10==1))) * (E(((((u0.voting_1==1)||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_10==1)) U ((u0.voting_2==1)||(u0.voting_8==1))) + (((u0.voting_3==0)&&(u0.voting_6==0))&&(u0.voting_8==0))))))] != FALSE
(forward)formula 6,1,0.072394,5836,1,0,187,2480,248,168,525,4746,293
FORMULA Referendum-PT-0010-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AF(EX(((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_6==0))&&(u0.voting_8==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_6==0))&&(u0.voting_8==0)))))] = FALSE
(forward)formula 7,1,0.074029,5836,1,0,211,2765,255,191,531,5331,316
FORMULA Referendum-PT-0010-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: A((AG(((u0.ready==1)||(u0.voting_10==1))) + (AG(A((((((u0.voting_1==1)||(u0.voting_6==1))||(u0.voting_9==1))||(u0.voting_6==1))||(u0.voting_10==1)) U ((((((u0.ready==1)||(u0.voting_6==1))||(u0.voting_1==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_8==1)))) * E(((AF((((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) + (u0.voting_2==1)) + (u0.voting_3==1)) U (u0.voting_6==1)))) U AX((!(EF(((u0.voting_4==1)&&(((u0.voting_5==1)||(u0.voting_7==1))||(u0.voting_8==1))))) * (((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)) + AX((((((u0.voting_2==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_9==1))||(u0.voting_10==1)))) + (u0.voting_6==1)) + (u0.voting_7==1)) + E(AF((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_6==1))) U ((((((u0.voting_2==0)&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_8==0)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!((!(E(TRUE U ((u0.voting_4==1)&&(((u0.voting_5==1)||(u0.voting_7==1))||(u0.voting_8==1))))) * (((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)) + !(EX(!((((((u0.voting_2==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_9==1))||(u0.voting_10==1)))))) + (u0.voting_6==1)) + (u0.voting_7==1)) + E(!(EG(!((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_6==1))))) U ((((((u0.voting_2==0)&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_8==0)))))))))))) * !(E(!(!(EX(!((!(E(TRUE U ((u0.voting_4==1)&&(((u0.voting_5==1)||(u0.voting_7==1))||(u0.voting_8==1))))) * (((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)) + !(EX(!((((((u0.voting_2==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_9==1))||(u0.voting_10==1)))))) + (u0.voting_6==1)) + (u0.voting_7==1)) + E(!(EG(!((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_6==1))))) U ((((((u0.voting_2==0)&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_8==0))))))))) U (!((!(E(TRUE U !(((u0.ready==1)||(u0.voting_10==1))))) + (!(E(TRUE U !(!((E(!(((((((u0.ready==1)||(u0.voting_6==1))||(u0.voting_1==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_8==1))) U (!((((((u0.voting_1==1)||(u0.voting_6==1))||(u0.voting_9==1))||(u0.voting_6==1))||(u0.voting_10==1))) * !(((((((u0.ready==1)||(u0.voting_6==1))||(u0.voting_1==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_8==1))))) + EG(!(((((((u0.ready==1)||(u0.voting_6==1))||(u0.voting_1==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_8==1))))))))) * E(((!(EG(!((((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))) + (u0.voting_2==1)) + (u0.voting_3==1)) U (u0.voting_6==1))))) * !(!(EX(!((!(E(TRUE U ((u0.voting_4==1)&&(((u0.voting_5==1)||(u0.voting_7==1))||(u0.voting_8==1))))) * (((((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)) + !(EX(!((((((u0.voting_2==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_9==1))||(u0.voting_10==1)))))) + (u0.voting_6==1)) + (u0.voting_7==1)) + E(!(EG(!((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_6==1))))) U ((((((u0.voting_2==0)&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_8==0)))))))))))))] != FALSE
(forward)formula 8,0,0.097052,6100,1,0,320,4250,317,291,591,8218,531
FORMULA Referendum-PT-0010-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (EX((EX(A((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1)) U ((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))) * !(EG(((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_10==1)))))) + AX(E((!(A((((((u0.ready==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_9==1)) U ((((((u0.voting_2==1)||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1)))) * !(AX((((u0.ready==1)||(u0.voting_4==1))||(u0.voting_6==1))))) U (((((u0.voting_4==0)&&(u0.voting_6==0))&&(u0.voting_8==0))&&(u0.voting_10==0)) * (((((((u0.voting_1==0)&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0)) + !(EG(((u0.voting_9==1)||(u0.voting_10==1)))))))))
=> equivalent forward existential formula: [(EY((Init * !(EX((EX(!((E(!(((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) U (!((((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_2==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))) * !(((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))) + EG(!(((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))))) * !(EG(((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_10==1))))))))) * !(E((!(!((E(!(((((((u0.voting_2==1)||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1))) U (!((((((u0.ready==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_9==1))) * !(((((((u0.voting_2==1)||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1))))) + EG(!(((((((u0.voting_2==1)||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1))))))) * !(!(EX(!((((u0.ready==1)||(u0.voting_4==1))||(u0.voting_6==1))))))) U (((((u0.voting_4==0)&&(u0.voting_6==0))&&(u0.voting_8==0))&&(u0.voting_10==0)) * (((((((u0.voting_1==0)&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0)) + !(EG(((u0.voting_9==1)||(u0.voting_10==1)))))))))] = FALSE
(forward)formula 9,1,0.111327,6364,1,0,363,4848,381,330,663,9219,625
FORMULA Referendum-PT-0010-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: A((((((((((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_10==0)) * EG(((((u0.voting_4==1)&&(((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))||(u0.voting_1==1))||(u0.voting_7==1)))) * AX((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_7==0))&&(u0.voting_9==0))&&(u0.voting_10==0)))) * AG((((((((AF(((u0.voting_5==1)||(u0.voting_8==1))) * ((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) + E(((((((((u0.ready==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1)) U ((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_8==1)))) + (u0.voting_2==1)) + (u0.voting_4==1)) + (u0.voting_6==1)) + (u0.voting_7==1)) + (u0.voting_9==1)))) * (((((u0.voting_1==1)||(u0.voting_3==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))) * (((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_9==1))) * ((u0.voting_3==0)||(u0.ready==0))) U AF(E((((((((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))||((((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_6==0))&&(u0.voting_8==0))&&(u0.voting_10==0)))||((((u0.voting_1==0)&&(u0.voting_3==0))&&(u0.voting_8==0))&&(u0.voting_10==0))) U (EG((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_8==1))) * (((((((A(((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_5==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)) U ((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) + (u0.voting_6==1)) + (u0.voting_7==1)) + (u0.voting_10==1)) + (u0.voting_2==1)) + (u0.voting_3==1)) + (u0.voting_5==1)) + (u0.voting_9==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(E((((((((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))||((((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_6==0))&&(u0.voting_8==0))&&(u0.voting_10==0)))||((((u0.voting_1==0)&&(u0.voting_3==0))&&(u0.voting_8==0))&&(u0.voting_10==0))) U (EG((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_8==1))) * (((((((!((E(!(((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) U (!(((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_5==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * !(((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))) + EG(!(((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))))) + (u0.voting_6==1)) + (u0.voting_7==1)) + (u0.voting_10==1)) + (u0.voting_2==1)) + (u0.voting_3==1)) + (u0.voting_5==1)) + (u0.voting_9==1))))))))))) * !(E(!(!(EG(!(E((((((((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))||((((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_6==0))&&(u0.voting_8==0))&&(u0.voting_10==0)))||((((u0.voting_1==0)&&(u0.voting_3==0))&&(u0.voting_8==0))&&(u0.voting_10==0))) U (EG((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_8==1))) * (((((((!((E(!(((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) U (!(((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_5==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * !(((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))) + EG(!(((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))))) + (u0.voting_6==1)) + (u0.voting_7==1)) + (u0.voting_10==1)) + (u0.voting_2==1)) + (u0.voting_3==1)) + (u0.voting_5==1)) + (u0.voting_9==1)))))))) U (!((((((((((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_10==0)) * EG(((((u0.voting_4==1)&&(((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))||(u0.voting_1==1))||(u0.voting_7==1)))) * !(EX(!((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_7==0))&&(u0.voting_9==0))&&(u0.voting_10==0)))))) * !(E(TRUE U !((((((((!(EG(!(((u0.voting_5==1)||(u0.voting_8==1))))) * ((((((((u0.ready==1)||(u0.voting_1==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) + E(((((((((u0.ready==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1)) U ((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_8==1)))) + (u0.voting_2==1)) + (u0.voting_4==1)) + (u0.voting_6==1)) + (u0.voting_7==1)) + (u0.voting_9==1)))))) * (((((u0.voting_1==1)||(u0.voting_3==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))) * (((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_9==1))) * ((u0.voting_3==0)||(u0.ready==0)))) * !(!(EG(!(E((((((((((u0.voting_3==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))||((((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_4==0))&&(u0.voting_6==0))&&(u0.voting_8==0))&&(u0.voting_10==0)))||((((u0.voting_1==0)&&(u0.voting_3==0))&&(u0.voting_8==0))&&(u0.voting_10==0))) U (EG((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_8==1))) * (((((((!((E(!(((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) U (!(((((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_5==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))) * !(((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1))))) + EG(!(((((((u0.voting_2==1)||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_9==1))||(u0.voting_10==1)))))) + (u0.voting_6==1)) + (u0.voting_7==1)) + (u0.voting_10==1)) + (u0.voting_2==1)) + (u0.voting_3==1)) + (u0.voting_5==1)) + (u0.voting_9==1))))))))))))] != FALSE
(forward)formula 10,0,0.141663,6364,1,0,446,5868,466,405,754,11181,791
FORMULA Referendum-PT-0010-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E((E((((((((((((u0.voting_2==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_8==1))||(u0.voting_3==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1))||((((u0.voting_1==1)||(u0.voting_5==1))||(u0.voting_6==1))&&((((((u0.voting_1==1)||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1)))) U ((((((((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_9==0))&&(u0.ready==0))&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_9==0))) + (((((!(A(((u0.voting_1==1)||(u0.voting_10==1)) U (((u0.voting_3==1)||(u0.voting_9==1))||(u0.voting_10==1)))) + !(AF(EG((((u0.voting_5==1)||(u0.voting_7==1))||(u0.voting_8==1)))))) + (((u0.ready==0)&&(u0.voting_3==0))&&(u0.voting_7==0))) + ((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_6==0))&&(u0.voting_8==0))) + (!(E((((((((u0.ready==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_10==1)) U ((((u0.voting_2==1)||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_8==1)))) * (((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_10==1)))) * (!(EF(((((((u0.ready==0)&&(u0.voting_2==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0)))) + ((((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))))) U (EF(AX(AF((((((u0.ready==1)||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_10==1))))) * AG(((((((((((((((((!(A((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_9==1)) U (((((((u0.voting_1==1)||(u0.voting_3==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_10==1)))) * (u0.voting_1==0)) * (u0.voting_4==0)) * (u0.voting_6==0)) * (u0.voting_7==0)) * (u0.voting_10==0)) * (u0.ready==0)) * (u0.voting_2==0)) * (u0.voting_3==0)) * (u0.voting_5==0)) * (u0.voting_6==0)) * (u0.voting_7==0)) * (u0.voting_8==0)) * (u0.voting_1==0)) * (u0.voting_4==0)) * (u0.voting_7==0)) * (u0.voting_10==0)))))
=> equivalent forward existential formula: [((FwdU(Init,(E((((((((((((u0.voting_2==1)||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_8==1))||(u0.voting_3==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_9==1))||(u0.voting_10==1))||((((u0.voting_1==1)||(u0.voting_5==1))||(u0.voting_6==1))&&((((((u0.voting_1==1)||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_9==1)))) U ((((((((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_9==0))&&(u0.ready==0))&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_9==0))) + (((((!(!((E(!((((u0.voting_3==1)||(u0.voting_9==1))||(u0.voting_10==1))) U (!(((u0.voting_1==1)||(u0.voting_10==1))) * !((((u0.voting_3==1)||(u0.voting_9==1))||(u0.voting_10==1))))) + EG(!((((u0.voting_3==1)||(u0.voting_9==1))||(u0.voting_10==1))))))) + !(!(EG(!(EG((((u0.voting_5==1)||(u0.voting_7==1))||(u0.voting_8==1)))))))) + (((u0.ready==0)&&(u0.voting_3==0))&&(u0.voting_7==0))) + ((((((u0.ready==0)&&(u0.voting_1==0))&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_6==0))&&(u0.voting_8==0))) + (!(E((((((((u0.ready==1)||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_8==1))||(u0.voting_10==1)) U ((((u0.voting_2==1)||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_8==1)))) * (((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_4==1))||(u0.voting_10==1)))) * (!(E(TRUE U ((((((u0.ready==0)&&(u0.voting_2==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0))&&(u0.voting_10==0)))) + ((((((((u0.voting_1==0)&&(u0.voting_2==0))&&(u0.voting_3==0))&&(u0.voting_5==0))&&(u0.voting_6==0))&&(u0.voting_7==0))&&(u0.voting_8==0))&&(u0.voting_9==0)))))) * E(TRUE U !(EX(!(!(EG(!((((((u0.ready==1)||(u0.voting_4==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_10==1)))))))))) * !(E(TRUE U !(((((((((((((((((!(!((E(!((((((((u0.voting_1==1)||(u0.voting_3==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_10==1))) U (!((((((u0.voting_1==1)||(u0.voting_2==1))||(u0.voting_3==1))||(u0.voting_6==1))||(u0.voting_9==1))) * !((((((((u0.voting_1==1)||(u0.voting_3==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_10==1))))) + EG(!((((((((u0.voting_1==1)||(u0.voting_3==1))||(u0.voting_5==1))||(u0.voting_6==1))||(u0.voting_7==1))||(u0.voting_8==1))||(u0.voting_10==1))))))) * (u0.voting_1==0)) * (u0.voting_4==0)) * (u0.voting_6==0)) * (u0.voting_7==0)) * (u0.voting_10==0)) * (u0.ready==0)) * (u0.voting_2==0)) * (u0.voting_3==0)) * (u0.voting_5==0)) * (u0.voting_6==0)) * (u0.voting_7==0)) * (u0.voting_8==0)) * (u0.voting_1==0)) * (u0.voting_4==0)) * (u0.voting_7==0)) * (u0.voting_10==0))))))] != FALSE
(forward)formula 11,1,0.174099,7156,1,0,570,7568,572,524,872,14613,1063
FORMULA Referendum-PT-0010-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************


BK_STOP 1621260476505

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-4028"
echo " Executing tool itstools"
echo " Input is Referendum-PT-0010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089415900514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0010.tgz
mv Referendum-PT-0010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; 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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;