Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389200708.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R010C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.4K May 14 00:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 00:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 13 07:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 07:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 43K May 12 20:53 model.pnml

--------------------
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-R010C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R010C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590556215506

[2020-05-27 05:10:17] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 05:10:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:17] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-05-27 05:10:17] [INFO ] Transformed 40 places.
[2020-05-27 05:10:17] [INFO ] Transformed 22 transitions.
[2020-05-27 05:10:17] [INFO ] Parsed PT model containing 40 places and 22 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Incomplete random walk after 100000 steps, including 2985 resets, run finished after 248 ms. (steps per millisecond=403 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 22 rows 40 cols
[2020-05-27 05:10:18] [INFO ] Computed 20 place invariants in 4 ms
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using 20 positive place invariants in 33 ms returned sat
[2020-05-27 05:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-05-27 05:10:18] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-27 05:10:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2020-05-27 05:10:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2020-05-27 05:10:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:18] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-05-27 05:10:18] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-27 05:10:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2020-05-27 05:10:18] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints in 6 ms.
[2020-05-27 05:10:18] [INFO ] Added : 13 causal constraints over 3 iterations in 30 ms. Result :sat
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-27 05:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-05-27 05:10:18] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-27 05:10:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned unsat
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using 20 positive place invariants in 67 ms returned sat
[2020-05-27 05:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-05-27 05:10:18] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints in 2 ms.
[2020-05-27 05:10:18] [INFO ] Added : 15 causal constraints over 3 iterations in 28 ms. Result :sat
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2020-05-27 05:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-05-27 05:10:18] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-27 05:10:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-05-27 05:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:18] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-05-27 05:10:18] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2020-05-27 05:10:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2020-05-27 05:10:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-05-27 05:10:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:18] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-05-27 05:10:19] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-05-27 05:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2020-05-27 05:10:19] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints in 5 ms.
[2020-05-27 05:10:19] [INFO ] Added : 8 causal constraints over 2 iterations in 47 ms. Result :sat
[2020-05-27 05:10:19] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2020-05-27 05:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:19] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-05-27 05:10:19] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-05-27 05:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2020-05-27 05:10:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:19] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2020-05-27 05:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-05-27 05:10:19] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-27 05:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2020-05-27 05:10:19] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints in 5 ms.
[2020-05-27 05:10:19] [INFO ] Added : 15 causal constraints over 3 iterations in 18 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-27 05:10:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-27 05:10:19] [INFO ] Flatten gal took : 45 ms
[2020-05-27 05:10:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-27 05:10:19] [INFO ] Flatten gal took : 10 ms
FORMULA ResAllocation-PT-R010C002-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 05:10:19] [INFO ] Applying decomposition
[2020-05-27 05:10:19] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph15202080719563061255.txt, -o, /tmp/graph15202080719563061255.bin, -w, /tmp/graph15202080719563061255.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph15202080719563061255.bin, -l, -1, -v, -w, /tmp/graph15202080719563061255.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:10:19] [INFO ] Decomposing Gal with order
[2020-05-27 05:10:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:10:19] [INFO ] Flatten gal took : 39 ms
[2020-05-27 05:10:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-27 05:10:19] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
[2020-05-27 05:10:19] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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.202005100927/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 14 CTL formulae.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 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,6144,0.021954,4704,63,7,635,24,88,1019,13,28,0


Converting to forward existential form...Done !
original formula: EF(AG(EX((i2.u9.p_0_9>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX((i2.u9.p_0_9>=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i2.u9.t_0_10, i3.t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/20/2/22
(forward)formula 0,0,0.031007,5144,1,0,992,26,395,1660,49,30,2141
FORMULA ResAllocation-PT-R010C002-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(EF(((((i2.u9.p_0_9>=1)||(((i1.u6.r_0_6>=1)&&(i1.u16.r_1_6>=1))&&(i1.u17.p_1_7>=1)))||((i1.u7.p_0_7>=1)&&(i2.u8.r_0_8>=1)))||((i2.u9.r_0_9>=1)&&(i2.u19.r_1_9>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i2.u9.p_0_9>=1)||(((i1.u6.r_0_6>=1)&&(i1.u16.r_1_6>=1))&&(i1.u17.p_1_7>=1)))||((i1.u7.p_0_7>=1)&&(i2.u8.r_0_8>=1)))||((i2.u9.r_0_9>=1)&&(i2.u19.r_1_9>=1))))))] = FALSE
(forward)formula 1,0,0.035468,5408,1,0,1244,26,429,2082,49,30,2868
FORMULA ResAllocation-PT-R010C002-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AG(((((i4.i0.u5.r_0_5>=1)&&(i4.i1.u15.r_1_5>=1))&&(i1.u16.p_1_6>=1))||(i3.u0.r_0_0>=1))) * (((i3.u0.p_0_0>=1)&&(i3.u1.r_0_1>=1))||((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (((i3.u0.p_0_0>=1)&&(i3.u1.r_0_1>=1))||((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1)))) * !(E(TRUE U !(((((i4.i0.u5.r_0_5>=1)&&(i4.i1.u15.r_1_5>=1))&&(i1.u16.p_1_6>=1))||(i3.u0.r_0_0>=1))))))] != FALSE
(forward)formula 2,0,0.037454,5408,1,0,1275,26,443,2140,49,30,3029
FORMULA ResAllocation-PT-R010C002-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((((i3.u1.r_0_1>=1)&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1))&&(i1.u6.p_0_6>=1))&&(i1.u7.r_0_7>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((((((i3.u1.r_0_1>=1)&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1))&&(i1.u6.p_0_6>=1))&&(i1.u7.r_0_7>=1))))] = FALSE
(forward)formula 3,0,0.052675,5936,1,0,2684,26,590,3792,52,31,6489
FORMULA ResAllocation-PT-R010C002-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(EF(EG((((i3.u1.r_0_1>=1)&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1))))) + (EX(((((i2.u8.r_0_8>=1)&&(i2.u18.r_1_8>=1))&&(i2.u19.p_1_9>=1))||(((i1.u6.r_0_6>=1)&&(i1.u16.r_1_6>=1))&&(i1.u17.p_1_7>=1)))) * AF(((((i1.u7.r_0_7>=1)&&(i1.u17.r_1_7>=1))&&(i2.u18.p_1_8>=1))||(((i0.u2.r_0_2>=1)&&(i0.u12.r_1_2>=1))&&(i0.u13.p_1_3>=1))))))
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U EG((((i3.u1.r_0_1>=1)&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1))))))) * !(EX(((((i2.u8.r_0_8>=1)&&(i2.u18.r_1_8>=1))&&(i2.u19.p_1_9>=1))||(((i1.u6.r_0_6>=1)&&(i1.u16.r_1_6>=1))&&(i1.u17.p_1_7>=1))))))] = FALSE * [FwdG((Init * !(!(E(TRUE U EG((((i3.u1.r_0_1>=1)&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1))))))),!(((((i1.u7.r_0_7>=1)&&(i1.u17.r_1_7>=1))&&(i2.u18.p_1_8>=1))||(((i0.u2.r_0_2>=1)&&(i0.u12.r_1_2>=1))&&(i0.u13.p_1_3>=1)))))] = FALSE)
(forward)formula 4,1,0.063355,6464,1,0,3589,26,635,4681,52,31,7923
FORMULA ResAllocation-PT-R010C002-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(E(EF(((i2.u9.r_0_9>=1)&&(i2.u19.r_1_9>=1))) U EG((i3.u0.r_0_0>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(TRUE U ((i2.u9.r_0_9>=1)&&(i2.u19.r_1_9>=1)))),(i3.u0.r_0_0>=1))] = FALSE
(forward)formula 5,1,0.119797,9368,1,0,11621,26,656,11435,52,31,17725
FORMULA ResAllocation-PT-R010C002-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EG(((i1.u7.p_0_7>=1)&&(i2.u8.r_0_8>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((i1.u7.p_0_7>=1)&&(i2.u8.r_0_8>=1)))] != FALSE
(forward)formula 6,0,0.12372,9632,1,0,12171,26,672,11830,52,31,18652
FORMULA ResAllocation-PT-R010C002-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(((EF((((((i2.u8.p_0_8>=1)&&(i2.u9.r_0_9>=1))&&(i3.u1.r_0_1>=1))&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1))) + AF(((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1)))) + AX(((i4.i0.u4.p_0_4>=1)&&(i4.i0.u5.r_0_5>=1)))))
=> equivalent forward existential formula: [(EY((EY(Init) * !((E(TRUE U (((((i2.u8.p_0_8>=1)&&(i2.u9.r_0_9>=1))&&(i3.u1.r_0_1>=1))&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1))) + !(EG(!(((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1))))))))) * !(((i4.i0.u4.p_0_4>=1)&&(i4.i0.u5.r_0_5>=1))))] = FALSE
(forward)formula 7,0,0.176298,12008,1,0,18643,26,707,17404,52,31,27364
FORMULA ResAllocation-PT-R010C002-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF((AX((((i3.u0.r_0_0>=1)&&(i3.u10.r_1_0>=1))&&(i3.u11.p_1_1>=1))) + ((((i0.u3.r_0_3<1)||(i0.u13.r_1_3<1))||(i4.i1.u14.p_1_4<1))&&((i2.u9.r_0_9<1)||(i2.u19.r_1_9<1))))) + A(((((i0.u3.p_0_3<1)||(i4.i0.u4.r_0_4<1))&&(i3.u1.p_0_1>=1))&&(i0.u2.r_0_2>=1)) U ((((((i3.u10.p_1_0>=1)&&(i3.u1.r_0_1>=1))&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1))||(((i2.u8.r_0_8>=1)&&(i2.u18.r_1_8>=1))&&(i2.u19.p_1_9>=1)))||((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1)))))
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!(((((((i3.u10.p_1_0>=1)&&(i3.u1.r_0_1>=1))&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1))||(((i2.u8.r_0_8>=1)&&(i2.u18.r_1_8>=1))&&(i2.u19.p_1_9>=1)))||((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1)))) U (!(((((i0.u3.p_0_3<1)||(i4.i0.u4.r_0_4<1))&&(i3.u1.p_0_1>=1))&&(i0.u2.r_0_2>=1))) * !(((((((i3.u10.p_1_0>=1)&&(i3.u1.r_0_1>=1))&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1))||(((i2.u8.r_0_8>=1)&&(i2.u18.r_1_8>=1))&&(i2.u19.p_1_9>=1)))||((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1)))))) + EG(!(((((((i3.u10.p_1_0>=1)&&(i3.u1.r_0_1>=1))&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1))||(((i2.u8.r_0_8>=1)&&(i2.u18.r_1_8>=1))&&(i2.u19.p_1_9>=1)))||((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1))))))))),!((!(EX(!((((i3.u0.r_0_0>=1)&&(i3.u10.r_1_0>=1))&&(i3.u11.p_1_1>=1))))) + ((((i0.u3.r_0_3<1)||(i0.u13.r_1_3<1))||(i4.i1.u14.p_1_4<1))&&((i2.u9.r_0_9<1)||(i2.u19.r_1_9<1))))))] = FALSE
(forward)formula 8,1,0.239499,14912,1,0,26378,26,781,24289,54,31,37935
FORMULA ResAllocation-PT-R010C002-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(((((i0.u2.r_0_2>=1)&&(i0.u12.r_1_2>=1))&&(i0.u13.p_1_3>=1)) * AX((i3.u0.r_0_0>=1)))) * EF(((i1.u6.p_0_6<1)||(i1.u7.r_0_7<1))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((((i0.u2.r_0_2>=1)&&(i0.u12.r_1_2>=1))&&(i0.u13.p_1_3>=1)) * !(EX(!((i3.u0.r_0_0>=1))))))),TRUE) * ((i1.u6.p_0_6<1)||(i1.u7.r_0_7<1)))] != FALSE
(forward)formula 9,0,0.243095,15176,1,0,26552,26,786,24473,54,31,38167
FORMULA ResAllocation-PT-R010C002-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF((((i1.u6.r_0_6>=1)&&(i1.u16.r_1_6>=1))&&(i1.u17.p_1_7>=1))) + EX((EF(((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1))) * EG((i3.u0.r_0_0>=1)))))
=> equivalent forward existential formula: [FwdG((Init * !(EX((E(TRUE U ((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1))) * EG((i3.u0.r_0_0>=1)))))),!((((i1.u6.r_0_6>=1)&&(i1.u16.r_1_6>=1))&&(i1.u17.p_1_7>=1))))] = FALSE
(forward)formula 10,0,0.282323,17024,1,0,31791,26,811,28327,54,31,44925
FORMULA ResAllocation-PT-R010C002-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(((AF(((i2.u8.p_0_8>=1)&&(i2.u9.r_0_9>=1))) + ((i0.u3.p_0_3>=1)&&(i4.i0.u4.r_0_4>=1))) + ((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1)))) + EF((AX(((i2.u8.p_0_8>=1)&&(i2.u9.r_0_9>=1))) * EG(((i2.u8.p_0_8>=1)&&(i2.u9.r_0_9>=1))))))
=> equivalent forward existential formula: ((([(EY(Init) * !(EG(!(((i2.u8.p_0_8>=1)&&(i2.u9.r_0_9>=1))))))] != FALSE + [(EY(Init) * ((i0.u3.p_0_3>=1)&&(i4.i0.u4.r_0_4>=1)))] != FALSE) + [(EY(Init) * ((i0.u2.p_0_2>=1)&&(i0.u3.r_0_3>=1)))] != FALSE) + [FwdG((FwdU(Init,TRUE) * !(EX(!(((i2.u8.p_0_8>=1)&&(i2.u9.r_0_9>=1)))))),((i2.u8.p_0_8>=1)&&(i2.u9.r_0_9>=1)))] != FALSE)
(forward)formula 11,0,0.316024,18872,1,0,35957,26,845,31792,54,31,51368
FORMULA ResAllocation-PT-R010C002-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((AG((((i4.i0.u4.r_0_4>=1)&&(i4.i1.u14.r_1_4>=1))&&(i4.i1.u15.p_1_5>=1))) + ((((i0.u3.r_0_3<1)||(i0.u13.r_1_3<1))||(i4.i1.u14.p_1_4<1))&&((i2.u8.p_0_8<1)||(i2.u9.r_0_9<1)))) U EG(((i4.i0.u4.p_0_4>=1)&&(i4.i0.u5.r_0_5>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!(E(TRUE U !((((i4.i0.u4.r_0_4>=1)&&(i4.i1.u14.r_1_4>=1))&&(i4.i1.u15.p_1_5>=1))))) + ((((i0.u3.r_0_3<1)||(i0.u13.r_1_3<1))||(i4.i1.u14.p_1_4<1))&&((i2.u8.p_0_8<1)||(i2.u9.r_0_9<1))))),((i4.i0.u4.p_0_4>=1)&&(i4.i0.u5.r_0_5>=1)))] != FALSE
(forward)formula 12,0,0.333428,19400,1,0,37488,26,877,33269,54,31,53683
FORMULA ResAllocation-PT-R010C002-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (E(((((i2.u9.r_0_9>=1)&&(i2.u19.r_1_9>=1))&&(i2.u9.r_0_9>=1))&&(i2.u19.r_1_9>=1)) U (((i1.u7.r_0_7>=1)&&(i1.u17.r_1_7>=1))&&(i2.u18.p_1_8>=1))) + (AX((((((i2.u8.r_0_8>=1)&&(i2.u18.r_1_8>=1))&&(i2.u19.p_1_9>=1))&&(i0.u2.p_0_2>=1))&&(i0.u3.r_0_3>=1))) * EF((((i3.u1.r_0_1>=1)&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1)))))
=> equivalent forward existential formula: ([(EY((Init * !(E(((((i2.u9.r_0_9>=1)&&(i2.u19.r_1_9>=1))&&(i2.u9.r_0_9>=1))&&(i2.u19.r_1_9>=1)) U (((i1.u7.r_0_7>=1)&&(i1.u17.r_1_7>=1))&&(i2.u18.p_1_8>=1)))))) * !((((((i2.u8.r_0_8>=1)&&(i2.u18.r_1_8>=1))&&(i2.u19.p_1_9>=1))&&(i0.u2.p_0_2>=1))&&(i0.u3.r_0_3>=1))))] = FALSE * [((Init * !(E(((((i2.u9.r_0_9>=1)&&(i2.u19.r_1_9>=1))&&(i2.u9.r_0_9>=1))&&(i2.u19.r_1_9>=1)) U (((i1.u7.r_0_7>=1)&&(i1.u17.r_1_7>=1))&&(i2.u18.p_1_8>=1))))) * !(E(TRUE U (((i3.u1.r_0_1>=1)&&(i3.u11.r_1_1>=1))&&(i0.u12.p_1_2>=1)))))] = FALSE)
(forward)formula 13,0,0.341771,19664,1,0,38162,26,902,33887,56,31,54918
FORMULA ResAllocation-PT-R010C002-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590556220338

--------------------
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 -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-R010C002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R010C002, 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 r193-csrt-159033389200708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R010C002.tgz
mv ResAllocation-PT-R010C002 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;