Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699100476.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 2.9K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 79K 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 BusinessProcesses-PT-04-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-04-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589250550086

[2020-05-12 02:29:14] [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-12 02:29:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:29:14] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2020-05-12 02:29:14] [INFO ] Transformed 288 places.
[2020-05-12 02:29:14] [INFO ] Transformed 283 transitions.
[2020-05-12 02:29:14] [INFO ] Found NUPN structural information;
[2020-05-12 02:29:14] [INFO ] Parsed PT model containing 288 places and 283 transitions in 224 ms.
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 2 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 61 ms.
Incomplete random walk after 100000 steps, including 1117 resets, run finished after 385 ms. (steps per millisecond=259 ) properties seen :[0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 281 rows 286 cols
[2020-05-12 02:29:15] [INFO ] Computed 44 place invariants in 19 ms
[2020-05-12 02:29:15] [INFO ] [Real]Absence check using 21 positive place invariants in 51 ms returned unsat
[2020-05-12 02:29:15] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2020-05-12 02:29:15] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 7 ms returned unsat
[2020-05-12 02:29:15] [INFO ] [Real]Absence check using 21 positive place invariants in 109 ms returned sat
[2020-05-12 02:29:15] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 148 ms returned sat
[2020-05-12 02:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:29:17] [INFO ] [Real]Absence check using state equation in 1363 ms returned unsat
[2020-05-12 02:29:17] [INFO ] [Real]Absence check using 21 positive place invariants in 107 ms returned sat
[2020-05-12 02:29:17] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 162 ms returned sat
[2020-05-12 02:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:29:17] [INFO ] [Real]Absence check using state equation in 270 ms returned unsat
[2020-05-12 02:29:18] [INFO ] [Real]Absence check using 21 positive place invariants in 128 ms returned sat
[2020-05-12 02:29:18] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 14 ms returned sat
[2020-05-12 02:29:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:29:18] [INFO ] [Real]Absence check using state equation in 382 ms returned unsat
[2020-05-12 02:29:18] [INFO ] [Real]Absence check using 21 positive place invariants in 43 ms returned sat
[2020-05-12 02:29:18] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 30 ms returned sat
[2020-05-12 02:29:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:29:18] [INFO ] [Real]Absence check using state equation in 347 ms returned unsat
[2020-05-12 02:29:19] [INFO ] [Real]Absence check using 21 positive place invariants in 54 ms returned unsat
[2020-05-12 02:29:19] [INFO ] [Real]Absence check using 21 positive place invariants in 112 ms returned sat
[2020-05-12 02:29:19] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 159 ms returned sat
[2020-05-12 02:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:29:19] [INFO ] [Real]Absence check using state equation in 549 ms returned unsat
[2020-05-12 02:29:20] [INFO ] [Real]Absence check using 21 positive place invariants in 22 ms returned sat
[2020-05-12 02:29:20] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 20 ms returned sat
[2020-05-12 02:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:29:20] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2020-05-12 02:29:20] [INFO ] Deduced a trap composed of 8 places in 322 ms
[2020-05-12 02:29:22] [INFO ] Deduced a trap composed of 24 places in 1776 ms
[2020-05-12 02:29:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2181 ms
[2020-05-12 02:29:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:29:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 263 ms returned sat
[2020-05-12 02:29:23] [INFO ] [Nat]Absence check using 21 positive and 23 generalized place invariants in 177 ms returned sat
[2020-05-12 02:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:29:24] [INFO ] [Nat]Absence check using state equation in 1183 ms returned sat
[2020-05-12 02:29:24] [INFO ] Deduced a trap composed of 8 places in 157 ms
[2020-05-12 02:29:25] [INFO ] Deduced a trap composed of 24 places in 709 ms
[2020-05-12 02:29:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 971 ms
[2020-05-12 02:29:25] [INFO ] Computed and/alt/rep : 280/922/280 causal constraints in 22 ms.
[2020-05-12 02:29:26] [INFO ] Added : 78 causal constraints over 17 iterations in 723 ms. Result :sat
[2020-05-12 02:29:26] [INFO ] Deduced a trap composed of 57 places in 119 ms
[2020-05-12 02:29:26] [INFO ] Deduced a trap composed of 60 places in 175 ms
[2020-05-12 02:29:26] [INFO ] Deduced a trap composed of 62 places in 166 ms
[2020-05-12 02:29:26] [INFO ] Deduced a trap composed of 65 places in 150 ms
[2020-05-12 02:29:27] [INFO ] Deduced a trap composed of 66 places in 91 ms
[2020-05-12 02:29:27] [INFO ] Deduced a trap composed of 65 places in 100 ms
[2020-05-12 02:29:27] [INFO ] Deduced a trap composed of 64 places in 102 ms
[2020-05-12 02:29:27] [INFO ] Deduced a trap composed of 66 places in 99 ms
[2020-05-12 02:29:28] [INFO ] Deduced a trap composed of 57 places in 611 ms
[2020-05-12 02:29:28] [INFO ] Deduced a trap composed of 67 places in 677 ms
[2020-05-12 02:29:29] [INFO ] Deduced a trap composed of 60 places in 890 ms
[2020-05-12 02:29:30] [INFO ] Deduced a trap composed of 76 places in 219 ms
[2020-05-12 02:29:30] [INFO ] Deduced a trap composed of 73 places in 151 ms
[2020-05-12 02:29:30] [INFO ] Deduced a trap composed of 68 places in 110 ms
[2020-05-12 02:29:31] [INFO ] Deduced a trap composed of 72 places in 478 ms
[2020-05-12 02:29:31] [INFO ] Deduced a trap composed of 73 places in 140 ms
[2020-05-12 02:29:31] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5031 ms
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2020-05-12 02:29:31] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 02:29:31] [INFO ] Flatten gal took : 121 ms
[2020-05-12 02:29:31] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 02:29:31] [INFO ] Flatten gal took : 28 ms
FORMULA BusinessProcesses-PT-04-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-04-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:29:31] [INFO ] Applying decomposition
[2020-05-12 02:29:31] [INFO ] Flatten gal took : 30 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/graph13474713947874661910.txt, -o, /tmp/graph13474713947874661910.bin, -w, /tmp/graph13474713947874661910.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/graph13474713947874661910.bin, -l, -1, -v, -w, /tmp/graph13474713947874661910.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:29:31] [INFO ] Decomposing Gal with order
[2020-05-12 02:29:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:29:32] [INFO ] Removed a total of 242 redundant transitions.
[2020-05-12 02:29:32] [INFO ] Flatten gal took : 179 ms
[2020-05-12 02:29:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2020-05-12 02:29:32] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 7 ms
[2020-05-12 02:29:32] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 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 10 CTL formulae.
built 37 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 18 ordering constraints for composite.
built 14 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 33 ordering constraints for composite.
built 5 ordering constraints for composite.
built 24 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 40 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 29 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 34 ordering constraints for composite.
built 7 ordering constraints for composite.
built 27 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,2.19702e+11,1.76707,48868,5064,65,84103,565,872,135952,66,1796,0


Converting to forward existential form...Done !
original formula: !(EF(((i11.u85.p217==1)||(((i10.i3.u84.p24==1)&&(i10.i2.u60.p151==1))&&(i10.i3.u81.p257==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i11.u85.p217==1)||(((i10.i3.u84.p24==1)&&(i10.i2.u60.p151==1))&&(i10.i3.u81.p257==1))))] = FALSE
(forward)formula 0,0,1.82118,49252,1,0,84103,565,898,135952,70,1796,1172
FORMULA BusinessProcesses-PT-04-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((EG(((i8.i2.u110.p277==1)&&(i8.i2.u111.p280==1))) * (i11.u77.p198==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (i11.u77.p198==1)),((i8.i2.u110.p277==1)&&(i8.i2.u111.p280==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
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 1,0,3.05716,55060,1,0,86259,621,2633,226615,230,1796,100994
FORMULA BusinessProcesses-PT-04-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF(((i8.i1.u28.p73==1)&&(i8.i1.u96.p241==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i8.i1.u28.p73==1)&&(i8.i1.u96.p241==1)))] = FALSE
(forward)formula 2,0,3.05834,55324,1,0,86263,621,2645,226699,230,1796,101121
FORMULA BusinessProcesses-PT-04-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(EG((i6.i2.u66.p164!=1)) U E((i11.u75.p190==1) U (((i0.u4.p10==1)&&(i10.i1.u57.p145==1))&&(i11.u102.p253==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EG((i6.i2.u66.p164!=1))),(i11.u75.p190==1)) * (((i0.u4.p10==1)&&(i10.i1.u57.p145==1))&&(i11.u102.p253==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t136, t141, t143, t182, i0.u4.t194, i0.u42.t135, i1.u21.t165, i2.t170, i2.i0.t168, i2.i0.t181, i2.i1.t173, i2.i1.t175, i2.i1.t177, i3.i1.t90, i3.i1.u69.t91, i4.i0.u44.t131, i4.i1.u46.t127, i5.i1.t94, i5.i1.u68.t95, i5.i2.t82, i5.i2.u73.t83, i6.i1.t102, i6.i1.u64.t103, i6.i2.t98, i6.i2.u66.t99, i8.i1.t106, i8.i1.u62.t107, i9.i0.t139, i9.i0.u23.t147, i9.i0.u23.t151, i9.i0.u23.t155, i9.i0.u23.t161, i9.i2.t86, i9.i2.u71.t87, i10.i0.t185, i10.i0.t187, i10.i0.u6.t191, i10.i1.t114, i10.i1.u57.t115, i10.i2.t110, i10.i2.u60.t111, i11.t70, i11.t65, i11.t63, i11.t56, i11.t54, i11.t51, i11.t49, i11.t47, i11.t19, i11.t16, i11.t13, i11.u102.t11, i11.u102.t30, i11.u102.t34, i11.u102.t38, i11.u102.t44, i11.u102.t60, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :40/179/61/280
(forward)formula 3,1,157.874,2200956,1,0,4.2691e+06,753,2443,4.92516e+06,170,1990,943526
FORMULA BusinessProcesses-PT-04-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((i7.u56.p138==1)||(((i9.i2.u107.p269==1)&&(((i6.i2.u43.p106!=1)||(i6.i2.u66.p166!=1))||(i0.u98.p245!=1)))&&(((i3.i0.u29.p76!=1)||(i8.i1.u62.p156!=1))||(i3.i2.u89.p261!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i7.u56.p138==1)||(((i9.i2.u107.p269==1)&&(((i6.i2.u43.p106!=1)||(i6.i2.u66.p166!=1))||(i0.u98.p245!=1)))&&(((i3.i0.u29.p76!=1)||(i8.i1.u62.p156!=1))||(i3.i2.u89.p261!=1)))))] != FALSE
(forward)formula 4,1,157.903,2200956,1,0,4.2691e+06,753,2481,4.92516e+06,174,1990,944712
FORMULA BusinessProcesses-PT-04-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF((i11.u87.p221==1)) * E(((((i3.i2.u105.p262==1)&&(i3.i2.u106.p265==1))&&(i9.i2.u107.p268==1))||(((i9.i2.u32.p82==1)&&(i9.i2.u71.p181==1))&&(i9.i3.u92.p285==1))) U (i0.u3.p7!=1)))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (i11.u87.p221==1))),((((i3.i2.u105.p262==1)&&(i3.i2.u106.p265==1))&&(i9.i2.u107.p268==1))||(((i9.i2.u32.p82==1)&&(i9.i2.u71.p181==1))&&(i9.i3.u92.p285==1)))) * (i0.u3.p7!=1))] != FALSE
(forward)formula 5,1,159.54,2200956,1,0,4.2691e+06,753,3461,4.92516e+06,212,1990,1114465
FORMULA BusinessProcesses-PT-04-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(EF(((i4.i0.u0.p2==1)||(i9.i2.u32.p57==1))) U E((i4.i0.u1.p4==1) U (i3.i0.u31.p81==1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,E(TRUE U ((i4.i0.u0.p2==1)||(i9.i2.u32.p57==1)))),(i4.i0.u1.p4==1)) * (i3.i0.u31.p81==1))] != FALSE
(forward)formula 6,0,161.169,2200956,1,0,4.2691e+06,753,3659,4.92516e+06,223,1990,1303173
FORMULA BusinessProcesses-PT-04-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((i2.i1.u16.p38!=1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((i2.i1.u16.p38!=1)))] = FALSE
(forward)formula 7,0,161.216,2200956,1,0,4.2691e+06,753,3663,4.92516e+06,223,1990,1306964
FORMULA BusinessProcesses-PT-04-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((AG((i4.i0.u1.p4==1)) + A((i11.u75.p189==1) U (((i4.i1.u46.p115==1)&&(i6.i1.u64.p160==1))&&(i11.u102.p253==1)))) + ((i8.i1.u108.p271==1)&&(i3.i1.u109.p274==1))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U !((i4.i0.u1.p4==1)))))] != FALSE + [((FwdU(Init,TRUE) * !(EG(!((((i4.i1.u46.p115==1)&&(i6.i1.u64.p160==1))&&(i11.u102.p253==1)))))) * !(E(!((((i4.i1.u46.p115==1)&&(i6.i1.u64.p160==1))&&(i11.u102.p253==1))) U (!((i11.u75.p189==1)) * !((((i4.i1.u46.p115==1)&&(i6.i1.u64.p160==1))&&(i11.u102.p253==1)))))))] != FALSE) + [(FwdU(Init,TRUE) * ((i8.i1.u108.p271==1)&&(i3.i1.u109.p274==1)))] != FALSE)
(forward)formula 8,1,239.674,2261672,1,0,4.2691e+06,762,3775,5.93394e+06,224,1990,3732256
FORMULA BusinessProcesses-PT-04-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(AG(((i8.i2.u110.p277==1)&&(i8.i2.u111.p280==1)))) * EF((((((i8.i1.u38.p92==1)&&(i9.i0.u39.p95==1))||((i8.i0.u35.p86==1)&&(i8.i0.u36.p89==1)))&&(i6.i2.u66.p164!=1))||(((((i2.i1.u16.p39==1)&&(i9.i2.u72.p178==1))&&(i3.i0.u30.p77==1))&&(i3.i0.u31.p80==1))&&(i9.i2.u33.p83==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !(((i8.i2.u110.p277==1)&&(i8.i2.u111.p280==1))))))),TRUE) * (((((i8.i1.u38.p92==1)&&(i9.i0.u39.p95==1))||((i8.i0.u35.p86==1)&&(i8.i0.u36.p89==1)))&&(i6.i2.u66.p164!=1))||(((((i2.i1.u16.p39==1)&&(i9.i2.u72.p178==1))&&(i3.i0.u30.p77==1))&&(i3.i0.u31.p80==1))&&(i9.i2.u33.p83==1))))] != FALSE
(forward)formula 9,1,240.762,2290184,1,0,4.2691e+06,926,3857,6.02107e+06,224,2414,3872605
FORMULA BusinessProcesses-PT-04-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589250814101

--------------------
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="BusinessProcesses-PT-04"
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 BusinessProcesses-PT-04, 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 r021-oct2-158897699100476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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