Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033476601012.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 ShieldRVt-PT-010B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476601012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 3.2K May 14 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 20:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 20:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 09:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 09:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 119K May 12 20:42 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 ShieldRVt-PT-010B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590630996352

[2020-05-28 01:56:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-28 01:56:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 01:56:38] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2020-05-28 01:56:38] [INFO ] Transformed 503 places.
[2020-05-28 01:56:38] [INFO ] Transformed 503 transitions.
[2020-05-28 01:56:38] [INFO ] Found NUPN structural information;
[2020-05-28 01:56:38] [INFO ] Parsed PT model containing 503 places and 503 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 234 ms. (steps per millisecond=427 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 503 rows 503 cols
[2020-05-28 01:56:38] [INFO ] Computed 41 place invariants in 28 ms
[2020-05-28 01:56:38] [INFO ] [Real]Absence check using 41 positive place invariants in 41 ms returned sat
[2020-05-28 01:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:56:39] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2020-05-28 01:56:39] [INFO ] Deduced a trap composed of 29 places in 196 ms
[2020-05-28 01:56:39] [INFO ] Deduced a trap composed of 23 places in 164 ms
[2020-05-28 01:56:39] [INFO ] Deduced a trap composed of 31 places in 119 ms
[2020-05-28 01:56:39] [INFO ] Deduced a trap composed of 20 places in 95 ms
[2020-05-28 01:56:40] [INFO ] Deduced a trap composed of 30 places in 82 ms
[2020-05-28 01:56:40] [INFO ] Deduced a trap composed of 26 places in 82 ms
[2020-05-28 01:56:40] [INFO ] Deduced a trap composed of 33 places in 76 ms
[2020-05-28 01:56:40] [INFO ] Deduced a trap composed of 25 places in 109 ms
[2020-05-28 01:56:40] [INFO ] Deduced a trap composed of 39 places in 73 ms
[2020-05-28 01:56:40] [INFO ] Deduced a trap composed of 22 places in 64 ms
[2020-05-28 01:56:40] [INFO ] Deduced a trap composed of 23 places in 88 ms
[2020-05-28 01:56:40] [INFO ] Deduced a trap composed of 26 places in 52 ms
[2020-05-28 01:56:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1493 ms
[2020-05-28 01:56:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:56:40] [INFO ] [Nat]Absence check using 41 positive place invariants in 43 ms returned sat
[2020-05-28 01:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:56:41] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2020-05-28 01:56:41] [INFO ] Deduced a trap composed of 34 places in 185 ms
[2020-05-28 01:56:41] [INFO ] Deduced a trap composed of 23 places in 136 ms
[2020-05-28 01:56:41] [INFO ] Deduced a trap composed of 30 places in 93 ms
[2020-05-28 01:56:41] [INFO ] Deduced a trap composed of 35 places in 100 ms
[2020-05-28 01:56:41] [INFO ] Deduced a trap composed of 34 places in 86 ms
[2020-05-28 01:56:42] [INFO ] Deduced a trap composed of 33 places in 88 ms
[2020-05-28 01:56:42] [INFO ] Deduced a trap composed of 31 places in 90 ms
[2020-05-28 01:56:42] [INFO ] Deduced a trap composed of 34 places in 79 ms
[2020-05-28 01:56:42] [INFO ] Deduced a trap composed of 29 places in 82 ms
[2020-05-28 01:56:42] [INFO ] Deduced a trap composed of 51 places in 75 ms
[2020-05-28 01:56:42] [INFO ] Deduced a trap composed of 28 places in 71 ms
[2020-05-28 01:56:42] [INFO ] Deduced a trap composed of 29 places in 66 ms
[2020-05-28 01:56:42] [INFO ] Deduced a trap composed of 26 places in 69 ms
[2020-05-28 01:56:42] [INFO ] Deduced a trap composed of 36 places in 62 ms
[2020-05-28 01:56:42] [INFO ] Deduced a trap composed of 31 places in 60 ms
[2020-05-28 01:56:42] [INFO ] Deduced a trap composed of 30 places in 49 ms
[2020-05-28 01:56:43] [INFO ] Deduced a trap composed of 29 places in 45 ms
[2020-05-28 01:56:43] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1770 ms
[2020-05-28 01:56:43] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints in 27 ms.
[2020-05-28 01:56:46] [INFO ] Added : 498 causal constraints over 100 iterations in 3210 ms. Result :sat
[2020-05-28 01:56:46] [INFO ] [Real]Absence check using 41 positive place invariants in 30 ms returned sat
[2020-05-28 01:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:56:46] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2020-05-28 01:56:47] [INFO ] Deduced a trap composed of 31 places in 154 ms
[2020-05-28 01:56:47] [INFO ] Deduced a trap composed of 29 places in 135 ms
[2020-05-28 01:56:47] [INFO ] Deduced a trap composed of 23 places in 125 ms
[2020-05-28 01:56:47] [INFO ] Deduced a trap composed of 27 places in 108 ms
[2020-05-28 01:56:47] [INFO ] Deduced a trap composed of 26 places in 104 ms
[2020-05-28 01:56:47] [INFO ] Deduced a trap composed of 58 places in 96 ms
[2020-05-28 01:56:47] [INFO ] Deduced a trap composed of 26 places in 112 ms
[2020-05-28 01:56:48] [INFO ] Deduced a trap composed of 20 places in 143 ms
[2020-05-28 01:56:48] [INFO ] Deduced a trap composed of 32 places in 97 ms
[2020-05-28 01:56:48] [INFO ] Deduced a trap composed of 30 places in 113 ms
[2020-05-28 01:56:48] [INFO ] Deduced a trap composed of 36 places in 93 ms
[2020-05-28 01:56:48] [INFO ] Deduced a trap composed of 41 places in 92 ms
[2020-05-28 01:56:48] [INFO ] Deduced a trap composed of 30 places in 87 ms
[2020-05-28 01:56:48] [INFO ] Deduced a trap composed of 28 places in 67 ms
[2020-05-28 01:56:48] [INFO ] Deduced a trap composed of 30 places in 53 ms
[2020-05-28 01:56:48] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1909 ms
[2020-05-28 01:56:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:56:48] [INFO ] [Nat]Absence check using 41 positive place invariants in 42 ms returned sat
[2020-05-28 01:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:56:49] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2020-05-28 01:56:49] [INFO ] Deduced a trap composed of 31 places in 114 ms
[2020-05-28 01:56:49] [INFO ] Deduced a trap composed of 25 places in 129 ms
[2020-05-28 01:56:49] [INFO ] Deduced a trap composed of 20 places in 118 ms
[2020-05-28 01:56:49] [INFO ] Deduced a trap composed of 31 places in 119 ms
[2020-05-28 01:56:49] [INFO ] Deduced a trap composed of 27 places in 117 ms
[2020-05-28 01:56:50] [INFO ] Deduced a trap composed of 22 places in 113 ms
[2020-05-28 01:56:50] [INFO ] Deduced a trap composed of 33 places in 120 ms
[2020-05-28 01:56:50] [INFO ] Deduced a trap composed of 52 places in 115 ms
[2020-05-28 01:56:50] [INFO ] Deduced a trap composed of 41 places in 114 ms
[2020-05-28 01:56:50] [INFO ] Deduced a trap composed of 34 places in 163 ms
[2020-05-28 01:56:50] [INFO ] Deduced a trap composed of 30 places in 109 ms
[2020-05-28 01:56:51] [INFO ] Deduced a trap composed of 30 places in 169 ms
[2020-05-28 01:56:51] [INFO ] Deduced a trap composed of 45 places in 127 ms
[2020-05-28 01:56:51] [INFO ] Deduced a trap composed of 28 places in 107 ms
[2020-05-28 01:56:51] [INFO ] Deduced a trap composed of 19 places in 156 ms
[2020-05-28 01:56:51] [INFO ] Deduced a trap composed of 23 places in 103 ms
[2020-05-28 01:56:51] [INFO ] Deduced a trap composed of 24 places in 85 ms
[2020-05-28 01:56:51] [INFO ] Deduced a trap composed of 33 places in 130 ms
[2020-05-28 01:56:51] [INFO ] Deduced a trap composed of 44 places in 92 ms
[2020-05-28 01:56:51] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2608 ms
[2020-05-28 01:56:51] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints in 20 ms.
[2020-05-28 01:56:55] [INFO ] Added : 470 causal constraints over 95 iterations in 3456 ms. Result :sat
[2020-05-28 01:56:55] [INFO ] [Real]Absence check using 41 positive place invariants in 35 ms returned sat
[2020-05-28 01:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:56:56] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2020-05-28 01:56:56] [INFO ] Deduced a trap composed of 40 places in 188 ms
[2020-05-28 01:56:56] [INFO ] Deduced a trap composed of 49 places in 184 ms
[2020-05-28 01:56:56] [INFO ] Deduced a trap composed of 33 places in 162 ms
[2020-05-28 01:56:56] [INFO ] Deduced a trap composed of 32 places in 155 ms
[2020-05-28 01:56:57] [INFO ] Deduced a trap composed of 24 places in 151 ms
[2020-05-28 01:56:57] [INFO ] Deduced a trap composed of 25 places in 110 ms
[2020-05-28 01:56:57] [INFO ] Deduced a trap composed of 35 places in 106 ms
[2020-05-28 01:56:57] [INFO ] Deduced a trap composed of 39 places in 117 ms
[2020-05-28 01:56:57] [INFO ] Deduced a trap composed of 21 places in 110 ms
[2020-05-28 01:56:57] [INFO ] Deduced a trap composed of 28 places in 99 ms
[2020-05-28 01:56:57] [INFO ] Deduced a trap composed of 40 places in 94 ms
[2020-05-28 01:56:57] [INFO ] Deduced a trap composed of 29 places in 98 ms
[2020-05-28 01:56:58] [INFO ] Deduced a trap composed of 26 places in 89 ms
[2020-05-28 01:56:58] [INFO ] Deduced a trap composed of 24 places in 80 ms
[2020-05-28 01:56:58] [INFO ] Deduced a trap composed of 27 places in 132 ms
[2020-05-28 01:56:58] [INFO ] Deduced a trap composed of 22 places in 99 ms
[2020-05-28 01:56:58] [INFO ] Deduced a trap composed of 30 places in 131 ms
[2020-05-28 01:56:58] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2485 ms
[2020-05-28 01:56:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:56:58] [INFO ] [Nat]Absence check using 41 positive place invariants in 63 ms returned sat
[2020-05-28 01:56:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:56:59] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2020-05-28 01:56:59] [INFO ] Deduced a trap composed of 29 places in 211 ms
[2020-05-28 01:56:59] [INFO ] Deduced a trap composed of 34 places in 176 ms
[2020-05-28 01:57:00] [INFO ] Deduced a trap composed of 32 places in 169 ms
[2020-05-28 01:57:00] [INFO ] Deduced a trap composed of 29 places in 150 ms
[2020-05-28 01:57:00] [INFO ] Deduced a trap composed of 27 places in 149 ms
[2020-05-28 01:57:00] [INFO ] Deduced a trap composed of 29 places in 148 ms
[2020-05-28 01:57:00] [INFO ] Deduced a trap composed of 27 places in 189 ms
[2020-05-28 01:57:00] [INFO ] Deduced a trap composed of 27 places in 122 ms
[2020-05-28 01:57:01] [INFO ] Deduced a trap composed of 40 places in 108 ms
[2020-05-28 01:57:01] [INFO ] Deduced a trap composed of 42 places in 110 ms
[2020-05-28 01:57:01] [INFO ] Deduced a trap composed of 38 places in 111 ms
[2020-05-28 01:57:01] [INFO ] Deduced a trap composed of 23 places in 115 ms
[2020-05-28 01:57:01] [INFO ] Deduced a trap composed of 21 places in 90 ms
[2020-05-28 01:57:01] [INFO ] Deduced a trap composed of 34 places in 85 ms
[2020-05-28 01:57:01] [INFO ] Deduced a trap composed of 26 places in 75 ms
[2020-05-28 01:57:01] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2322 ms
[2020-05-28 01:57:01] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints in 27 ms.
[2020-05-28 01:57:04] [INFO ] Added : 476 causal constraints over 96 iterations in 2890 ms. Result :sat
[2020-05-28 01:57:04] [INFO ] Flatten gal took : 66 ms
[2020-05-28 01:57:04] [INFO ] Flatten gal took : 26 ms
[2020-05-28 01:57:04] [INFO ] Applying decomposition
[2020-05-28 01:57:04] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph906725669920268470.txt, -o, /tmp/graph906725669920268470.bin, -w, /tmp/graph906725669920268470.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph906725669920268470.bin, -l, -1, -v, -w, /tmp/graph906725669920268470.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 01:57:05] [INFO ] Decomposing Gal with order
[2020-05-28 01:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 01:57:05] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-28 01:57:05] [INFO ] Flatten gal took : 68 ms
[2020-05-28 01:57:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-28 01:57:05] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 10 ms
[2020-05-28 01:57:05] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 46 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 18 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
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,1.49538e+39,22.4745,358056,2256,31,444599,288,737,1.66315e+06,40,827,0


Converting to forward existential form...Done !
original formula: EX(((EF((i1.i3.u16.p42==1)) * (i5.u47.p122!=1)) * (i24.u195.p483!=1)))
=> equivalent forward existential formula: [(FwdU(((EY(Init) * (i24.u195.p483!=1)) * (i5.u47.p122!=1)),TRUE) * (i1.i3.u16.p42==1))] != FALSE
(forward)formula 0,1,45.7347,372432,1,0,457983,288,1853,1.7578e+06,72,827,619005
FORMULA ShieldRVt-PT-010B-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(!(EF((i21.i1.u167.p420==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U (i21.i1.u167.p420==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.i1.t396, i0.i1.u34.t400, i0.i1.u34.t402, i0.i2.t372, i0.i2.t379, i0.i2.u41.t377, i0.i2.u44.t373, i0.i2.u44.t380, i1.i0.u4.t460, i1.i2.t442, i1.i2.u14.t446, i1.i2.u14.t448, i1.i3.t430, i1.i3.t437, i1.i3.u16.t435, i1.i3.u18.t431, i1.i3.u18.t438, i1.i4.t418, i1.i4.t425, i1.i4.u20.t423, i1.i4.u23.t419, i1.i4.u23.t426, i2.t458, i2.t451, i2.u8.t452, i2.u8.t459, i2.u10.t456, i3.t412, i3.t405, i3.u28.t406, i3.u28.t413, i3.u30.t410, i4.t391, i4.t384, i4.u38.t385, i4.u38.t392, i4.u39.t389, i5.t366, i5.t359, i5.u47.t360, i5.u47.t367, i5.u50.t364, i6.i1.t350, i6.i1.u54.t354, i6.i1.u54.t356, i6.i2.t326, i6.i2.t333, i6.i2.u61.t331, i6.i2.u63.t327, i6.i2.u63.t334, i7.t345, i7.t338, i7.u58.t339, i7.u58.t346, i7.u59.t343, i8.i1.t304, i8.i1.u74.t308, i8.i1.u74.t310, i8.i2.t280, i8.i2.t287, i8.i2.u83.t281, i8.i2.u83.t288, i8.i2.u84.t285, i9.t320, i9.t313, i9.u70.t314, i9.u70.t321, i9.u71.t318, i10.t299, i10.t292, i10.u76.t297, i10.u79.t293, i10.u79.t300, i11.i1.t267, i11.i1.t274, i11.i1.u87.t268, i11.i1.u87.t275, i11.i1.u89.t272, i11.i2.t258, i11.i2.u94.t262, i11.i2.u94.t264, i11.i3.t234, i11.i3.t241, i11.i3.u100.t239, i11.i3.u103.t235, i11.i3.u103.t242, i12.t253, i12.t246, i12.u97.t247, i12.u97.t254, i12.u98.t251, i13.i1.t221, i13.i1.t228, i13.i1.u110.t222, i13.i1.u110.t229, i13.i1.u111.t226, i14.t207, i14.t200, i14.u116.t201, i14.u116.t208, i14.u119.t205, i15.i0.t212, i15.i0.u114.t216, i15.i0.u114.t218, i15.i1.t188, i15.i1.t195, i15.i1.u123.t189, i15.i1.u123.t196, i15.i1.u124.t193, i16.i1.t166, i16.i1.u134.t170, i16.i1.u134.t172, i16.i2.t142, i16.i2.t149, i16.i2.u140.t143, i16.i2.u140.t150, i16.i2.u143.t147, i17.t182, i17.t175, i17.u128.t176, i17.u128.t183, i17.u131.t180, i18.t161, i18.t154, i18.u135.t159, i18.u138.t155, i18.u138.t162, i19.t136, i19.t129, i19.u148.t134, i19.u150.t130, i19.u150.t137, i20.i0.t120, i20.i0.u153.t124, i20.i0.u153.t126, i20.i2.t108, i20.i2.t115, i20.i2.u157.t113, i20.i2.u159.t109, i20.i2.u159.t116, i20.i3.t96, i20.i3.t103, i20.i3.u162.t97, i20.i3.u162.t104, i20.i3.u163.t101, i21.i1.t83, i21.i1.t90, i21.i1.u168.t84, i21.i1.u168.t91, i21.i1.u169.t88, i21.i2.t74, i21.i2.u173.t78, i21.i2.u173.t80, i21.i3.t50, i21.i3.t57, i21.i3.u181.t51, i21.i3.u181.t58, i21.i3.u184.t55, i22.t69, i22.t62, i22.u176.t63, i22.u176.t70, i22.u179.t67, i23.i1.t37, i23.i1.t42, i23.i1.u187.t38, i23.i1.u187.t45, i23.i1.u189.t44, i23.i2.t28, i23.i2.u193.t32, i23.i2.u193.t34, i23.i3.t4, i23.i3.t11, i23.i3.u199.t5, i23.i3.u199.t12, i23.i3.u202.t9, i24.t23, i24.t16, i24.u195.t21, i24.u198.t17, i24.u198.t24, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/322/181/503
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Detected timeout of ITS tools.
[2020-05-28 02:17:13] [INFO ] Applying decomposition
[2020-05-28 02:17:13] [INFO ] Flatten gal took : 22 ms
[2020-05-28 02:17:13] [INFO ] Decomposing Gal with order
[2020-05-28 02:17:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 02:17:13] [INFO ] Flatten gal took : 21 ms
[2020-05-28 02:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-05-28 02:17:13] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 5 ms
[2020-05-28 02:17:13] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 2 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
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,1.49538e+39,166.707,2594368,1055,228,4.36965e+06,615,177,1.65054e+07,93,6928,0


Converting to forward existential form...Done !
original formula: AF(!(EF((i0.i1.i0.i0.u70.p420==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U (i0.i1.i0.i0.u70.p420==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t460, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u17.t418, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u17.t419, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u17.t423, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u17.t425, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u17.t426, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u16.t430, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u16.t431, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u16.t435, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u16.t437, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u16.t438, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u14.t451, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u14.t452, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u14.t456, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u14.t458, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u14.t459, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u15.t442, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u15.t446, i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u15.t448, i0.i0.i0.i0.i0.i0.i0.i0.i1.u24.t372, i0.i0.i0.i0.i0.i0.i0.i0.i1.u24.t373, i0.i0.i0.i0.i0.i0.i0.i0.i1.u24.t377, i0.i0.i0.i0.i0.i0.i0.i0.i1.u24.t379, i0.i0.i0.i0.i0.i0.i0.i0.i1.u24.t380, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u23.t384, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u23.t385, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u23.t389, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u23.t391, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u23.t392, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u21.t405, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u21.t406, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u21.t410, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u21.t412, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u21.t413, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u22.t396, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u22.t400, i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u22.t402, i0.i0.i0.i0.i0.i0.i0.i1.u31.t326, i0.i0.i0.i0.i0.i0.i0.i1.u31.t327, i0.i0.i0.i0.i0.i0.i0.i1.u31.t331, i0.i0.i0.i0.i0.i0.i0.i1.u31.t333, i0.i0.i0.i0.i0.i0.i0.i1.u31.t334, i0.i0.i0.i0.i0.i0.i0.i1.i0.u30.t338, i0.i0.i0.i0.i0.i0.i0.i1.i0.u30.t339, i0.i0.i0.i0.i0.i0.i0.i1.i0.u30.t343, i0.i0.i0.i0.i0.i0.i0.i1.i0.u30.t345, i0.i0.i0.i0.i0.i0.i0.i1.i0.u30.t346, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u28.t359, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u28.t360, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u28.t364, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u28.t366, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u28.t367, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u29.t350, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u29.t354, i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u29.t356, i0.i0.i0.i0.i0.i0.i1.u38.t280, i0.i0.i0.i0.i0.i0.i1.u38.t281, i0.i0.i0.i0.i0.i0.i1.u38.t285, i0.i0.i0.i0.i0.i0.i1.u38.t287, i0.i0.i0.i0.i0.i0.i1.u38.t288, i0.i0.i0.i0.i0.i0.i1.i0.u37.t292, i0.i0.i0.i0.i0.i0.i1.i0.u37.t293, i0.i0.i0.i0.i0.i0.i1.i0.u37.t297, i0.i0.i0.i0.i0.i0.i1.i0.u37.t299, i0.i0.i0.i0.i0.i0.i1.i0.u37.t300, i0.i0.i0.i0.i0.i0.i1.i0.i0.u35.t313, i0.i0.i0.i0.i0.i0.i1.i0.i0.u35.t314, i0.i0.i0.i0.i0.i0.i1.i0.i0.u35.t318, i0.i0.i0.i0.i0.i0.i1.i0.i0.u35.t320, i0.i0.i0.i0.i0.i0.i1.i0.i0.u35.t321, i0.i0.i0.i0.i0.i0.i1.i0.i0.u36.t304, i0.i0.i0.i0.i0.i0.i1.i0.i0.u36.t308, i0.i0.i0.i0.i0.i0.i1.i0.i0.u36.t310, i0.i0.i0.i0.i0.i1.u45.t234, i0.i0.i0.i0.i0.i1.u45.t235, i0.i0.i0.i0.i0.i1.u45.t239, i0.i0.i0.i0.i0.i1.u45.t241, i0.i0.i0.i0.i0.i1.u45.t242, i0.i0.i0.i0.i0.i1.i0.u44.t246, i0.i0.i0.i0.i0.i1.i0.u44.t247, i0.i0.i0.i0.i0.i1.i0.u44.t251, i0.i0.i0.i0.i0.i1.i0.u44.t253, i0.i0.i0.i0.i0.i1.i0.u44.t254, i0.i0.i0.i0.i0.i1.i0.i0.u42.t267, i0.i0.i0.i0.i0.i1.i0.i0.u42.t268, i0.i0.i0.i0.i0.i1.i0.i0.u42.t272, i0.i0.i0.i0.i0.i1.i0.i0.u42.t274, i0.i0.i0.i0.i0.i1.i0.i0.u42.t275, i0.i0.i0.i0.i0.i1.i0.i0.u43.t258, i0.i0.i0.i0.i0.i1.i0.i0.u43.t262, i0.i0.i0.i0.i0.i1.i0.i0.u43.t264, i0.i0.i0.i0.i1.u52.t188, i0.i0.i0.i0.i1.u52.t189, i0.i0.i0.i0.i1.u52.t193, i0.i0.i0.i0.i1.u52.t195, i0.i0.i0.i0.i1.u52.t196, i0.i0.i0.i0.i1.i0.u51.t200, i0.i0.i0.i0.i1.i0.u51.t201, i0.i0.i0.i0.i1.i0.u51.t205, i0.i0.i0.i0.i1.i0.u51.t207, i0.i0.i0.i0.i1.i0.u51.t208, i0.i0.i0.i0.i1.i0.i0.u49.t221, i0.i0.i0.i0.i1.i0.i0.u49.t222, i0.i0.i0.i0.i1.i0.i0.u49.t226, i0.i0.i0.i0.i1.i0.i0.u49.t228, i0.i0.i0.i0.i1.i0.i0.u49.t229, i0.i0.i0.i0.i1.i0.i0.u50.t212, i0.i0.i0.i0.i1.i0.i0.u50.t216, i0.i0.i0.i0.i1.i0.i0.u50.t218, i0.i0.i0.i1.u59.t142, i0.i0.i0.i1.u59.t143, i0.i0.i0.i1.u59.t147, i0.i0.i0.i1.u59.t149, i0.i0.i0.i1.u59.t150, i0.i0.i0.i1.i0.u58.t154, i0.i0.i0.i1.i0.u58.t155, i0.i0.i0.i1.i0.u58.t159, i0.i0.i0.i1.i0.u58.t161, i0.i0.i0.i1.i0.u58.t162, i0.i0.i0.i1.i0.i0.u56.t175, i0.i0.i0.i1.i0.i0.u56.t176, i0.i0.i0.i1.i0.i0.u56.t180, i0.i0.i0.i1.i0.i0.u56.t182, i0.i0.i0.i1.i0.i0.u56.t183, i0.i0.i0.i1.i0.i0.u57.t166, i0.i0.i0.i1.i0.i0.u57.t170, i0.i0.i0.i1.i0.i0.u57.t172, i0.i0.i1.u66.t96, i0.i0.i1.u66.t97, i0.i0.i1.u66.t101, i0.i0.i1.u66.t103, i0.i0.i1.u66.t104, i0.i0.i1.i0.u65.t108, i0.i0.i1.i0.u65.t109, i0.i0.i1.i0.u65.t113, i0.i0.i1.i0.u65.t115, i0.i0.i1.i0.u65.t116, i0.i0.i1.i0.i0.u63.t129, i0.i0.i1.i0.i0.u63.t130, i0.i0.i1.i0.i0.u63.t134, i0.i0.i1.i0.i0.u63.t136, i0.i0.i1.i0.i0.u63.t137, i0.i0.i1.i0.i0.u64.t120, i0.i0.i1.i0.i0.u64.t124, i0.i0.i1.i0.i0.u64.t126, i0.i1.u73.t50, i0.i1.u73.t51, i0.i1.u73.t55, i0.i1.u73.t57, i0.i1.u73.t58, i0.i1.i0.u72.t62, i0.i1.i0.u72.t63, i0.i1.i0.u72.t67, i0.i1.i0.u72.t69, i0.i1.i0.u72.t70, i0.i1.i0.i0.u70.t83, i0.i1.i0.i0.u70.t84, i0.i1.i0.i0.u70.t88, i0.i1.i0.i0.u70.t90, i0.i1.i0.i0.u70.t91, i0.i1.i0.i0.u71.t74, i0.i1.i0.i0.u71.t78, i0.i1.i0.i0.u71.t80, i1.u80.t4, i1.u80.t5, i1.u80.t9, i1.u80.t11, i1.u80.t12, i1.i0.u79.t16, i1.i0.u79.t17, i1.i0.u79.t21, i1.i0.u79.t23, i1.i0.u79.t24, i1.i0.i0.u77.t37, i1.i0.i0.u77.t38, i1.i0.i0.u77.t42, i1.i0.i0.u77.t44, i1.i0.i0.u77.t45, i1.i0.i0.u78.t28, i1.i0.i0.u78.t32, i1.i0.i0.u78.t34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/322/181/503
Detected timeout of ITS tools.
[2020-05-28 02:37:21] [INFO ] Flatten gal took : 19 ms
[2020-05-28 02:37:21] [INFO ] Input system was already deterministic with 503 transitions.
[2020-05-28 02:37:21] [INFO ] Transformed 503 places.
[2020-05-28 02:37:21] [INFO ] Transformed 503 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-28 02:37:22] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
[2020-05-28 02:37:22] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl, --load-order, /home/mcc/execution/model.ord, --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.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 15 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,1.49538e+39,8.16871,242660,2,25576,5,757845,6,0,2517,1.56222e+06,0


Converting to forward existential form...Done !
original formula: AF(!(EF((p420==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U (p420==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t9, t11, t12, t16, t17, t21, t23, t24, t28, t32, t34, t37, t38, t42, t44, t45, t50, t51, t55, t57, t58, t62, t63, t67, t69, t70, t74, t78, t80, t83, t84, t88, t90, t91, t96, t97, t101, t103, t104, t108, t109, t113, t115, t116, t120, t124, t126, t129, t130, t134, t136, t137, t142, t143, t147, t149, t150, t154, t155, t159, t161, t162, t166, t170, t172, t175, t176, t180, t182, t183, t188, t189, t193, t195, t196, t200, t201, t205, t207, t208, t212, t216, t218, t221, t222, t226, t228, t229, t234, t235, t239, t241, t242, t246, t247, t251, t253, t254, t258, t262, t264, t267, t268, t272, t274, t275, t280, t281, t285, t287, t288, t292, t293, t297, t299, t300, t304, t308, t310, t313, t314, t318, t320, t321, t326, t327, t331, t333, t334, t338, t339, t343, t345, t346, t350, t354, t356, t359, t360, t364, t366, t367, t372, t373, t377, t379, t380, t384, t385, t389, t391, t392, t396, t400, t402, t405, t406, t410, t412, t413, t418, t419, t423, t425, t426, t430, t431, t435, t437, t438, t442, t446, t448, t451, t452, t456, t458, t459, t460, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/322/181/503

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ShieldRVt-PT-010B"
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"

# 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 ShieldRVt-PT-010B, 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 r210-tajo-159033476601012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-010B.tgz
mv ShieldRVt-PT-010B 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 ;