Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r051-ebro-158902545900236.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545900236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.0K Mar 30 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 30 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 73K Mar 24 05:37 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 DES-PT-05b-CTLFireability-00
FORMULA_NAME DES-PT-05b-CTLFireability-01
FORMULA_NAME DES-PT-05b-CTLFireability-02
FORMULA_NAME DES-PT-05b-CTLFireability-03
FORMULA_NAME DES-PT-05b-CTLFireability-04
FORMULA_NAME DES-PT-05b-CTLFireability-05
FORMULA_NAME DES-PT-05b-CTLFireability-06
FORMULA_NAME DES-PT-05b-CTLFireability-07
FORMULA_NAME DES-PT-05b-CTLFireability-08
FORMULA_NAME DES-PT-05b-CTLFireability-09
FORMULA_NAME DES-PT-05b-CTLFireability-10
FORMULA_NAME DES-PT-05b-CTLFireability-11
FORMULA_NAME DES-PT-05b-CTLFireability-12
FORMULA_NAME DES-PT-05b-CTLFireability-13
FORMULA_NAME DES-PT-05b-CTLFireability-14
FORMULA_NAME DES-PT-05b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589532110719

[2020-05-15 08:41: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-15 08:41:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 08:41:54] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2020-05-15 08:41:54] [INFO ] Transformed 300 places.
[2020-05-15 08:41:54] [INFO ] Transformed 251 transitions.
[2020-05-15 08:41:54] [INFO ] Found NUPN structural information;
[2020-05-15 08:41:54] [INFO ] Parsed PT model containing 300 places and 251 transitions in 224 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 59 ms.
Incomplete random walk after 100000 steps, including 851 resets, run finished after 559 ms. (steps per millisecond=178 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 251 rows 300 cols
[2020-05-15 08:41:54] [INFO ] Computed 65 place invariants in 36 ms
[2020-05-15 08:41:55] [INFO ] [Real]Absence check using 40 positive place invariants in 54 ms returned unsat
[2020-05-15 08:41:55] [INFO ] [Real]Absence check using 40 positive place invariants in 42 ms returned sat
[2020-05-15 08:41:55] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 34 ms returned sat
[2020-05-15 08:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:41:55] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2020-05-15 08:41:56] [INFO ] Deduced a trap composed of 25 places in 205 ms
[2020-05-15 08:41:56] [INFO ] Deduced a trap composed of 15 places in 135 ms
[2020-05-15 08:41:56] [INFO ] Deduced a trap composed of 14 places in 122 ms
[2020-05-15 08:41:56] [INFO ] Deduced a trap composed of 17 places in 111 ms
[2020-05-15 08:41:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 759 ms
[2020-05-15 08:41:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:41:56] [INFO ] [Nat]Absence check using 40 positive place invariants in 72 ms returned sat
[2020-05-15 08:41:56] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 08:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:41:57] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2020-05-15 08:41:57] [INFO ] Deduced a trap composed of 9 places in 190 ms
[2020-05-15 08:41:57] [INFO ] Deduced a trap composed of 37 places in 136 ms
[2020-05-15 08:41:57] [INFO ] Deduced a trap composed of 24 places in 100 ms
[2020-05-15 08:41:58] [INFO ] Deduced a trap composed of 25 places in 123 ms
[2020-05-15 08:41:58] [INFO ] Deduced a trap composed of 21 places in 100 ms
[2020-05-15 08:41:58] [INFO ] Deduced a trap composed of 18 places in 97 ms
[2020-05-15 08:41:58] [INFO ] Deduced a trap composed of 15 places in 77 ms
[2020-05-15 08:41:58] [INFO ] Deduced a trap composed of 13 places in 109 ms
[2020-05-15 08:41:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1293 ms
[2020-05-15 08:41:58] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 32 ms.
[2020-05-15 08:42:01] [INFO ] Added : 244 causal constraints over 50 iterations in 2441 ms. Result :sat
[2020-05-15 08:42:01] [INFO ] [Real]Absence check using 40 positive place invariants in 63 ms returned sat
[2020-05-15 08:42:01] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 34 ms returned sat
[2020-05-15 08:42:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:42:01] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2020-05-15 08:42:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:42:01] [INFO ] [Nat]Absence check using 40 positive place invariants in 60 ms returned sat
[2020-05-15 08:42:01] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 29 ms returned sat
[2020-05-15 08:42:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:42:02] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2020-05-15 08:42:02] [INFO ] Deduced a trap composed of 16 places in 145 ms
[2020-05-15 08:42:02] [INFO ] Deduced a trap composed of 14 places in 116 ms
[2020-05-15 08:42:03] [INFO ] Deduced a trap composed of 10 places in 216 ms
[2020-05-15 08:42:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 626 ms
[2020-05-15 08:42:03] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 43 ms.
[2020-05-15 08:42:05] [INFO ] Added : 181 causal constraints over 37 iterations in 2051 ms. Result :sat
[2020-05-15 08:42:05] [INFO ] [Real]Absence check using 40 positive place invariants in 38 ms returned sat
[2020-05-15 08:42:05] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 24 ms returned sat
[2020-05-15 08:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:42:05] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2020-05-15 08:42:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:42:06] [INFO ] [Nat]Absence check using 40 positive place invariants in 107 ms returned sat
[2020-05-15 08:42:06] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 51 ms returned sat
[2020-05-15 08:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:42:07] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2020-05-15 08:42:07] [INFO ] Deduced a trap composed of 8 places in 126 ms
[2020-05-15 08:42:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2020-05-15 08:42:07] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 27 ms.
[2020-05-15 08:42:10] [INFO ] Added : 242 causal constraints over 49 iterations in 2505 ms. Result :sat
[2020-05-15 08:42:10] [INFO ] Deduced a trap composed of 28 places in 94 ms
[2020-05-15 08:42:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2020-05-15 08:42:10] [INFO ] [Real]Absence check using 40 positive place invariants in 39 ms returned sat
[2020-05-15 08:42:10] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 24 ms returned sat
[2020-05-15 08:42:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:42:10] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2020-05-15 08:42:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:42:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 81 ms returned sat
[2020-05-15 08:42:11] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 08:42:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:42:11] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2020-05-15 08:42:11] [INFO ] Deduced a trap composed of 13 places in 140 ms
[2020-05-15 08:42:12] [INFO ] Deduced a trap composed of 14 places in 118 ms
[2020-05-15 08:42:12] [INFO ] Deduced a trap composed of 17 places in 92 ms
[2020-05-15 08:42:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 471 ms
[2020-05-15 08:42:12] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 35 ms.
[2020-05-15 08:42:14] [INFO ] Added : 241 causal constraints over 49 iterations in 2216 ms. Result :sat
[2020-05-15 08:42:14] [INFO ] [Real]Absence check using 40 positive place invariants in 51 ms returned sat
[2020-05-15 08:42:14] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 08:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:42:15] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2020-05-15 08:42:15] [INFO ] Deduced a trap composed of 32 places in 225 ms
[2020-05-15 08:42:15] [INFO ] Deduced a trap composed of 31 places in 143 ms
[2020-05-15 08:42:15] [INFO ] Deduced a trap composed of 35 places in 136 ms
[2020-05-15 08:42:15] [INFO ] Deduced a trap composed of 31 places in 128 ms
[2020-05-15 08:42:16] [INFO ] Deduced a trap composed of 39 places in 120 ms
[2020-05-15 08:42:16] [INFO ] Deduced a trap composed of 8 places in 111 ms
[2020-05-15 08:42:16] [INFO ] Deduced a trap composed of 9 places in 97 ms
[2020-05-15 08:42:16] [INFO ] Deduced a trap composed of 10 places in 140 ms
[2020-05-15 08:42:16] [INFO ] Deduced a trap composed of 21 places in 97 ms
[2020-05-15 08:42:16] [INFO ] Deduced a trap composed of 12 places in 94 ms
[2020-05-15 08:42:16] [INFO ] Deduced a trap composed of 24 places in 108 ms
[2020-05-15 08:42:17] [INFO ] Deduced a trap composed of 13 places in 88 ms
[2020-05-15 08:42:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1889 ms
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-15 08:42:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 08:42:17] [INFO ] Flatten gal took : 197 ms
[2020-05-15 08:42:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 08:42:17] [INFO ] Flatten gal took : 53 ms
FORMULA DES-PT-05b-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 08:42:17] [INFO ] Applying decomposition
[2020-05-15 08:42:17] [INFO ] Flatten gal took : 49 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/graph4706484277133306900.txt, -o, /tmp/graph4706484277133306900.bin, -w, /tmp/graph4706484277133306900.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/graph4706484277133306900.bin, -l, -1, -v, -w, /tmp/graph4706484277133306900.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 08:42:18] [INFO ] Decomposing Gal with order
[2020-05-15 08:42:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 08:42:18] [INFO ] Removed a total of 31 redundant transitions.
[2020-05-15 08:42:18] [INFO ] Flatten gal took : 172 ms
[2020-05-15 08:42:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 23 ms.
[2020-05-15 08:42:18] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 21 ms
[2020-05-15 08:42:18] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 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 15 CTL formulae.
built 28 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 29 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 20 ordering constraints for composite.
built 22 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 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.61397e+20,3.408,64964,5765,317,127719,1991,713,239709,148,5665,0


Converting to forward existential form...Done !
original formula: !(EG((((i3.u5.p32!=1)||(i10.u76.p262==1))||((((((((((i6.u13.p62==1)||(i7.u43.p149==1))&&(i8.i0.i0.u54.p179==1))&&(i8.i0.i0.u54.p181==1))&&(i8.i1.i2.u61.p183==1))&&(i8.i1.i0.u62.p185==1))&&(i9.u52.p187==1))&&(i9.u55.p189==1))&&(i9.u51.p191==1))&&(i9.u50.p193==1)))))
=> equivalent forward existential formula: [FwdG(Init,(((i3.u5.p32!=1)||(i10.u76.p262==1))||((((((((((i6.u13.p62==1)||(i7.u43.p149==1))&&(i8.i0.i0.u54.p179==1))&&(i8.i0.i0.u54.p181==1))&&(i8.i1.i2.u61.p183==1))&&(i8.i1.i0.u62.p185==1))&&(i9.u52.p187==1))&&(i9.u55.p189==1))&&(i9.u51.p191==1))&&(i9.u50.p193==1))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,421.026,1744520,1,0,4.51331e+06,4196,2623,4.5995e+06,675,15463,2090568
FORMULA DES-PT-05b-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(EF((i8.i1.i0.u53.p175==1)) U EX((i8.i0.i1.u59.p202==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,E(TRUE U (i8.i1.i0.u53.p175==1)))) * (i8.i0.i1.u59.p202==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t56, t99, t154, i0.u41.t83, i1.t166, i1.u7.t162, i1.u7.t164, i1.u24.t112, i1.u27.t111, i1.u27.t117, i2.t160, i2.u9.t156, i2.u9.t158, i3.t121, i3.u20.t123, i4.t109, i4.u22.t118, i4.u29.t102, i5.u37.t90, i5.u37.t92, i5.u37.t94, i5.u37.t96, i5.u37.t98, i6.t141, i6.t139, i6.u11.t144, i6.u11.t146, i6.u11.t149, i6.u11.t151, i6.u11.t153, i7.u43.t80, i7.u45.t78, i8.t66, i8.i0.i0.u60.t67, i8.i0.i1.u59.t68, i8.i1.t58, i8.i1.t62, i8.i1.i0.u62.t63, i8.i1.i1.t60, i8.i1.i1.u63.t61, i8.i1.i2.t64, i8.i1.i2.u61.t65, i8.i1.i4.u64.t59, i9.t54, i9.u66.t55, i9.u67.t52, i9.u50.t76, i9.u65.t57, i10.u16.t133, i10.u16.t135, i10.u16.t137, i10.u75.t41, i10.u76.t33, i10.u76.t36, i10.u76.t38, i11.u18.t126, i11.u18.t128, i11.u18.t130, i11.u83.t23, i11.u83.t25, i11.u83.t27, i12.u86.t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/186/62/248
Detected timeout of ITS tools.
[2020-05-15 09:02:25] [INFO ] Applying decomposition
[2020-05-15 09:02:25] [INFO ] Flatten gal took : 49 ms
[2020-05-15 09:02:25] [INFO ] Decomposing Gal with order
[2020-05-15 09:02:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 09:02:26] [INFO ] Removed a total of 38 redundant transitions.
[2020-05-15 09:02:26] [INFO ] Flatten gal took : 115 ms
[2020-05-15 09:02:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 171 labels/synchronizations in 58 ms.
[2020-05-15 09:02:26] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 17 ms
[2020-05-15 09:02:26] [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], 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 2 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-15 09:22:36] [INFO ] Flatten gal took : 361 ms
[2020-05-15 09:22:36] [INFO ] Input system was already deterministic with 251 transitions.
[2020-05-15 09:22:37] [INFO ] Transformed 300 places.
[2020-05-15 09:22:37] [INFO ] Transformed 251 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
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-15 09:23:07] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 9 ms
[2020-05-15 09:23:07] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 7 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 14 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.61397e+20,65.7164,1065968,2,210663,5,4.41203e+06,6,0,1444,5.05381e+06,0


Converting to forward existential form...Done !
original formula: E(EF((p175==1)) U EX((p202==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,E(TRUE U (p175==1)))) * (p202==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t23, t25, t27, t33, t36, t38, t41, t52, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t76, t78, t80, t83, t90, t92, t94, t96, t98, t99, t102, t109, t111, t112, t117, t118, t121, t123, t126, t128, t130, t133, t135, t137, t139, t141, t144, t146, t149, t151, t153, t154, t156, t158, t160, t162, t164, t166, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/189/62/251

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="DES-PT-05b"
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 DES-PT-05b, 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 r051-ebro-158902545900236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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