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-158902545900244.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-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545900244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 2.8K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.0K 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.9K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 43K 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-10a-CTLFireability-00
FORMULA_NAME DES-PT-10a-CTLFireability-01
FORMULA_NAME DES-PT-10a-CTLFireability-02
FORMULA_NAME DES-PT-10a-CTLFireability-03
FORMULA_NAME DES-PT-10a-CTLFireability-04
FORMULA_NAME DES-PT-10a-CTLFireability-05
FORMULA_NAME DES-PT-10a-CTLFireability-06
FORMULA_NAME DES-PT-10a-CTLFireability-07
FORMULA_NAME DES-PT-10a-CTLFireability-08
FORMULA_NAME DES-PT-10a-CTLFireability-09
FORMULA_NAME DES-PT-10a-CTLFireability-10
FORMULA_NAME DES-PT-10a-CTLFireability-11
FORMULA_NAME DES-PT-10a-CTLFireability-12
FORMULA_NAME DES-PT-10a-CTLFireability-13
FORMULA_NAME DES-PT-10a-CTLFireability-14
FORMULA_NAME DES-PT-10a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589534755078

[2020-05-15 09:25:58] [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 09:25:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 09:25:58] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2020-05-15 09:25:58] [INFO ] Transformed 155 places.
[2020-05-15 09:25:58] [INFO ] Transformed 112 transitions.
[2020-05-15 09:25:58] [INFO ] Found NUPN structural information;
[2020-05-15 09:25:58] [INFO ] Parsed PT model containing 155 places and 112 transitions in 198 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 44 ms.
Incomplete random walk after 100000 steps, including 2240 resets, run finished after 678 ms. (steps per millisecond=147 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 98 rows 155 cols
[2020-05-15 09:25:59] [INFO ] Computed 59 place invariants in 25 ms
[2020-05-15 09:25:59] [INFO ] [Real]Absence check using 33 positive place invariants in 104 ms returned sat
[2020-05-15 09:26:00] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 39 ms returned sat
[2020-05-15 09:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:00] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2020-05-15 09:26:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 09:26:00] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 09:26:00] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 22 ms.
[2020-05-15 09:26:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:26:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 124 ms returned sat
[2020-05-15 09:26:01] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 154 ms returned sat
[2020-05-15 09:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:01] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2020-05-15 09:26:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 09:26:01] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 70 ms.
[2020-05-15 09:26:02] [INFO ] Added : 87 causal constraints over 18 iterations in 768 ms. Result :sat
[2020-05-15 09:26:02] [INFO ] Deduced a trap composed of 13 places in 99 ms
[2020-05-15 09:26:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2020-05-15 09:26:02] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2020-05-15 09:26:02] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 20 ms returned sat
[2020-05-15 09:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:02] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2020-05-15 09:26:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:26:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 52 ms returned sat
[2020-05-15 09:26:03] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 161 ms returned sat
[2020-05-15 09:26:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:03] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2020-05-15 09:26:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 09:26:03] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 33 ms.
[2020-05-15 09:26:04] [INFO ] Added : 90 causal constraints over 18 iterations in 567 ms. Result :sat
[2020-05-15 09:26:04] [INFO ] [Real]Absence check using 33 positive place invariants in 44 ms returned sat
[2020-05-15 09:26:04] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 51 ms returned sat
[2020-05-15 09:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:04] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2020-05-15 09:26:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:26:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 45 ms returned sat
[2020-05-15 09:26:05] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 231 ms returned sat
[2020-05-15 09:26:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:05] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2020-05-15 09:26:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 09:26:05] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 20 ms.
[2020-05-15 09:26:05] [INFO ] Added : 92 causal constraints over 19 iterations in 575 ms. Result :sat
[2020-05-15 09:26:06] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2020-05-15 09:26:06] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 21 ms returned sat
[2020-05-15 09:26:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:06] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2020-05-15 09:26:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:26:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2020-05-15 09:26:06] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 161 ms returned sat
[2020-05-15 09:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:06] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-05-15 09:26:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2020-05-15 09:26:06] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 15 ms.
[2020-05-15 09:26:07] [INFO ] Added : 83 causal constraints over 17 iterations in 486 ms. Result :sat
[2020-05-15 09:26:07] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2020-05-15 09:26:07] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 17 ms returned sat
[2020-05-15 09:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:07] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-05-15 09:26:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:26:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 55 ms returned sat
[2020-05-15 09:26:07] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 115 ms returned sat
[2020-05-15 09:26:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:08] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2020-05-15 09:26:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-15 09:26:08] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 43 ms.
[2020-05-15 09:26:09] [INFO ] Added : 75 causal constraints over 16 iterations in 787 ms. Result :sat
[2020-05-15 09:26:09] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned sat
[2020-05-15 09:26:09] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 22 ms returned sat
[2020-05-15 09:26:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:09] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-05-15 09:26:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:26:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2020-05-15 09:26:09] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 75 ms returned sat
[2020-05-15 09:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:09] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2020-05-15 09:26:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2020-05-15 09:26:09] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 50 ms.
[2020-05-15 09:26:10] [INFO ] Added : 72 causal constraints over 15 iterations in 546 ms. Result :sat
[2020-05-15 09:26:10] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2020-05-15 09:26:10] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 22 ms returned sat
[2020-05-15 09:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:10] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2020-05-15 09:26:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:26:11] [INFO ] [Nat]Absence check using 33 positive place invariants in 50 ms returned sat
[2020-05-15 09:26:11] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 124 ms returned sat
[2020-05-15 09:26:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:11] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2020-05-15 09:26:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-05-15 09:26:11] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 60 ms.
[2020-05-15 09:26:12] [INFO ] Added : 90 causal constraints over 19 iterations in 737 ms. Result :sat
[2020-05-15 09:26:12] [INFO ] Deduced a trap composed of 12 places in 55 ms
[2020-05-15 09:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2020-05-15 09:26:12] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2020-05-15 09:26:12] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 25 ms returned sat
[2020-05-15 09:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:12] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2020-05-15 09:26:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 09:26:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2020-05-15 09:26:12] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 45 ms returned sat
[2020-05-15 09:26:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 09:26:13] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2020-05-15 09:26:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 09:26:13] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 16 ms.
[2020-05-15 09:26:14] [INFO ] Added : 91 causal constraints over 19 iterations in 685 ms. Result :sat
[2020-05-15 09:26:14] [INFO ] [Real]Absence check using 33 positive place invariants in 60 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-15 09:26:14] [INFO ] Flatten gal took : 170 ms
[2020-05-15 09:26:14] [INFO ] Flatten gal took : 57 ms
[2020-05-15 09:26:14] [INFO ] Applying decomposition
[2020-05-15 09:26:14] [INFO ] Flatten gal took : 34 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/graph10382790701293088284.txt, -o, /tmp/graph10382790701293088284.bin, -w, /tmp/graph10382790701293088284.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/graph10382790701293088284.bin, -l, -1, -v, -w, /tmp/graph10382790701293088284.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 09:26:15] [INFO ] Decomposing Gal with order
[2020-05-15 09:26:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 09:26:15] [INFO ] Removed a total of 20 redundant transitions.
[2020-05-15 09:26:15] [INFO ] Flatten gal took : 153 ms
[2020-05-15 09:26:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 14 ms.
[2020-05-15 09:26:15] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 21 ms
[2020-05-15 09:26:15] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 5 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 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 19 ordering constraints for composite.
built 19 ordering constraints for composite.
built 15 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,1.60031e+12,2.23863,43072,5985,433,78949,2051,326,157766,143,7725,0


Converting to forward existential form...Done !
original formula: EG(E((((i4.u14.p6!=1)||(i4.u13.p73!=1))||(i4.u14.p75!=1)) U ((((i9.u18.p82==1)&&(i9.u26.p99==1))&&(i2.u2.p35==1))&&(i2.u2.p45==1))))
=> equivalent forward existential formula: [FwdG(Init,E((((i4.u14.p6!=1)||(i4.u13.p73!=1))||(i4.u14.p75!=1)) U ((((i9.u18.p82==1)&&(i9.u26.p99==1))&&(i2.u2.p35==1))&&(i2.u2.p45==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t67, t68, t101, u12.t50, u48.t5, u48.t21, i0.u0.t10, i0.u6.t110, i1.t109, i1.t99, i1.t0, i1.u1.t9, i2.u2.t8, i2.u2.t31, i2.u2.t35, i2.u2.t36, i2.u2.t37, i2.u2.t38, i2.u2.t39, i2.u2.t40, i4.t12, i13.t4, i13.t3, i13.i0.t79, i13.i0.u16.t76, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/26/88
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 14
(forward)formula 0,1,847.552,2436192,1,0,5.24149e+06,7400,686,1.31435e+07,388,38973,3127890
FORMULA DES-PT-10a-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((i6.u27.p100!=1)||(i6.u35.p116!=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i6.u27.p100!=1)||(i6.u35.p116!=1))))] = FALSE
(forward)formula 1,0,847.675,2436192,1,0,5.24149e+06,7400,695,1.31435e+07,389,38973,3131845
FORMULA DES-PT-10a-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AG(EF(((i13.i1.u3.p49==1)&&(i13.i1.u44.p134==1)))) + (AX(((i0.u6.p57==1)&&(i1.u7.p58==1))) * EG((i0.u0.p42==1))))
=> equivalent forward existential formula: ([(EY((Init * !(!(E(TRUE U !(E(TRUE U ((i13.i1.u3.p49==1)&&(i13.i1.u44.p134==1))))))))) * !(((i0.u6.p57==1)&&(i1.u7.p58==1))))] = FALSE * [((Init * !(!(E(TRUE U !(E(TRUE U ((i13.i1.u3.p49==1)&&(i13.i1.u44.p134==1)))))))) * !(EG((i0.u0.p42==1))))] = FALSE)
(forward)formula 2,0,1127.86,2680104,1,0,5.25431e+06,7400,855,1.54209e+07,432,38973,2869864
FORMULA DES-PT-10a-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2020-05-15 09:46:20] [INFO ] Applying decomposition
[2020-05-15 09:46:20] [INFO ] Flatten gal took : 47 ms
[2020-05-15 09:46:20] [INFO ] Decomposing Gal with order
[2020-05-15 09:46:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 09:46:20] [INFO ] Removed a total of 83 redundant transitions.
[2020-05-15 09:46:20] [INFO ] Flatten gal took : 63 ms
[2020-05-15 09:46:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 13 ms.
[2020-05-15 09:46:20] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 10 ms
[2020-05-15 09:46:20] [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 13 CTL formulae.
built 47 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 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,1.60031e+12,258.378,2580952,312072,88,7.26296e+06,408,270,4.97308e+06,63,1113,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2020-05-15 10:06:29] [INFO ] Flatten gal took : 638 ms
[2020-05-15 10:06:31] [INFO ] Input system was already deterministic with 98 transitions.
[2020-05-15 10:06:31] [INFO ] Transformed 155 places.
[2020-05-15 10:06:31] [INFO ] Transformed 98 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-15 10:06:31] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 6 ms
[2020-05-15 10:06:31] [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, --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 13 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,1.60031e+12,83.9963,1363108,2,1.48099e+06,5,5.97508e+06,6,0,717,5.56777e+06,0


Converting to forward existential form...Done !

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

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