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-167813697000542.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-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697000542
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:48 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.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 146K 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-12-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678792158587

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-12
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 11:09:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 11:09:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:09:20] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-14 11:09:20] [INFO ] Transformed 586 places.
[2023-03-14 11:09:20] [INFO ] Transformed 525 transitions.
[2023-03-14 11:09:20] [INFO ] Found NUPN structural information;
[2023-03-14 11:09:20] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 73 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 13) seen :2
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 521 rows 582 cols
[2023-03-14 11:09:21] [INFO ] Computed 98 place invariants in 31 ms
[2023-03-14 11:09:22] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2023-03-14 11:09:22] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2023-03-14 11:09:22] [INFO ] After 424ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-14 11:09:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 42 ms returned sat
[2023-03-14 11:09:22] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-14 11:09:23] [INFO ] After 837ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-14 11:09:23] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 6 ms to minimize.
[2023-03-14 11:09:23] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2023-03-14 11:09:24] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 14 ms to minimize.
[2023-03-14 11:09:24] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2023-03-14 11:09:24] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2023-03-14 11:09:24] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2023-03-14 11:09:24] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2023-03-14 11:09:24] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 0 ms to minimize.
[2023-03-14 11:09:25] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2023-03-14 11:09:25] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2023-03-14 11:09:25] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2023-03-14 11:09:25] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2023-03-14 11:09:25] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 0 ms to minimize.
[2023-03-14 11:09:25] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 0 ms to minimize.
[2023-03-14 11:09:25] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2023-03-14 11:09:25] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2023-03-14 11:09:25] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2179 ms
[2023-03-14 11:09:26] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2023-03-14 11:09:26] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 1 ms to minimize.
[2023-03-14 11:09:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 404 ms
[2023-03-14 11:09:26] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 1 ms to minimize.
[2023-03-14 11:09:27] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 0 ms to minimize.
[2023-03-14 11:09:27] [INFO ] Deduced a trap composed of 142 places in 230 ms of which 0 ms to minimize.
[2023-03-14 11:09:27] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 0 ms to minimize.
[2023-03-14 11:09:27] [INFO ] Deduced a trap composed of 149 places in 133 ms of which 0 ms to minimize.
[2023-03-14 11:09:27] [INFO ] Deduced a trap composed of 123 places in 171 ms of which 0 ms to minimize.
[2023-03-14 11:09:28] [INFO ] Deduced a trap composed of 129 places in 181 ms of which 1 ms to minimize.
[2023-03-14 11:09:28] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 1 ms to minimize.
[2023-03-14 11:09:28] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 3 ms to minimize.
[2023-03-14 11:09:28] [INFO ] Deduced a trap composed of 151 places in 180 ms of which 0 ms to minimize.
[2023-03-14 11:09:28] [INFO ] Deduced a trap composed of 129 places in 170 ms of which 0 ms to minimize.
[2023-03-14 11:09:29] [INFO ] Deduced a trap composed of 132 places in 164 ms of which 1 ms to minimize.
[2023-03-14 11:09:29] [INFO ] Deduced a trap composed of 141 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:09:29] [INFO ] Deduced a trap composed of 141 places in 137 ms of which 0 ms to minimize.
[2023-03-14 11:09:29] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 1 ms to minimize.
[2023-03-14 11:09:29] [INFO ] Deduced a trap composed of 140 places in 162 ms of which 1 ms to minimize.
[2023-03-14 11:09:29] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 12 ms to minimize.
[2023-03-14 11:09:30] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 1 ms to minimize.
[2023-03-14 11:09:30] [INFO ] Deduced a trap composed of 130 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:09:30] [INFO ] Deduced a trap composed of 129 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:09:30] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 1 ms to minimize.
[2023-03-14 11:09:30] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
[2023-03-14 11:09:30] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 0 ms to minimize.
[2023-03-14 11:09:31] [INFO ] Deduced a trap composed of 140 places in 131 ms of which 0 ms to minimize.
[2023-03-14 11:09:31] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 1 ms to minimize.
[2023-03-14 11:09:31] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 0 ms to minimize.
[2023-03-14 11:09:31] [INFO ] Deduced a trap composed of 141 places in 137 ms of which 0 ms to minimize.
[2023-03-14 11:09:31] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 14 ms to minimize.
[2023-03-14 11:09:31] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 1 ms to minimize.
[2023-03-14 11:09:32] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 1 ms to minimize.
[2023-03-14 11:09:32] [INFO ] Deduced a trap composed of 137 places in 186 ms of which 1 ms to minimize.
[2023-03-14 11:09:32] [INFO ] Deduced a trap composed of 148 places in 161 ms of which 0 ms to minimize.
[2023-03-14 11:09:32] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 3 ms to minimize.
[2023-03-14 11:09:32] [INFO ] Deduced a trap composed of 140 places in 161 ms of which 1 ms to minimize.
[2023-03-14 11:09:33] [INFO ] Deduced a trap composed of 132 places in 141 ms of which 1 ms to minimize.
[2023-03-14 11:09:33] [INFO ] Deduced a trap composed of 145 places in 174 ms of which 0 ms to minimize.
[2023-03-14 11:09:33] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 1 ms to minimize.
[2023-03-14 11:09:33] [INFO ] Deduced a trap composed of 132 places in 144 ms of which 2 ms to minimize.
[2023-03-14 11:09:33] [INFO ] Deduced a trap composed of 138 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:09:34] [INFO ] Deduced a trap composed of 145 places in 153 ms of which 0 ms to minimize.
[2023-03-14 11:09:34] [INFO ] Deduced a trap composed of 133 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:09:34] [INFO ] Deduced a trap composed of 154 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:09:34] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 7918 ms
[2023-03-14 11:09:34] [INFO ] After 12135ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 522 ms.
[2023-03-14 11:09:35] [INFO ] After 13068ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 137 ms.
Support contains 28 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 298 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 13 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 572 transition count 405
Reduce places removed 107 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 114 rules applied. Total rules applied 223 place count 465 transition count 398
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 230 place count 458 transition count 398
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 230 place count 458 transition count 314
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 179 rules applied. Total rules applied 409 place count 363 transition count 314
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 476 place count 296 transition count 247
Iterating global reduction 3 with 67 rules applied. Total rules applied 543 place count 296 transition count 247
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 543 place count 296 transition count 243
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 551 place count 292 transition count 243
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 709 place count 213 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 711 place count 212 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 713 place count 212 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 715 place count 210 transition count 166
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 716 place count 210 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 717 place count 209 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 718 place count 208 transition count 165
Applied a total of 718 rules in 179 ms. Remains 208 /582 variables (removed 374) and now considering 165/521 (removed 356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 208/582 places, 165/521 transitions.
Finished random walk after 141 steps, including 3 resets, run visited all 6 properties in 17 ms. (steps per millisecond=8 )
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15184 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 12
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: 586 places, 525 transitions, 1560 arcs.
Final Score: 25985.571
Took : 17 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-00 (reachable & potential(( ( (tk(P189)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P91)) ) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-01 (reachable & potential(( ( 1 ) <= (tk(P305)) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-02 (reachable & potential(( (! ( ( ( ( (tk(P25)) <= ( 0 ) ) | ( (tk(P335)) <= (tk(P428)) ) ) | ( ( (! ( (! ( (tk(P399)) <= (tk(P231)) )) & (! ( ( 1 ) <= (tk(P377)) )) )) | ( (tk(P414)) <= (tk(P288)) ) ) | ( ( ( ( ( ( 1 ) <= (tk(P43)) ) & ( (tk(P411)) <= (tk(P391)) ) ) | ( ( ( 1 ) <= (tk(P307)) ) & ( (tk(P156)) <= (tk(P285)) ) ) ) & ( ( 1 ) <= (tk(P426)) ) ) | ( ( ( ( 1 ) <= (tk(P395)) ) & ( ( ( 1 ) <= (tk(P45)) ) & ( (tk(P196)) <= (tk(P458)) ) ) ) | (! ( ( 1 ) <= (tk(P569)) )) ) ) ) ) | ( ( (tk(P95)) <= ( 1 ) ) | ( (! ( (tk(P140)) <= ( 0 ) )) & ( (! ( ( 1 ) <= (tk(P10)) )) & ( (! ( ( (tk(P407)) <= (tk(P322)) ) | ( (tk(P426)) <= ( 1 ) ) )) | ( (! ( ( 1 ) <= (tk(P204)) )) | ( (tk(P341)) <= ( 0 ) ) ) ) ) ) ) )) & ( (tk(P380)) <= ( 1 ) ) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-03 (reachable & potential(( ( (! ( (tk(P231)) <= (tk(P286)) )) & ( ( (tk(P417)) <= (tk(P20)) ) | ( ( 1 ) <= (tk(P79)) ) ) ) | ( (! ( (tk(P440)) <= ( 1 ) )) & ( ( ( ( (tk(P526)) <= (tk(P243)) ) & ( ( (tk(P178)) <= (tk(P387)) ) | ( ( ( 1 ) <= (tk(P75)) ) & ( (tk(P258)) <= (tk(P530)) ) ) ) ) | (! ( ( ( ( (tk(P225)) <= ( 1 ) ) & ( ( (tk(P452)) <= ( 1 ) ) | ( (tk(P15)) <= ( 1 ) ) ) ) | ( (! ( (tk(P157)) <= (tk(P155)) )) | (! ( (tk(P460)) <= (tk(P94)) )) ) ) & ( (tk(P513)) <= ( 0 ) ) )) ) | (! ( (tk(P553)) <= ( 0 ) )) ) ) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-04 (reachable &!potential( (! ( ( ( ( ( 1 ) <= (tk(P438)) ) | ( ( (! ( ( (tk(P322)) <= (tk(P19)) ) & ( (tk(P167)) <= ( 0 ) ) )) & ( ( 1 ) <= (tk(P16)) ) ) & (! ( ( (tk(P579)) <= ( 1 ) ) & ( (tk(P77)) <= ( 0 ) ) )) ) ) | ( ( ( 1 ) <= (tk(P276)) ) & (! ( ( ( (tk(P541)) <= (tk(P517)) ) | ( ( ( (tk(P255)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P88)) ) ) & ( ( (tk(P358)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P537)) ) ) ) ) | ( ( (tk(P77)) <= ( 1 ) ) & (! ( ( ( 1 ) <= (tk(P567)) ) | ( (tk(P39)) <= (tk(P70)) ) )) ) )) ) ) & ( (tk(P575)) <= (tk(P23)) ) ))))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-05 (reachable & potential(( (! ( ( ( ( ( ( ( ( 1 ) <= (tk(P393)) ) | ( ( 1 ) <= (tk(P265)) ) ) & ( (tk(P319)) <= ( 1 ) ) ) & ( (tk(P7)) <= (tk(P567)) ) ) | ( (tk(P369)) <= (tk(P423)) ) ) | (! ( ( ( ( (tk(P551)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P234)) ) ) & ( (tk(P537)) <= ( 1 ) ) ) | (! ( ( ( (tk(P37)) <= ( 0 ) ) & ( (tk(P117)) <= (tk(P81)) ) ) | ( ( (tk(P210)) <= (tk(P464)) ) | ( ( 1 ) <= (tk(P497)) ) ) )) )) ) | (! ( ( (tk(P200)) <= ( 0 ) ) & ( (! ( (tk(P493)) <= (tk(P149)) )) | ( ( (! ( (tk(P284)) <= ( 0 ) )) | ( (tk(P144)) <= (tk(P337)) ) ) | (! ( ( ( 1 ) <= (tk(P296)) ) & ( ( 1 ) <= (tk(P426)) ) )) ) ) )) )) & ( ( 1 ) <= (tk(P545)) ) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-06 (reachable &!potential( ( ( (tk(P150)) <= (tk(P542)) ) & ( ( (! ( ( (tk(P395)) <= ( 0 ) ) & ( (! ( ( ( (tk(P512)) <= ( 1 ) ) & ( (tk(P571)) <= (tk(P470)) ) ) | ( ( 1 ) <= (tk(P68)) ) )) & (! ( (tk(P570)) <= (tk(P93)) )) ) )) | ( ( (tk(P516)) <= (tk(P209)) ) & ( (! ( ( (! ( ( 1 ) <= (tk(P140)) )) & ( (tk(P136)) <= (tk(P265)) ) ) | ( ( ( (tk(P521)) <= ( 1 ) ) & ( (tk(P471)) <= ( 0 ) ) ) & (! ( ( 1 ) <= (tk(P354)) )) ) )) & ( (tk(P536)) <= (tk(P482)) ) ) ) ) | (! ( (tk(P396)) <= ( 0 ) )) ) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-07 (reachable &!potential( ( ( (tk(P475)) <= (tk(P538)) ) | ( ( (tk(P1)) <= ( 1 ) ) | (! ( ( ( 1 ) <= (tk(P582)) ) | (! ( ( ( ( (tk(P525)) <= (tk(P419)) ) & ( (tk(P142)) <= ( 0 ) ) ) & ( (tk(P43)) <= (tk(P452)) ) ) & (! ( ( (tk(P23)) <= ( 0 ) ) | ( (tk(P584)) <= (tk(P247)) ) )) )) )) ) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P59)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-09 (reachable & potential(( ( (! ( (tk(P534)) <= ( 0 ) )) & (! ( (tk(P478)) <= (tk(P65)) )) ) | (! ( (tk(P96)) <= (tk(P177)) )) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-10 (reachable &!potential( ( ( ( (tk(P307)) <= (tk(P482)) ) & ( (tk(P16)) <= ( 0 ) ) ) | ( ( (tk(P150)) <= (tk(P237)) ) & ( (tk(P517)) <= (tk(P331)) ) ) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-11 (reachable & potential(( ( ( 1 ) <= (tk(P177)) ) | (! ( (tk(P465)) <= (tk(P460)) )) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-12 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P496)) )) | ( (! ( ( ( ( (! ( (tk(P228)) <= ( 0 ) )) | ( ( (tk(P110)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P445)) ) | ( ( 1 ) <= (tk(P319)) ) ) ) ) & ( ( ( ( (tk(P517)) <= ( 0 ) ) & ( (tk(P505)) <= (tk(P32)) ) ) | (! ( (tk(P225)) <= (tk(P455)) )) ) | (! ( (tk(P497)) <= ( 1 ) )) ) ) & (! ( ( 1 ) <= (tk(P444)) )) ) & ( ( (tk(P29)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P403)) ) ) )) & ( (tk(P399)) <= ( 1 ) ) ) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-13 (reachable & potential(( (! ( ( 1 ) <= (tk(P293)) )) & ( ( ( ( (tk(P186)) <= ( 1 ) ) & ( ( ( (! ( (tk(P466)) <= ( 1 ) )) & ( (! ( (tk(P416)) <= ( 0 ) )) & ( ( (tk(P381)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P191)) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P319)) ) | ( ( ( 1 ) <= (tk(P409)) ) | ( ( 1 ) <= (tk(P122)) ) ) ) & (! ( (tk(P579)) <= ( 1 ) )) ) ) & ( ( ( ( 1 ) <= (tk(P5)) ) | ( ( (tk(P357)) <= (tk(P102)) ) & ( ( (tk(P376)) <= (tk(P4)) ) & ( ( 1 ) <= (tk(P231)) ) ) ) ) | ( (tk(P473)) <= (tk(P461)) ) ) ) ) & ( (tk(P396)) <= ( 0 ) ) ) & ( (tk(P470)) <= ( 0 ) ) ) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-14 (reachable &!potential( ( (tk(P123)) <= (tk(P142)) )))
PROPERTY: BusinessProcesses-PT-12-ReachabilityCardinality-15 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P152)) )) | ( (tk(P150)) <= (tk(P349)) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10863404 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16108312 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
Caught signal 15, terminating.

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

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