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-C0001N0000100000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r217su-smll-146468018600481
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464773626724


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,4.04885e+06,130.115,1089488,2,73366,5,2.56536e+06,6,0,161,2.44835e+06,0


Converting to forward existential form...Done !
original formula: E(!(EG((GSSG>=1 * NADPH>=1))) U (E4P>=1 * Xu5P>=1))
=> equivalent forward existential formula: [(FwdU(Init,!(EG((GSSG>=1 * NADPH>=1)))) * (E4P>=1 * Xu5P>=1))] != FALSE
Checking (exact) 0 :[(FwdU(Init,!(EG((GSSG>=1 * NADPH>=1)))) * (E4P>=1 * Xu5P>=1))] != FALSE
Checking (exact) 0 :(FwdU(Init,!(EG((GSSG>=1 * NADPH>=1)))) * (E4P>=1 * Xu5P>=1))
Checking (exact) 1 :(E4P>=1 * Xu5P>=1)
Checking (exact) 1 :Xu5P>=1
Checking (exact) 1 :FwdU(Init,!(EG((GSSG>=1 * NADPH>=1))))
Checking (exact) 1 :Init
Checking (exact) 1 :!(EG((GSSG>=1 * NADPH>=1)))
Checking (exact) 1 :EG((GSSG>=1 * NADPH>=1))
Fast SCC detection found none.
(forward)formula 0,1,267.283,1312804,1,0,60,3.20184e+06,72,25,4525,3.09214e+06,69
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: A((AF(DHAP>=1) + _2PG>=1) U AX(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))))))) * !(E(!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3)))))) U (!((!(EG(!(DHAP>=1))) + _2PG>=1)) * !(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))))))))] != FALSE
Checking (exact) 0 :[((Init * !(EG(!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))))))) * !(E(!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3)))))) U (!((!(EG(!(DHAP>=1))) + _2PG>=1)) * !(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))))))) * !(E(!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3)))))) U (!((!(EG(!(DHAP>=1))) + _2PG>=1)) * !(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))))))))
Checking (exact) 1 :!(E(!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3)))))) U (!((!(EG(!(DHAP>=1))) + _2PG>=1)) * !(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3)))))))))
Checking (exact) 1 :E(!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3)))))) U (!((!(EG(!(DHAP>=1))) + _2PG>=1)) * !(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))))))
Checking (exact) 1 :!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))))
Checking (exact) 1 :EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))
Checking (exact) 1 :(!((!(EG(!(DHAP>=1))) + _2PG>=1)) * !(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3)))))))
Checking (exact) 1 :!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))))
Checking (exact) 1 :EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))
Checking (exact) 1 :!((!(EG(!(DHAP>=1))) + _2PG>=1))
Checking (exact) 1 :(!(EG(!(DHAP>=1))) + _2PG>=1)
Checking (exact) 1 :!(EG(!(DHAP>=1)))
Checking (exact) 1 :EG(!(DHAP>=1))
Fast SCC detection found none.
Checking (exact) 1 :(Init * !(EG(!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3)))))))))
Checking (exact) 1 :!(EG(!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))))))
Checking (exact) 1 :EG(!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3)))))))
Checking (exact) 1 :!(!(EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))))
Checking (exact) 1 :EX(!(((Pyr>=1 * NADH>=1) + (G6P>=1 * b1>=3))))
Checking (exact) 1 :Init
(forward)formula 1,1,293.973,1767412,1,0,373,5.90571e+06,94,157,4537,4.66259e+06,656
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF((EG((Ru5P>=1 * a2>=1)) + DHAP>=1))
=> equivalent forward existential formula: [FwdG(Init,!((EG((Ru5P>=1 * a2>=1)) + DHAP>=1)))] = FALSE
Checking (exact) 0 :[FwdG(Init,!((EG((Ru5P>=1 * a2>=1)) + DHAP>=1)))] = FALSE
Checking (exact) 0 :FwdG(Init,!((EG((Ru5P>=1 * a2>=1)) + DHAP>=1)))
Checking (exact) 1 :Init
Checking (exact) 1 :!((EG((Ru5P>=1 * a2>=1)) + DHAP>=1))
Checking (exact) 1 :(EG((Ru5P>=1 * a2>=1)) + DHAP>=1)
Checking (exact) 1 :EG((Ru5P>=1 * a2>=1))
(forward)formula 2,1,295.368,1796804,1,0,446,6.06378e+06,106,183,4540,4.82635e+06,815
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-2 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: !(EF(EG(((GSSG>=1 * NADPH>=1) * (PEP>=1 * ADP>=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((GSSG>=1 * NADPH>=1) * (PEP>=1 * ADP>=1)))] = FALSE
Checking (exact) 0 :[FwdG(FwdU(Init,TRUE),((GSSG>=1 * NADPH>=1) * (PEP>=1 * ADP>=1)))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),((GSSG>=1 * NADPH>=1) * (PEP>=1 * ADP>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 3,1,295.545,1799180,1,0,446,6.10667e+06,117,183,4547,4.86935e+06,816
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: !(EF(E((F6P>=1 * ATP>=1) U (ATP>=7 * Lac>=7))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),(F6P>=1 * ATP>=1)) * (ATP>=7 * Lac>=7))] = FALSE
Checking (exact) 0 :[(FwdU(FwdU(Init,TRUE),(F6P>=1 * ATP>=1)) * (ATP>=7 * Lac>=7))] = FALSE
Checking (exact) 0 :(FwdU(FwdU(Init,TRUE),(F6P>=1 * ATP>=1)) * (ATP>=7 * Lac>=7))
Checking (exact) 1 :(ATP>=7 * Lac>=7)
Checking (exact) 1 :Lac>=7
Checking (exact) 1 :FwdU(FwdU(Init,TRUE),(F6P>=1 * ATP>=1))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 14/7/8
(forward)formula 4,0,296.071,1812368,1,0,447,6.13054e+06,131,184,4603,4.9198e+06,821
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (((((ATP>=1 * Gluc>=1) * !(((F6P>=1 * ATP>=1) * ((S7P>=1 * GAP>=1) * c1>=7)))) * !(AG(_2PG>=1))) + !(EX(!(GSH>=2)))) + (EF(((NADPplus>=2 * G6P>=1) * b2>=1)) * (EF((start>=1 + (((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) * EF((DHAP>=1 * start>=1)))))
=> equivalent forward existential formula: [(EY(((Init * !((E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) * (E(TRUE U (start>=1 + (((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) * E(TRUE U (DHAP>=1 * start>=1)))))) * !((((ATP>=1 * Gluc>=1) * !(((F6P>=1 * ATP>=1) * ((S7P>=1 * GAP>=1) * c1>=7)))) * !(!(E(TRUE U !(_2PG>=1)))))))) * !(GSH>=2))] = FALSE
Checking (exact) 0 :[(EY(((Init * !((E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) * (E(TRUE U (start>=1 + (((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) * E(TRUE U (DHAP>=1 * start>=1)))))) * !((((ATP>=1 * Gluc>=1) * !(((F6P>=1 * ATP>=1) * ((S7P>=1 * GAP>=1) * c1>=7)))) * !(!(E(TRUE U !(_2PG>=1)))))))) * !(GSH>=2))] = FALSE
Checking (exact) 0 :(EY(((Init * !((E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) * (E(TRUE U (start>=1 + (((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) * E(TRUE U (DHAP>=1 * start>=1)))))) * !((((ATP>=1 * Gluc>=1) * !(((F6P>=1 * ATP>=1) * ((S7P>=1 * GAP>=1) * c1>=7)))) * !(!(E(TRUE U !(_2PG>=1)))))))) * !(GSH>=2))
Checking (exact) 1 :!(GSH>=2)
Checking (exact) 1 :EY(((Init * !((E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) * (E(TRUE U (start>=1 + (((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) * E(TRUE U (DHAP>=1 * start>=1)))))) * !((((ATP>=1 * Gluc>=1) * !(((F6P>=1 * ATP>=1) * ((S7P>=1 * GAP>=1) * c1>=7)))) * !(!(E(TRUE U !(_2PG>=1))))))))
Checking (exact) 1 :((Init * !((E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) * (E(TRUE U (start>=1 + (((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) * E(TRUE U (DHAP>=1 * start>=1)))))) * !((((ATP>=1 * Gluc>=1) * !(((F6P>=1 * ATP>=1) * ((S7P>=1 * GAP>=1) * c1>=7)))) * !(!(E(TRUE U !(_2PG>=1)))))))
Checking (exact) 1 :!((((ATP>=1 * Gluc>=1) * !(((F6P>=1 * ATP>=1) * ((S7P>=1 * GAP>=1) * c1>=7)))) * !(!(E(TRUE U !(_2PG>=1))))))
Checking (exact) 1 :(((ATP>=1 * Gluc>=1) * !(((F6P>=1 * ATP>=1) * ((S7P>=1 * GAP>=1) * c1>=7)))) * !(!(E(TRUE U !(_2PG>=1)))))
Checking (exact) 1 :!(!(E(TRUE U !(_2PG>=1))))
Checking (exact) 1 :E(TRUE U !(_2PG>=1))
Checking (exact) 1 :(Init * !((E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) * (E(TRUE U (start>=1 + (((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) * E(TRUE U (DHAP>=1 * start>=1))))))
Checking (exact) 1 :!((E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) * (E(TRUE U (start>=1 + (((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) * E(TRUE U (DHAP>=1 * start>=1)))))
Checking (exact) 1 :(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) * (E(TRUE U (start>=1 + (((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) * E(TRUE U (DHAP>=1 * start>=1))))
Checking (exact) 1 :(E(TRUE U (start>=1 + (((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1))) * E(TRUE U (DHAP>=1 * start>=1)))
Checking (exact) 1 :E(TRUE U (DHAP>=1 * start>=1))
Checking (exact) 1 :Init
(forward)formula 5,0,297.381,1842800,1,0,452,6.19325e+06,173,189,4669,4.96453e+06,830
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG(EF(((DHAP>=1 * start>=1) * (_3PG>=1 + (Ru5P>=1 * a2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((DHAP>=1 * start>=1) * (_3PG>=1 + (Ru5P>=1 * a2>=1))))))] = FALSE
Checking (exact) 0 :[(FwdU(Init,TRUE) * !(E(TRUE U ((DHAP>=1 * start>=1) * (_3PG>=1 + (Ru5P>=1 * a2>=1))))))] = FALSE
Checking (exact) 0 :(FwdU(Init,TRUE) * !(E(TRUE U ((DHAP>=1 * start>=1) * (_3PG>=1 + (Ru5P>=1 * a2>=1))))))
Checking (exact) 1 :!(E(TRUE U ((DHAP>=1 * start>=1) * (_3PG>=1 + (Ru5P>=1 * a2>=1)))))
Checking (exact) 1 :E(TRUE U ((DHAP>=1 * start>=1) * (_3PG>=1 + (Ru5P>=1 * a2>=1))))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 6,0,297.531,1847140,1,0,452,6.21825e+06,177,189,4673,4.96466e+06,831
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(AX(EF((ATP>=7 * Lac>=7))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U (ATP>=7 * Lac>=7))))))] != FALSE
Checking (exact) 0 :[(EY(Init) * !(EX(!(E(TRUE U (ATP>=7 * Lac>=7))))))] != FALSE
Checking (exact) 0 :(EY(Init) * !(EX(!(E(TRUE U (ATP>=7 * Lac>=7))))))
Checking (exact) 1 :!(EX(!(E(TRUE U (ATP>=7 * Lac>=7)))))
Checking (exact) 1 :EX(!(E(TRUE U (ATP>=7 * Lac>=7))))
Checking (exact) 1 :!(E(TRUE U (ATP>=7 * Lac>=7)))
Checking (exact) 1 :E(TRUE U (ATP>=7 * Lac>=7))
Checking (exact) 1 :EY(Init)
Checking (exact) 1 :Init
(forward)formula 7,1,298.471,1859528,1,0,461,6.26376e+06,177,197,4673,5.01726e+06,847
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: (A(!((_3PG>=1 * (Ru5P>=1 * a2>=1))) U AG(start>=1)) + AG(AX(!((Pyr>=1 * NADH>=1)))))
=> equivalent forward existential formula: [(EY(FwdU((Init * !(!((E(!(!(E(TRUE U !(start>=1)))) U (!(!((_3PG>=1 * (Ru5P>=1 * a2>=1)))) * !(!(E(TRUE U !(start>=1)))))) + EG(!(!(E(TRUE U !(start>=1))))))))),TRUE)) * (Pyr>=1 * NADH>=1))] = FALSE
Checking (exact) 0 :[(EY(FwdU((Init * !(!((E(!(!(E(TRUE U !(start>=1)))) U (!(!((_3PG>=1 * (Ru5P>=1 * a2>=1)))) * !(!(E(TRUE U !(start>=1)))))) + EG(!(!(E(TRUE U !(start>=1))))))))),TRUE)) * (Pyr>=1 * NADH>=1))] = FALSE
Checking (exact) 0 :(EY(FwdU((Init * !(!((E(!(!(E(TRUE U !(start>=1)))) U (!(!((_3PG>=1 * (Ru5P>=1 * a2>=1)))) * !(!(E(TRUE U !(start>=1)))))) + EG(!(!(E(TRUE U !(start>=1))))))))),TRUE)) * (Pyr>=1 * NADH>=1))
Checking (exact) 1 :(Pyr>=1 * NADH>=1)
Checking (exact) 1 :NADH>=1
Checking (exact) 1 :EY(FwdU((Init * !(!((E(!(!(E(TRUE U !(start>=1)))) U (!(!((_3PG>=1 * (Ru5P>=1 * a2>=1)))) * !(!(E(TRUE U !(start>=1)))))) + EG(!(!(E(TRUE U !(start>=1))))))))),TRUE))
Checking (exact) 1 :FwdU((Init * !(!((E(!(!(E(TRUE U !(start>=1)))) U (!(!((_3PG>=1 * (Ru5P>=1 * a2>=1)))) * !(!(E(TRUE U !(start>=1)))))) + EG(!(!(E(TRUE U !(start>=1))))))))),TRUE)
Checking (exact) 1 :(Init * !(!((E(!(!(E(TRUE U !(start>=1)))) U (!(!((_3PG>=1 * (Ru5P>=1 * a2>=1)))) * !(!(E(TRUE U !(start>=1)))))) + EG(!(!(E(TRUE U !(start>=1)))))))))
Checking (exact) 1 :!(!((E(!(!(E(TRUE U !(start>=1)))) U (!(!((_3PG>=1 * (Ru5P>=1 * a2>=1)))) * !(!(E(TRUE U !(start>=1)))))) + EG(!(!(E(TRUE U !(start>=1))))))))
Checking (exact) 1 :(E(!(!(E(TRUE U !(start>=1)))) U (!(!((_3PG>=1 * (Ru5P>=1 * a2>=1)))) * !(!(E(TRUE U !(start>=1)))))) + EG(!(!(E(TRUE U !(start>=1))))))
Checking (exact) 1 :E(!(!(E(TRUE U !(start>=1)))) U (!(!((_3PG>=1 * (Ru5P>=1 * a2>=1)))) * !(!(E(TRUE U !(start>=1))))))
Checking (exact) 1 :!(!(E(TRUE U !(start>=1))))
Checking (exact) 1 :E(TRUE U !(start>=1))
Checking (exact) 1 :(!(!((_3PG>=1 * (Ru5P>=1 * a2>=1)))) * !(!(E(TRUE U !(start>=1)))))
Checking (exact) 1 :!(!(E(TRUE U !(start>=1))))
Checking (exact) 1 :E(TRUE U !(start>=1))
Checking (exact) 1 :EG(!(!(E(TRUE U !(start>=1)))))
Checking (exact) 1 :!(!(E(TRUE U !(start>=1))))
Checking (exact) 1 :E(TRUE U !(start>=1))
Checking (exact) 1 :Init
(forward)formula 8,0,301.406,1898448,1,0,475,6.41667e+06,181,207,4676,5.17978e+06,870
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (A((Pyr>=1 * NADH>=1) U ((NADPplus>=2 * G6P>=1) * b2>=1)) + EF(EF((Pyr>=1 * NADH>=1))))
=> equivalent forward existential formula: ([((Init * !(EG(!(((NADPplus>=2 * G6P>=1) * b2>=1))))) * !(E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U (!((Pyr>=1 * NADH>=1)) * !(((NADPplus>=2 * G6P>=1) * b2>=1))))))] != FALSE + [(FwdU(FwdU(Init,TRUE),TRUE) * (Pyr>=1 * NADH>=1))] != FALSE)
Checking (exact) 0 :([((Init * !(EG(!(((NADPplus>=2 * G6P>=1) * b2>=1))))) * !(E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U (!((Pyr>=1 * NADH>=1)) * !(((NADPplus>=2 * G6P>=1) * b2>=1))))))] != FALSE + [(FwdU(FwdU(Init,TRUE),TRUE) * (Pyr>=1 * NADH>=1))] != FALSE)
Checking (exact) 0 :[((Init * !(EG(!(((NADPplus>=2 * G6P>=1) * b2>=1))))) * !(E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U (!((Pyr>=1 * NADH>=1)) * !(((NADPplus>=2 * G6P>=1) * b2>=1))))))] != FALSE
Checking (exact) 0 :((Init * !(EG(!(((NADPplus>=2 * G6P>=1) * b2>=1))))) * !(E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U (!((Pyr>=1 * NADH>=1)) * !(((NADPplus>=2 * G6P>=1) * b2>=1))))))
Checking (exact) 1 :!(E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U (!((Pyr>=1 * NADH>=1)) * !(((NADPplus>=2 * G6P>=1) * b2>=1)))))
Checking (exact) 1 :E(!(((NADPplus>=2 * G6P>=1) * b2>=1)) U (!((Pyr>=1 * NADH>=1)) * !(((NADPplus>=2 * G6P>=1) * b2>=1))))
Checking (exact) 1 :(Init * !(EG(!(((NADPplus>=2 * G6P>=1) * b2>=1)))))
Checking (exact) 1 :!(EG(!(((NADPplus>=2 * G6P>=1) * b2>=1))))
Checking (exact) 1 :EG(!(((NADPplus>=2 * G6P>=1) * b2>=1)))
Checking (exact) 1 :Init
Checking (exact) 0 :[(FwdU(FwdU(Init,TRUE),TRUE) * (Pyr>=1 * NADH>=1))] != FALSE
Checking (exact) 0 :(FwdU(FwdU(Init,TRUE),TRUE) * (Pyr>=1 * NADH>=1))
Checking (exact) 1 :(Pyr>=1 * NADH>=1)
Checking (exact) 1 :NADH>=1
Checking (exact) 1 :FwdU(FwdU(Init,TRUE),TRUE)
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
(forward)formula 9,1,302.188,1917372,1,0,572,6.43582e+06,189,251,4682,5.22058e+06,1048
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((Ru5P>=1 * a2>=1) + (AX(EF((PEP>=1 * ADP>=1))) + ((((NADPplus>=2 * G6P>=1) * b2>=1) + AF((Xu5P>=1 * R5P>=1))) + ((((Ru5P>=1 * a1>=2) * GAP>=1) + (GSSG>=1 * NADPH>=1)) * EG(DHAP>=1)))))
=> equivalent forward existential formula: [FwdG(((((Init * !((Ru5P>=1 * a2>=1))) * !(!(EX(!(E(TRUE U (PEP>=1 * ADP>=1))))))) * !(((((Ru5P>=1 * a1>=2) * GAP>=1) + (GSSG>=1 * NADPH>=1)) * EG(DHAP>=1)))) * !(((NADPplus>=2 * G6P>=1) * b2>=1))),!((Xu5P>=1 * R5P>=1)))] = FALSE
Checking (exact) 0 :[FwdG(((((Init * !((Ru5P>=1 * a2>=1))) * !(!(EX(!(E(TRUE U (PEP>=1 * ADP>=1))))))) * !(((((Ru5P>=1 * a1>=2) * GAP>=1) + (GSSG>=1 * NADPH>=1)) * EG(DHAP>=1)))) * !(((NADPplus>=2 * G6P>=1) * b2>=1))),!((Xu5P>=1 * R5P>=1)))] = FALSE
Checking (exact) 0 :FwdG(((((Init * !((Ru5P>=1 * a2>=1))) * !(!(EX(!(E(TRUE U (PEP>=1 * ADP>=1))))))) * !(((((Ru5P>=1 * a1>=2) * GAP>=1) + (GSSG>=1 * NADPH>=1)) * EG(DHAP>=1)))) * !(((NADPplus>=2 * G6P>=1) * b2>=1))),!((Xu5P>=1 * R5P>=1)))
Checking (exact) 1 :((((Init * !((Ru5P>=1 * a2>=1))) * !(!(EX(!(E(TRUE U (PEP>=1 * ADP>=1))))))) * !(((((Ru5P>=1 * a1>=2) * GAP>=1) + (GSSG>=1 * NADPH>=1)) * EG(DHAP>=1)))) * !(((NADPplus>=2 * G6P>=1) * b2>=1)))
Checking (exact) 1 :!(((NADPplus>=2 * G6P>=1) * b2>=1))
Checking (exact) 1 :(((Init * !((Ru5P>=1 * a2>=1))) * !(!(EX(!(E(TRUE U (PEP>=1 * ADP>=1))))))) * !(((((Ru5P>=1 * a1>=2) * GAP>=1) + (GSSG>=1 * NADPH>=1)) * EG(DHAP>=1))))
Checking (exact) 1 :!(((((Ru5P>=1 * a1>=2) * GAP>=1) + (GSSG>=1 * NADPH>=1)) * EG(DHAP>=1)))
Checking (exact) 1 :((((Ru5P>=1 * a1>=2) * GAP>=1) + (GSSG>=1 * NADPH>=1)) * EG(DHAP>=1))
Checking (exact) 1 :EG(DHAP>=1)
Checking (exact) 1 :((Init * !((Ru5P>=1 * a2>=1))) * !(!(EX(!(E(TRUE U (PEP>=1 * ADP>=1)))))))
Checking (exact) 1 :!(!(EX(!(E(TRUE U (PEP>=1 * ADP>=1))))))
Checking (exact) 1 :EX(!(E(TRUE U (PEP>=1 * ADP>=1))))
Checking (exact) 1 :!(E(TRUE U (PEP>=1 * ADP>=1)))
Checking (exact) 1 :E(TRUE U (PEP>=1 * ADP>=1))
Checking (exact) 1 :(Init * !((Ru5P>=1 * a2>=1)))
(forward)formula 10,1,309.389,2000800,1,0,677,6.79665e+06,209,292,4698,5.46811e+06,1259
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AG(A(!((Ru5P>=1 * a1>=2)) U !(_3PG>=1)))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!(!(_3PG>=1))) * (!(!((Ru5P>=1 * a1>=2))) * !(!(_3PG>=1))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(!(_3PG>=1)))] = FALSE)
Checking (exact) 0 :([(FwdU(FwdU(Init,TRUE),!(!(_3PG>=1))) * (!(!((Ru5P>=1 * a1>=2))) * !(!(_3PG>=1))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(!(_3PG>=1)))] = FALSE)
Checking (exact) 1 :[FwdG(FwdU(Init,TRUE),!(!(_3PG>=1)))] = FALSE
Checking (exact) 0 :FwdG(FwdU(Init,TRUE),!(!(_3PG>=1)))
Checking (exact) 1 :FwdU(Init,TRUE)
Checking (exact) 1 :Init
Hit Full ! (commute/partial/dont) 20/0/2
(forward)formula 11,0,311.575,2041316,1,0,678,6.98272e+06,215,292,4731,5.73922e+06,1263
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E((EF(((NADPplus>=2 * G6P>=1) * b2>=1)) + (PEP>=1 * ADP>=1)) U (EX((PEP>=1 * ADP>=1)) * EF(((NADPplus>=2 * G6P>=1) * b2>=1))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) + (PEP>=1 * ADP>=1))) * EX((PEP>=1 * ADP>=1))),TRUE) * ((NADPplus>=2 * G6P>=1) * b2>=1))] != FALSE
Checking (exact) 0 :[(FwdU((FwdU(Init,(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) + (PEP>=1 * ADP>=1))) * EX((PEP>=1 * ADP>=1))),TRUE) * ((NADPplus>=2 * G6P>=1) * b2>=1))] != FALSE
Checking (exact) 0 :(FwdU((FwdU(Init,(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) + (PEP>=1 * ADP>=1))) * EX((PEP>=1 * ADP>=1))),TRUE) * ((NADPplus>=2 * G6P>=1) * b2>=1))
Checking (exact) 1 :((NADPplus>=2 * G6P>=1) * b2>=1)
Checking (exact) 1 :b2>=1
Checking (exact) 1 :FwdU((FwdU(Init,(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) + (PEP>=1 * ADP>=1))) * EX((PEP>=1 * ADP>=1))),TRUE)
Checking (exact) 1 :(FwdU(Init,(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) + (PEP>=1 * ADP>=1))) * EX((PEP>=1 * ADP>=1)))
Checking (exact) 1 :EX((PEP>=1 * ADP>=1))
Checking (exact) 1 :FwdU(Init,(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) + (PEP>=1 * ADP>=1)))
Checking (exact) 1 :Init
Checking (exact) 1 :(E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1)) + (PEP>=1 * ADP>=1))
Checking (exact) 1 :E(TRUE U ((NADPplus>=2 * G6P>=1) * b2>=1))
(forward)formula 12,1,1225.86,2935072,1,0,28109,9.59146e+06,17,28098,4022,1.26055e+07,9200
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: ((AG((((Ru5P>=1 * a1>=2) * start>=1) + !(((NADPplus>=2 * G6P>=1) * b2>=1)))) + EG(AF(DHAP>=1))) + AF((((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + ((ADP>=1 * _1_3_BPG>=1) * _3PG>=1)) * EX((Ru5P>=1 * a2>=1)))))
=> equivalent forward existential formula: [FwdG((Init * !((!(E(TRUE U !((((Ru5P>=1 * a1>=2) * start>=1) + !(((NADPplus>=2 * G6P>=1) * b2>=1)))))) + EG(!(EG(!(DHAP>=1))))))),!((((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + ((ADP>=1 * _1_3_BPG>=1) * _3PG>=1)) * EX((Ru5P>=1 * a2>=1)))))] = FALSE
Checking (exact) 0 :[FwdG((Init * !((!(E(TRUE U !((((Ru5P>=1 * a1>=2) * start>=1) + !(((NADPplus>=2 * G6P>=1) * b2>=1)))))) + EG(!(EG(!(DHAP>=1))))))),!((((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + ((ADP>=1 * _1_3_BPG>=1) * _3PG>=1)) * EX((Ru5P>=1 * a2>=1)))))] = FALSE
Checking (exact) 0 :FwdG((Init * !((!(E(TRUE U !((((Ru5P>=1 * a1>=2) * start>=1) + !(((NADPplus>=2 * G6P>=1) * b2>=1)))))) + EG(!(EG(!(DHAP>=1))))))),!((((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + ((ADP>=1 * _1_3_BPG>=1) * _3PG>=1)) * EX((Ru5P>=1 * a2>=1)))))
Checking (exact) 1 :(Init * !((!(E(TRUE U !((((Ru5P>=1 * a1>=2) * start>=1) + !(((NADPplus>=2 * G6P>=1) * b2>=1)))))) + EG(!(EG(!(DHAP>=1)))))))
Checking (exact) 1 :!((!(E(TRUE U !((((Ru5P>=1 * a1>=2) * start>=1) + !(((NADPplus>=2 * G6P>=1) * b2>=1)))))) + EG(!(EG(!(DHAP>=1))))))
Checking (exact) 1 :(!(E(TRUE U !((((Ru5P>=1 * a1>=2) * start>=1) + !(((NADPplus>=2 * G6P>=1) * b2>=1)))))) + EG(!(EG(!(DHAP>=1)))))
Checking (exact) 1 :!(E(TRUE U !((((Ru5P>=1 * a1>=2) * start>=1) + !(((NADPplus>=2 * G6P>=1) * b2>=1))))))
Checking (exact) 1 :E(TRUE U !((((Ru5P>=1 * a1>=2) * start>=1) + !(((NADPplus>=2 * G6P>=1) * b2>=1)))))
Checking (exact) 1 :EG(!(EG(!(DHAP>=1))))
Checking (exact) 1 :!(EG(!(DHAP>=1)))
Checking (exact) 1 :EG(!(DHAP>=1))
Fast SCC detection found none.
Checking (exact) 1 :!((((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + ((ADP>=1 * _1_3_BPG>=1) * _3PG>=1)) * EX((Ru5P>=1 * a2>=1))))
Checking (exact) 1 :(((((GAP>=1 * NADplus>=1) * Pi>=1) * c2>=1) + ((ADP>=1 * _1_3_BPG>=1) * _3PG>=1)) * EX((Ru5P>=1 * a2>=1)))
Checking (exact) 1 :EX((Ru5P>=1 * a2>=1))
(forward)formula 13,1,1246.55,2935072,1,0,28109,9.59146e+06,71,28098,4203,1.26055e+07,9637
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: E((!((((S7P>=1 * GAP>=1) * c1>=7) + (GSSG>=1 * NADPH>=1))) + (F6P>=1 * ATP>=1)) U (AG(GSH>=2) * AG((E4P>=1 * Xu5P>=1))))
=> equivalent forward existential formula: [((FwdU(Init,(!((((S7P>=1 * GAP>=1) * c1>=7) + (GSSG>=1 * NADPH>=1))) + (F6P>=1 * ATP>=1))) * !(E(TRUE U !(GSH>=2)))) * !(E(TRUE U !((E4P>=1 * Xu5P>=1)))))] != FALSE
Checking (exact) 0 :[((FwdU(Init,(!((((S7P>=1 * GAP>=1) * c1>=7) + (GSSG>=1 * NADPH>=1))) + (F6P>=1 * ATP>=1))) * !(E(TRUE U !(GSH>=2)))) * !(E(TRUE U !((E4P>=1 * Xu5P>=1)))))] != FALSE
Checking (exact) 0 :((FwdU(Init,(!((((S7P>=1 * GAP>=1) * c1>=7) + (GSSG>=1 * NADPH>=1))) + (F6P>=1 * ATP>=1))) * !(E(TRUE U !(GSH>=2)))) * !(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 14,0,1247.24,2935072,1,0,28109,9.59146e+06,76,28098,4208,1.26055e+07,9645
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: ((AX(AG(((S7P>=1 * GAP>=1) * c1>=7))) * ((AG(DHAP>=1) + AF((ADP>=1 * _1_3_BPG>=1))) * (!(((GSSG>=1 * NADPH>=1) + (Pyr>=1 * NADH>=1))) * AX((F6P>=1 * ATP>=1))))) + E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))
=> equivalent forward existential formula: ([(FwdU(EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))),TRUE) * !(((S7P>=1 * GAP>=1) * c1>=7)))] = FALSE * ([FwdG(((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * !(!(E(TRUE U !(DHAP>=1))))),!((ADP>=1 * _1_3_BPG>=1)))] = FALSE * ([((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * ((GSSG>=1 * NADPH>=1) + (Pyr>=1 * NADH>=1)))] = FALSE * [(EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))) * !((F6P>=1 * ATP>=1)))] = FALSE)))
Checking (exact) 0 :([(FwdU(EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))),TRUE) * !(((S7P>=1 * GAP>=1) * c1>=7)))] = FALSE * ([FwdG(((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * !(!(E(TRUE U !(DHAP>=1))))),!((ADP>=1 * _1_3_BPG>=1)))] = FALSE * ([((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * ((GSSG>=1 * NADPH>=1) + (Pyr>=1 * NADH>=1)))] = FALSE * [(EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))) * !((F6P>=1 * ATP>=1)))] = FALSE)))
Checking (exact) 1 :([FwdG(((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * !(!(E(TRUE U !(DHAP>=1))))),!((ADP>=1 * _1_3_BPG>=1)))] = FALSE * ([((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * ((GSSG>=1 * NADPH>=1) + (Pyr>=1 * NADH>=1)))] = FALSE * [(EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))) * !((F6P>=1 * ATP>=1)))] = FALSE))
Checking (exact) 1 :([((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * ((GSSG>=1 * NADPH>=1) + (Pyr>=1 * NADH>=1)))] = FALSE * [(EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))) * !((F6P>=1 * ATP>=1)))] = FALSE)
Checking (exact) 1 :[(EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))) * !((F6P>=1 * ATP>=1)))] = FALSE
Checking (exact) 0 :(EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))) * !((F6P>=1 * ATP>=1)))
Checking (exact) 1 :!((F6P>=1 * ATP>=1))
Checking (exact) 1 :EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))))
Checking (exact) 1 :(Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))
Checking (exact) 1 :!(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))
Checking (exact) 1 :E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * ((GSSG>=1 * NADPH>=1) + (Pyr>=1 * NADH>=1)))] = FALSE
Checking (exact) 0 :((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * ((GSSG>=1 * NADPH>=1) + (Pyr>=1 * NADH>=1)))
Checking (exact) 1 :((GSSG>=1 * NADPH>=1) + (Pyr>=1 * NADH>=1))
Checking (exact) 1 :(Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))
Checking (exact) 1 :!(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))
Checking (exact) 1 :E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[FwdG(((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * !(!(E(TRUE U !(DHAP>=1))))),!((ADP>=1 * _1_3_BPG>=1)))] = FALSE
Checking (exact) 0 :FwdG(((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * !(!(E(TRUE U !(DHAP>=1))))),!((ADP>=1 * _1_3_BPG>=1)))
Checking (exact) 1 :((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))) * !(!(E(TRUE U !(DHAP>=1)))))
Checking (exact) 1 :!(!(E(TRUE U !(DHAP>=1))))
Checking (exact) 1 :E(TRUE U !(DHAP>=1))
Checking (exact) 1 :(Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))
Checking (exact) 1 :!(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))
Checking (exact) 1 :E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))
Checking (exact) 1 :Init
Checking (exact) 1 :[(FwdU(EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))),TRUE) * !(((S7P>=1 * GAP>=1) * c1>=7)))] = FALSE
Checking (exact) 0 :(FwdU(EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))),TRUE) * !(((S7P>=1 * GAP>=1) * c1>=7)))
Checking (exact) 1 :!(((S7P>=1 * GAP>=1) * c1>=7))
Checking (exact) 1 :FwdU(EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))),TRUE)
Checking (exact) 1 :EY((Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))))
Checking (exact) 1 :(Init * !(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))))
Checking (exact) 1 :!(E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1)))
Checking (exact) 1 :E(!((ATP>=7 * Lac>=7)) U (Pyr>=1 * NADH>=1))
Checking (exact) 1 :Init
(forward)formula 15,1,1252.51,2935072,1,0,28109,9.59146e+06,111,28098,4237,1.26055e+07,9768
FORMULA GPPP-PT-C0001N0000100000-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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


BK_STOP 1464774883481

--------------------
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 9:33:49 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2016 9:33:49 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 31 ms
Jun 01, 2016 9:33:49 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 33 places.
Jun 01, 2016 9:33:49 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 22 transitions.
Jun 01, 2016 9:33:50 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 37 ms
Jun 01, 2016 9:33:50 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.gal : 10 ms
Jun 01, 2016 9:33:50 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="GPPP-PT-C0001N0000100000"
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-C0001N0000100000.tgz
mv GPPP-PT-C0001N0000100000 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-C0001N0000100000, 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-146468018600481"
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 ;