About the Execution of ITS-Tools for GPPP-PT-C0001N0000000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
558.940 | 17562.00 | 23374.00 | 318.00 | FFTFFFFFTTFTFTFT | 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 GPPP-PT-C0001N0000000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r217su-smll-146468018500445
=====================================================================
--------------------
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 GPPP-PT-C0001N0000000010-CTLFireability-0
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-1
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-15
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-2
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-3
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-4
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-5
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-6
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-7
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-8
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1464761069159
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,1.65535e+06,2.03285,48780,2,4057,5,216894,6,0,161,255465,0
Converting to forward existential form...Done !
original formula: EG(EF(AG((E4P>=1 * Xu5P>=1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !((E4P>=1 * Xu5P>=1))))))] != FALSE
Checking (exact) 0 :[FwdG(Init,E(TRUE U !(E(TRUE U !((E4P>=1 * Xu5P>=1))))))] != FALSE
Checking (exact) 0 :FwdG(Init,E(TRUE U !(E(TRUE U !((E4P>=1 * Xu5P>=1))))))
Checking (exact) 1 :Init
Checking (exact) 1 :E(TRUE U !(E(TRUE U !((E4P>=1 * Xu5P>=1)))))
Checking (exact) 1 :!(E(TRUE U !((E4P>=1 * Xu5P>=1))))
Checking (exact) 1 :E(TRUE U !((E4P>=1 * Xu5P>=1)))
(forward)formula 0,0,2.50857,48876,1,0,44,216894,73,26,1220,255465,60
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: !(AF(EX((DHAP>=1 + start>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((DHAP>=1 + start>=1))))] != FALSE
Checking (exact) 0 :[FwdG(Init,!(EX((DHAP>=1 + start>=1))))] != FALSE
Checking (exact) 0 :FwdG(Init,!(EX((DHAP>=1 + start>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EX((DHAP>=1 + start>=1)))
Checking (exact) 1 :EX((DHAP>=1 + start>=1))
(forward)formula 1,0,2.64575,48876,1,0,119,216894,79,80,1221,255465,117
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AG(!((EG((GSSG>=1 * NADPH>=1)) * AG(((NADPplus>=2 * G6P>=1) * b2>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EG((GSSG>=1 * NADPH>=1))) * !(E(TRUE U !(((NADPplus>=2 * G6P>=1) * b2>=1)))))] = FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * EG((GSSG>=1 * NADPH>=1))) * !(E(TRUE U !(((NADPplus>=2 * G6P>=1) * b2>=1)))))] = FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * EG((GSSG>=1 * NADPH>=1))) * !(E(TRUE U !(((NADPplus>=2 * G6P>=1) * b2>=1)))))
Checking (exact) 1 :!(E(TRUE U !(((NADPplus>=2 * G6P>=1) * b2>=1))))
Checking (exact) 1 :E(TRUE U !(((NADPplus>=2 * G6P>=1) * b2>=1)))
(forward)formula 2,1,2.66303,48876,1,0,120,216894,87,80,1230,255465,120
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: E(((GAP>=1 * ((ATP>=7 * Lac>=7) * (Ru5P>=1 * a1>=2))) * (Ru5P>=1 * a1>=2)) U (AF(DHAP>=1) * !(((Ru5P>=1 * a1>=2) + GAP>=1))))
=> equivalent forward existential formula: [((FwdU(Init,((GAP>=1 * ((ATP>=7 * Lac>=7) * (Ru5P>=1 * a1>=2))) * (Ru5P>=1 * a1>=2))) * !(((Ru5P>=1 * a1>=2) + GAP>=1))) * !(EG(!(DHAP>=1))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,((GAP>=1 * ((ATP>=7 * Lac>=7) * (Ru5P>=1 * a1>=2))) * (Ru5P>=1 * a1>=2))) * !(((Ru5P>=1 * a1>=2) + GAP>=1))) * !(EG(!(DHAP>=1))))] != FALSE
Checking (exact) 0 :((FwdU(Init,((GAP>=1 * ((ATP>=7 * Lac>=7) * (Ru5P>=1 * a1>=2))) * (Ru5P>=1 * a1>=2))) * !(((Ru5P>=1 * a1>=2) + GAP>=1))) * !(EG(!(DHAP>=1))))
Checking (exact) 1 :!(EG(!(DHAP>=1)))
Checking (exact) 1 :EG(!(DHAP>=1))
Fast SCC detection found none.
Checking (exact) 1 :(FwdU(Init,((GAP>=1 * ((ATP>=7 * Lac>=7) * (Ru5P>=1 * a1>=2))) * (Ru5P>=1 * a1>=2))) * !(((Ru5P>=1 * a1>=2) + GAP>=1)))
Checking (exact) 1 :!(((Ru5P>=1 * a1>=2) + GAP>=1))
Checking (exact) 1 :FwdU(Init,((GAP>=1 * ((ATP>=7 * Lac>=7) * (Ru5P>=1 * a1>=2))) * (Ru5P>=1 * a1>=2)))
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 6/88/16
(forward)formula 3,1,8.0174,146392,1,0,527,776674,115,240,1299,636011,906
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EF((start>=1 * _2PG>=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (start>=1 * _2PG>=1))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * (start>=1 * _2PG>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * (start>=1 * _2PG>=1))
(forward)formula 4,0,8.01793,146452,1,0,527,776684,118,240,1301,636011,906
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: ((EX(EF(_3PG>=1)) * EF(EG((E4P>=1 * Xu5P>=1)))) * !((((G6P>=1 * b1>=3) + ((Ru5P>=1 * a2>=1) * FBP>=1)) + !(EF((ATP>=1 * Gluc>=1))))))
=> equivalent forward existential formula: [(FwdU(((Init * (EX(E(TRUE U _3PG>=1)) * E(TRUE U EG((E4P>=1 * Xu5P>=1))))) * !(((G6P>=1 * b1>=3) + ((Ru5P>=1 * a2>=1) * FBP>=1)))),TRUE) * (ATP>=1 * Gluc>=1))] != FALSE
Checking (exact) 0 :[(FwdU(((Init * (EX(E(TRUE U _3PG>=1)) * E(TRUE U EG((E4P>=1 * Xu5P>=1))))) * !(((G6P>=1 * b1>=3) + ((Ru5P>=1 * a2>=1) * FBP>=1)))),TRUE) * (ATP>=1 * Gluc>=1))] != FALSE
Checking (exact) 0 :(FwdU(((Init * (EX(E(TRUE U _3PG>=1)) * E(TRUE U EG((E4P>=1 * Xu5P>=1))))) * !(((G6P>=1 * b1>=3) + ((Ru5P>=1 * a2>=1) * FBP>=1)))),TRUE) * (ATP>=1 * Gluc>=1))
Checking (exact) 1 :(ATP>=1 * Gluc>=1)
Checking (exact) 1 :Gluc>=1
Checking (exact) 1 :FwdU(((Init * (EX(E(TRUE U _3PG>=1)) * E(TRUE U EG((E4P>=1 * Xu5P>=1))))) * !(((G6P>=1 * b1>=3) + ((Ru5P>=1 * a2>=1) * FBP>=1)))),TRUE)
Checking (exact) 1 :((Init * (EX(E(TRUE U _3PG>=1)) * E(TRUE U EG((E4P>=1 * Xu5P>=1))))) * !(((G6P>=1 * b1>=3) + ((Ru5P>=1 * a2>=1) * FBP>=1))))
Checking (exact) 1 :!(((G6P>=1 * b1>=3) + ((Ru5P>=1 * a2>=1) * FBP>=1)))
Checking (exact) 1 :(Init * (EX(E(TRUE U _3PG>=1)) * E(TRUE U EG((E4P>=1 * Xu5P>=1)))))
Checking (exact) 1 :(EX(E(TRUE U _3PG>=1)) * E(TRUE U EG((E4P>=1 * Xu5P>=1))))
Checking (exact) 1 :E(TRUE U EG((E4P>=1 * Xu5P>=1)))
Checking (exact) 1 :EG((E4P>=1 * Xu5P>=1))
Checking (exact) 1 :EX(E(TRUE U _3PG>=1))
Checking (exact) 1 :E(TRUE U _3PG>=1)
Checking (exact) 1 :Init
(forward)formula 5,1,10.7622,197360,1,0,675,1.04006e+06,139,245,1349,934869,1356
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-5 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EF((EG(!(DHAP>=1)) * AF(!((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EG(!(DHAP>=1))) * !(EG(!(!((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * EG(!(DHAP>=1))) * !(EG(!(!((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * EG(!(DHAP>=1))) * !(EG(!(!((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))))))
Checking (exact) 1 :!(EG(!(!((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1)))))
Checking (exact) 1 :EG(!(!((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))))
Checking (exact) 1 :(FwdU(Init,TRUE) * EG(!(DHAP>=1)))
Checking (exact) 1 :EG(!(DHAP>=1))
Fast SCC detection found none.
(forward)formula 6,0,11.2696,210264,1,0,921,1.11197e+06,152,329,1357,1.00683e+06,1850
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: ((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (EF(FBP>=1) * (PEP>=1 * ADP>=1)))) + ((EF(((PEP>=1 * ADP>=1) * GSH>=2)) + (EG(FBP>=1) * AX((Ru5P>=1 * a2>=1)))) * !(AX(((F6P>=1 * ATP>=1) + (Xu5P>=1 * R5P>=1))))))
=> equivalent forward existential formula: (([(((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2)))) * !(EG(FBP>=1)))] = FALSE * [(EY(((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2))))) * !((Ru5P>=1 * a2>=1)))] = FALSE) * [((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(EX(!(((F6P>=1 * ATP>=1) + (Xu5P>=1 * R5P>=1))))))] = FALSE)
Checking (exact) 0 :(([(((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2)))) * !(EG(FBP>=1)))] = FALSE * [(EY(((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2))))) * !((Ru5P>=1 * a2>=1)))] = FALSE) * [((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(EX(!(((F6P>=1 * ATP>=1) + (Xu5P>=1 * R5P>=1))))))] = FALSE)
Checking (exact) 1 :[((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(EX(!(((F6P>=1 * ATP>=1) + (Xu5P>=1 * R5P>=1))))))] = FALSE
Checking (exact) 0 :((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(EX(!(((F6P>=1 * ATP>=1) + (Xu5P>=1 * R5P>=1))))))
Checking (exact) 1 :!(EX(!(((F6P>=1 * ATP>=1) + (Xu5P>=1 * R5P>=1)))))
Checking (exact) 1 :EX(!(((F6P>=1 * ATP>=1) + (Xu5P>=1 * R5P>=1))))
Checking (exact) 1 :(Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1))))))
Checking (exact) 1 :!((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))
Checking (exact) 1 :(EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1))))
Checking (exact) 1 :(EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))
Checking (exact) 1 :EG(!(DHAP>=1))
Fast SCC detection found none.
Checking (exact) 1 :(E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1))
Checking (exact) 1 :(PEP>=1 * ADP>=1)
Checking (exact) 1 :ADP>=1
Checking (exact) 1 :E(TRUE U FBP>=1)
Checking (exact) 1 :EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1)))
Checking (exact) 1 :Init
Checking (exact) 1 :([(((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2)))) * !(EG(FBP>=1)))] = FALSE * [(EY(((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2))))) * !((Ru5P>=1 * a2>=1)))] = FALSE)
Checking (exact) 1 :[(EY(((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2))))) * !((Ru5P>=1 * a2>=1)))] = FALSE
Checking (exact) 0 :(EY(((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2))))) * !((Ru5P>=1 * a2>=1)))
Checking (exact) 1 :!((Ru5P>=1 * a2>=1))
Checking (exact) 1 :EY(((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2)))))
Checking (exact) 1 :((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2))))
Checking (exact) 1 :!(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2)))
Checking (exact) 1 :E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2))
Checking (exact) 1 :[(((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2)))) * !(EG(FBP>=1)))] = FALSE
Checking (exact) 0 :(((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2)))) * !(EG(FBP>=1)))
Checking (exact) 1 :!(EG(FBP>=1))
Checking (exact) 1 :EG(FBP>=1)
Checking (exact) 1 :((Init * !((EX(!(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + start>=1))) * (EG(!(DHAP>=1)) + (E(TRUE U FBP>=1) * (PEP>=1 * ADP>=1)))))) * !(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2))))
Checking (exact) 1 :!(E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2)))
Checking (exact) 1 :E(TRUE U ((PEP>=1 * ADP>=1) * GSH>=2))
(forward)formula 7,1,12.2003,232636,1,0,1167,1.24022e+06,174,420,1381,1.12337e+06,2338
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EF(AG((((Ru5P>=1 * a2>=1) + (Xu5P>=1 * R5P>=1)) * !(start>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((Ru5P>=1 * a2>=1) + (Xu5P>=1 * R5P>=1)) * !(start>=1))))))] != FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U !((((Ru5P>=1 * a2>=1) + (Xu5P>=1 * R5P>=1)) * !(start>=1))))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U !((((Ru5P>=1 * a2>=1) + (Xu5P>=1 * R5P>=1)) * !(start>=1))))))
Checking (exact) 1 :!(E(TRUE U !((((Ru5P>=1 * a2>=1) + (Xu5P>=1 * R5P>=1)) * !(start>=1)))))
Checking (exact) 1 :E(TRUE U !((((Ru5P>=1 * a2>=1) + (Xu5P>=1 * R5P>=1)) * !(start>=1))))
(forward)formula 8,0,12.212,232932,1,0,1168,1.24039e+06,179,420,1386,1.12338e+06,2341
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EF(A(!(((S7P>=1 * GAP>=1) * c1>=7)) U (Pyr>=1 * NADH>=1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((Pyr>=1 * NADH>=1))))) * !(E(!((Pyr>=1 * NADH>=1)) U (!(!(((S7P>=1 * GAP>=1) * c1>=7))) * !((Pyr>=1 * NADH>=1))))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,TRUE) * !(EG(!((Pyr>=1 * NADH>=1))))) * !(E(!((Pyr>=1 * NADH>=1)) U (!(!(((S7P>=1 * GAP>=1) * c1>=7))) * !((Pyr>=1 * NADH>=1))))))] != FALSE
Checking (exact) 0 :((FwdU(Init,TRUE) * !(EG(!((Pyr>=1 * NADH>=1))))) * !(E(!((Pyr>=1 * NADH>=1)) U (!(!(((S7P>=1 * GAP>=1) * c1>=7))) * !((Pyr>=1 * NADH>=1))))))
Checking (exact) 1 :!(E(!((Pyr>=1 * NADH>=1)) U (!(!(((S7P>=1 * GAP>=1) * c1>=7))) * !((Pyr>=1 * NADH>=1)))))
Checking (exact) 1 :E(!((Pyr>=1 * NADH>=1)) U (!(!(((S7P>=1 * GAP>=1) * c1>=7))) * !((Pyr>=1 * NADH>=1))))
Checking (exact) 1 :(FwdU(Init,TRUE) * !(EG(!((Pyr>=1 * NADH>=1)))))
Checking (exact) 1 :!(EG(!((Pyr>=1 * NADH>=1))))
Checking (exact) 1 :EG(!((Pyr>=1 * NADH>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 9,1,12.6862,244084,1,0,1417,1.30228e+06,196,516,1396,1.19452e+06,2902
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: AG(AF(EF((Xu5P>=1 * R5P>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U (Xu5P>=1 * R5P>=1))))] = FALSE
Checking (exact) 0 :[FwdG(FwdU(Init,TRUE),!(E(TRUE U (Xu5P>=1 * R5P>=1))))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),!(E(TRUE U (Xu5P>=1 * R5P>=1))))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Checking (exact) 1 :!(E(TRUE U (Xu5P>=1 * R5P>=1)))
Checking (exact) 1 :E(TRUE U (Xu5P>=1 * R5P>=1))
(forward)formula 10,1,12.7378,245600,1,0,1418,1.30729e+06,196,517,1396,1.19941e+06,2908
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
original formula: EF(E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U ((ADP>=1 * _1_3_BPG>=1) * (Ru5P>=1 * a1>=2))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),!(((NADPplus>=2 * G6P>=1) * b2>=1))) * ((ADP>=1 * _1_3_BPG>=1) * (Ru5P>=1 * a1>=2)))] != FALSE
Checking (exact) 0 :[(FwdU(FwdU(Init,TRUE),!(((NADPplus>=2 * G6P>=1) * b2>=1))) * ((ADP>=1 * _1_3_BPG>=1) * (Ru5P>=1 * a1>=2)))] != FALSE
Checking (exact) 0 :(FwdU(FwdU(Init,TRUE),!(((NADPplus>=2 * G6P>=1) * b2>=1))) * ((ADP>=1 * _1_3_BPG>=1) * (Ru5P>=1 * a1>=2)))
(forward)formula 11,0,12.7438,245860,1,0,1418,1.30761e+06,201,517,1400,1.19941e+06,2908
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EX(EG(((NADPplus>=2 * G6P>=1) * b2>=1)))
=> equivalent forward existential formula: [FwdG(EY(Init),((NADPplus>=2 * G6P>=1) * b2>=1))] != FALSE
Checking (exact) 0 :[FwdG(EY(Init),((NADPplus>=2 * G6P>=1) * b2>=1))] != FALSE
Checking (exact) 0 :FwdG(EY(Init),((NADPplus>=2 * G6P>=1) * b2>=1))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 12,0,12.7531,246124,1,0,1418,1.30761e+06,206,518,1403,1.19942e+06,2909
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: (((F6P>=1 * ATP>=1) * FBP>=1) * EG(AG((PEP>=1 * ADP>=1))))
=> equivalent forward existential formula: [FwdG((Init * ((F6P>=1 * ATP>=1) * FBP>=1)),!(E(TRUE U !((PEP>=1 * ADP>=1)))))] != FALSE
Checking (exact) 0 :[FwdG((Init * ((F6P>=1 * ATP>=1) * FBP>=1)),!(E(TRUE U !((PEP>=1 * ADP>=1)))))] != FALSE
Checking (exact) 0 :FwdG((Init * ((F6P>=1 * ATP>=1) * FBP>=1)),!(E(TRUE U !((PEP>=1 * ADP>=1)))))
Checking (exact) 1 :(Init * ((F6P>=1 * ATP>=1) * FBP>=1))
Checking (exact) 1 :!(E(TRUE U !((PEP>=1 * ADP>=1))))
Checking (exact) 1 :E(TRUE U !((PEP>=1 * ADP>=1)))
(forward)formula 13,0,12.9118,250564,1,0,1419,1.32967e+06,209,518,1409,1.21155e+06,2913
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: AF(AX((((Ru5P>=1 * a1>=2) + (Xu5P>=1 * R5P>=1)) + ((Ru5P>=1 * a2>=1) + ((S7P>=1 * GAP>=1) * c1>=7)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((Ru5P>=1 * a1>=2) + (Xu5P>=1 * R5P>=1)) + ((Ru5P>=1 * a2>=1) + ((S7P>=1 * GAP>=1) * c1>=7))))))))] = FALSE
Checking (exact) 0 :[FwdG(Init,!(!(EX(!((((Ru5P>=1 * a1>=2) + (Xu5P>=1 * R5P>=1)) + ((Ru5P>=1 * a2>=1) + ((S7P>=1 * GAP>=1) * c1>=7))))))))] = FALSE
Checking (exact) 0 :FwdG(Init,!(!(EX(!((((Ru5P>=1 * a1>=2) + (Xu5P>=1 * R5P>=1)) + ((Ru5P>=1 * a2>=1) + ((S7P>=1 * GAP>=1) * c1>=7))))))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(!(EX(!((((Ru5P>=1 * a1>=2) + (Xu5P>=1 * R5P>=1)) + ((Ru5P>=1 * a2>=1) + ((S7P>=1 * GAP>=1) * c1>=7)))))))
Checking (exact) 1 :EX(!((((Ru5P>=1 * a1>=2) + (Xu5P>=1 * R5P>=1)) + ((Ru5P>=1 * a2>=1) + ((S7P>=1 * GAP>=1) * c1>=7)))))
(forward)formula 14,0,13.0251,253204,1,0,1456,1.34122e+06,216,549,1418,1.22628e+06,2948
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
original formula: EF((((((Ru5P>=1 * a1>=2) * (G6P>=1 * b1>=3)) * !(_2PG>=1)) * EG(DHAP>=1)) + ((((Ru5P>=1 * a2>=1) * (ATP>=7 * Lac>=7)) * ((ADP>=1 * _1_3_BPG>=1) + ((S7P>=1 * GAP>=1) * c1>=7))) * (!((ATP>=7 * Lac>=7)) * ((ATP>=1 * Gluc>=1) + ((NADPplus>=2 * G6P>=1) * b2>=1))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * (((Ru5P>=1 * a1>=2) * (G6P>=1 * b1>=3)) * !(_2PG>=1))),DHAP>=1)] != FALSE + [(FwdU(Init,TRUE) * ((((Ru5P>=1 * a2>=1) * (ATP>=7 * Lac>=7)) * ((ADP>=1 * _1_3_BPG>=1) + ((S7P>=1 * GAP>=1) * c1>=7))) * (!((ATP>=7 * Lac>=7)) * ((ATP>=1 * Gluc>=1) + ((NADPplus>=2 * G6P>=1) * b2>=1)))))] != FALSE)
Checking (exact) 0 :([FwdG((FwdU(Init,TRUE) * (((Ru5P>=1 * a1>=2) * (G6P>=1 * b1>=3)) * !(_2PG>=1))),DHAP>=1)] != FALSE + [(FwdU(Init,TRUE) * ((((Ru5P>=1 * a2>=1) * (ATP>=7 * Lac>=7)) * ((ADP>=1 * _1_3_BPG>=1) + ((S7P>=1 * GAP>=1) * c1>=7))) * (!((ATP>=7 * Lac>=7)) * ((ATP>=1 * Gluc>=1) + ((NADPplus>=2 * G6P>=1) * b2>=1)))))] != FALSE)
Checking (exact) 0 :[FwdG((FwdU(Init,TRUE) * (((Ru5P>=1 * a1>=2) * (G6P>=1 * b1>=3)) * !(_2PG>=1))),DHAP>=1)] != FALSE
Checking (exact) 0 :FwdG((FwdU(Init,TRUE) * (((Ru5P>=1 * a1>=2) * (G6P>=1 * b1>=3)) * !(_2PG>=1))),DHAP>=1)
Checking (exact) 1 :(FwdU(Init,TRUE) * (((Ru5P>=1 * a1>=2) * (G6P>=1 * b1>=3)) * !(_2PG>=1)))
Checking (exact) 1 :(((Ru5P>=1 * a1>=2) * (G6P>=1 * b1>=3)) * !(_2PG>=1))
Checking (exact) 1 :!(_2PG>=1)
Checking (exact) 0 :[(FwdU(Init,TRUE) * ((((Ru5P>=1 * a2>=1) * (ATP>=7 * Lac>=7)) * ((ADP>=1 * _1_3_BPG>=1) + ((S7P>=1 * GAP>=1) * c1>=7))) * (!((ATP>=7 * Lac>=7)) * ((ATP>=1 * Gluc>=1) + ((NADPplus>=2 * G6P>=1) * b2>=1)))))] != FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * ((((Ru5P>=1 * a2>=1) * (ATP>=7 * Lac>=7)) * ((ADP>=1 * _1_3_BPG>=1) + ((S7P>=1 * GAP>=1) * c1>=7))) * (!((ATP>=7 * Lac>=7)) * ((ATP>=1 * Gluc>=1) + ((NADPplus>=2 * G6P>=1) * b2>=1)))))
(forward)formula 15,0,13.0464,253732,1,0,1457,1.34347e+06,237,550,1442,1.22877e+06,2951
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
BK_STOP 1464761086721
--------------------
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
Jun 01, 2016 6:04:32 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2016 6:04:32 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 46 ms
Jun 01, 2016 6:04:32 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 33 places.
Jun 01, 2016 6:04:32 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 transitions.
Jun 01, 2016 6:04:33 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 50 ms
Jun 01, 2016 6:04:33 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 15 ms
Jun 01, 2016 6:04:33 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="GPPP-PT-C0001N0000000010"
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/GPPP-PT-C0001N0000000010.tgz
mv GPPP-PT-C0001N0000000010 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 GPPP-PT-C0001N0000000010, 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 r217su-smll-146468018500445"
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 ;