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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 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.6K 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 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 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 148K 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-13-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678792790246

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 11:19:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 11:19:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:19:51] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-14 11:19:51] [INFO ] Transformed 593 places.
[2023-03-14 11:19:51] [INFO ] Transformed 536 transitions.
[2023-03-14 11:19:51] [INFO ] Found NUPN structural information;
[2023-03-14 11:19:51] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 71 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 14) seen :2
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :3
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 528 rows 585 cols
[2023-03-14 11:19:53] [INFO ] Computed 95 place invariants in 19 ms
[2023-03-14 11:19:53] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 11:19:53] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-14 11:19:53] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2023-03-14 11:19:54] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :5
[2023-03-14 11:19:54] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 6 ms to minimize.
[2023-03-14 11:19:54] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2023-03-14 11:19:54] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2023-03-14 11:19:54] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2023-03-14 11:19:54] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2023-03-14 11:19:54] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2023-03-14 11:19:54] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 1 ms to minimize.
[2023-03-14 11:19:55] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2023-03-14 11:19:55] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 12 ms to minimize.
[2023-03-14 11:19:55] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2023-03-14 11:19:55] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2023-03-14 11:19:55] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2023-03-14 11:19:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1489 ms
[2023-03-14 11:19:55] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 1 ms to minimize.
[2023-03-14 11:19:56] [INFO ] Deduced a trap composed of 133 places in 228 ms of which 1 ms to minimize.
[2023-03-14 11:19:56] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2023-03-14 11:19:56] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 1 ms to minimize.
[2023-03-14 11:19:56] [INFO ] Deduced a trap composed of 132 places in 164 ms of which 1 ms to minimize.
[2023-03-14 11:19:56] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 0 ms to minimize.
[2023-03-14 11:19:57] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 0 ms to minimize.
[2023-03-14 11:19:57] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 0 ms to minimize.
[2023-03-14 11:19:57] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 0 ms to minimize.
[2023-03-14 11:19:57] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 1 ms to minimize.
[2023-03-14 11:19:57] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 0 ms to minimize.
[2023-03-14 11:19:57] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2023-03-14 11:19:57] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 1 ms to minimize.
[2023-03-14 11:19:58] [INFO ] Deduced a trap composed of 128 places in 100 ms of which 0 ms to minimize.
[2023-03-14 11:19:58] [INFO ] Deduced a trap composed of 137 places in 103 ms of which 14 ms to minimize.
[2023-03-14 11:19:58] [INFO ] Deduced a trap composed of 143 places in 101 ms of which 1 ms to minimize.
[2023-03-14 11:19:58] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 1 ms to minimize.
[2023-03-14 11:19:58] [INFO ] Deduced a trap composed of 130 places in 121 ms of which 1 ms to minimize.
[2023-03-14 11:19:58] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 1 ms to minimize.
[2023-03-14 11:19:58] [INFO ] Deduced a trap composed of 128 places in 98 ms of which 0 ms to minimize.
[2023-03-14 11:19:58] [INFO ] Deduced a trap composed of 150 places in 114 ms of which 1 ms to minimize.
[2023-03-14 11:19:59] [INFO ] Deduced a trap composed of 135 places in 103 ms of which 2 ms to minimize.
[2023-03-14 11:19:59] [INFO ] Deduced a trap composed of 135 places in 146 ms of which 7 ms to minimize.
[2023-03-14 11:19:59] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 0 ms to minimize.
[2023-03-14 11:19:59] [INFO ] Deduced a trap composed of 127 places in 99 ms of which 1 ms to minimize.
[2023-03-14 11:19:59] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 1 ms to minimize.
[2023-03-14 11:19:59] [INFO ] Deduced a trap composed of 140 places in 95 ms of which 1 ms to minimize.
[2023-03-14 11:19:59] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2023-03-14 11:20:00] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 0 ms to minimize.
[2023-03-14 11:20:00] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 0 ms to minimize.
[2023-03-14 11:20:00] [INFO ] Deduced a trap composed of 145 places in 106 ms of which 0 ms to minimize.
[2023-03-14 11:20:00] [INFO ] Deduced a trap composed of 125 places in 94 ms of which 1 ms to minimize.
[2023-03-14 11:20:00] [INFO ] Deduced a trap composed of 139 places in 101 ms of which 1 ms to minimize.
[2023-03-14 11:20:00] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 0 ms to minimize.
[2023-03-14 11:20:00] [INFO ] Deduced a trap composed of 134 places in 108 ms of which 1 ms to minimize.
[2023-03-14 11:20:00] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2023-03-14 11:20:01] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 1 ms to minimize.
[2023-03-14 11:20:01] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 0 ms to minimize.
[2023-03-14 11:20:01] [INFO ] Deduced a trap composed of 137 places in 87 ms of which 1 ms to minimize.
[2023-03-14 11:20:01] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 0 ms to minimize.
[2023-03-14 11:20:01] [INFO ] Deduced a trap composed of 136 places in 109 ms of which 1 ms to minimize.
[2023-03-14 11:20:01] [INFO ] Deduced a trap composed of 133 places in 121 ms of which 0 ms to minimize.
[2023-03-14 11:20:01] [INFO ] Deduced a trap composed of 131 places in 95 ms of which 0 ms to minimize.
[2023-03-14 11:20:01] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 7 ms to minimize.
[2023-03-14 11:20:02] [INFO ] Deduced a trap composed of 156 places in 102 ms of which 1 ms to minimize.
[2023-03-14 11:20:02] [INFO ] Deduced a trap composed of 130 places in 105 ms of which 1 ms to minimize.
[2023-03-14 11:20:02] [INFO ] Deduced a trap composed of 133 places in 115 ms of which 0 ms to minimize.
[2023-03-14 11:20:02] [INFO ] Deduced a trap composed of 142 places in 105 ms of which 0 ms to minimize.
[2023-03-14 11:20:02] [INFO ] Deduced a trap composed of 139 places in 119 ms of which 0 ms to minimize.
[2023-03-14 11:20:02] [INFO ] Deduced a trap composed of 123 places in 122 ms of which 0 ms to minimize.
[2023-03-14 11:20:02] [INFO ] Deduced a trap composed of 131 places in 87 ms of which 0 ms to minimize.
[2023-03-14 11:20:03] [INFO ] Deduced a trap composed of 141 places in 99 ms of which 1 ms to minimize.
[2023-03-14 11:20:03] [INFO ] Deduced a trap composed of 143 places in 120 ms of which 0 ms to minimize.
[2023-03-14 11:20:03] [INFO ] Deduced a trap composed of 132 places in 116 ms of which 2 ms to minimize.
[2023-03-14 11:20:03] [INFO ] Deduced a trap composed of 133 places in 113 ms of which 1 ms to minimize.
[2023-03-14 11:20:03] [INFO ] Deduced a trap composed of 139 places in 106 ms of which 2 ms to minimize.
[2023-03-14 11:20:03] [INFO ] Deduced a trap composed of 150 places in 107 ms of which 2 ms to minimize.
[2023-03-14 11:20:03] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 1 ms to minimize.
[2023-03-14 11:20:03] [INFO ] Deduced a trap composed of 132 places in 92 ms of which 1 ms to minimize.
[2023-03-14 11:20:04] [INFO ] Deduced a trap composed of 136 places in 132 ms of which 0 ms to minimize.
[2023-03-14 11:20:04] [INFO ] Deduced a trap composed of 138 places in 106 ms of which 1 ms to minimize.
[2023-03-14 11:20:04] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 1 ms to minimize.
[2023-03-14 11:20:04] [INFO ] Deduced a trap composed of 138 places in 102 ms of which 0 ms to minimize.
[2023-03-14 11:20:04] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2023-03-14 11:20:04] [INFO ] Deduced a trap composed of 137 places in 99 ms of which 0 ms to minimize.
[2023-03-14 11:20:04] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 1 ms to minimize.
[2023-03-14 11:20:05] [INFO ] Deduced a trap composed of 133 places in 140 ms of which 1 ms to minimize.
[2023-03-14 11:20:05] [INFO ] Deduced a trap composed of 135 places in 110 ms of which 1 ms to minimize.
[2023-03-14 11:20:05] [INFO ] Deduced a trap composed of 141 places in 125 ms of which 1 ms to minimize.
[2023-03-14 11:20:05] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 1 ms to minimize.
[2023-03-14 11:20:05] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2023-03-14 11:20:05] [INFO ] Deduced a trap composed of 130 places in 109 ms of which 1 ms to minimize.
[2023-03-14 11:20:06] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 1 ms to minimize.
[2023-03-14 11:20:06] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 0 ms to minimize.
[2023-03-14 11:20:06] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 0 ms to minimize.
[2023-03-14 11:20:06] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 0 ms to minimize.
[2023-03-14 11:20:06] [INFO ] Deduced a trap composed of 129 places in 149 ms of which 1 ms to minimize.
[2023-03-14 11:20:06] [INFO ] Deduced a trap composed of 143 places in 136 ms of which 0 ms to minimize.
[2023-03-14 11:20:06] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 1 ms to minimize.
[2023-03-14 11:20:07] [INFO ] Deduced a trap composed of 127 places in 102 ms of which 1 ms to minimize.
[2023-03-14 11:20:07] [INFO ] Deduced a trap composed of 137 places in 103 ms of which 0 ms to minimize.
[2023-03-14 11:20:07] [INFO ] Deduced a trap composed of 141 places in 114 ms of which 0 ms to minimize.
[2023-03-14 11:20:07] [INFO ] Deduced a trap composed of 136 places in 139 ms of which 1 ms to minimize.
[2023-03-14 11:20:07] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 1 ms to minimize.
[2023-03-14 11:20:07] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 0 ms to minimize.
[2023-03-14 11:20:07] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 0 ms to minimize.
[2023-03-14 11:20:08] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 0 ms to minimize.
[2023-03-14 11:20:08] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 0 ms to minimize.
[2023-03-14 11:20:08] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 1 ms to minimize.
[2023-03-14 11:20:08] [INFO ] Deduced a trap composed of 143 places in 123 ms of which 0 ms to minimize.
[2023-03-14 11:20:08] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 1 ms to minimize.
[2023-03-14 11:20:08] [INFO ] Deduced a trap composed of 130 places in 102 ms of which 1 ms to minimize.
[2023-03-14 11:20:08] [INFO ] Deduced a trap composed of 130 places in 95 ms of which 0 ms to minimize.
[2023-03-14 11:20:08] [INFO ] Deduced a trap composed of 128 places in 96 ms of which 0 ms to minimize.
[2023-03-14 11:20:09] [INFO ] Deduced a trap composed of 134 places in 149 ms of which 0 ms to minimize.
[2023-03-14 11:20:09] [INFO ] Deduced a trap composed of 142 places in 128 ms of which 0 ms to minimize.
[2023-03-14 11:20:09] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2023-03-14 11:20:09] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-14 11:20:09] [INFO ] Deduced a trap composed of 130 places in 169 ms of which 1 ms to minimize.
[2023-03-14 11:20:09] [INFO ] Deduced a trap composed of 136 places in 119 ms of which 1 ms to minimize.
[2023-03-14 11:20:10] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 1 ms to minimize.
[2023-03-14 11:20:10] [INFO ] Deduced a trap composed of 130 places in 88 ms of which 1 ms to minimize.
[2023-03-14 11:20:10] [INFO ] Deduced a trap composed of 135 places in 93 ms of which 0 ms to minimize.
[2023-03-14 11:20:10] [INFO ] Deduced a trap composed of 133 places in 99 ms of which 0 ms to minimize.
[2023-03-14 11:20:10] [INFO ] Deduced a trap composed of 137 places in 101 ms of which 1 ms to minimize.
[2023-03-14 11:20:10] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 0 ms to minimize.
[2023-03-14 11:20:10] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 0 ms to minimize.
[2023-03-14 11:20:11] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 0 ms to minimize.
[2023-03-14 11:20:11] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 1 ms to minimize.
[2023-03-14 11:20:11] [INFO ] Deduced a trap composed of 135 places in 102 ms of which 1 ms to minimize.
[2023-03-14 11:20:11] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 1 ms to minimize.
[2023-03-14 11:20:11] [INFO ] Deduced a trap composed of 130 places in 129 ms of which 1 ms to minimize.
[2023-03-14 11:20:11] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 0 ms to minimize.
[2023-03-14 11:20:11] [INFO ] Deduced a trap composed of 124 places in 104 ms of which 1 ms to minimize.
[2023-03-14 11:20:11] [INFO ] Trap strengthening (SAT) tested/added 115/114 trap constraints in 16274 ms
[2023-03-14 11:20:12] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2023-03-14 11:20:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-14 11:20:12] [INFO ] After 18349ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :4
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-14 11:20:12] [INFO ] After 18751ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :4
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 38 ms.
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 333 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 132 place count 573 transition count 389
Reduce places removed 130 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 131 rules applied. Total rules applied 263 place count 443 transition count 388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 442 transition count 388
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 264 place count 442 transition count 301
Deduced a syphon composed of 87 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 191 rules applied. Total rules applied 455 place count 338 transition count 301
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 530 place count 263 transition count 226
Iterating global reduction 3 with 75 rules applied. Total rules applied 605 place count 263 transition count 226
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 605 place count 263 transition count 218
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 623 place count 253 transition count 218
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 803 place count 162 transition count 129
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 805 place count 161 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 807 place count 161 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 809 place count 159 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 810 place count 159 transition count 131
Applied a total of 810 rules in 154 ms. Remains 159 /585 variables (removed 426) and now considering 131/528 (removed 397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 159/585 places, 131/528 transitions.
Finished random walk after 729 steps, including 34 resets, run visited all 2 properties in 10 ms. (steps per millisecond=72 )
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 20724 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 13
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 593 places, 536 transitions, 1582 arcs.
Final Score: 28504.48
Took : 19 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 13846360 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16107172 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 ReachabilityFireability -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-13"
export BK_EXAMINATION="ReachabilityFireability"
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-13, examination is ReachabilityFireability"
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-167813697000551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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