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-158897699100516.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-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 22:44 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.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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.3K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 104K 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-09-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589251667664

[2020-05-12 02:47:49] [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:47:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:47:50] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2020-05-12 02:47:50] [INFO ] Transformed 403 places.
[2020-05-12 02:47:50] [INFO ] Transformed 374 transitions.
[2020-05-12 02:47:50] [INFO ] Found NUPN structural information;
[2020-05-12 02:47:50] [INFO ] Parsed PT model containing 403 places and 374 transitions in 159 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 47 ms.
Incomplete random walk after 100000 steps, including 1049 resets, run finished after 327 ms. (steps per millisecond=305 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1]
// Phase 1: matrix 374 rows 403 cols
[2020-05-12 02:47:50] [INFO ] Computed 65 place invariants in 18 ms
[2020-05-12 02:47:50] [INFO ] [Real]Absence check using 36 positive place invariants in 260 ms returned sat
[2020-05-12 02:47:51] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 164 ms returned sat
[2020-05-12 02:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:47:53] [INFO ] [Real]Absence check using state equation in 2411 ms returned unsat
[2020-05-12 02:47:53] [INFO ] [Real]Absence check using 36 positive place invariants in 26 ms returned sat
[2020-05-12 02:47:53] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 13 ms returned sat
[2020-05-12 02:47:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:47:53] [INFO ] [Real]Absence check using state equation in 277 ms returned unsat
[2020-05-12 02:47:54] [INFO ] [Real]Absence check using 36 positive place invariants in 214 ms returned sat
[2020-05-12 02:47:54] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 216 ms returned sat
[2020-05-12 02:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:47:54] [INFO ] [Real]Absence check using state equation in 462 ms returned unsat
[2020-05-12 02:47:54] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned unsat
[2020-05-12 02:47:55] [INFO ] [Real]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-05-12 02:47:55] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 21 ms returned sat
[2020-05-12 02:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:47:55] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2020-05-12 02:47:57] [INFO ] Deduced a trap composed of 8 places in 1607 ms
[2020-05-12 02:47:59] [INFO ] Deduced a trap composed of 20 places in 1789 ms
[2020-05-12 02:48:03] [INFO ] Deduced a trap composed of 11 places in 3985 ms
[2020-05-12 02:48:03] [INFO ] Deduced a trap composed of 40 places in 222 ms
[2020-05-12 02:48:04] [INFO ] Deduced a trap composed of 14 places in 975 ms
[2020-05-12 02:48:05] [INFO ] Deduced a trap composed of 56 places in 449 ms
[2020-05-12 02:48:05] [INFO ] Deduced a trap composed of 19 places in 166 ms
[2020-05-12 02:48:05] [INFO ] Deduced a trap composed of 89 places in 141 ms
[2020-05-12 02:48:05] [INFO ] Deduced a trap composed of 97 places in 126 ms
[2020-05-12 02:48:05] [INFO ] Deduced a trap composed of 16 places in 124 ms
[2020-05-12 02:48:05] [INFO ] Deduced a trap composed of 101 places in 132 ms
[2020-05-12 02:48:06] [INFO ] Deduced a trap composed of 32 places in 132 ms
[2020-05-12 02:48:06] [INFO ] Deduced a trap composed of 57 places in 242 ms
[2020-05-12 02:48:06] [INFO ] Deduced a trap composed of 92 places in 117 ms
[2020-05-12 02:48:06] [INFO ] Deduced a trap composed of 27 places in 313 ms
[2020-05-12 02:48:07] [INFO ] Deduced a trap composed of 62 places in 232 ms
[2020-05-12 02:48:07] [INFO ] Deduced a trap composed of 106 places in 153 ms
[2020-05-12 02:48:08] [INFO ] Deduced a trap composed of 28 places in 970 ms
[2020-05-12 02:48:08] [INFO ] Deduced a trap composed of 105 places in 136 ms
[2020-05-12 02:48:08] [INFO ] Deduced a trap composed of 94 places in 187 ms
[2020-05-12 02:48:08] [INFO ] Deduced a trap composed of 91 places in 264 ms
[2020-05-12 02:48:09] [INFO ] Deduced a trap composed of 100 places in 108 ms
[2020-05-12 02:48:09] [INFO ] Deduced a trap composed of 92 places in 105 ms
[2020-05-12 02:48:09] [INFO ] Deduced a trap composed of 49 places in 177 ms
[2020-05-12 02:48:09] [INFO ] Deduced a trap composed of 50 places in 107 ms
[2020-05-12 02:48:09] [INFO ] Deduced a trap composed of 50 places in 257 ms
[2020-05-12 02:48:09] [INFO ] Deduced a trap composed of 85 places in 114 ms
[2020-05-12 02:48:10] [INFO ] Deduced a trap composed of 95 places in 168 ms
[2020-05-12 02:48:10] [INFO ] Deduced a trap composed of 84 places in 215 ms
[2020-05-12 02:48:10] [INFO ] Deduced a trap composed of 96 places in 176 ms
[2020-05-12 02:48:10] [INFO ] Deduced a trap composed of 90 places in 236 ms
[2020-05-12 02:48:10] [INFO ] Deduced a trap composed of 89 places in 147 ms
[2020-05-12 02:48:11] [INFO ] Deduced a trap composed of 92 places in 115 ms
[2020-05-12 02:48:12] [INFO ] Deduced a trap composed of 92 places in 1143 ms
[2020-05-12 02:48:12] [INFO ] Deduced a trap composed of 84 places in 123 ms
[2020-05-12 02:48:12] [INFO ] Deduced a trap composed of 95 places in 169 ms
[2020-05-12 02:48:12] [INFO ] Deduced a trap composed of 109 places in 107 ms
[2020-05-12 02:48:12] [INFO ] Deduced a trap composed of 99 places in 214 ms
[2020-05-12 02:48:13] [INFO ] Deduced a trap composed of 95 places in 597 ms
[2020-05-12 02:48:14] [INFO ] Deduced a trap composed of 97 places in 452 ms
[2020-05-12 02:48:14] [INFO ] Deduced a trap composed of 88 places in 141 ms
[2020-05-12 02:48:14] [INFO ] Deduced a trap composed of 93 places in 175 ms
[2020-05-12 02:48:14] [INFO ] Deduced a trap composed of 94 places in 207 ms
[2020-05-12 02:48:14] [INFO ] Deduced a trap composed of 98 places in 184 ms
[2020-05-12 02:48:15] [INFO ] Deduced a trap composed of 92 places in 732 ms
[2020-05-12 02:48:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s24 s25 s28 s29 s30 s31 s32 s80 s84 s92 s98 s99 s114 s166 s169 s188 s189 s190 s193 s195 s219 s234 s244 s249 s254 s259 s274 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s299 s300 s306 s307 s308 s309 s310 s311 s312 s313 s314 s317 s318 s319 s320 s321 s322 s326 s330 s333 s337 s338 s339 s340 s341 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s356 s357 s360 s361 s362 s363 s364 s365 s368 s369 s370 s371 s385 s397) 0)") while checking expression at index 4
[2020-05-12 02:48:15] [INFO ] [Real]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-05-12 02:48:15] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 33 ms returned unsat
[2020-05-12 02:48:16] [INFO ] [Real]Absence check using 36 positive place invariants in 226 ms returned sat
[2020-05-12 02:48:16] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 76 ms returned sat
[2020-05-12 02:48:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:48:16] [INFO ] [Real]Absence check using state equation in 344 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-05-12 02:48:16] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-12 02:48:16] [INFO ] Flatten gal took : 115 ms
[2020-05-12 02:48:16] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-12 02:48:16] [INFO ] Flatten gal took : 39 ms
FORMULA BusinessProcesses-PT-09-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:48:16] [INFO ] Applying decomposition
[2020-05-12 02:48:17] [INFO ] Flatten gal took : 37 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/graph17124261584915985808.txt, -o, /tmp/graph17124261584915985808.bin, -w, /tmp/graph17124261584915985808.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/graph17124261584915985808.bin, -l, -1, -v, -w, /tmp/graph17124261584915985808.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:48:17] [INFO ] Decomposing Gal with order
[2020-05-12 02:48:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:48:17] [INFO ] Removed a total of 233 redundant transitions.
[2020-05-12 02:48:17] [INFO ] Flatten gal took : 141 ms
[2020-05-12 02:48:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-12 02:48:17] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 21 ms
[2020-05-12 02:48:17] [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 13 CTL formulae.
built 44 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 18 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 18 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 22 ordering constraints for composite.
built 15 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 47 ordering constraints for composite.
built 22 ordering constraints for composite.
built 16 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 23 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 47 ordering constraints for composite.
built 19 ordering constraints for composite.
built 37 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,7.52257e+18,25.6572,551544,9051,91,834928,1198,999,1.82511e+06,89,3162,0


Converting to forward existential form...Done !
original formula: AG(EX((((i13.u119.p299!=1)||(i3.i0.u27.p64==1))||(((i11.u34.p108==1)&&(i10.u97.p245==1))&&(i10.u131.p333==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((i13.u119.p299!=1)||(i3.i0.u27.p64==1))||(((i11.u34.p108==1)&&(i10.u97.p245==1))&&(i10.u131.p333==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t35, t37, t39, t113, t179, t203, t208, t210, t245, t249, t255, i0.u54.t198, i0.u56.t194, i0.u58.t190, i0.u60.t186, i1.i0.u52.t202, i1.i1.t149, i1.i1.u87.t150, i2.i0.t260, i3.t233, i3.i0.t231, i3.i0.t244, i3.i0.u23.t248, i3.i1.t236, i3.i1.t238, i3.i1.t240, i4.i0.u62.t182, i4.i0.u64.t178, i4.i3.t109, i4.i3.u108.t110, i4.i4.t105, i4.i4.u109.t106, i5.i1.t157, i5.i1.u83.t158, i5.i2.t153, i5.i2.u86.t154, i5.i3.t145, i5.i3.u89.t146, i5.i4.t141, i5.i4.u92.t142, i6.i0.t172, i6.i0.u75.t173, i6.i1.t165, i6.i1.u80.t166, i6.i2.t161, i6.i2.u81.t162, i7.i0.t261, i7.i0.t265, i7.i0.u8.t273, i7.i0.u11.t268, i7.i0.u13.t264, i7.i1.t270, i7.i1.u12.t266, i7.i2.t169, i7.i2.u78.t170, i7.i3.t78, i7.i3.u118.t82, i8.i0.u19.t254, i8.i1.t137, i8.i1.u93.t138, i9.i1.t133, i9.i1.u96.t134, i9.i2.t125, i9.i2.u100.t126, i9.i3.t121, i9.i3.u101.t122, i10.t129, i10.u97.t130, i11.t117, i11.u104.t118, i12.t206, i12.u33.t214, i12.u33.t218, i12.u33.t222, i12.u33.t228, i12.u106.t114, i13.t99, i13.t92, i13.t87, i13.t85, i13.t80, i13.t76, i13.t73, i13.t71, i13.t64, i13.t61, i13.t59, i13.t32, i13.t29, i13.t26, i13.t23, i13.t20, i13.t17, i13.t14, i13.u112.t12, i13.u112.t43, i13.u112.t47, i13.u112.t51, i13.u112.t57, i13.u112.t69, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/238/100/374
(forward)formula 0,0,46.1212,598920,1,0,959489,1198,5271,2.11514e+06,409,3540,1746788
FORMULA BusinessProcesses-PT-09-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF(EG((i13.u112.p327==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(i13.u112.p327==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
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an 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
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 1,1,48.8619,633768,1,0,1.02879e+06,1229,6622,2.3029e+06,473,3719,1837857
FORMULA BusinessProcesses-PT-09-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((EG((i12.u50.p122==1)) * (i7.i0.u7.p16==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (i7.i0.u7.p16==1)),(i12.u50.p122==1))] != FALSE
(forward)formula 2,1,53.0496,758640,1,0,1.24305e+06,1485,6902,2.70261e+06,492,4419,2108693
FORMULA BusinessProcesses-PT-09-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((i1.i0.u4.p9==1) * !(EF((i11.u103.p261==1)))) * (((i5.i2.u57.p141!=1)||(i5.i2.u86.p215!=1))||(i0.u140.p352!=1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (((i5.i2.u57.p141!=1)||(i5.i2.u86.p215!=1))||(i0.u140.p352!=1))) * (i1.i0.u4.p9==1)) * !(E(TRUE U (i11.u103.p261==1))))] != FALSE
(forward)formula 3,1,53.3805,765768,1,0,1.25364e+06,1935,7779,2.72386e+06,522,5016,2160752
FORMULA BusinessProcesses-PT-09-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((EX((i7.i1.u12.p29!=1)) * (i9.i3.u101.p253!=1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX((i7.i1.u12.p29!=1))))] = FALSE * [(FwdU(Init,TRUE) * !((i9.i3.u101.p253!=1)))] = FALSE)
(forward)formula 4,0,53.417,766296,1,0,1.25522e+06,1935,7785,2.72575e+06,522,5016,2161295
FORMULA BusinessProcesses-PT-09-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF((i5.i0.u73.p181==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i5.i0.u73.p181==1))] = FALSE
(forward)formula 5,0,53.4368,766824,1,0,1.25524e+06,1935,7787,2.72668e+06,522,5016,2166567
FORMULA BusinessProcesses-PT-09-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(!(AG(((i12.u48.p119==1)||(i12.u106.p263==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((i12.u48.p119==1)||(i12.u106.p263==1))))))] = FALSE
(forward)formula 6,1,54.476,776592,1,0,1.26794e+06,2029,7795,2.7776e+06,522,5245,2210580
FORMULA BusinessProcesses-PT-09-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((EX((i12.u106.p263==1)) + ((i3.i1.u30.p67==1)&&(i4.i0.u62.p157!=1))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * (i12.u106.p263==1))] != FALSE + [(FwdU(Init,TRUE) * ((i3.i1.u30.p67==1)&&(i4.i0.u62.p157!=1)))] != FALSE)
(forward)formula 7,1,55.4555,799824,1,0,1.30033e+06,2031,7803,2.90925e+06,522,5258,2240535
FORMULA BusinessProcesses-PT-09-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AG((((i5.i4.u91.p231!=1)&&(((i3.i1.u29.p73!=1)||(i9.i3.u101.p254!=1))||(i13.u112.p368!=1)))||(i13.u116.p293==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((i5.i4.u91.p231!=1)&&(((i3.i1.u29.p73!=1)||(i9.i3.u101.p254!=1))||(i13.u112.p368!=1)))||(i13.u116.p293==1))))] != FALSE
(forward)formula 8,1,55.6889,805896,1,0,1.31038e+06,2052,7824,2.92593e+06,524,5371,2254848
FORMULA BusinessProcesses-PT-09-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EX((i5.i4.u91.p227==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (i5.i4.u91.p227==1))] != FALSE
(forward)formula 9,1,55.7254,806688,1,0,1.3104e+06,2052,7826,2.92825e+06,524,5371,2259895
FORMULA BusinessProcesses-PT-09-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((i10.u35.p88==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i10.u35.p88==1))] != FALSE
(forward)formula 10,1,55.7261,806952,1,0,1.3104e+06,2052,7827,2.92825e+06,524,5371,2260006
FORMULA BusinessProcesses-PT-09-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(!(AG((i13.u124.p311!=1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((i13.u124.p311!=1)))] != FALSE
(forward)formula 11,1,88.0563,1474884,1,0,2.29185e+06,2400,7862,5.08851e+06,524,6726,3230683
FORMULA BusinessProcesses-PT-09-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((((i7.i0.u9.p20==1)&&(i6.i0.u75.p190==1))&&(i7.i0.u117.p295==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i7.i0.u9.p20==1)&&(i6.i0.u75.p190==1))&&(i7.i0.u117.p295==1)))] != FALSE
(forward)formula 12,1,88.0867,1475940,1,0,2.29245e+06,2400,7880,5.09014e+06,524,6726,3235972
FORMULA BusinessProcesses-PT-09-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1589251786201

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

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