About the Execution of ITS-Tools.L for ResAllocation-PT-R005C002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15758.350 | 5848.00 | 13972.00 | 5789.60 | FTFFTFTTFTFFFTTT | 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)
....................................................................................................
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is ResAllocation-PT-R005C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-qhx2-152673583100382
=====================================================================
--------------------
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-00
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R005C002-CTLFireability-09
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
=== Now, execution of the tool begins
BK_START 1527930096170
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph2426689902870865749.txt, -o, /tmp/graph2426689902870865749.bin, -w, /tmp/graph2426689902870865749.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph2426689902870865749.bin, -l, -1, -v, -w, /tmp/graph2426689902870865749.weights, -q, 0, -e, 0.001], workingDir=null]
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,112,0.029918,4700,47,7,188,22,64,194,13,21,0
Converting to forward existential form...Done !
original formula: AF(E((((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1)) U ((((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1))||((i1.u2.p_0_2>=1)&&(i1.u3.r_0_3>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E((((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1)) U ((((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1))||((i1.u2.p_0_2>=1)&&(i1.u3.r_0_3>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t_1_0, i2.u4.t_0_5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/10/2/12
(forward)formula 0,0,0.044446,5212,1,0,903,27,255,975,48,43,2292
FORMULA ResAllocation-PT-R005C002-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (i0.u0.r_0_0>=1)
=> equivalent forward existential formula: [(Init * (i0.u0.r_0_0>=1))] != FALSE
(forward)formula 1,1,0.045442,5532,1,0,904,27,255,975,48,43,2298
FORMULA ResAllocation-PT-R005C002-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: ((EX(((i2.u9.r_1_4>=1)&&(i2.u4.r_0_4>=1))) + AG((((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1)))) * EX((((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1))))
=> equivalent forward existential formula: ([(FwdU((Init * !(EX(((i2.u9.r_1_4>=1)&&(i2.u4.r_0_4>=1))))),TRUE) * !((((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1))))] = FALSE * [(Init * !(EX((((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1)))))] = FALSE)
(forward)formula 2,0,0.046483,5532,1,0,935,27,267,1017,48,43,2369
FORMULA ResAllocation-PT-R005C002-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX((i2.u4.p_0_4>=1))
=> equivalent forward existential formula: [(EY(Init) * !((i2.u4.p_0_4>=1)))] = FALSE
(forward)formula 3,0,0.04679,5532,1,0,937,27,271,1022,49,43,2371
FORMULA ResAllocation-PT-R005C002-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (!((E((i0.u5.p_1_0>=1) U (((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1))) * (((((i2.u9.r_1_4>=1)&&(i2.u4.r_0_4>=1))&&(((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1)))&&(!(i0.u5.p_1_0>=1)))&&((i2.u4.p_0_4>=1)||(!((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))))))) + !(((EF((i0.u5.p_1_0>=1)) * EG((((i3.u6.r_1_1>=1)&&(i3.u7.p_1_2>=1))&&(i0.u1.r_0_1>=1)))) * !(((i1.u2.p_0_2>=1)&&(i1.u3.r_0_3>=1))))))
=> equivalent forward existential formula: (([(Init * !(E((i0.u5.p_1_0>=1) U (((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1)))))] != FALSE + [(Init * !((((((i2.u9.r_1_4>=1)&&(i2.u4.r_0_4>=1))&&(((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1)))&&(!(i0.u5.p_1_0>=1)))&&((i2.u4.p_0_4>=1)||(!((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1)))))))] != FALSE) + (([(Init * !(E(TRUE U (i0.u5.p_1_0>=1))))] != FALSE + [(Init * !(EG((((i3.u6.r_1_1>=1)&&(i3.u7.p_1_2>=1))&&(i0.u1.r_0_1>=1)))))] != FALSE) + [(Init * ((i1.u2.p_0_2>=1)&&(i1.u3.r_0_3>=1)))] != FALSE))
(forward)formula 4,1,0.048871,5532,1,0,1015,27,299,1114,49,43,2662
FORMULA ResAllocation-PT-R005C002-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EF(!(AX(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1))))) * (EG((((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1))) + (EX(((i0.u5.p_1_0>=1)&&(((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1)))) * AX(((i1.u2.p_0_2>=1)&&(i1.u3.r_0_3>=1))))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(!(EX(!(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1)))))))))] = FALSE * ([((Init * !(EG((((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1))))) * !(EX(((i0.u5.p_1_0>=1)&&(((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1))))))] = FALSE * [(EY((Init * !(EG((((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1)))))) * !(((i1.u2.p_0_2>=1)&&(i1.u3.r_0_3>=1))))] = FALSE))
(forward)formula 5,0,0.05269,5532,1,0,1129,27,318,1218,50,43,2976
FORMULA ResAllocation-PT-R005C002-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AF((!(((!((i2.u9.r_1_4>=1)&&(i2.u4.r_0_4>=1)))||(i0.u5.p_1_0>=1))) + (((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))&&(i0.u0.r_0_0>=1))||((((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1))||(i0.u5.p_1_0>=1))) * AX((((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(((!((i2.u9.r_1_4>=1)&&(i2.u4.r_0_4>=1)))||(i0.u5.p_1_0>=1))) + (((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))&&(i0.u0.r_0_0>=1))||((((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1))||(i0.u5.p_1_0>=1))) * !(EX(!((((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1)))))))))] = FALSE
(forward)formula 6,1,0.061439,5796,1,0,1173,27,347,1314,52,43,3068
FORMULA ResAllocation-PT-R005C002-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !((((i1.u2.p_0_2>=1)&&(i1.u3.r_0_3>=1)) * (((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1)) + AG((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))||(i2.u4.p_0_4>=1))))))
=> equivalent forward existential formula: ([(Init * !(((i1.u2.p_0_2>=1)&&(i1.u3.r_0_3>=1))))] != FALSE + [(FwdU((Init * !(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1)))),TRUE) * !((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))||(i2.u4.p_0_4>=1))))] != FALSE)
(forward)formula 7,1,0.062658,5796,1,0,1173,27,347,1314,52,43,3072
FORMULA ResAllocation-PT-R005C002-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(AG(((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))&&(((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1)))||((((i3.u6.r_1_1>=1)&&(i3.u7.p_1_2>=1))&&(i0.u1.r_0_1>=1))||(((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))&&(((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1)))||((((i3.u6.r_1_1>=1)&&(i3.u7.p_1_2>=1))&&(i0.u1.r_0_1>=1))||(((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1))))))))] != FALSE
(forward)formula 8,0,0.069418,5796,1,0,1203,27,384,1374,53,44,3288
FORMULA ResAllocation-PT-R005C002-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((EF(!((((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1)))) * !(AF((i0.u5.p_1_0>=1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * E(TRUE U !((((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1))))),!((i0.u5.p_1_0>=1)))] != FALSE
(forward)formula 9,1,0.071093,5796,1,0,1241,27,423,1440,54,44,3461
FORMULA ResAllocation-PT-R005C002-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !((((EX(((i1.u2.p_0_2>=1)&&(i1.u3.r_0_3>=1))) + ((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))&&((i2.u9.r_1_4>=1)&&(i2.u4.r_0_4>=1)))||(!((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1))))) * (((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1)) + EX(((i2.u9.r_1_4>=1)&&(i2.u4.r_0_4>=1))))) + AF(((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))&&(((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1)))||(i0.u5.p_1_0>=1)))))
=> equivalent forward existential formula: [FwdG((Init * !(((EX(((i1.u2.p_0_2>=1)&&(i1.u3.r_0_3>=1))) + ((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))&&((i2.u9.r_1_4>=1)&&(i2.u4.r_0_4>=1)))||(!((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1))))) * (((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1)) + EX(((i2.u9.r_1_4>=1)&&(i2.u4.r_0_4>=1))))))),!(((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))&&(((i0.u5.r_1_0>=1)&&(i3.u6.p_1_1>=1))&&(i0.u0.r_0_0>=1)))||(i0.u5.p_1_0>=1))))] != FALSE
(forward)formula 10,0,0.074222,5796,1,0,1281,27,455,1527,54,44,3582
FORMULA ResAllocation-PT-R005C002-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: A(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1)) U E((i0.u0.r_0_0>=1) U ((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E((i0.u0.r_0_0>=1) U ((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))))))) * !(E(!(E((i0.u0.r_0_0>=1) U ((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1)))) U (!(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1))) * !(E((i0.u0.r_0_0>=1) U ((i0.u1.p_0_1>=1)&&(i1.u2.r_0_2>=1))))))))] != FALSE
(forward)formula 11,0,0.102189,6060,1,0,2418,27,481,2880,54,44,5949
FORMULA ResAllocation-PT-R005C002-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (A(!(((((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1))&&((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1)))) U EG(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1)))) * !(EF(EG((((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1))))))
=> equivalent forward existential formula: (([((FwdU(Init,!(EG(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1))))) * !(!(((((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1))&&((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1)))))) * !(EG(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1)))))] = FALSE * [FwdG(Init,!(EG(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1)))))] = FALSE) * [FwdG(FwdU(Init,TRUE),(((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1)))] = FALSE)
(forward)formula 12,0,0.109163,6324,1,0,2617,27,525,3076,55,45,6703
FORMULA ResAllocation-PT-R005C002-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(((((i0.u0.r_0_0>=1)||(((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1)))||((i2.u4.p_0_4>=1)&&(i0.u0.r_0_0>=1)))||((((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1))&&(((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1)))||(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1))||(((i3.u6.r_1_1>=1)&&(i3.u7.p_1_2>=1))&&(i0.u1.r_0_1>=1))))) U AG(!(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,((((i0.u0.r_0_0>=1)||(((i3.u8.r_1_3>=1)&&(i2.u9.p_1_4>=1))&&(i1.u3.r_0_3>=1)))||((i2.u4.p_0_4>=1)&&(i0.u0.r_0_0>=1)))||((((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1))&&(((i3.u7.r_1_2>=1)&&(i3.u8.p_1_3>=1))&&(i1.u2.r_0_2>=1)))||(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1))||(((i3.u6.r_1_1>=1)&&(i3.u7.p_1_2>=1))&&(i0.u1.r_0_1>=1)))))) * !(E(TRUE U !(!(((i1.u3.p_0_3>=1)&&(i2.u4.r_0_4>=1)))))))] != FALSE
(forward)formula 13,1,0.118336,6852,1,0,3057,27,549,3513,55,45,7890
FORMULA ResAllocation-PT-R005C002-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(!(EX((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))&&(i0.u5.p_1_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((i0.u0.p_0_0>=1)&&(i0.u1.r_0_1>=1))&&(i0.u5.p_1_0>=1)))))] != FALSE
(forward)formula 14,1,0.119351,6852,1,0,3057,27,553,3513,55,45,7910
FORMULA ResAllocation-PT-R005C002-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (i0.u0.r_0_0>=1)
=> equivalent forward existential formula: [(Init * (i0.u0.r_0_0>=1))] != FALSE
(forward)formula 15,1,0.119525,6852,1,0,3057,27,553,3513,55,45,7910
FORMULA ResAllocation-PT-R005C002-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1527930102018
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 02, 2018 9:01:39 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 02, 2018 9:01:39 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 9:01:39 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 53 ms
Jun 02, 2018 9:01:39 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 20 places.
Jun 02, 2018 9:01:39 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 12 transitions.
Jun 02, 2018 9:01:39 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Jun 02, 2018 9:01:39 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 9:01:40 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 36 ms
Jun 02, 2018 9:01:40 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 11 ms
Begin: Sat Jun 2 09:01:40 2018
Computation of communities with the Newman-Girvan Modularity quality function
level 0:
start computation: Sat Jun 2 09:01:40 2018
network size: 20 nodes, 78 links, 24 weight
quality increased from -0.0596065 to 0.377122
end computation: Sat Jun 2 09:01:40 2018
level 1:
start computation: Sat Jun 2 09:01:40 2018
network size: 10 nodes, 52 links, 24 weight
quality increased from 0.377122 to 0.470679
end computation: Sat Jun 2 09:01:40 2018
level 2:
start computation: Sat Jun 2 09:01:40 2018
network size: 4 nodes, 14 links, 24 weight
quality increased from 0.470679 to 0.470679
end computation: Sat Jun 2 09:01:40 2018
End: Sat Jun 2 09:01:40 2018
Total duration: 0 sec
0.470679
Jun 02, 2018 9:01:40 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 9:01:40 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 9 ms
Jun 02, 2018 9:01:40 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 9:01:40 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
Jun 02, 2018 9:01:40 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSCTLTools
INFO: Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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="ResAllocation-PT-R005C002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstoolsl"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R005C002.tgz
mv ResAllocation-PT-R005C002 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is 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 r141-qhx2-152673583100382"
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 ;