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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 08:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 08:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 37K 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-05a-CTLFireability-00
FORMULA_NAME DES-PT-05a-CTLFireability-01
FORMULA_NAME DES-PT-05a-CTLFireability-02
FORMULA_NAME DES-PT-05a-CTLFireability-03
FORMULA_NAME DES-PT-05a-CTLFireability-04
FORMULA_NAME DES-PT-05a-CTLFireability-05
FORMULA_NAME DES-PT-05a-CTLFireability-06
FORMULA_NAME DES-PT-05a-CTLFireability-07
FORMULA_NAME DES-PT-05a-CTLFireability-08
FORMULA_NAME DES-PT-05a-CTLFireability-09
FORMULA_NAME DES-PT-05a-CTLFireability-10
FORMULA_NAME DES-PT-05a-CTLFireability-11
FORMULA_NAME DES-PT-05a-CTLFireability-12
FORMULA_NAME DES-PT-05a-CTLFireability-13
FORMULA_NAME DES-PT-05a-CTLFireability-14
FORMULA_NAME DES-PT-05a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589531433830

[2020-05-15 08:30:37] [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:30:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 08:30:37] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2020-05-15 08:30:37] [INFO ] Transformed 135 places.
[2020-05-15 08:30:37] [INFO ] Transformed 92 transitions.
[2020-05-15 08:30:37] [INFO ] Found NUPN structural information;
[2020-05-15 08:30:37] [INFO ] Parsed PT model containing 135 places and 92 transitions in 200 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 38 ms.
Incomplete random walk after 100000 steps, including 2224 resets, run finished after 567 ms. (steps per millisecond=176 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 78 rows 135 cols
[2020-05-15 08:30:37] [INFO ] Computed 59 place invariants in 27 ms
[2020-05-15 08:30:38] [INFO ] [Real]Absence check using 33 positive place invariants in 79 ms returned sat
[2020-05-15 08:30:38] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 29 ms returned sat
[2020-05-15 08:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:38] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2020-05-15 08:30:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:30:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 44 ms returned sat
[2020-05-15 08:30:38] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 76 ms returned sat
[2020-05-15 08:30:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:38] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2020-05-15 08:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 08:30:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2020-05-15 08:30:39] [INFO ] Computed and/alt/rep : 77/274/77 causal constraints in 47 ms.
[2020-05-15 08:30:39] [INFO ] Added : 64 causal constraints over 14 iterations in 509 ms. Result :sat
[2020-05-15 08:30:39] [INFO ] [Real]Absence check using 33 positive place invariants in 54 ms returned sat
[2020-05-15 08:30:39] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 31 ms returned sat
[2020-05-15 08:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:39] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2020-05-15 08:30:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:30:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2020-05-15 08:30:40] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 41 ms returned sat
[2020-05-15 08:30:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:40] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2020-05-15 08:30:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-05-15 08:30:40] [INFO ] Computed and/alt/rep : 77/274/77 causal constraints in 40 ms.
[2020-05-15 08:30:40] [INFO ] Added : 75 causal constraints over 16 iterations in 473 ms. Result :sat
[2020-05-15 08:30:40] [INFO ] Deduced a trap composed of 15 places in 120 ms
[2020-05-15 08:30:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2020-05-15 08:30:40] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2020-05-15 08:30:41] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 54 ms returned sat
[2020-05-15 08:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:41] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-05-15 08:30:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:30:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 24 ms returned sat
[2020-05-15 08:30:41] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 24 ms returned sat
[2020-05-15 08:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:41] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2020-05-15 08:30:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-05-15 08:30:41] [INFO ] Computed and/alt/rep : 77/274/77 causal constraints in 16 ms.
[2020-05-15 08:30:42] [INFO ] Added : 66 causal constraints over 14 iterations in 422 ms. Result :unsat
[2020-05-15 08:30:42] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2020-05-15 08:30:42] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 20 ms returned sat
[2020-05-15 08:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:42] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-05-15 08:30:42] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-15 08:30:42] [INFO ] Deduced a trap composed of 9 places in 41 ms
[2020-05-15 08:30:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2020-05-15 08:30:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:30:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2020-05-15 08:30:42] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 89 ms returned sat
[2020-05-15 08:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:42] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2020-05-15 08:30:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 08:30:42] [INFO ] Computed and/alt/rep : 77/274/77 causal constraints in 42 ms.
[2020-05-15 08:30:43] [INFO ] Added : 69 causal constraints over 15 iterations in 584 ms. Result :sat
[2020-05-15 08:30:43] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned unsat
[2020-05-15 08:30:43] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2020-05-15 08:30:43] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 20 ms returned sat
[2020-05-15 08:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:43] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-05-15 08:30:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:30:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2020-05-15 08:30:43] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 54 ms returned sat
[2020-05-15 08:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:44] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2020-05-15 08:30:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-15 08:30:44] [INFO ] Computed and/alt/rep : 77/274/77 causal constraints in 14 ms.
[2020-05-15 08:30:44] [INFO ] Added : 74 causal constraints over 15 iterations in 435 ms. Result :sat
[2020-05-15 08:30:44] [INFO ] Deduced a trap composed of 12 places in 55 ms
[2020-05-15 08:30:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2020-05-15 08:30:44] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2020-05-15 08:30:44] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 24 ms returned sat
[2020-05-15 08:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:44] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-05-15 08:30:44] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 08:30:44] [INFO ] Computed and/alt/rep : 77/274/77 causal constraints in 11 ms.
[2020-05-15 08:30:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:30:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 46 ms returned sat
[2020-05-15 08:30:45] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 47 ms returned sat
[2020-05-15 08:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:45] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2020-05-15 08:30:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-05-15 08:30:45] [INFO ] Computed and/alt/rep : 77/274/77 causal constraints in 34 ms.
[2020-05-15 08:30:45] [INFO ] Added : 25 causal constraints over 5 iterations in 109 ms. Result :unsat
[2020-05-15 08:30:45] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2020-05-15 08:30:45] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 19 ms returned sat
[2020-05-15 08:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:45] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-05-15 08:30:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 08:30:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 20 ms returned sat
[2020-05-15 08:30:45] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 34 ms returned sat
[2020-05-15 08:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 08:30:45] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2020-05-15 08:30:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-05-15 08:30:46] [INFO ] Computed and/alt/rep : 77/274/77 causal constraints in 11 ms.
[2020-05-15 08:30:46] [INFO ] Added : 75 causal constraints over 16 iterations in 281 ms. Result :sat
[2020-05-15 08:30:46] [INFO ] Deduced a trap composed of 15 places in 74 ms
[2020-05-15 08:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-15 08:30:46] [INFO ] Flatten gal took : 96 ms
[2020-05-15 08:30:46] [INFO ] Flatten gal took : 33 ms
[2020-05-15 08:30:46] [INFO ] Applying decomposition
[2020-05-15 08:30:46] [INFO ] Flatten gal took : 27 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/graph8662976066167247358.txt, -o, /tmp/graph8662976066167247358.bin, -w, /tmp/graph8662976066167247358.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/graph8662976066167247358.bin, -l, -1, -v, -w, /tmp/graph8662976066167247358.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 08:30:47] [INFO ] Decomposing Gal with order
[2020-05-15 08:30:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 08:30:47] [INFO ] Removed a total of 16 redundant transitions.
[2020-05-15 08:30:47] [INFO ] Flatten gal took : 78 ms
[2020-05-15 08:30:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 13 ms.
[2020-05-15 08:30:47] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 12 ms
[2020-05-15 08:30:47] [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 16 CTL formulae.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 18 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 16 ordering constraints for composite.
built 18 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.30998e+11,0.285485,11920,1292,210,19295,975,277,18800,102,2830,0


Converting to forward existential form...Done !
original formula: E(EF(((i13.u4.p31!=1)||(i13.u47.p125!=1))) U ((((u14.p1==1)&&(u14.p53==1))&&(u14.p55==1))&&((((((((((((i13.u46.p123==1)&&(i13.u47.p129==1))&&(i13.u15.p56==1))&&(i8.u17.p61==1))&&(i4.u18.p63==1))&&(i9.u19.p65==1))&&(i5.u20.p67==1))&&(i6.u21.p69==1))&&(i10.u22.p71==1))&&(i7.u23.p73==1))&&(i11.u24.p75==1))||(((i13.u4.p31==1)&&(i13.u47.p125==1))&&(i12.u3.p0==1)))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((i13.u4.p31!=1)||(i13.u47.p125!=1)))) * ((((u14.p1==1)&&(u14.p53==1))&&(u14.p55==1))&&((((((((((((i13.u46.p123==1)&&(i13.u47.p129==1))&&(i13.u15.p56==1))&&(i8.u17.p61==1))&&(i4.u18.p63==1))&&(i9.u19.p65==1))&&(i5.u20.p67==1))&&(i6.u21.p69==1))&&(i10.u22.p71==1))&&(i7.u23.p73==1))&&(i11.u24.p75==1))||(((i13.u4.p31==1)&&(i13.u47.p125==1))&&(i12.u3.p0==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t47, t48, u14.t11, u48.t5, u48.t16, i0.t89, i0.t79, i0.t0, i0.u1.t9, i1.t81, i1.u0.t10, i1.u6.t90, i1.u13.t30, i2.u2.t8, i2.u2.t21, i2.u2.t25, i13.t59, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/55/20/75
(forward)formula 0,1,1.22748,36592,1,0,84702,2530,1796,85771,752,9756,126244
FORMULA DES-PT-05a-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((A((((u14.p2!=1)||(u14.p53!=1))||(u14.p55!=1)) U ((i12.u42.p110==1)&&(i12.u43.p113==1))) * AX(((i13.u46.p123==1)&&(i13.u47.p129==1)))) + (AF(AX(((i11.u24.p74==1)&&(i11.u32.p91==1)))) * EF((((i0.u5.p33!=1)||(i0.u9.p43!=1))||(i0.u10.p45!=1)))))
=> equivalent forward existential formula: ([FwdG((Init * !((!((E(!(((i12.u42.p110==1)&&(i12.u43.p113==1))) U (!((((u14.p2!=1)||(u14.p53!=1))||(u14.p55!=1))) * !(((i12.u42.p110==1)&&(i12.u43.p113==1))))) + EG(!(((i12.u42.p110==1)&&(i12.u43.p113==1)))))) * !(EX(!(((i13.u46.p123==1)&&(i13.u47.p129==1)))))))),!(!(EX(!(((i11.u24.p74==1)&&(i11.u32.p91==1)))))))] = FALSE * [((Init * !((!((E(!(((i12.u42.p110==1)&&(i12.u43.p113==1))) U (!((((u14.p2!=1)||(u14.p53!=1))||(u14.p55!=1))) * !(((i12.u42.p110==1)&&(i12.u43.p113==1))))) + EG(!(((i12.u42.p110==1)&&(i12.u43.p113==1)))))) * !(EX(!(((i13.u46.p123==1)&&(i13.u47.p129==1)))))))) * !(E(TRUE U (((i0.u5.p33!=1)||(i0.u9.p43!=1))||(i0.u10.p45!=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
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 1,0,51.6,1100864,1,0,2.99674e+06,4120,1973,2.52346e+06,769,32073,2533104
FORMULA DES-PT-05a-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(((i12.u42.p110==1)&&(i12.u43.p113==1))) + AG(((i0.u1.p24==1)&&(i0.u10.p44==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!(((i12.u42.p110==1)&&(i12.u43.p113==1))))))),TRUE) * !(((i0.u1.p24==1)&&(i0.u10.p44==1))))] = FALSE
(forward)formula 2,1,51.6187,1101392,1,0,2.99741e+06,4120,1981,2.52413e+06,769,32073,2533999
FORMULA DES-PT-05a-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((AG((((i0.u7.p42==1)&&(i1.u11.p47==1))&&(i2.u12.p49==1))) + AX(((i13.u46.p123==1)&&(i13.u47.p129==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((((i0.u7.p42==1)&&(i1.u11.p47==1))&&(i2.u12.p49==1))))))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(((i13.u46.p123==1)&&(i13.u47.p129==1))))))] != FALSE)
(forward)formula 3,1,51.6712,1101920,1,0,2.99816e+06,4120,1989,2.52456e+06,769,32073,2536495
FORMULA DES-PT-05a-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((u14.p52==1)&&(i12.u44.p115==1))||((i2.u2.p18==1)&&(i2.u2.p25==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((u14.p52==1)&&(i12.u44.p115==1))||((i2.u2.p18==1)&&(i2.u2.p25==1))))] != FALSE
(forward)formula 4,1,51.7005,1101920,1,0,2.99824e+06,4120,2006,2.52516e+06,773,32073,2537556
FORMULA DES-PT-05a-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(EF(((((i7.u31.p88==1)&&(i7.u39.p104==1))&&(i1.u13.p13==1))&&(i1.u13.p50==1))) U AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((((i7.u31.p88==1)&&(i7.u39.p104==1))&&(i1.u13.p13==1))&&(i1.u13.p50==1)))) * !(EX(!(FALSE))))] != FALSE
(forward)formula 5,1,84.1308,1642672,1,0,4.4562e+06,4131,2031,3.94179e+06,776,32422,3806286
FORMULA DES-PT-05a-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(A(((((i7.u31.p88==1)&&(i7.u39.p104==1))&&(i2.u2.p20==1))&&(i2.u2.p25==1)) U ((i0.u7.p39!=1)||(i0.u8.p41!=1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!(((i0.u7.p39!=1)||(i0.u8.p41!=1)))) * (!(((((i7.u31.p88==1)&&(i7.u39.p104==1))&&(i2.u2.p20==1))&&(i2.u2.p25==1))) * !(((i0.u7.p39!=1)||(i0.u8.p41!=1)))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(((i0.u7.p39!=1)||(i0.u8.p41!=1))))] = FALSE)
(forward)formula 6,0,92.3414,1816120,1,0,4.9714e+06,4143,2100,4.21366e+06,778,32523,4182889
FORMULA DES-PT-05a-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(((i1.u13.p12==1)&&(i1.u13.p50==1))) + EF(EG(((i2.u2.p19!=1)||(i2.u2.p25!=1)))))
=> equivalent forward existential formula: ([(EY(Init) * ((i1.u13.p12==1)&&(i1.u13.p50==1)))] != FALSE + [FwdG(FwdU(Init,TRUE),((i2.u2.p19!=1)||(i2.u2.p25!=1)))] != FALSE)
(forward)formula 7,1,95.5573,1875784,1,0,5.1261e+06,4143,2152,4.30282e+06,783,32579,4318039
FORMULA DES-PT-05a-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AF((((u14.p1==1)&&(u14.p53==1))&&(u14.p55==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((((u14.p1==1)&&(u14.p53==1))&&(u14.p55==1))))] = FALSE
(forward)formula 8,0,95.6102,1876840,1,0,5.12897e+06,4143,2166,4.30471e+06,785,32593,4323578
FORMULA DES-PT-05a-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(EG(((i4.u26.p78!=1)||(i4.u34.p94!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((i4.u26.p78!=1)||(i4.u34.p94!=1)))))] = FALSE
(forward)formula 9,1,142.852,2198784,1,0,5.93757e+06,4210,614,5.00658e+06,277,34080,384483
FORMULA DES-PT-05a-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(A(((((((((i8.u33.p93!=1)||(i4.u34.p95!=1))||(i9.u35.p97!=1))||(i5.u36.p99!=1))||(i6.u37.p101!=1))||(i10.u38.p103!=1))||(i7.u39.p105!=1))||(i11.u40.p107!=1)) U ((i9.u19.p64!=1)||(i9.u27.p81!=1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((i9.u19.p64!=1)||(i9.u27.p81!=1))) U (!(((((((((i8.u33.p93!=1)||(i4.u34.p95!=1))||(i9.u35.p97!=1))||(i5.u36.p99!=1))||(i6.u37.p101!=1))||(i10.u38.p103!=1))||(i7.u39.p105!=1))||(i11.u40.p107!=1))) * !(((i9.u19.p64!=1)||(i9.u27.p81!=1))))) + EG(!(((i9.u19.p64!=1)||(i9.u27.p81!=1)))))))] != FALSE
(forward)formula 10,1,151.653,2198784,1,0,5.93757e+06,4210,926,5.00658e+06,330,34080,897052
FORMULA DES-PT-05a-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((((AF((((u14.p2==1)&&(u14.p53==1))&&(u14.p55==1))) + (u14.p52!=1)) + (i12.u44.p115!=1)) + (i13.u16.p58!=1)) + (i13.u47.p128!=1)) U E(((i12.u3.p29==1)&&(i12.u44.p114==1)) U ((i0.u41.p109==1)&&(i12.u42.p111==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(((i12.u3.p29==1)&&(i12.u44.p114==1)) U ((i0.u41.p109==1)&&(i12.u42.p111==1))))))) * !(E(!(E(((i12.u3.p29==1)&&(i12.u44.p114==1)) U ((i0.u41.p109==1)&&(i12.u42.p111==1)))) U (!(((((!(EG(!((((u14.p2==1)&&(u14.p53==1))&&(u14.p55==1))))) + (u14.p52!=1)) + (i12.u44.p115!=1)) + (i13.u16.p58!=1)) + (i13.u47.p128!=1))) * !(E(((i12.u3.p29==1)&&(i12.u44.p114==1)) U ((i0.u41.p109==1)&&(i12.u42.p111==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
(forward)formula 11,0,232.603,2300156,1,0,5.96884e+06,4210,1094,5.60531e+06,351,34080,4331563
FORMULA DES-PT-05a-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EF((((i8.u17.p60==1)&&(i8.u25.p77==1))||((i13.u4.p31==1)&&(i13.u47.p125==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((i8.u17.p60==1)&&(i8.u25.p77==1))||((i13.u4.p31==1)&&(i13.u47.p125==1)))))] != FALSE
(forward)formula 12,1,278.018,2421596,1,0,6.30299e+06,4210,605,5.92902e+06,265,34080,1343099
FORMULA DES-PT-05a-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((i12.u43.p112==1)&&(i12.u43.p117==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i12.u43.p112==1)&&(i12.u43.p117==1)))] != FALSE
(forward)formula 13,1,278.025,2421596,1,0,6.30299e+06,4210,617,5.92902e+06,269,34080,1343394
FORMULA DES-PT-05a-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(EF(((i11.u24.p74!=1)||(i11.u32.p91!=1))) U EF(((((i0.u9.p43==1)&&(i0.u10.p45==1))&&(i0.u41.p109==1))&&(i12.u42.p111==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((((i0.u9.p43==1)&&(i0.u10.p45==1))&&(i0.u41.p109==1))&&(i12.u42.p111==1))))))) * !(E(!(E(TRUE U ((((i0.u9.p43==1)&&(i0.u10.p45==1))&&(i0.u41.p109==1))&&(i12.u42.p111==1)))) U (!(E(TRUE U ((i11.u24.p74!=1)||(i11.u32.p91!=1)))) * !(E(TRUE U ((((i0.u9.p43==1)&&(i0.u10.p45==1))&&(i0.u41.p109==1))&&(i12.u42.p111==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
(forward)formula 14,1,351.487,2421596,1,0,6.30299e+06,4210,1014,5.92902e+06,342,34080,3959695
FORMULA DES-PT-05a-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(AX(((((i12.u3.p29==1)&&(i12.u44.p114==1))&&(i5.u20.p66==1))&&(i5.u28.p83==1)))) * AF(AG(((((i0.u7.p42==1)&&(i1.u11.p47==1))&&(i2.u12.p49==1))||(((i13.u15.p57==1)&&(i13.u16.p59==1))&&(i12.u44.p116==1))))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(((((i12.u3.p29==1)&&(i12.u44.p114==1))&&(i5.u20.p66==1))&&(i5.u28.p83==1)))))))] = FALSE * [FwdG(Init,!(!(E(TRUE U !(((((i0.u7.p42==1)&&(i1.u11.p47==1))&&(i2.u12.p49==1))||(((i13.u15.p57==1)&&(i13.u16.p59==1))&&(i12.u44.p116==1))))))))] = FALSE)
(forward)formula 15,0,352.025,2421596,1,0,6.30299e+06,4210,1245,5.92902e+06,366,34080,3995688
FORMULA DES-PT-05a-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1589531800882

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

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