Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813696900454.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is BusinessProcesses-PT-01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696900454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 47K Mar 5 18:22 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-01-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678789788797

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-01
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:29:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 10:29:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:29:50] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-14 10:29:50] [INFO ] Transformed 200 places.
[2023-03-14 10:29:50] [INFO ] Transformed 178 transitions.
[2023-03-14 10:29:50] [INFO ] Found NUPN structural information;
[2023-03-14 10:29:50] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 115 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 12) seen :9
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 177 rows 199 cols
[2023-03-14 10:29:51] [INFO ] Computed 30 place invariants in 23 ms
[2023-03-14 10:29:51] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 10:29:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-14 10:29:51] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-14 10:29:51] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 10:29:51] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 6 ms to minimize.
[2023-03-14 10:29:51] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2023-03-14 10:29:51] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 0 ms to minimize.
[2023-03-14 10:29:51] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2023-03-14 10:29:51] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2023-03-14 10:29:51] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 0 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 5 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 0 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2023-03-14 10:29:52] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 0 ms to minimize.
[2023-03-14 10:29:53] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2023-03-14 10:29:53] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2023-03-14 10:29:53] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 0 ms to minimize.
[2023-03-14 10:29:53] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 0 ms to minimize.
[2023-03-14 10:29:53] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 0 ms to minimize.
[2023-03-14 10:29:53] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2023-03-14 10:29:53] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2023-03-14 10:29:53] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2046 ms
[2023-03-14 10:29:53] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2023-03-14 10:29:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-14 10:29:53] [INFO ] After 2280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-14 10:29:53] [INFO ] After 2462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 10 ms.
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 177/177 transitions.
Graph (trivial) has 115 edges and 199 vertex of which 8 / 199 are part of one of the 1 SCC in 5 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 372 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 189 transition count 127
Reduce places removed 39 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 150 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 146 transition count 123
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 88 place count 146 transition count 101
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 136 place count 120 transition count 101
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 160 place count 96 transition count 77
Iterating global reduction 3 with 24 rules applied. Total rules applied 184 place count 96 transition count 77
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 184 place count 96 transition count 74
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 190 place count 93 transition count 74
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 246 place count 65 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 64 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 64 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 63 transition count 48
Applied a total of 250 rules in 72 ms. Remains 63 /199 variables (removed 136) and now considering 48/177 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 63/199 places, 48/177 transitions.
Incomplete random walk after 10000 steps, including 556 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 242 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10074 steps, run visited all 1 properties in 40 ms. (steps per millisecond=251 )
Probabilistic random walk after 10074 steps, saw 2733 distinct states, run finished after 40 ms. (steps per millisecond=251 ) properties seen :1
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 3534 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 01
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 200 places, 178 transitions, 487 arcs.
Final Score: 3438.051
Took : 5 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-00 (reachable &!potential( ( (tk(P102)) <= ( 1 ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-01 (reachable &!potential( ( ( ( (tk(P105)) <= (tk(P18)) ) & (! ( ( ( ( (! ( ( 1 ) <= (tk(P29)) )) | (! ( ( ( 1 ) <= (tk(P69)) ) & ( (tk(P82)) <= (tk(P153)) ) )) ) | ( ( ( ( (tk(P187)) <= ( 0 ) ) & ( (tk(P199)) <= ( 1 ) ) ) & (! ( (tk(P161)) <= (tk(P46)) )) ) | ( ( (tk(P155)) <= ( 1 ) ) | ( (tk(P54)) <= (tk(P132)) ) ) ) ) | ( ( (tk(P35)) <= ( 0 ) ) | ( ( (! ( (tk(P136)) <= ( 0 ) )) | ( ( (tk(P148)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P191)) ) ) ) & ( ( ( ( 1 ) <= (tk(P149)) ) | ( ( 1 ) <= (tk(P8)) ) ) & ( ( (tk(P180)) <= ( 0 ) ) | ( (tk(P197)) <= (tk(P122)) ) ) ) ) ) ) & ( ( ( ( ( (tk(P113)) <= ( 1 ) ) & ( ( (tk(P167)) <= (tk(P21)) ) | ( (tk(P94)) <= ( 1 ) ) ) ) & ( (tk(P66)) <= ( 0 ) ) ) & ( (! ( (tk(P150)) <= (tk(P95)) )) & ( (tk(P103)) <= ( 1 ) ) ) ) | ( (! ( (tk(P178)) <= ( 0 ) )) & ( ( (! ( ( 1 ) <= (tk(P69)) )) & ( ( ( 1 ) <= (tk(P200)) ) & ( (tk(P46)) <= (tk(P53)) ) ) ) | (! ( ( 1 ) <= (tk(P156)) )) ) ) ) )) ) & ( (tk(P63)) <= ( 0 ) ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-02 (reachable &!potential( ( (tk(P181)) <= ( 1 ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-03 (reachable & potential(( ( ( ( 1 ) <= (tk(P48)) ) & ( ( (tk(P100)) <= (tk(P45)) ) & ( (tk(P38)) <= ( 1 ) ) ) ) | ( ( 1 ) <= (tk(P181)) ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-04 (reachable &!potential( (! ( (! ( (tk(P30)) <= ( 0 ) )) & ( (tk(P149)) <= ( 0 ) ) ))))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-05 (reachable &!potential( ( (! ( ( (! ( ( ( ( (tk(P192)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P53)) ) ) & ( ( ( 1 ) <= (tk(P58)) ) | ( (tk(P187)) <= (tk(P19)) ) ) ) & ( ( (tk(P166)) <= (tk(P199)) ) & (! ( ( 1 ) <= (tk(P110)) )) ) )) | ( ( (tk(P51)) <= (tk(P55)) ) | ( ( ( (! ( ( 1 ) <= (tk(P131)) )) | ( ( ( 1 ) <= (tk(P32)) ) | ( ( 1 ) <= (tk(P186)) ) ) ) | ( ( ( (tk(P76)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P53)) ) ) | (! ( ( 1 ) <= (tk(P18)) )) ) ) & ( ( 1 ) <= (tk(P109)) ) ) ) ) & (! ( (tk(P12)) <= (tk(P128)) )) )) | ( ( ( ( ( (! ( (tk(P176)) <= ( 1 ) )) & ( (! ( (tk(P57)) <= (tk(P164)) )) | ( ( 1 ) <= (tk(P172)) ) ) ) | (! ( (tk(P56)) <= (tk(P19)) )) ) | ( ( 1 ) <= (tk(P54)) ) ) & ( (tk(P56)) <= ( 0 ) ) ) & (! ( (! ( ( ( ( 1 ) <= (tk(P56)) ) & (! ( ( ( 1 ) <= (tk(P68)) ) | ( (tk(P45)) <= (tk(P185)) ) )) ) & (! ( (tk(P160)) <= (tk(P64)) )) )) | ( (! ( ( ( (tk(P145)) <= (tk(P112)) ) & (! ( (tk(P57)) <= (tk(P75)) )) ) & ( ( (tk(P61)) <= ( 1 ) ) & ( ( (tk(P179)) <= (tk(P130)) ) | ( (tk(P6)) <= ( 1 ) ) ) ) )) & ( ( ( (tk(P122)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P150)) ) ) | ( ( 1 ) <= (tk(P191)) ) ) ) )) ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-06 (reachable &!potential( ( ( (! ( (! ( (tk(P99)) <= (tk(P179)) )) | ( ( (tk(P80)) <= ( 1 ) ) & ( (tk(P160)) <= (tk(P158)) ) ) )) | ( (tk(P169)) <= (tk(P65)) ) ) & ( (tk(P71)) <= (tk(P95)) ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-07 (reachable &!potential( ( ( (tk(P128)) <= (tk(P15)) ) & ( (tk(P100)) <= ( 0 ) ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-08 (reachable &!potential( ( ( (tk(P148)) <= ( 0 ) ) | ( (! ( (! ( ( (tk(P144)) <= ( 1 ) ) & ( ( ( (tk(P112)) <= (tk(P88)) ) | ( (tk(P77)) <= (tk(P56)) ) ) & ( ( (tk(P122)) <= ( 1 ) ) & ( (tk(P193)) <= ( 0 ) ) ) ) )) | ( ( ( ( ( (tk(P124)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P150)) ) ) | (! ( (tk(P188)) <= ( 0 ) )) ) & (! ( ( ( 1 ) <= (tk(P106)) ) & ( ( 1 ) <= (tk(P10)) ) )) ) & ( ( ( ( ( 1 ) <= (tk(P153)) ) & ( (tk(P167)) <= (tk(P145)) ) ) | ( (tk(P53)) <= ( 1 ) ) ) & (! ( (tk(P43)) <= ( 1 ) )) ) ) )) | (! ( (tk(P17)) <= (tk(P26)) )) ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-09 (reachable &!potential( (! ( (! ( (tk(P12)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P107)) ) ))))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-10 (reachable & potential(( (! ( (tk(P27)) <= (tk(P33)) )) & ( ( (tk(P37)) <= (tk(P156)) ) | ( ( (! ( (tk(P125)) <= ( 0 ) )) | (! ( ( (tk(P56)) <= ( 0 ) ) & (! ( ( (tk(P14)) <= (tk(P94)) ) & ( (tk(P29)) <= ( 1 ) ) )) )) ) | ( (tk(P117)) <= (tk(P92)) ) ) ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-11 (reachable &!potential( ( ( (tk(P175)) <= ( 1 ) ) | ( (tk(P12)) <= ( 0 ) ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-12 (reachable &!potential( ( ( (tk(P32)) <= ( 0 ) ) | (! ( (tk(P88)) <= ( 0 ) )) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-13 (reachable &!potential( ( (tk(P101)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-14 (reachable &!potential( ( ( (tk(P158)) <= ( 1 ) ) & ( ( (tk(P102)) <= ( 1 ) ) | ( ( ( ( ( ( ( 1 ) <= (tk(P184)) ) | (! ( ( 1 ) <= (tk(P7)) )) ) | ( ( (tk(P63)) <= ( 0 ) ) | ( (! ( (tk(P195)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P177)) ) & ( (tk(P34)) <= ( 0 ) ) ) ) ) ) & ( (! ( (tk(P2)) <= ( 1 ) )) | ( (tk(P13)) <= ( 1 ) ) ) ) & ( (tk(P65)) <= ( 1 ) ) ) | ( (! ( (! ( (tk(P25)) <= (tk(P190)) )) & (! ( ( ( ( 1 ) <= (tk(P5)) ) & ( (tk(P110)) <= ( 0 ) ) ) | (! ( (tk(P150)) <= ( 0 ) )) )) )) & ( (! ( ( 1 ) <= (tk(P181)) )) & (! ( ( ( ( (tk(P103)) <= (tk(P18)) ) & ( ( 1 ) <= (tk(P162)) ) ) | ( ( ( 1 ) <= (tk(P2)) ) & ( ( 1 ) <= (tk(P157)) ) ) ) & (! ( ( (tk(P150)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P40)) ) )) )) ) ) ) ) )))
PROPERTY: BusinessProcesses-PT-01-ReachabilityCardinality-15 (reachable & potential((! ( ( ( ( ( ( (! ( ( ( 1 ) <= (tk(P54)) ) | ( (tk(P139)) <= (tk(P28)) ) )) & (! ( (tk(P51)) <= (tk(P105)) )) ) & (! ( ( 1 ) <= (tk(P196)) )) ) & ( ( (tk(P86)) <= ( 0 ) ) & ( ( ( (tk(P166)) <= (tk(P59)) ) & ( ( (tk(P91)) <= (tk(P183)) ) & ( ( 1 ) <= (tk(P4)) ) ) ) | ( ( ( (tk(P14)) <= (tk(P93)) ) | ( (tk(P126)) <= (tk(P2)) ) ) & ( ( (tk(P38)) <= ( 0 ) ) & ( (tk(P80)) <= ( 1 ) ) ) ) ) ) ) | (! ( ( ( ( (tk(P136)) <= (tk(P151)) ) & ( (tk(P57)) <= (tk(P110)) ) ) & (! ( ( 1 ) <= (tk(P65)) )) ) & (! ( ( (tk(P61)) <= (tk(P65)) ) & ( (tk(P24)) <= (tk(P110)) ) )) )) ) | ( ( ( ( ( 1 ) <= (tk(P88)) ) & ( (tk(P146)) <= (tk(P92)) ) ) | ( (! ( ( ( (tk(P129)) <= ( 1 ) ) & ( (tk(P93)) <= (tk(P82)) ) ) | ( ( ( 1 ) <= (tk(P114)) ) | ( (tk(P180)) <= ( 0 ) ) ) )) | ( (! ( ( (tk(P154)) <= ( 0 ) ) & ( (tk(P79)) <= (tk(P128)) ) )) | ( ( 1 ) <= (tk(P118)) ) ) ) ) | (! ( ( ( (! ( (tk(P138)) <= ( 1 ) )) | ( (tk(P64)) <= (tk(P28)) ) ) | (! ( ( ( 1 ) <= (tk(P67)) ) & ( (tk(P30)) <= (tk(P78)) ) )) ) & ( ( 1 ) <= (tk(P54)) ) )) ) ) | ( ( (! ( ( (! ( (tk(P166)) <= (tk(P115)) )) | (! ( (tk(P46)) <= (tk(P55)) )) ) | (! ( ( 1 ) <= (tk(P71)) )) )) | ( (tk(P136)) <= (tk(P18)) ) ) & ( (tk(P50)) <= (tk(P118)) ) ) ))))
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678789811099

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-01"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool smartxred"
echo " Input is BusinessProcesses-PT-01, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813696900454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;