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-159033476500948.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-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476500948
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.7K May 14 02:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 02:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 13 20:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 13 20:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.3K May 13 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 24K 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-002B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590630293154

[2020-05-28 01:44:54] [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:44:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 01:44:54] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-05-28 01:44:54] [INFO ] Transformed 103 places.
[2020-05-28 01:44:54] [INFO ] Transformed 103 transitions.
[2020-05-28 01:44:54] [INFO ] Found NUPN structural information;
[2020-05-28 01:44:54] [INFO ] Parsed PT model containing 103 places and 103 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Incomplete random walk after 100000 steps, including 51 resets, run finished after 165 ms. (steps per millisecond=606 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 103 rows 103 cols
[2020-05-28 01:44:55] [INFO ] Computed 9 place invariants in 6 ms
[2020-05-28 01:44:55] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2020-05-28 01:44:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:55] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-05-28 01:44:55] [INFO ] Deduced a trap composed of 13 places in 55 ms
[2020-05-28 01:44:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2020-05-28 01:44:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:44:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 24 ms returned sat
[2020-05-28 01:44:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:55] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-05-28 01:44:55] [INFO ] Deduced a trap composed of 13 places in 28 ms
[2020-05-28 01:44:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2020-05-28 01:44:55] [INFO ] Computed and/alt/rep : 102/151/102 causal constraints in 6 ms.
[2020-05-28 01:44:55] [INFO ] Added : 95 causal constraints over 19 iterations in 134 ms. Result :unsat
[2020-05-28 01:44:55] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2020-05-28 01:44:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:55] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-05-28 01:44:55] [INFO ] Deduced a trap composed of 25 places in 21 ms
[2020-05-28 01:44:55] [INFO ] Deduced a trap composed of 21 places in 22 ms
[2020-05-28 01:44:55] [INFO ] Deduced a trap composed of 25 places in 16 ms
[2020-05-28 01:44:55] [INFO ] Deduced a trap composed of 21 places in 15 ms
[2020-05-28 01:44:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 95 ms
[2020-05-28 01:44:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:44:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2020-05-28 01:44:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:55] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-05-28 01:44:55] [INFO ] Deduced a trap composed of 25 places in 17 ms
[2020-05-28 01:44:55] [INFO ] Deduced a trap composed of 21 places in 18 ms
[2020-05-28 01:44:55] [INFO ] Deduced a trap composed of 25 places in 15 ms
[2020-05-28 01:44:55] [INFO ] Deduced a trap composed of 12 places in 15 ms
[2020-05-28 01:44:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 91 ms
[2020-05-28 01:44:56] [INFO ] Computed and/alt/rep : 102/151/102 causal constraints in 5 ms.
[2020-05-28 01:44:56] [INFO ] Added : 100 causal constraints over 21 iterations in 137 ms. Result :sat
[2020-05-28 01:44:56] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2020-05-28 01:44:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:56] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2020-05-28 01:44:56] [INFO ] Deduced a trap composed of 12 places in 22 ms
[2020-05-28 01:44:56] [INFO ] Deduced a trap composed of 20 places in 15 ms
[2020-05-28 01:44:56] [INFO ] Deduced a trap composed of 21 places in 13 ms
[2020-05-28 01:44:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 65 ms
[2020-05-28 01:44:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:44:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 27 ms returned sat
[2020-05-28 01:44:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:56] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-05-28 01:44:56] [INFO ] Deduced a trap composed of 12 places in 14 ms
[2020-05-28 01:44:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2020-05-28 01:44:56] [INFO ] Computed and/alt/rep : 102/151/102 causal constraints in 5 ms.
[2020-05-28 01:44:56] [INFO ] Added : 95 causal constraints over 20 iterations in 124 ms. Result :sat
[2020-05-28 01:44:56] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2020-05-28 01:44:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:56] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-05-28 01:44:56] [INFO ] Deduced a trap composed of 13 places in 24 ms
[2020-05-28 01:44:56] [INFO ] Deduced a trap composed of 27 places in 24 ms
[2020-05-28 01:44:56] [INFO ] Deduced a trap composed of 19 places in 38 ms
[2020-05-28 01:44:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 103 ms
[2020-05-28 01:44:56] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2020-05-28 01:44:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:56] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2020-05-28 01:44:56] [INFO ] Deduced a trap composed of 12 places in 13 ms
[2020-05-28 01:44:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2020-05-28 01:44:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:44:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 17 ms returned sat
[2020-05-28 01:44:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:56] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2020-05-28 01:44:56] [INFO ] Deduced a trap composed of 12 places in 8 ms
[2020-05-28 01:44:56] [INFO ] Deduced a trap composed of 19 places in 29 ms
[2020-05-28 01:44:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 49 ms
[2020-05-28 01:44:56] [INFO ] Computed and/alt/rep : 102/151/102 causal constraints in 5 ms.
[2020-05-28 01:44:57] [INFO ] Added : 95 causal constraints over 19 iterations in 156 ms. Result :unsat
[2020-05-28 01:44:57] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2020-05-28 01:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:57] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-05-28 01:44:57] [INFO ] Deduced a trap composed of 26 places in 32 ms
[2020-05-28 01:44:57] [INFO ] Deduced a trap composed of 27 places in 25 ms
[2020-05-28 01:44:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2020-05-28 01:44:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:44:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2020-05-28 01:44:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:57] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-05-28 01:44:57] [INFO ] Deduced a trap composed of 21 places in 37 ms
[2020-05-28 01:44:57] [INFO ] Deduced a trap composed of 23 places in 30 ms
[2020-05-28 01:44:57] [INFO ] Deduced a trap composed of 23 places in 18 ms
[2020-05-28 01:44:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 110 ms
[2020-05-28 01:44:57] [INFO ] Computed and/alt/rep : 102/151/102 causal constraints in 6 ms.
[2020-05-28 01:44:57] [INFO ] Added : 85 causal constraints over 17 iterations in 117 ms. Result :unsat
[2020-05-28 01:44:57] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-05-28 01:44:57] [INFO ] Flatten gal took : 37 ms
[2020-05-28 01:44:57] [INFO ] Flatten gal took : 11 ms
[2020-05-28 01:44:57] [INFO ] Applying decomposition
[2020-05-28 01:44:57] [INFO ] Flatten gal took : 9 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/graph17324036915681132312.txt, -o, /tmp/graph17324036915681132312.bin, -w, /tmp/graph17324036915681132312.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/graph17324036915681132312.bin, -l, -1, -v, -w, /tmp/graph17324036915681132312.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 01:44:57] [INFO ] Decomposing Gal with order
[2020-05-28 01:44:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 01:44:57] [INFO ] Removed a total of 12 redundant transitions.
[2020-05-28 01:44:57] [INFO ] Flatten gal took : 36 ms
[2020-05-28 01:44:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-28 01:44:57] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
[2020-05-28 01:44:57] [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 14 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 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 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.65284e+08,0.084011,7528,462,28,5934,173,251,10564,38,413,0


Converting to forward existential form...Done !
original formula: E(AF((i2.u12.p31!=1)) U AX(((i8.u40.p94==1)&&(i3.u20.p48==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((i2.u12.p31!=1))))) * !(EX(!(((i8.u40.p94==1)&&(i3.u20.p48==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t90, i0.t83, i0.u7.t84, i0.u7.t91, i0.u8.t88, i1.t74, i1.u10.t78, i1.u10.t80, i2.t69, i2.t62, i2.u14.t67, i2.u16.t63, i2.u16.t70, i3.t57, i3.t50, i3.u19.t55, i3.u21.t51, i3.u21.t58, i4.i0.u1.t92, i5.t42, i5.t37, i5.u24.t38, i5.u24.t45, i5.u25.t44, i6.t28, i6.u31.t32, i6.u31.t34, i7.t23, i7.t16, i7.u33.t17, i7.u33.t24, i7.u36.t21, i8.t11, i8.t4, i8.u37.t5, i8.u37.t12, i8.u38.t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/37/103
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 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
(forward)formula 0,1,3.04997,116416,1,0,203919,337,1314,357703,175,848,233174
FORMULA ShieldRVt-PT-002B-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((AF((i7.u36.p83==1)) + ((i5.u25.p60!=1)&&(i2.u16.p39!=1))) U !(EF((i0.u7.p17==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (i0.u7.p17==1))))))) * !(E(!(!(E(TRUE U (i0.u7.p17==1)))) U (!((!(EG(!((i7.u36.p83==1)))) + ((i5.u25.p60!=1)&&(i2.u16.p39!=1)))) * !(!(E(TRUE U (i0.u7.p17==1))))))))] != FALSE
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
(forward)formula 1,0,8.54622,279120,1,0,464873,425,1636,927336,190,1026,525722
FORMULA ShieldRVt-PT-002B-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG(((((i4.i0.u0.p1==1)||(i7.u32.p80==1))||(i2.u13.p37==1)) + EG((i2.u13.p37==1)))) + !(AF((i3.u18.p49==1))))
=> equivalent forward existential formula: ([FwdG(Init,((((i4.i0.u0.p1==1)||(i7.u32.p80==1))||(i2.u13.p37==1)) + EG((i2.u13.p37==1))))] != FALSE + [FwdG(Init,!((i3.u18.p49==1)))] != FALSE)
(forward)formula 2,1,9.04378,302880,1,0,511369,451,1897,986923,200,1153,585063
FORMULA ShieldRVt-PT-002B-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF((((i4.i0.u3.p7==1)||(i5.u27.p63==1))||((i1.u11.p21==1)&&(i1.u11.p29==1)))) * (A((i8.u41.p92==1) U (i4.i1.u22.p54==1)) + AF(((i4.i0.u3.p8==1)||(i3.u18.p45==1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((i4.i0.u3.p7==1)||(i5.u27.p63==1))||((i1.u11.p21==1)&&(i1.u11.p29==1))))))] = FALSE * [FwdG((Init * !(!((E(!((i4.i1.u22.p54==1)) U (!((i8.u41.p92==1)) * !((i4.i1.u22.p54==1)))) + EG(!((i4.i1.u22.p54==1))))))),!(((i4.i0.u3.p8==1)||(i3.u18.p45==1))))] = FALSE)
(forward)formula 3,0,9.74796,333504,1,0,566856,451,1951,1.08514e+06,200,1155,654970
FORMULA ShieldRVt-PT-002B-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AF((i8.u37.p93==1)))
=> equivalent forward existential formula: [FwdG(Init,!((i8.u37.p93==1)))] != FALSE
(forward)formula 4,1,9.81041,335088,1,0,569618,451,2000,1.08857e+06,200,1158,661169
FORMULA ShieldRVt-PT-002B-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(AG((i8.u41.p92==1))) U (i4.i0.u1.p3==1))
=> equivalent forward existential formula: [(FwdU(Init,!(!(E(TRUE U !((i8.u41.p92==1)))))) * (i4.i0.u1.p3==1))] != FALSE
(forward)formula 5,1,9.87025,336408,1,0,572289,451,2003,1.09378e+06,200,1159,667680
FORMULA ShieldRVt-PT-002B-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(!(EG(((i2.u12.p31==1)||(i3.u21.p51==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((i2.u12.p31==1)||(i3.u21.p51==1)))] = FALSE
(forward)formula 6,0,10.1029,345384,1,0,593849,454,2030,1.11655e+06,200,1171,693595
FORMULA ShieldRVt-PT-002B-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(AF((i5.u28.p68==1))) * ((!(E((i3.u21.p51==1) U (i2.u12.p41==1))) + EG(((i1.u9.p25==1)||(i7.u34.p85==1)))) + AX((i1.u10.p26!=1))))
=> equivalent forward existential formula: ([(Init * !(EG(!((i5.u28.p68==1)))))] = FALSE * [(EY((Init * !((!(E((i3.u21.p51==1) U (i2.u12.p41==1))) + EG(((i1.u9.p25==1)||(i7.u34.p85==1))))))) * !((i1.u10.p26!=1)))] = FALSE)
(forward)formula 7,1,11.4125,395280,1,0,682387,462,2089,1.27585e+06,200,1186,783502
FORMULA ShieldRVt-PT-002B-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(AG((i8.u37.p93==1))) * AF(((i7.u34.p85==1)||(i5.u26.p61==1))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !((i8.u37.p93==1)))))))] = FALSE * [FwdG(Init,!(((i7.u34.p85==1)||(i5.u26.p61==1))))] = FALSE)
(forward)formula 8,0,11.4334,396072,1,0,684628,462,2107,1.27802e+06,200,1186,787431
FORMULA ShieldRVt-PT-002B-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG(AG(((((i0.u6.p13==1)&&(i5.u25.p67==1))&&(i8.u38.p101==1))&&(i1.u11.p29==1)))) + !(EF((i4.i0.u1.p3==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG(!(E(TRUE U !(((((i0.u6.p13==1)&&(i5.u25.p67==1))&&(i8.u38.p101==1))&&(i1.u11.p29==1)))))))),TRUE) * (i4.i0.u1.p3==1))] = FALSE
(forward)formula 9,0,11.4373,396336,1,0,684752,462,2124,1.27822e+06,200,1186,787877
FORMULA ShieldRVt-PT-002B-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((((i1.u11.p21!=1)||(i3.u21.p44!=1))||((i6.u29.p79!=1)&&(i2.u12.p42!=1))) U (((i2.u12.p31!=1)&&(i7.u35.p86!=1))&&(i0.u5.p11==1)))
=> equivalent forward existential formula: [(FwdU(Init,(((i1.u11.p21!=1)||(i3.u21.p44!=1))||((i6.u29.p79!=1)&&(i2.u12.p42!=1)))) * (((i2.u12.p31!=1)&&(i7.u35.p86!=1))&&(i0.u5.p11==1)))] != FALSE
(forward)formula 10,1,12.325,434152,1,0,768474,462,2166,1.36551e+06,200,1196,900705
FORMULA ShieldRVt-PT-002B-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(((i5.u24.p66==1)||(i4.i1.u23.p56==1))) + AF((i5.u27.p63==1)))
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!(((i5.u24.p66==1)||(i4.i1.u23.p56==1))))))),!((i5.u27.p63==1)))] = FALSE
(forward)formula 11,1,12.9372,458704,1,0,813702,462,2204,1.44075e+06,200,1196,958310
FORMULA ShieldRVt-PT-002B-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((((i1.u11.p30==1)||(i6.u29.p70!=1)) + EF((i1.u10.p27==1))) + ((i4.i0.u1.p2==1)&&(i2.u15.p35==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((i4.i0.u1.p2==1)&&(i2.u15.p35==1)))) * !(((i1.u11.p30==1)||(i6.u29.p70!=1)))) * !(E(TRUE U (i1.u10.p27==1))))] = FALSE
(forward)formula 12,0,14.4506,492232,1,0,868919,465,2217,1.55275e+06,201,1216,1043789
FORMULA ShieldRVt-PT-002B-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF((AF((i7.u34.p85==1)) * AG((i4.i0.u0.p0==1)))) * A((((i5.u27.p64==1)&&(i0.u7.p16==1))&&(i8.u37.p99!=1)) U (i8.u37.p93!=1)))
=> equivalent forward existential formula: [(((Init * E(TRUE U (!(EG(!((i7.u34.p85==1)))) * !(E(TRUE U !((i4.i0.u0.p0==1))))))) * !(EG(!((i8.u37.p93!=1))))) * !(E(!((i8.u37.p93!=1)) U (!((((i5.u27.p64==1)&&(i0.u7.p16==1))&&(i8.u37.p99!=1))) * !((i8.u37.p93!=1))))))] != FALSE
(forward)formula 13,0,14.6643,499888,1,0,883710,465,2242,1.5726e+06,201,1216,1061953
FORMULA ShieldRVt-PT-002B-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(AX((i0.u7.p17==1))) * (!(EF((i0.u5.p15==1))) + (!(EX((i5.u26.p61==1))) * !(AF((((i0.u6.p13==1)&&(i5.u25.p67==1))&&(i8.u38.p101==1)))))))
=> equivalent forward existential formula: ([(Init * !(EX(!((i0.u7.p17==1)))))] = FALSE * ([(EY((Init * !(!(E(TRUE U (i0.u5.p15==1)))))) * (i5.u26.p61==1))] = FALSE * [((Init * !(!(E(TRUE U (i0.u5.p15==1))))) * !(EG(!((((i0.u6.p13==1)&&(i5.u25.p67==1))&&(i8.u38.p101==1))))))] = FALSE))
(forward)formula 14,1,17.4369,584988,1,0,1.02609e+06,468,2270,1.85996e+06,201,1225,1231064
FORMULA ShieldRVt-PT-002B-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EG((i6.u30.p74!=1)) + EG((i6.u31.p72==1)))
=> equivalent forward existential formula: ([FwdG(Init,(i6.u30.p74!=1))] != FALSE + [FwdG(Init,(i6.u31.p72==1))] != FALSE)
(forward)formula 15,1,17.4501,585516,1,0,1.02729e+06,468,2283,1.8613e+06,201,1225,1233072
FORMULA ShieldRVt-PT-002B-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1590630315679

--------------------
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-002B"
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-002B, 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-159033476500948"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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