About the Execution of ITS-Tools for Raft-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 314.960 | 5105.00 | 12030.00 | 265.60 | FTFFFTTTFFFTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-2979
Executing tool itstools
Input is Raft-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097kn-smll-146369138600139
=====================================================================
--------------------
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 Raft-PT-02-CTLFireability-0
FORMULA_NAME Raft-PT-02-CTLFireability-1
FORMULA_NAME Raft-PT-02-CTLFireability-10
FORMULA_NAME Raft-PT-02-CTLFireability-11
FORMULA_NAME Raft-PT-02-CTLFireability-12
FORMULA_NAME Raft-PT-02-CTLFireability-13
FORMULA_NAME Raft-PT-02-CTLFireability-14
FORMULA_NAME Raft-PT-02-CTLFireability-15
FORMULA_NAME Raft-PT-02-CTLFireability-2
FORMULA_NAME Raft-PT-02-CTLFireability-3
FORMULA_NAME Raft-PT-02-CTLFireability-4
FORMULA_NAME Raft-PT-02-CTLFireability-5
FORMULA_NAME Raft-PT-02-CTLFireability-6
FORMULA_NAME Raft-PT-02-CTLFireability-7
FORMULA_NAME Raft-PT-02-CTLFireability-8
FORMULA_NAME Raft-PT-02-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1463964497393
its-ctl command run as :
/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 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,7381,0.020637,4432,27,21,207,99,101,295,35,380,0
Converting to forward existential form...Done !
original formula: E(EF((u3.p15>=1 * u1.p5>=1)) U ((u3.p11>=1 * (u3.p12>=1 * (u4.p20>=1 * u2.p10>=1))) * (!(u6.p25>=1) + !((u3.p15>=1 * u2.p9>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (u3.p15>=1 * u1.p5>=1))) * ((u3.p11>=1 * (u3.p12>=1 * (u4.p20>=1 * u2.p10>=1))) * (!(u6.p25>=1) + !((u3.p15>=1 * u2.p9>=1)))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,E(TRUE U (u3.p15>=1 * u1.p5>=1))) * ((u3.p11>=1 * (u3.p12>=1 * (u4.p20>=1 * u2.p10>=1))) * (!(u6.p25>=1) + !((u3.p15>=1 * u2.p9>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,E(TRUE U (u3.p15>=1 * u1.p5>=1))) * ((u3.p11>=1 * (u3.p12>=1 * (u4.p20>=1 * u2.p10>=1))) * (!(u6.p25>=1) + !((u3.p15>=1 * u2.p9>=1)))))
(forward)formula 0,0,0.022222,4692,1,0,207,99,126,295,44,380,28
FORMULA Raft-PT-02-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(E(((u4.p20>=1 * u2.p10>=1) + (u3.p15>=1 * u1.p5>=1)) U !((u3.p15>=1 * u1.p5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((u4.p20>=1 * u2.p10>=1) + (u3.p15>=1 * u1.p5>=1)) U !((u3.p15>=1 * u1.p5>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(((u4.p20>=1 * u2.p10>=1) + (u3.p15>=1 * u1.p5>=1)) U !((u3.p15>=1 * u1.p5>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(((u4.p20>=1 * u2.p10>=1) + (u3.p15>=1 * u1.p5>=1)) U !((u3.p15>=1 * u1.p5>=1)))))
Checking (exact) 1 :!(E(((u4.p20>=1 * u2.p10>=1) + (u3.p15>=1 * u1.p5>=1)) U !((u3.p15>=1 * u1.p5>=1))))
Checking (exact) 1 :E(((u4.p20>=1 * u2.p10>=1) + (u3.p15>=1 * u1.p5>=1)) U !((u3.p15>=1 * u1.p5>=1)))
(forward)formula 1,1,0.035602,4700,1,0,605,181,412,552,173,382,1280
FORMULA Raft-PT-02-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A(EF((u4.p19>=1 * (u4.p20>=1 * u1.p2>=1))) U (EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))))) * !(E(!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))) U (!(E(TRUE U (u4.p19>=1 * (u4.p20>=1 * u1.p2>=1)))) * !((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))))) * !(E(!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))) U (!(E(TRUE U (u4.p19>=1 * (u4.p20>=1 * u1.p2>=1)))) * !((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))))) * !(E(!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))) U (!(E(TRUE U (u4.p19>=1 * (u4.p20>=1 * u1.p2>=1)))) * !((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))))))
Checking (exact) 1 :!(E(!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))) U (!(E(TRUE U (u4.p19>=1 * (u4.p20>=1 * u1.p2>=1)))) * !((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))))))
Checking (exact) 1 :E(!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))) U (!(E(TRUE U (u4.p19>=1 * (u4.p20>=1 * u1.p2>=1)))) * !((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))))
Checking (exact) 1 :!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))
Checking (exact) 1 :(EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))
Checking (exact) 1 :EX(u4.p17>=1)
Checking (exact) 1 :(!(E(TRUE U (u4.p19>=1 * (u4.p20>=1 * u1.p2>=1)))) * !((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))))
Checking (exact) 1 :!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))
Checking (exact) 1 :(EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))
Checking (exact) 1 :EX(u4.p17>=1)
Checking (exact) 1 :!(E(TRUE U (u4.p19>=1 * (u4.p20>=1 * u1.p2>=1))))
Checking (exact) 1 :E(TRUE U (u4.p19>=1 * (u4.p20>=1 * u1.p2>=1)))
Checking (exact) 1 :(Init * !(EG(!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))))))
Checking (exact) 1 :!(EG(!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))))
Checking (exact) 1 :EG(!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))))
Checking (exact) 1 :!((EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1)))))
Checking (exact) 1 :(EX(u4.p17>=1) + ((u3.p15>=1 * u1.p5>=1) * !((u3.p11>=1 * u6.p27>=1))))
Checking (exact) 1 :EX(u4.p17>=1)
Checking (exact) 1 :Init
(forward)formula 2,0,0.04458,4864,1,0,781,216,469,832,187,513,1584
FORMULA Raft-PT-02-CTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(AX(AG((u3.p15>=1 * u1.p5>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((u3.p15>=1 * u1.p5>=1))))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((u3.p15>=1 * u1.p5>=1))))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((u3.p15>=1 * u1.p5>=1))))))))
Checking (exact) 1 :!(EX(!(!(E(TRUE U !((u3.p15>=1 * u1.p5>=1)))))))
Checking (exact) 1 :EX(!(!(E(TRUE U !((u3.p15>=1 * u1.p5>=1))))))
Checking (exact) 1 :!(!(E(TRUE U !((u3.p15>=1 * u1.p5>=1)))))
Checking (exact) 1 :E(TRUE U !((u3.p15>=1 * u1.p5>=1)))
(forward)formula 3,0,0.047387,4908,1,0,792,221,513,873,188,531,1709
FORMULA Raft-PT-02-CTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(!(EF((u4.p20>=1 * u2.p10>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (u4.p20>=1 * u2.p10>=1))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U (u4.p20>=1 * u2.p10>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U (u4.p20>=1 * u2.p10>=1))))
Checking (exact) 1 :!(E(TRUE U (u4.p20>=1 * u2.p10>=1)))
Checking (exact) 1 :E(TRUE U (u4.p20>=1 * u2.p10>=1))
(forward)formula 4,0,0.049467,4920,1,0,869,225,513,958,188,537,1874
FORMULA Raft-PT-02-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(EF(AF((u4.p20>=1 * u1.p4>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EG(!((u4.p20>=1 * u1.p4>=1)))))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !(EG(!((u4.p20>=1 * u1.p4>=1)))))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !(EG(!((u4.p20>=1 * u1.p4>=1)))))))
Checking (exact) 1 :!(E(TRUE U !(EG(!((u4.p20>=1 * u1.p4>=1))))))
Checking (exact) 1 :E(TRUE U !(EG(!((u4.p20>=1 * u1.p4>=1)))))
Checking (exact) 1 :!(EG(!((u4.p20>=1 * u1.p4>=1))))
Checking (exact) 1 :EG(!((u4.p20>=1 * u1.p4>=1)))
(forward)formula 5,1,0.054042,4944,1,0,1094,232,529,1246,188,564,2333
FORMULA Raft-PT-02-CTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(AX(AG(u4.p20>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(u4.p20>=1)))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(u4.p20>=1)))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(u4.p20>=1)))))))
Checking (exact) 1 :!(EX(!(!(E(TRUE U !(u4.p20>=1))))))
Checking (exact) 1 :EX(!(!(E(TRUE U !(u4.p20>=1)))))
Checking (exact) 1 :!(!(E(TRUE U !(u4.p20>=1))))
Checking (exact) 1 :E(TRUE U !(u4.p20>=1))
(forward)formula 6,0,0.055821,5048,1,0,1150,235,531,1355,189,584,2470
FORMULA Raft-PT-02-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(((u6.p25>=1 * u5.p22>=1) * AG(((u3.p13>=1 * u6.p27>=1) + (u3.p15>=1 * u2.p9>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (u6.p25>=1 * u5.p22>=1)) * !(E(TRUE U !(((u3.p13>=1 * u6.p27>=1) + (u3.p15>=1 * u2.p9>=1))))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * (u6.p25>=1 * u5.p22>=1)) * !(E(TRUE U !(((u3.p13>=1 * u6.p27>=1) + (u3.p15>=1 * u2.p9>=1))))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * (u6.p25>=1 * u5.p22>=1)) * !(E(TRUE U !(((u3.p13>=1 * u6.p27>=1) + (u3.p15>=1 * u2.p9>=1))))))
Checking (exact) 1 :!(E(TRUE U !(((u3.p13>=1 * u6.p27>=1) + (u3.p15>=1 * u2.p9>=1)))))
Checking (exact) 1 :E(TRUE U !(((u3.p13>=1 * u6.p27>=1) + (u3.p15>=1 * u2.p9>=1))))
(forward)formula 7,0,0.058749,5076,1,0,1186,244,537,1436,189,626,2608
FORMULA Raft-PT-02-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(EF(((u6.p26>=1 * u4.p17>=1) + !(u3.p11>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.p26>=1 * u4.p17>=1) + !(u3.p11>=1)))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U ((u6.p26>=1 * u4.p17>=1) + !(u3.p11>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U ((u6.p26>=1 * u4.p17>=1) + !(u3.p11>=1)))))
Checking (exact) 1 :!(E(TRUE U ((u6.p26>=1 * u4.p17>=1) + !(u3.p11>=1))))
Checking (exact) 1 :E(TRUE U ((u6.p26>=1 * u4.p17>=1) + !(u3.p11>=1)))
(forward)formula 8,1,0.061729,5104,1,0,1244,256,542,1554,189,661,2831
FORMULA Raft-PT-02-CTLFireability-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (((A((u3.p15>=1 * u5.p23>=1) U (u3.p15>=1 * u5.p21>=1)) * EX((u4.p20>=1 * u1.p1>=1))) + EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1))))) * !(EF(AG((u3.p15>=1 * u1.p5>=1)))))
=> equivalent forward existential formula: ((([(FwdU((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1))) * (!((u3.p15>=1 * u5.p23>=1)) * !((u3.p15>=1 * u5.p21>=1))))] = FALSE * [FwdG((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1)))] = FALSE) * [((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))) * !(EX((u4.p20>=1 * u1.p1>=1))))] = FALSE) * [(FwdU(Init,TRUE) * !(E(TRUE U !((u3.p15>=1 * u1.p5>=1)))))] = FALSE)
Checking (exact) 0 :((([(FwdU((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1))) * (!((u3.p15>=1 * u5.p23>=1)) * !((u3.p15>=1 * u5.p21>=1))))] = FALSE * [FwdG((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1)))] = FALSE) * [((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))) * !(EX((u4.p20>=1 * u1.p1>=1))))] = FALSE) * [(FwdU(Init,TRUE) * !(E(TRUE U !((u3.p15>=1 * u1.p5>=1)))))] = FALSE)
Checking (exact) 1 :[(FwdU(Init,TRUE) * !(E(TRUE U !((u3.p15>=1 * u1.p5>=1)))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !((u3.p15>=1 * u1.p5>=1)))))
Checking (exact) 1 :!(E(TRUE U !((u3.p15>=1 * u1.p5>=1))))
Checking (exact) 1 :E(TRUE U !((u3.p15>=1 * u1.p5>=1)))
Checking (exact) 1 :(([(FwdU((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1))) * (!((u3.p15>=1 * u5.p23>=1)) * !((u3.p15>=1 * u5.p21>=1))))] = FALSE * [FwdG((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1)))] = FALSE) * [((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))) * !(EX((u4.p20>=1 * u1.p1>=1))))] = FALSE)
Checking (exact) 1 :[((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))) * !(EX((u4.p20>=1 * u1.p1>=1))))] = FALSE
Checking (exact) 0 :((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))) * !(EX((u4.p20>=1 * u1.p1>=1))))
Checking (exact) 1 :!(EX((u4.p20>=1 * u1.p1>=1)))
Checking (exact) 1 :EX((u4.p20>=1 * u1.p1>=1))
Checking (exact) 1 :(Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1))))))
Checking (exact) 1 :!(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))
Checking (exact) 1 :EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :([(FwdU((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1))) * (!((u3.p15>=1 * u5.p23>=1)) * !((u3.p15>=1 * u5.p21>=1))))] = FALSE * [FwdG((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1)))] = FALSE)
Checking (exact) 1 :[FwdG((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1)))] = FALSE
Checking (exact) 0 :FwdG((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1)))
Checking (exact) 1 :(Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1))))))
Checking (exact) 1 :!(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))
Checking (exact) 1 :EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :[(FwdU((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1))) * (!((u3.p15>=1 * u5.p23>=1)) * !((u3.p15>=1 * u5.p21>=1))))] = FALSE
Checking (exact) 0 :(FwdU((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1))) * (!((u3.p15>=1 * u5.p23>=1)) * !((u3.p15>=1 * u5.p21>=1))))
Checking (exact) 1 :(!((u3.p15>=1 * u5.p23>=1)) * !((u3.p15>=1 * u5.p21>=1)))
Checking (exact) 1 :!((u3.p15>=1 * u5.p21>=1))
Checking (exact) 1 :FwdU((Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))),!((u3.p15>=1 * u5.p21>=1)))
Checking (exact) 1 :(Init * !(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1))))))
Checking (exact) 1 :!(EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1)))))
Checking (exact) 1 :EG(((u4.p18>=1 * u4.p17>=1) + !((u4.p20>=1 * u1.p4>=1))))
Checking (exact) 1 :Init
(forward)formula 9,1,0.075519,5160,1,0,1322,257,588,1630,191,668,2978
FORMULA Raft-PT-02-CTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF((A(u3.p15>=1 U (u3.p15>=1 * u1.p5>=1)) * (u6.p26>=1 * AX((u3.p15>=1 * u1.p5>=1)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((E(!((u3.p15>=1 * u1.p5>=1)) U (!(u3.p15>=1) * !((u3.p15>=1 * u1.p5>=1)))) + EG(!((u3.p15>=1 * u1.p5>=1)))))) * u6.p26>=1) * !(EX(!((u3.p15>=1 * u1.p5>=1)))))] != FALSE
Checking (exact) 0 :[(((FwdU(Init,TRUE) * !((E(!((u3.p15>=1 * u1.p5>=1)) U (!(u3.p15>=1) * !((u3.p15>=1 * u1.p5>=1)))) + EG(!((u3.p15>=1 * u1.p5>=1)))))) * u6.p26>=1) * !(EX(!((u3.p15>=1 * u1.p5>=1)))))] != FALSE
Checking (exact) 0 :(((FwdU(Init,TRUE) * !((E(!((u3.p15>=1 * u1.p5>=1)) U (!(u3.p15>=1) * !((u3.p15>=1 * u1.p5>=1)))) + EG(!((u3.p15>=1 * u1.p5>=1)))))) * u6.p26>=1) * !(EX(!((u3.p15>=1 * u1.p5>=1)))))
Checking (exact) 1 :!(EX(!((u3.p15>=1 * u1.p5>=1))))
Checking (exact) 1 :EX(!((u3.p15>=1 * u1.p5>=1)))
Checking (exact) 1 :((FwdU(Init,TRUE) * !((E(!((u3.p15>=1 * u1.p5>=1)) U (!(u3.p15>=1) * !((u3.p15>=1 * u1.p5>=1)))) + EG(!((u3.p15>=1 * u1.p5>=1)))))) * u6.p26>=1)
Checking (exact) 1 :u6.p26>=1
Checking (exact) 1 :(FwdU(Init,TRUE) * !((E(!((u3.p15>=1 * u1.p5>=1)) U (!(u3.p15>=1) * !((u3.p15>=1 * u1.p5>=1)))) + EG(!((u3.p15>=1 * u1.p5>=1))))))
Checking (exact) 1 :!((E(!((u3.p15>=1 * u1.p5>=1)) U (!(u3.p15>=1) * !((u3.p15>=1 * u1.p5>=1)))) + EG(!((u3.p15>=1 * u1.p5>=1)))))
Checking (exact) 1 :(E(!((u3.p15>=1 * u1.p5>=1)) U (!(u3.p15>=1) * !((u3.p15>=1 * u1.p5>=1)))) + EG(!((u3.p15>=1 * u1.p5>=1))))
Checking (exact) 1 :E(!((u3.p15>=1 * u1.p5>=1)) U (!(u3.p15>=1) * !((u3.p15>=1 * u1.p5>=1))))
Checking (exact) 1 :EG(!((u3.p15>=1 * u1.p5>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 10,0,0.092225,5284,1,0,1601,257,626,1959,191,677,3555
FORMULA Raft-PT-02-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(((((u6.p25>=1 + (u6.p25>=1 * u5.p22>=1)) * !(u6.p25>=1)) + AF(u4.p16>=1)) * u4.p20>=1))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * u4.p20>=1) * ((u6.p25>=1 + (u6.p25>=1 * u5.p22>=1)) * !(u6.p25>=1)))] != FALSE + [((FwdU(Init,TRUE) * u4.p20>=1) * !(EG(!(u4.p16>=1))))] != FALSE)
Checking (exact) 0 :([((FwdU(Init,TRUE) * u4.p20>=1) * ((u6.p25>=1 + (u6.p25>=1 * u5.p22>=1)) * !(u6.p25>=1)))] != FALSE + [((FwdU(Init,TRUE) * u4.p20>=1) * !(EG(!(u4.p16>=1))))] != FALSE)
Checking (exact) 0 :[((FwdU(Init,TRUE) * u4.p20>=1) * ((u6.p25>=1 + (u6.p25>=1 * u5.p22>=1)) * !(u6.p25>=1)))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * u4.p20>=1) * ((u6.p25>=1 + (u6.p25>=1 * u5.p22>=1)) * !(u6.p25>=1)))
Checking (exact) 0 :[((FwdU(Init,TRUE) * u4.p20>=1) * !(EG(!(u4.p16>=1))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * u4.p20>=1) * !(EG(!(u4.p16>=1))))
Checking (exact) 1 :!(EG(!(u4.p16>=1)))
Checking (exact) 1 :EG(!(u4.p16>=1))
Checking (exact) 1 :(FwdU(Init,TRUE) * u4.p20>=1)
Checking (exact) 1 :u4.p20>=1
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 11,0,0.095767,5284,1,0,1638,257,645,2008,191,684,3629
FORMULA Raft-PT-02-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (E((((u3.p15>=1 * u1.p5>=1) * (u3.p15>=1 * u2.p6>=1)) + !(u3.p14>=1)) U (u3.p14>=1 * (u4.p20>=1 * (u3.p15>=1 * u2.p6>=1)))) + A(AF((u4.p20>=1 * u1.p3>=1)) U (!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1)))))
=> equivalent forward existential formula: ([(FwdU(Init,(((u3.p15>=1 * u1.p5>=1) * (u3.p15>=1 * u2.p6>=1)) + !(u3.p14>=1))) * (u3.p14>=1 * (u4.p20>=1 * (u3.p15>=1 * u2.p6>=1))))] != FALSE + [((Init * !(EG(!((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1))))))) * !(E(!((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1)))) U (!(!(EG(!((u4.p20>=1 * u1.p3>=1))))) * !((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1))))))))] != FALSE)
Checking (exact) 0 :([(FwdU(Init,(((u3.p15>=1 * u1.p5>=1) * (u3.p15>=1 * u2.p6>=1)) + !(u3.p14>=1))) * (u3.p14>=1 * (u4.p20>=1 * (u3.p15>=1 * u2.p6>=1))))] != FALSE + [((Init * !(EG(!((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1))))))) * !(E(!((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1)))) U (!(!(EG(!((u4.p20>=1 * u1.p3>=1))))) * !((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1))))))))] != FALSE)
Checking (exact) 0 :[(FwdU(Init,(((u3.p15>=1 * u1.p5>=1) * (u3.p15>=1 * u2.p6>=1)) + !(u3.p14>=1))) * (u3.p14>=1 * (u4.p20>=1 * (u3.p15>=1 * u2.p6>=1))))] != FALSE
Checking (exact) 0 :(FwdU(Init,(((u3.p15>=1 * u1.p5>=1) * (u3.p15>=1 * u2.p6>=1)) + !(u3.p14>=1))) * (u3.p14>=1 * (u4.p20>=1 * (u3.p15>=1 * u2.p6>=1))))
Checking (exact) 0 :[((Init * !(EG(!((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1))))))) * !(E(!((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1)))) U (!(!(EG(!((u4.p20>=1 * u1.p3>=1))))) * !((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1))))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1))))))) * !(E(!((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1)))) U (!(!(EG(!((u4.p20>=1 * u1.p3>=1))))) * !((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1))))))))
Checking (exact) 1 :!(E(!((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1)))) U (!(!(EG(!((u4.p20>=1 * u1.p3>=1))))) * !((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1)))))))
Checking (exact) 1 :E(!((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1)))) U (!(!(EG(!((u4.p20>=1 * u1.p3>=1))))) * !((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1))))))
Checking (exact) 1 :(!(!(EG(!((u4.p20>=1 * u1.p3>=1))))) * !((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1)))))
Checking (exact) 1 :!((!((u4.p20>=1 * u2.p10>=1)) * (u3.p14>=1 * (u3.p15>=1 * u2.p9>=1))))
Checking (exact) 1 :!(!(EG(!((u4.p20>=1 * u1.p3>=1)))))
Checking (exact) 1 :EG(!((u4.p20>=1 * u1.p3>=1)))
(forward)formula 12,0,0.103312,5316,1,0,1706,259,674,2104,191,700,3787
FORMULA Raft-PT-02-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(((u6.p25>=1 * u5.p22>=1) + EF((u4.p20>=1 * (u3.p15>=1 * u2.p8>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((u6.p25>=1 * u5.p22>=1))) * !(E(TRUE U (u4.p20>=1 * (u3.p15>=1 * u2.p8>=1)))))] = FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * !((u6.p25>=1 * u5.p22>=1))) * !(E(TRUE U (u4.p20>=1 * (u3.p15>=1 * u2.p8>=1)))))] = FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * !((u6.p25>=1 * u5.p22>=1))) * !(E(TRUE U (u4.p20>=1 * (u3.p15>=1 * u2.p8>=1)))))
Checking (exact) 1 :!(E(TRUE U (u4.p20>=1 * (u3.p15>=1 * u2.p8>=1))))
Checking (exact) 1 :E(TRUE U (u4.p20>=1 * (u3.p15>=1 * u2.p8>=1)))
(forward)formula 13,1,0.106667,5348,1,0,1848,270,679,2271,191,735,4125
FORMULA Raft-PT-02-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(EF(EF(u3.p12>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U E(TRUE U u3.p12>=1))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U E(TRUE U u3.p12>=1))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U E(TRUE U u3.p12>=1))))
Checking (exact) 1 :!(E(TRUE U E(TRUE U u3.p12>=1)))
Checking (exact) 1 :E(TRUE U E(TRUE U u3.p12>=1))
Checking (exact) 1 :E(TRUE U u3.p12>=1)
(forward)formula 14,1,0.111617,5424,1,0,2022,286,679,2492,191,772,4526
FORMULA Raft-PT-02-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AX((EF((u4.p19>=1 * (u6.p25>=1 * u5.p24>=1))) * ((u3.p15>=1 * u1.p5>=1) * u3.p15>=1)))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U (u4.p19>=1 * (u6.p25>=1 * u5.p24>=1)))))] = FALSE * [(EY(Init) * !(((u3.p15>=1 * u1.p5>=1) * u3.p15>=1)))] = FALSE)
Checking (exact) 0 :([(EY(Init) * !(E(TRUE U (u4.p19>=1 * (u6.p25>=1 * u5.p24>=1)))))] = FALSE * [(EY(Init) * !(((u3.p15>=1 * u1.p5>=1) * u3.p15>=1)))] = FALSE)
Checking (exact) 1 :[(EY(Init) * !(((u3.p15>=1 * u1.p5>=1) * u3.p15>=1)))] = FALSE
Checking (exact) 0 :(EY(Init) * !(((u3.p15>=1 * u1.p5>=1) * u3.p15>=1)))
Checking (exact) 1 :!(((u3.p15>=1 * u1.p5>=1) * u3.p15>=1))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
Checking (exact) 1 :[(EY(Init) * !(E(TRUE U (u4.p19>=1 * (u6.p25>=1 * u5.p24>=1)))))] = FALSE
Checking (exact) 0 :(EY(Init) * !(E(TRUE U (u4.p19>=1 * (u6.p25>=1 * u5.p24>=1)))))
Checking (exact) 1 :!(E(TRUE U (u4.p19>=1 * (u6.p25>=1 * u5.p24>=1))))
Checking (exact) 1 :E(TRUE U (u4.p19>=1 * (u6.p25>=1 * u5.p24>=1)))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 15,1,0.13234,5496,1,0,2423,299,691,3103,193,840,5575
FORMULA Raft-PT-02-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1463964502498
--------------------
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
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 23, 2016 12:48:21 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 23, 2016 12:48:21 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 42 ms
May 23, 2016 12:48:21 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 28 places.
May 23, 2016 12:48:21 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 52 transitions.
May 23, 2016 12:48:21 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
May 23, 2016 12:48:21 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 65 ms
May 23, 2016 12:48:21 AM fr.lip6.move.gal.application.Application applyOrder
INFO: Applying decomposition
May 23, 2016 12:48:21 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 23, 2016 12:48:21 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 19 ms
May 23, 2016 12:48:21 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Partition obtained :[p1, p2, p3, p4, p5, ],[p6, p7, p8, p9, p10, ],[p11, p12, p13, p14, p15, ],[p16, p17, p18, p19, p20, ],[p21, p22, p23, p24, ],[p25, p26, p27, ],[p0, ],
May 23, 2016 12:48:21 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 18 redundant transitions.
May 23, 2016 12:48:21 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 16 ms
May 23, 2016 12:48:21 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
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="Raft-PT-02"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/Raft-PT-02.tgz
mv Raft-PT-02 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is Raft-PT-02, 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 r097kn-smll-146369138600139"
echo "====================================================================="
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 '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;