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 S_ResAllocation-PT-R005C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r181kn-smll-146444110900346
=====================================================================

--------------------
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 ResAllocation-PT-R005C002-CTLFireability-0
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-1
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-15
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-2
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-3
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-4
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-5
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-6
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-7
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-8
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1464514687205


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,112,0.013267,4248,2,49,5,377,6,0,95,354,0


Converting to forward existential form...Done !
original formula: (AF(AF(((p_0_2>=1 * r_0_3>=1) + ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))) * !(EX(((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(EG(!(((p_0_2>=1 * r_0_3>=1) + ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))))))] = FALSE * [(EY(Init) * ((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))] = FALSE)
Checking (exact) 0 :([FwdG(Init,!(!(EG(!(((p_0_2>=1 * r_0_3>=1) + ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))))))] = FALSE * [(EY(Init) * ((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))] = FALSE)
Checking (exact) 1 :[(EY(Init) * ((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))] = FALSE
Checking (exact) 0 :(EY(Init) * ((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))
Checking (exact) 1 :((r_1_2>=1 * p_1_3>=1) * r_0_2>=1)
Checking (exact) 1 :r_0_2>=1
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
Checking (exact) 1 :[FwdG(Init,!(!(EG(!(((p_0_2>=1 * r_0_3>=1) + ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(!(EG(!(((p_0_2>=1 * r_0_3>=1) + ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(!(EG(!(((p_0_2>=1 * r_0_3>=1) + ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))))))
Checking (exact) 1 :EG(!(((p_0_2>=1 * r_0_3>=1) + ((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))))
Fast SCC detection found none.
(forward)formula 0,0,0.062776,5528,1,0,173,6071,69,92,604,8695,196
FORMULA ResAllocation-PT-R005C002-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(A(((p_0_1>=1 * r_0_2>=1) + (r_1_4>=1 * r_0_4>=1)) U (((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)) U (!(((p_0_1>=1 * r_0_2>=1) + (r_1_4>=1 * r_0_4>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)))) + EG(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)))))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(!((E(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)) U (!(((p_0_1>=1 * r_0_2>=1) + (r_1_4>=1 * r_0_4>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)))) + EG(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)))))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(!((E(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)) U (!(((p_0_1>=1 * r_0_2>=1) + (r_1_4>=1 * r_0_4>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)))) + EG(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)))))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(!((E(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)) U (!(((p_0_1>=1 * r_0_2>=1) + (r_1_4>=1 * r_0_4>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)))) + EG(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1))))))
Checking (exact) 1 :(E(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)) U (!(((p_0_1>=1 * r_0_2>=1) + (r_1_4>=1 * r_0_4>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)))) + EG(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1))))
Checking (exact) 1 :E(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)) U (!(((p_0_1>=1 * r_0_2>=1) + (r_1_4>=1 * r_0_4>=1))) * !((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1))))
Checking (exact) 1 :EG(!((((r_1_1>=1 * p_1_2>=1) * r_0_1>=1) + p_0_4>=1)))
Fast SCC detection found none.
(forward)formula 1,0,0.083776,6060,1,0,317,8455,90,174,622,12423,377
FORMULA ResAllocation-PT-R005C002-CTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))
=> equivalent forward existential formula: [(Init * !(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))] != FALSE
Checking (exact) 0 :[(Init * !(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))] != FALSE
Checking (exact) 0 :(Init * !(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))
(forward)formula 2,1,0.084416,6320,1,0,318,8464,91,174,622,12423,378
FORMULA ResAllocation-PT-R005C002-CTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AX(EX(EF(p_1_0>=1)))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(TRUE U p_1_0>=1))))] = FALSE
Checking (exact) 0 :[(EY(Init) * !(EX(E(TRUE U p_1_0>=1))))] = FALSE
Checking (exact) 0 :(EY(Init) * !(EX(E(TRUE U p_1_0>=1))))
Checking (exact) 1 :!(EX(E(TRUE U p_1_0>=1)))
Checking (exact) 1 :EX(E(TRUE U p_1_0>=1))
Checking (exact) 1 :E(TRUE U p_1_0>=1)
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 3,1,0.090944,6328,1,0,336,8988,97,187,640,13391,411
FORMULA ResAllocation-PT-R005C002-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((p_0_0>=1 * r_0_1>=1) + (EF(!(p_0_4>=1)) + !(((!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) + (p_1_0>=1 * (p_0_2>=1 * r_0_3>=1))))))
=> equivalent forward existential formula: ([(Init * (p_0_0>=1 * r_0_1>=1))] != FALSE + ([(FwdU(Init,TRUE) * !(p_0_4>=1))] != FALSE + [(Init * !(((!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) + (p_1_0>=1 * (p_0_2>=1 * r_0_3>=1)))))] != FALSE))
Checking (exact) 0 :([(Init * (p_0_0>=1 * r_0_1>=1))] != FALSE + ([(FwdU(Init,TRUE) * !(p_0_4>=1))] != FALSE + [(Init * !(((!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) + (p_1_0>=1 * (p_0_2>=1 * r_0_3>=1)))))] != FALSE))
Checking (exact) 0 :[(Init * (p_0_0>=1 * r_0_1>=1))] != FALSE
Checking (exact) 0 :(Init * (p_0_0>=1 * r_0_1>=1))
Checking (exact) 0 :([(FwdU(Init,TRUE) * !(p_0_4>=1))] != FALSE + [(Init * !(((!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) + (p_1_0>=1 * (p_0_2>=1 * r_0_3>=1)))))] != FALSE)
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(p_0_4>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(p_0_4>=1))
Checking (exact) 1 :!(p_0_4>=1)
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 4,1,0.092124,6328,1,0,339,8997,101,189,642,13399,413
FORMULA ResAllocation-PT-R005C002-CTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: A((AX(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)) * AG((p_0_1>=1 * r_0_2>=1))) U E(r_0_0>=1 U p_0_4>=1))
=> equivalent forward existential formula: [((Init * !(EG(!(E(r_0_0>=1 U p_0_4>=1))))) * !(E(!(E(r_0_0>=1 U p_0_4>=1)) U (!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(E(TRUE U !((p_0_1>=1 * r_0_2>=1)))))) * !(E(r_0_0>=1 U p_0_4>=1))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(E(r_0_0>=1 U p_0_4>=1))))) * !(E(!(E(r_0_0>=1 U p_0_4>=1)) U (!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(E(TRUE U !((p_0_1>=1 * r_0_2>=1)))))) * !(E(r_0_0>=1 U p_0_4>=1))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(E(r_0_0>=1 U p_0_4>=1))))) * !(E(!(E(r_0_0>=1 U p_0_4>=1)) U (!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(E(TRUE U !((p_0_1>=1 * r_0_2>=1)))))) * !(E(r_0_0>=1 U p_0_4>=1))))))
Checking (exact) 1 :!(E(!(E(r_0_0>=1 U p_0_4>=1)) U (!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(E(TRUE U !((p_0_1>=1 * r_0_2>=1)))))) * !(E(r_0_0>=1 U p_0_4>=1)))))
Checking (exact) 1 :E(!(E(r_0_0>=1 U p_0_4>=1)) U (!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(E(TRUE U !((p_0_1>=1 * r_0_2>=1)))))) * !(E(r_0_0>=1 U p_0_4>=1))))
Checking (exact) 1 :!(E(r_0_0>=1 U p_0_4>=1))
Checking (exact) 1 :E(r_0_0>=1 U p_0_4>=1)
Checking (exact) 1 :(!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(E(TRUE U !((p_0_1>=1 * r_0_2>=1)))))) * !(E(r_0_0>=1 U p_0_4>=1)))
Checking (exact) 1 :!(E(r_0_0>=1 U p_0_4>=1))
Checking (exact) 1 :E(r_0_0>=1 U p_0_4>=1)
Checking (exact) 1 :!((!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(E(TRUE U !((p_0_1>=1 * r_0_2>=1))))))
Checking (exact) 1 :(!(EX(!(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))) * !(E(TRUE U !((p_0_1>=1 * r_0_2>=1)))))
Checking (exact) 1 :!(E(TRUE U !((p_0_1>=1 * r_0_2>=1))))
Checking (exact) 1 :E(TRUE U !((p_0_1>=1 * r_0_2>=1)))
Checking (exact) 1 :(Init * !(EG(!(E(r_0_0>=1 U p_0_4>=1)))))
Checking (exact) 1 :!(EG(!(E(r_0_0>=1 U p_0_4>=1))))
Checking (exact) 1 :EG(!(E(r_0_0>=1 U p_0_4>=1)))
Checking (exact) 1 :!(E(r_0_0>=1 U p_0_4>=1))
Checking (exact) 1 :E(r_0_0>=1 U p_0_4>=1)
Checking (exact) 1 :Init
(forward)formula 5,0,0.107578,6732,1,0,453,11488,118,274,650,17683,548
FORMULA ResAllocation-PT-R005C002-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (p_0_0>=1 * r_0_1>=1)
=> equivalent forward existential formula: [(Init * (p_0_0>=1 * r_0_1>=1))] != FALSE
Checking (exact) 0 :[(Init * (p_0_0>=1 * r_0_1>=1))] != FALSE
Checking (exact) 0 :(Init * (p_0_0>=1 * r_0_1>=1))
(forward)formula 6,0,0.107983,6992,1,0,453,11488,118,274,650,17683,548
FORMULA ResAllocation-PT-R005C002-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AX((p_0_0>=1 * r_0_1>=1))
=> equivalent forward existential formula: [(EY(Init) * !((p_0_0>=1 * r_0_1>=1)))] = FALSE
Checking (exact) 0 :[(EY(Init) * !((p_0_0>=1 * r_0_1>=1)))] = FALSE
Checking (exact) 0 :(EY(Init) * !((p_0_0>=1 * r_0_1>=1)))
Checking (exact) 1 :!((p_0_0>=1 * r_0_1>=1))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 7,0,0.108573,6996,1,0,455,11514,119,276,652,17753,549
FORMULA ResAllocation-PT-R005C002-CTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(AF(EF(!((r_1_4>=1 * r_0_4>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((r_1_4>=1 * r_0_4>=1)))))] != FALSE
Checking (exact) 0 :[FwdG(Init,!(E(TRUE U !((r_1_4>=1 * r_0_4>=1)))))] != FALSE
Checking (exact) 0 :FwdG(Init,!(E(TRUE U !((r_1_4>=1 * r_0_4>=1)))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(E(TRUE U !((r_1_4>=1 * r_0_4>=1))))
Checking (exact) 1 :E(TRUE U !((r_1_4>=1 * r_0_4>=1)))
(forward)formula 8,0,0.10936,7000,1,0,456,11524,123,276,652,17771,552
FORMULA ResAllocation-PT-R005C002-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: !(AX(p_0_4>=1))
=> equivalent forward existential formula: [(EY(Init) * !(p_0_4>=1))] != FALSE
Checking (exact) 0 :[(EY(Init) * !(p_0_4>=1))] != FALSE
Checking (exact) 0 :(EY(Init) * !(p_0_4>=1))
Checking (exact) 1 :!(p_0_4>=1)
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 9,1,0.109634,7000,1,0,456,11524,123,277,652,17788,552
FORMULA ResAllocation-PT-R005C002-CTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (p_0_3>=1 * r_0_4>=1)
=> equivalent forward existential formula: [(Init * (p_0_3>=1 * r_0_4>=1))] != FALSE
Checking (exact) 0 :[(Init * (p_0_3>=1 * r_0_4>=1))] != FALSE
Checking (exact) 0 :(Init * (p_0_3>=1 * r_0_4>=1))
(forward)formula 10,0,0.110013,7012,1,0,456,11525,126,277,654,17788,553
FORMULA ResAllocation-PT-R005C002-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(((EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1))) * (AF((p_0_3>=1 * r_0_4>=1)) + EF(((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)))))
=> equivalent forward existential formula: ([((EY(Init) * (EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1)))) * !(EG(!((p_0_3>=1 * r_0_4>=1)))))] != FALSE + [(FwdU((EY(Init) * (EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1)))),TRUE) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))] != FALSE)
Checking (exact) 0 :([((EY(Init) * (EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1)))) * !(EG(!((p_0_3>=1 * r_0_4>=1)))))] != FALSE + [(FwdU((EY(Init) * (EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1)))),TRUE) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))] != FALSE)
Checking (exact) 0 :[((EY(Init) * (EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1)))) * !(EG(!((p_0_3>=1 * r_0_4>=1)))))] != FALSE
Checking (exact) 0 :((EY(Init) * (EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1)))) * !(EG(!((p_0_3>=1 * r_0_4>=1)))))
Checking (exact) 1 :!(EG(!((p_0_3>=1 * r_0_4>=1))))
Checking (exact) 1 :EG(!((p_0_3>=1 * r_0_4>=1)))
Checking (exact) 1 :(EY(Init) * (EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1))))
Checking (exact) 1 :(EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1)))
Checking (exact) 1 :EG(p_0_4>=1)
Fast SCC detection found none.
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
Checking (exact) 0 :[(FwdU((EY(Init) * (EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1)))),TRUE) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))] != FALSE
Checking (exact) 0 :(FwdU((EY(Init) * (EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1)))),TRUE) * ((r_1_0>=1 * p_1_1>=1) * r_0_0>=1))
Checking (exact) 1 :((r_1_0>=1 * p_1_1>=1) * r_0_0>=1)
Checking (exact) 1 :r_0_0>=1
Checking (exact) 1 :FwdU((EY(Init) * (EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1)))),TRUE)
Checking (exact) 1 :(EY(Init) * (EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1))))
Checking (exact) 1 :(EG(p_0_4>=1) + (!(p_1_0>=1) + (p_0_2>=1 * r_0_3>=1)))
Checking (exact) 1 :EG(p_0_4>=1)
Fast SCC detection found none.
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 11,1,0.126104,7380,1,0,591,12976,138,345,677,20104,762
FORMULA ResAllocation-PT-R005C002-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((r_0_0>=1 + !((p_1_0>=1 + EX(((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))))) + (EG(!((((r_1_2>=1 * p_1_3>=1) * r_0_2>=1) * p_0_4>=1))) * (p_0_1>=1 * r_0_2>=1)))
=> equivalent forward existential formula: (([(Init * r_0_0>=1)] != FALSE + [((Init * !(p_1_0>=1)) * !(EX(((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))))] != FALSE) + [FwdG((Init * (p_0_1>=1 * r_0_2>=1)),!((((r_1_2>=1 * p_1_3>=1) * r_0_2>=1) * p_0_4>=1)))] != FALSE)
Checking (exact) 0 :(([(Init * r_0_0>=1)] != FALSE + [((Init * !(p_1_0>=1)) * !(EX(((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))))] != FALSE) + [FwdG((Init * (p_0_1>=1 * r_0_2>=1)),!((((r_1_2>=1 * p_1_3>=1) * r_0_2>=1) * p_0_4>=1)))] != FALSE)
Checking (exact) 0 :([(Init * r_0_0>=1)] != FALSE + [((Init * !(p_1_0>=1)) * !(EX(((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))))] != FALSE)
Checking (exact) 0 :[(Init * r_0_0>=1)] != FALSE
Checking (exact) 0 :(Init * r_0_0>=1)
(forward)formula 12,1,0.126434,7380,1,0,591,12976,138,345,677,20104,763
FORMULA ResAllocation-PT-R005C002-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (((p_0_4>=1 * (!(((p_0_0>=1 * r_0_1>=1) + p_0_4>=1)) + AX((p_0_0>=1 * r_0_1>=1)))) * EG(AX(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1)))) * (!(AF(!((p_0_2>=1 * r_0_3>=1)))) + AF(((p_1_0>=1 * ((r_1_3>=1 * p_1_4>=1) * r_0_3>=1)) + ((p_0_3>=1 * r_0_4>=1) * (p_0_2>=1 * r_0_3>=1))))))
=> equivalent forward existential formula: ((([(Init * !(p_0_4>=1))] = FALSE * [(EY((Init * !(!(((p_0_0>=1 * r_0_1>=1) + p_0_4>=1))))) * !((p_0_0>=1 * r_0_1>=1)))] = FALSE) * [(Init * !(EG(!(EX(!(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1)))))))] = FALSE) * [FwdG((Init * !(!(!(EG(!(!((p_0_2>=1 * r_0_3>=1)))))))),!(((p_1_0>=1 * ((r_1_3>=1 * p_1_4>=1) * r_0_3>=1)) + ((p_0_3>=1 * r_0_4>=1) * (p_0_2>=1 * r_0_3>=1)))))] = FALSE)
Checking (exact) 0 :((([(Init * !(p_0_4>=1))] = FALSE * [(EY((Init * !(!(((p_0_0>=1 * r_0_1>=1) + p_0_4>=1))))) * !((p_0_0>=1 * r_0_1>=1)))] = FALSE) * [(Init * !(EG(!(EX(!(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1)))))))] = FALSE) * [FwdG((Init * !(!(!(EG(!(!((p_0_2>=1 * r_0_3>=1)))))))),!(((p_1_0>=1 * ((r_1_3>=1 * p_1_4>=1) * r_0_3>=1)) + ((p_0_3>=1 * r_0_4>=1) * (p_0_2>=1 * r_0_3>=1)))))] = FALSE)
Checking (exact) 1 :[FwdG((Init * !(!(!(EG(!(!((p_0_2>=1 * r_0_3>=1)))))))),!(((p_1_0>=1 * ((r_1_3>=1 * p_1_4>=1) * r_0_3>=1)) + ((p_0_3>=1 * r_0_4>=1) * (p_0_2>=1 * r_0_3>=1)))))] = FALSE
Checking (exact) 0 :FwdG((Init * !(!(!(EG(!(!((p_0_2>=1 * r_0_3>=1)))))))),!(((p_1_0>=1 * ((r_1_3>=1 * p_1_4>=1) * r_0_3>=1)) + ((p_0_3>=1 * r_0_4>=1) * (p_0_2>=1 * r_0_3>=1)))))
Checking (exact) 1 :(Init * !(!(!(EG(!(!((p_0_2>=1 * r_0_3>=1))))))))
Checking (exact) 1 :!(!(!(EG(!(!((p_0_2>=1 * r_0_3>=1)))))))
Checking (exact) 1 :!(EG(!(!((p_0_2>=1 * r_0_3>=1)))))
Checking (exact) 1 :EG(!(!((p_0_2>=1 * r_0_3>=1))))
Fast SCC detection found none.
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 3/2/9
(forward)formula 13,0,0.136267,7520,1,0,614,13922,160,360,723,21586,805
FORMULA ResAllocation-PT-R005C002-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: p_1_0>=1
=> equivalent forward existential formula: [(Init * p_1_0>=1)] != FALSE
Checking (exact) 0 :[(Init * p_1_0>=1)] != FALSE
Checking (exact) 0 :(Init * p_1_0>=1)
(forward)formula 14,0,0.136539,7520,1,0,614,13922,160,360,723,21586,806
FORMULA ResAllocation-PT-R005C002-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (((((p_1_0>=1 * ((p_0_0>=1 * r_0_1>=1) + p_0_4>=1)) * EG(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1))) * !(AX(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))) * EG((((r_1_3>=1 * p_1_4>=1) * r_0_3>=1) + ((p_0_1>=1 * r_0_2>=1) + (p_0_0>=1 * r_0_1>=1))))) + AF((((p_0_2>=1 * r_0_3>=1) + (r_0_0>=1 * (p_0_0>=1 * r_0_1>=1))) + ((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))))
=> equivalent forward existential formula: [FwdG((Init * !(((((p_1_0>=1 * ((p_0_0>=1 * r_0_1>=1) + p_0_4>=1)) * EG(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1))) * !(!(EX(!(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))))) * EG((((r_1_3>=1 * p_1_4>=1) * r_0_3>=1) + ((p_0_1>=1 * r_0_2>=1) + (p_0_0>=1 * r_0_1>=1))))))),!((((p_0_2>=1 * r_0_3>=1) + (r_0_0>=1 * (p_0_0>=1 * r_0_1>=1))) + ((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))))] = FALSE
Checking (exact) 0 :[FwdG((Init * !(((((p_1_0>=1 * ((p_0_0>=1 * r_0_1>=1) + p_0_4>=1)) * EG(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1))) * !(!(EX(!(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))))) * EG((((r_1_3>=1 * p_1_4>=1) * r_0_3>=1) + ((p_0_1>=1 * r_0_2>=1) + (p_0_0>=1 * r_0_1>=1))))))),!((((p_0_2>=1 * r_0_3>=1) + (r_0_0>=1 * (p_0_0>=1 * r_0_1>=1))) + ((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))))] = FALSE
Checking (exact) 0 :FwdG((Init * !(((((p_1_0>=1 * ((p_0_0>=1 * r_0_1>=1) + p_0_4>=1)) * EG(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1))) * !(!(EX(!(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))))) * EG((((r_1_3>=1 * p_1_4>=1) * r_0_3>=1) + ((p_0_1>=1 * r_0_2>=1) + (p_0_0>=1 * r_0_1>=1))))))),!((((p_0_2>=1 * r_0_3>=1) + (r_0_0>=1 * (p_0_0>=1 * r_0_1>=1))) + ((r_1_2>=1 * p_1_3>=1) * r_0_2>=1))))
Checking (exact) 1 :(Init * !(((((p_1_0>=1 * ((p_0_0>=1 * r_0_1>=1) + p_0_4>=1)) * EG(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1))) * !(!(EX(!(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))))) * EG((((r_1_3>=1 * p_1_4>=1) * r_0_3>=1) + ((p_0_1>=1 * r_0_2>=1) + (p_0_0>=1 * r_0_1>=1)))))))
Checking (exact) 1 :!(((((p_1_0>=1 * ((p_0_0>=1 * r_0_1>=1) + p_0_4>=1)) * EG(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1))) * !(!(EX(!(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))))) * EG((((r_1_3>=1 * p_1_4>=1) * r_0_3>=1) + ((p_0_1>=1 * r_0_2>=1) + (p_0_0>=1 * r_0_1>=1))))))
Checking (exact) 1 :((((p_1_0>=1 * ((p_0_0>=1 * r_0_1>=1) + p_0_4>=1)) * EG(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1))) * !(!(EX(!(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))))) * EG((((r_1_3>=1 * p_1_4>=1) * r_0_3>=1) + ((p_0_1>=1 * r_0_2>=1) + (p_0_0>=1 * r_0_1>=1)))))
Checking (exact) 1 :EG((((r_1_3>=1 * p_1_4>=1) * r_0_3>=1) + ((p_0_1>=1 * r_0_2>=1) + (p_0_0>=1 * r_0_1>=1))))
Checking (exact) 1 :(((p_1_0>=1 * ((p_0_0>=1 * r_0_1>=1) + p_0_4>=1)) * EG(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1))) * !(!(EX(!(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1))))))
Checking (exact) 1 :!(!(EX(!(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))))
Checking (exact) 1 :EX(!(((r_1_1>=1 * p_1_2>=1) * r_0_1>=1)))
Checking (exact) 1 :((p_1_0>=1 * ((p_0_0>=1 * r_0_1>=1) + p_0_4>=1)) * EG(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1)))
Checking (exact) 1 :EG(((r_1_3>=1 * p_1_4>=1) * r_0_3>=1))
Fast SCC detection found none.
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 2/6/10
(forward)formula 15,1,0.150643,8016,1,0,725,15400,184,412,764,23633,993
FORMULA ResAllocation-PT-R005C002-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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


BK_STOP 1464514691376

--------------------
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 29, 2016 9:38:10 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 29, 2016 9:38:10 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 31 ms
May 29, 2016 9:38:10 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 20 places.
May 29, 2016 9:38:10 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 12 transitions.
May 29, 2016 9:38:10 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 34 ms
May 29, 2016 9:38:10 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 11 ms
May 29, 2016 9:38:10 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 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="S_ResAllocation-PT-R005C002"
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/S_ResAllocation-PT-R005C002.tgz
mv S_ResAllocation-PT-R005C002 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 S_ResAllocation-PT-R005C002, 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 r181kn-smll-146444110900346"
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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;