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-159033389200732.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-R050C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200732
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 3.1K May 14 00:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 14 00:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 17:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 17:37 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.7K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 13 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:35 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 212K 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-R050C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R050C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590556251094

[2020-05-27 05:10:53] [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:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:53] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2020-05-27 05:10:53] [INFO ] Transformed 200 places.
[2020-05-27 05:10:53] [INFO ] Transformed 102 transitions.
[2020-05-27 05:10:53] [INFO ] Parsed PT model containing 200 places and 102 transitions in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 47 ms.
Incomplete random walk after 100000 steps, including 150 resets, run finished after 601 ms. (steps per millisecond=166 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 102 rows 200 cols
[2020-05-27 05:10:54] [INFO ] Computed 100 place invariants in 13 ms
[2020-05-27 05:10:55] [INFO ] [Real]Absence check using 100 positive place invariants in 73 ms returned sat
[2020-05-27 05:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:55] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2020-05-27 05:10:55] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 22 ms.
[2020-05-27 05:10:55] [INFO ] Added : 47 causal constraints over 10 iterations in 282 ms. Result :sat
[2020-05-27 05:10:55] [INFO ] [Real]Absence check using 100 positive place invariants in 126 ms returned sat
[2020-05-27 05:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:56] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2020-05-27 05:10:56] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 35 ms.
[2020-05-27 05:10:56] [INFO ] Added : 89 causal constraints over 18 iterations in 395 ms. Result :sat
[2020-05-27 05:10:56] [INFO ] [Real]Absence check using 100 positive place invariants in 48 ms returned sat
[2020-05-27 05:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:56] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-05-27 05:10:57] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 26 ms.
[2020-05-27 05:10:57] [INFO ] Added : 81 causal constraints over 17 iterations in 361 ms. Result :sat
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using 100 positive place invariants in 35 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:57] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2020-05-27 05:10:57] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-05-27 05:10:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2020-05-27 05:10:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 46 ms returned sat
[2020-05-27 05:10:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:57] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2020-05-27 05:10:58] [INFO ] Deduced a trap composed of 4 places in 147 ms
[2020-05-27 05:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 7 ms.
[2020-05-27 05:10:58] [INFO ] Added : 95 causal constraints over 19 iterations in 338 ms. Result :sat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 100 positive place invariants in 41 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 24 ms.
[2020-05-27 05:10:58] [INFO ] Added : 47 causal constraints over 10 iterations in 148 ms. Result :sat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 100 positive place invariants in 48 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2020-05-27 05:10:59] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 8 ms.
[2020-05-27 05:10:59] [INFO ] Added : 47 causal constraints over 10 iterations in 159 ms. Result :sat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 100 positive place invariants in 36 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2020-05-27 05:10:59] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 10 ms.
[2020-05-27 05:11:00] [INFO ] Added : 93 causal constraints over 19 iterations in 285 ms. Result :sat
[2020-05-27 05:11:00] [INFO ] [Real]Absence check using 100 positive place invariants in 41 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:00] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-05-27 05:11:00] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-05-27 05:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2020-05-27 05:11:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:11:00] [INFO ] [Nat]Absence check using 100 positive place invariants in 43 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:00] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2020-05-27 05:11:00] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2020-05-27 05:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2020-05-27 05:11:00] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 6 ms.
[2020-05-27 05:11:00] [INFO ] Added : 82 causal constraints over 17 iterations in 216 ms. Result :sat
[2020-05-27 05:11:01] [INFO ] [Real]Absence check using 100 positive place invariants in 28 ms returned sat
[2020-05-27 05:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:01] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-05-27 05:11:01] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-27 05:11:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2020-05-27 05:11:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:11:01] [INFO ] [Nat]Absence check using 100 positive place invariants in 34 ms returned sat
[2020-05-27 05:11:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:01] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2020-05-27 05:11:01] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-27 05:11:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2020-05-27 05:11:01] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 15 ms.
[2020-05-27 05:11:01] [INFO ] Added : 87 causal constraints over 18 iterations in 228 ms. Result :sat
[2020-05-27 05:11:01] [INFO ] [Real]Absence check using 100 positive place invariants in 81 ms returned sat
[2020-05-27 05:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:02] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2020-05-27 05:11:02] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-05-27 05:11:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 118 ms
[2020-05-27 05:11:02] [INFO ] [Real]Absence check using 100 positive place invariants in 104 ms returned sat
[2020-05-27 05:11:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:03] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-05-27 05:11:03] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-05-27 05:11:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2020-05-27 05:11:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:11:03] [INFO ] [Nat]Absence check using 100 positive place invariants in 28 ms returned sat
[2020-05-27 05:11:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:03] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-05-27 05:11:03] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-05-27 05:11:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2020-05-27 05:11:03] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 7 ms.
[2020-05-27 05:11:03] [INFO ] Added : 86 causal constraints over 18 iterations in 264 ms. Result :sat
[2020-05-27 05:11:03] [INFO ] [Real]Absence check using 100 positive place invariants in 31 ms returned sat
[2020-05-27 05:11:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:03] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-05-27 05:11:03] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 8 ms.
[2020-05-27 05:11:04] [INFO ] Added : 48 causal constraints over 10 iterations in 157 ms. Result :sat
[2020-05-27 05:11:04] [INFO ] [Real]Absence check using 100 positive place invariants in 106 ms returned sat
[2020-05-27 05:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:04] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-05-27 05:11:04] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-05-27 05:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2020-05-27 05:11:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:11:04] [INFO ] [Nat]Absence check using 100 positive place invariants in 37 ms returned sat
[2020-05-27 05:11:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:04] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2020-05-27 05:11:04] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-27 05:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2020-05-27 05:11:04] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints in 4 ms.
[2020-05-27 05:11:04] [INFO ] Added : 89 causal constraints over 18 iterations in 165 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-27 05:11:05] [INFO ] Flatten gal took : 108 ms
[2020-05-27 05:11:05] [INFO ] Flatten gal took : 25 ms
[2020-05-27 05:11:05] [INFO ] Applying decomposition
[2020-05-27 05:11:05] [INFO ] Flatten gal took : 26 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/graph14808408763641220521.txt, -o, /tmp/graph14808408763641220521.bin, -w, /tmp/graph14808408763641220521.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/graph14808408763641220521.bin, -l, -1, -v, -w, /tmp/graph14808408763641220521.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:11:05] [INFO ] Decomposing Gal with order
[2020-05-27 05:11:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:11:05] [INFO ] Flatten gal took : 75 ms
[2020-05-27 05:11:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-27 05:11:05] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 22 ms
[2020-05-27 05:11:05] [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 16 CTL formulae.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 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,2.92734e+16,0.143406,8632,127,7,10027,42,228,11194,13,52,0


Converting to forward existential form...Done !
original formula: E(!(AG((((i4.i0.u19.r_0_19>=1)&&(i4.i0.u69.r_1_19>=1))&&(i4.i0.u70.p_1_20>=1)))) U (((((i4.i1.u21.r_0_21>=1)&&(i4.i1.u71.r_1_21>=1))&&(i4.i1.u72.p_1_22>=1))||(((((i1.i0.u5.r_0_5>=1)&&(i1.i0.u55.r_1_5>=1))&&(i1.i1.u56.p_1_6>=1))&&(i2.i0.u8.p_0_8>=1))&&(i2.i0.u9.r_0_9>=1)))||(((((i4.i1.u22.p_0_22>=1)&&(i5.i0.u23.r_0_23>=1))&&(i2.i1.u12.r_0_12>=1))&&(i2.i1.u62.r_1_12>=1))&&(i3.i0.u63.p_1_13>=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(E(TRUE U !((((i4.i0.u19.r_0_19>=1)&&(i4.i0.u69.r_1_19>=1))&&(i4.i0.u70.p_1_20>=1))))))) * (((((i4.i1.u21.r_0_21>=1)&&(i4.i1.u71.r_1_21>=1))&&(i4.i1.u72.p_1_22>=1))||(((((i1.i0.u5.r_0_5>=1)&&(i1.i0.u55.r_1_5>=1))&&(i1.i1.u56.p_1_6>=1))&&(i2.i0.u8.p_0_8>=1))&&(i2.i0.u9.r_0_9>=1)))||(((((i4.i1.u22.p_0_22>=1)&&(i5.i0.u23.r_0_23>=1))&&(i2.i1.u12.r_0_12>=1))&&(i2.i1.u62.r_1_12>=1))&&(i3.i0.u63.p_1_13>=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.i1.t_1_0, i9.i1.u49.t_0_50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/2/102
(forward)formula 0,1,0.263782,10336,1,0,13731,42,1675,17109,51,52,21809
FORMULA ResAllocation-PT-R050C002-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AG(((i9.i1.u49.p_0_49>=1)||(((i5.i0.u23.r_0_23>=1)&&(i5.i0.u73.r_1_23>=1))&&(i5.i0.u74.p_1_24>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((i9.i1.u49.p_0_49>=1)||(((i5.i0.u23.r_0_23>=1)&&(i5.i0.u73.r_1_23>=1))&&(i5.i0.u74.p_1_24>=1)))))))] != FALSE
(forward)formula 1,0,0.265843,10600,1,0,13802,42,1695,17281,51,52,22089
FORMULA ResAllocation-PT-R050C002-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(AX((((((((i2.i1.u11.r_0_11>=1)&&(i2.i1.u61.r_1_11>=1))&&(i2.i1.u62.p_1_12>=1))&&(i2.i0.u9.r_0_9>=1))&&(i2.i0.u59.r_1_9>=1))&&(i2.i0.u60.p_1_10>=1))&&(((i9.i0.u45.p_0_45>=1)&&(i9.i0.u46.r_0_46>=1))||(((i8.i0.u41.r_0_41>=1)&&(i8.i0.u91.r_1_41>=1))&&(i8.i0.u92.p_1_42>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((((((i2.i1.u11.r_0_11>=1)&&(i2.i1.u61.r_1_11>=1))&&(i2.i1.u62.p_1_12>=1))&&(i2.i0.u9.r_0_9>=1))&&(i2.i0.u59.r_1_9>=1))&&(i2.i0.u60.p_1_10>=1))&&(((i9.i0.u45.p_0_45>=1)&&(i9.i0.u46.r_0_46>=1))||(((i8.i0.u41.r_0_41>=1)&&(i8.i0.u91.r_1_41>=1))&&(i8.i0.u92.p_1_42>=1)))))))))] = FALSE
(forward)formula 2,0,51.4716,566056,1,0,1.46931e+06,42,1849,894003,53,52,339167
FORMULA ResAllocation-PT-R050C002-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(((((i8.i1.u43.p_0_43>=1)&&(i8.i1.u44.r_0_44>=1))||(i3.i0.u15.p_0_15<1))||(i3.i1.u16.r_0_16<1))) * AF((((i5.i0.u24.r_0_24>=1)&&(i5.i0.u74.r_1_24>=1))&&(i5.i0.u75.p_1_25>=1))))
=> equivalent forward existential formula: ([FwdG(Init,!(((((i8.i1.u43.p_0_43>=1)&&(i8.i1.u44.r_0_44>=1))||(i3.i0.u15.p_0_15<1))||(i3.i1.u16.r_0_16<1))))] = FALSE * [FwdG(Init,!((((i5.i0.u24.r_0_24>=1)&&(i5.i0.u74.r_1_24>=1))&&(i5.i0.u75.p_1_25>=1))))] = FALSE)
(forward)formula 3,0,51.5333,568696,1,0,1.47548e+06,42,1881,902500,53,52,346762
FORMULA ResAllocation-PT-R050C002-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((((((i3.i0.u13.p_0_13>=1)&&(i3.i0.u14.r_0_14>=1))&&(i6.i1.u33.p_0_33>=1))&&(i6.i1.u34.r_0_34>=1))&&(((i6.i1.u35.r_0_35<1)||(i6.i1.u85.r_1_35<1))||(i7.i0.u86.p_1_36<1))))
=> equivalent forward existential formula: [FwdG(Init,!((((((i3.i0.u13.p_0_13>=1)&&(i3.i0.u14.r_0_14>=1))&&(i6.i1.u33.p_0_33>=1))&&(i6.i1.u34.r_0_34>=1))&&(((i6.i1.u35.r_0_35<1)||(i6.i1.u85.r_1_35<1))||(i7.i0.u86.p_1_36<1)))))] = FALSE
(forward)formula 4,0,57.0038,684592,1,0,1.65522e+06,42,1936,1.1574e+06,55,52,480260
FORMULA ResAllocation-PT-R050C002-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(AF(((i9.i0.u46.p_0_46>=1)&&(i9.i1.u47.r_0_47>=1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((i9.i0.u46.p_0_46>=1)&&(i9.i1.u47.r_0_47>=1))))] = FALSE
(forward)formula 5,0,57.0332,685912,1,0,1.65857e+06,42,1954,1.16086e+06,55,52,485244
FORMULA ResAllocation-PT-R050C002-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(AX(((i2.i0.u8.p_0_8>=1)&&(i2.i0.u9.r_0_9>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(((i2.i0.u8.p_0_8>=1)&&(i2.i0.u9.r_0_9>=1)))))))] = FALSE
(forward)formula 6,0,66.0894,776220,1,0,1.74639e+06,42,1961,1.30083e+06,55,52,626093
FORMULA ResAllocation-PT-R050C002-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((EF((((i6.i1.u34.r_0_34>=1)&&(i6.i1.u84.r_1_34>=1))&&(i6.i1.u85.p_1_35>=1))) * E((((i8.i0.u42.r_0_42>=1)&&(i8.i0.u92.r_1_42>=1))&&(i8.i1.u93.p_1_43>=1)) U (((i0.i0.u1.r_0_1>=1)&&(i0.i0.u51.r_1_1>=1))&&(i0.i0.u52.p_1_2>=1)))) * (((i3.i0.u13.r_0_13<1)||(i3.i0.u63.r_1_13<1))||(i3.i0.u64.p_1_14<1))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * (((i3.i0.u13.r_0_13<1)||(i3.i0.u63.r_1_13<1))||(i3.i0.u64.p_1_14<1))) * E(TRUE U (((i6.i1.u34.r_0_34>=1)&&(i6.i1.u84.r_1_34>=1))&&(i6.i1.u85.p_1_35>=1)))),(((i8.i0.u42.r_0_42>=1)&&(i8.i0.u92.r_1_42>=1))&&(i8.i1.u93.p_1_43>=1))) * (((i0.i0.u1.r_0_1>=1)&&(i0.i0.u51.r_1_1>=1))&&(i0.i0.u52.p_1_2>=1)))] != FALSE
(forward)formula 7,1,66.1196,777276,1,0,1.74858e+06,42,2014,1.30479e+06,55,52,632190
FORMULA ResAllocation-PT-R050C002-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2020-05-27 05:31:08] [INFO ] Flatten gal took : 10 ms
[2020-05-27 05:31:08] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 3 ms
[2020-05-27 05:31:08] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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, --gen-order, FOLLOW], 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 --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 8 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,2.92734e+16,0.238613,10808,2,544,5,30512,6,0,905,36129,0


Converting to forward existential form...Done !
original formula: E((AF((r_0_0>=1)) + (((((p_0_29>=1)&&(r_0_30>=1))&&(p_0_45>=1))&&(r_0_46>=1))&&((p_0_40<1)||(r_0_41<1)))) U ((p_0_35>=1)&&(r_0_36>=1)))
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!((r_0_0>=1)))) + (((((p_0_29>=1)&&(r_0_30>=1))&&(p_0_45>=1))&&(r_0_46>=1))&&((p_0_40<1)||(r_0_41<1))))) * ((p_0_35>=1)&&(r_0_36>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t_0_50, t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/2/102
Detected timeout of ITS tools.
[2020-05-27 05:51:12] [INFO ] Flatten gal took : 23 ms
[2020-05-27 05:51:12] [INFO ] Input system was already deterministic with 102 transitions.
[2020-05-27 05:51:12] [INFO ] Transformed 200 places.
[2020-05-27 05:51:12] [INFO ] Transformed 102 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-27 05:51:12] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
[2020-05-27 05:51:12] [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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 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,2.92734e+16,0.198039,11384,2,832,5,31043,6,0,905,37355,0


Converting to forward existential form...Done !
original formula: E((AF((r_0_0>=1)) + (((((p_0_29>=1)&&(r_0_30>=1))&&(p_0_45>=1))&&(r_0_46>=1))&&((p_0_40<1)||(r_0_41<1)))) U ((p_0_35>=1)&&(r_0_36>=1)))
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!((r_0_0>=1)))) + (((((p_0_29>=1)&&(r_0_30>=1))&&(p_0_45>=1))&&(r_0_46>=1))&&((p_0_40<1)||(r_0_41<1))))) * ((p_0_35>=1)&&(r_0_36>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t50, t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/2/102

BK_TIME_CONFINEMENT_REACHED

--------------------
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-R050C002"
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-R050C002, 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-159033389200732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R050C002.tgz
mv ResAllocation-PT-R050C002 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 ;