About the Execution of Marcie+red for BusinessProcesses-PT-17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6724.892 | 161290.00 | 192688.00 | 157.90 | TFTTTTTFFTTTTTFT | normal |
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.r042-tajo-167813696000583.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 marciexred
Input is BusinessProcesses-PT-17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000583
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 161K 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-17-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678734585119
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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:09:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:09:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:09:47] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-13 19:09:47] [INFO ] Transformed 650 places.
[2023-03-13 19:09:47] [INFO ] Transformed 580 transitions.
[2023-03-13 19:09:47] [INFO ] Found NUPN structural information;
[2023-03-13 19:09:47] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 505 ms. (steps per millisecond=19 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 576 rows 646 cols
[2023-03-13 19:09:48] [INFO ] Computed 108 place invariants in 34 ms
[2023-03-13 19:09:48] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned sat
[2023-03-13 19:09:48] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2023-03-13 19:09:49] [INFO ] After 220ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-13 19:09:49] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 9 ms to minimize.
[2023-03-13 19:09:49] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2023-03-13 19:09:49] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2023-03-13 19:09:49] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2023-03-13 19:09:49] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 5 ms to minimize.
[2023-03-13 19:09:50] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 1 ms to minimize.
[2023-03-13 19:09:50] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2023-03-13 19:09:50] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-03-13 19:09:50] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2023-03-13 19:09:50] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2023-03-13 19:09:50] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 10 ms to minimize.
[2023-03-13 19:09:50] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2023-03-13 19:09:51] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 0 ms to minimize.
[2023-03-13 19:09:51] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-13 19:09:51] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 1 ms to minimize.
[2023-03-13 19:09:51] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2023-03-13 19:09:51] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
[2023-03-13 19:09:51] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2023-03-13 19:09:51] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2023-03-13 19:09:52] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2023-03-13 19:09:52] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-03-13 19:09:52] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2023-03-13 19:09:52] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2023-03-13 19:09:52] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2023-03-13 19:09:52] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2023-03-13 19:09:52] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2023-03-13 19:09:52] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2023-03-13 19:09:52] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3712 ms
[2023-03-13 19:09:52] [INFO ] After 3959ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 19:09:52] [INFO ] After 4480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 19:09:53] [INFO ] [Nat]Absence check using 62 positive place invariants in 35 ms returned sat
[2023-03-13 19:09:53] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 19 ms returned sat
[2023-03-13 19:09:54] [INFO ] After 1373ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-13 19:09:54] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2023-03-13 19:09:54] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 12 ms to minimize.
[2023-03-13 19:09:55] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 1 ms to minimize.
[2023-03-13 19:09:55] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2023-03-13 19:09:55] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 1 ms to minimize.
[2023-03-13 19:09:55] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2023-03-13 19:09:55] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2023-03-13 19:09:55] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 3 ms to minimize.
[2023-03-13 19:09:56] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2023-03-13 19:09:56] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 0 ms to minimize.
[2023-03-13 19:09:56] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2023-03-13 19:09:56] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2023-03-13 19:09:56] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2023-03-13 19:09:56] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2023-03-13 19:09:56] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2023-03-13 19:09:56] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 0 ms to minimize.
[2023-03-13 19:09:57] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 1 ms to minimize.
[2023-03-13 19:09:57] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 0 ms to minimize.
[2023-03-13 19:09:57] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 0 ms to minimize.
[2023-03-13 19:09:57] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2023-03-13 19:09:57] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 0 ms to minimize.
[2023-03-13 19:09:57] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2023-03-13 19:09:57] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 0 ms to minimize.
[2023-03-13 19:09:57] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2023-03-13 19:09:58] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2023-03-13 19:09:58] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2023-03-13 19:09:58] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 0 ms to minimize.
[2023-03-13 19:09:58] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2023-03-13 19:09:58] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2023-03-13 19:09:58] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3913 ms
[2023-03-13 19:09:58] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 11 ms to minimize.
[2023-03-13 19:09:58] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2023-03-13 19:09:59] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 1 ms to minimize.
[2023-03-13 19:09:59] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2023-03-13 19:09:59] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 0 ms to minimize.
[2023-03-13 19:09:59] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 0 ms to minimize.
[2023-03-13 19:09:59] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 0 ms to minimize.
[2023-03-13 19:09:59] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 1 ms to minimize.
[2023-03-13 19:10:00] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 1 ms to minimize.
[2023-03-13 19:10:00] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2023-03-13 19:10:00] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 1 ms to minimize.
[2023-03-13 19:10:00] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2023-03-13 19:10:00] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 1 ms to minimize.
[2023-03-13 19:10:00] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2023-03-13 19:10:00] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2023-03-13 19:10:01] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 0 ms to minimize.
[2023-03-13 19:10:01] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2023-03-13 19:10:01] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 0 ms to minimize.
[2023-03-13 19:10:01] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 0 ms to minimize.
[2023-03-13 19:10:01] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 0 ms to minimize.
[2023-03-13 19:10:01] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 1 ms to minimize.
[2023-03-13 19:10:01] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2023-03-13 19:10:02] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 0 ms to minimize.
[2023-03-13 19:10:02] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 0 ms to minimize.
[2023-03-13 19:10:02] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3528 ms
[2023-03-13 19:10:02] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2023-03-13 19:10:02] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 0 ms to minimize.
[2023-03-13 19:10:02] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2023-03-13 19:10:02] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2023-03-13 19:10:02] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2023-03-13 19:10:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 468 ms
[2023-03-13 19:10:03] [INFO ] Deduced a trap composed of 134 places in 189 ms of which 1 ms to minimize.
[2023-03-13 19:10:03] [INFO ] Deduced a trap composed of 119 places in 153 ms of which 1 ms to minimize.
[2023-03-13 19:10:03] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 0 ms to minimize.
[2023-03-13 19:10:03] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:10:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 770 ms
[2023-03-13 19:10:04] [INFO ] Deduced a trap composed of 135 places in 199 ms of which 1 ms to minimize.
[2023-03-13 19:10:04] [INFO ] Deduced a trap composed of 145 places in 166 ms of which 0 ms to minimize.
[2023-03-13 19:10:04] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 0 ms to minimize.
[2023-03-13 19:10:04] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 0 ms to minimize.
[2023-03-13 19:10:04] [INFO ] Deduced a trap composed of 146 places in 137 ms of which 0 ms to minimize.
[2023-03-13 19:10:04] [INFO ] Deduced a trap composed of 150 places in 139 ms of which 0 ms to minimize.
[2023-03-13 19:10:05] [INFO ] Deduced a trap composed of 161 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:10:05] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 1 ms to minimize.
[2023-03-13 19:10:05] [INFO ] Deduced a trap composed of 143 places in 203 ms of which 1 ms to minimize.
[2023-03-13 19:10:05] [INFO ] Deduced a trap composed of 148 places in 140 ms of which 1 ms to minimize.
[2023-03-13 19:10:05] [INFO ] Deduced a trap composed of 155 places in 125 ms of which 0 ms to minimize.
[2023-03-13 19:10:06] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 0 ms to minimize.
[2023-03-13 19:10:06] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 0 ms to minimize.
[2023-03-13 19:10:06] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 1 ms to minimize.
[2023-03-13 19:10:06] [INFO ] Deduced a trap composed of 156 places in 138 ms of which 0 ms to minimize.
[2023-03-13 19:10:06] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 0 ms to minimize.
[2023-03-13 19:10:07] [INFO ] Deduced a trap composed of 155 places in 142 ms of which 0 ms to minimize.
[2023-03-13 19:10:07] [INFO ] Deduced a trap composed of 168 places in 127 ms of which 1 ms to minimize.
[2023-03-13 19:10:07] [INFO ] Deduced a trap composed of 168 places in 135 ms of which 0 ms to minimize.
[2023-03-13 19:10:07] [INFO ] Deduced a trap composed of 151 places in 124 ms of which 0 ms to minimize.
[2023-03-13 19:10:07] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 0 ms to minimize.
[2023-03-13 19:10:07] [INFO ] Deduced a trap composed of 148 places in 123 ms of which 0 ms to minimize.
[2023-03-13 19:10:08] [INFO ] Deduced a trap composed of 159 places in 124 ms of which 0 ms to minimize.
[2023-03-13 19:10:08] [INFO ] Deduced a trap composed of 150 places in 119 ms of which 1 ms to minimize.
[2023-03-13 19:10:08] [INFO ] Deduced a trap composed of 157 places in 140 ms of which 0 ms to minimize.
[2023-03-13 19:10:08] [INFO ] Deduced a trap composed of 159 places in 163 ms of which 1 ms to minimize.
[2023-03-13 19:10:08] [INFO ] Deduced a trap composed of 162 places in 136 ms of which 0 ms to minimize.
[2023-03-13 19:10:09] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 1 ms to minimize.
[2023-03-13 19:10:09] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:10:09] [INFO ] Deduced a trap composed of 148 places in 123 ms of which 0 ms to minimize.
[2023-03-13 19:10:09] [INFO ] Deduced a trap composed of 146 places in 149 ms of which 1 ms to minimize.
[2023-03-13 19:10:10] [INFO ] Deduced a trap composed of 143 places in 162 ms of which 0 ms to minimize.
[2023-03-13 19:10:10] [INFO ] Deduced a trap composed of 134 places in 149 ms of which 0 ms to minimize.
[2023-03-13 19:10:10] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 1 ms to minimize.
[2023-03-13 19:10:10] [INFO ] Deduced a trap composed of 143 places in 130 ms of which 0 ms to minimize.
[2023-03-13 19:10:10] [INFO ] Deduced a trap composed of 147 places in 156 ms of which 1 ms to minimize.
[2023-03-13 19:10:11] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 0 ms to minimize.
[2023-03-13 19:10:11] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 1 ms to minimize.
[2023-03-13 19:10:11] [INFO ] Deduced a trap composed of 136 places in 144 ms of which 1 ms to minimize.
[2023-03-13 19:10:11] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 1 ms to minimize.
[2023-03-13 19:10:12] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 1 ms to minimize.
[2023-03-13 19:10:12] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:10:12] [INFO ] Deduced a trap composed of 139 places in 103 ms of which 0 ms to minimize.
[2023-03-13 19:10:12] [INFO ] Deduced a trap composed of 140 places in 110 ms of which 1 ms to minimize.
[2023-03-13 19:10:12] [INFO ] Deduced a trap composed of 141 places in 109 ms of which 0 ms to minimize.
[2023-03-13 19:10:12] [INFO ] Deduced a trap composed of 140 places in 134 ms of which 1 ms to minimize.
[2023-03-13 19:10:12] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 0 ms to minimize.
[2023-03-13 19:10:13] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 1 ms to minimize.
[2023-03-13 19:10:13] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 1 ms to minimize.
[2023-03-13 19:10:13] [INFO ] Deduced a trap composed of 139 places in 113 ms of which 1 ms to minimize.
[2023-03-13 19:10:13] [INFO ] Deduced a trap composed of 145 places in 118 ms of which 0 ms to minimize.
[2023-03-13 19:10:13] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 0 ms to minimize.
[2023-03-13 19:10:13] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 1 ms to minimize.
[2023-03-13 19:10:13] [INFO ] Deduced a trap composed of 142 places in 117 ms of which 1 ms to minimize.
[2023-03-13 19:10:14] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 1 ms to minimize.
[2023-03-13 19:10:14] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 0 ms to minimize.
[2023-03-13 19:10:14] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 1 ms to minimize.
[2023-03-13 19:10:14] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 1 ms to minimize.
[2023-03-13 19:10:14] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 1 ms to minimize.
[2023-03-13 19:10:15] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 1 ms to minimize.
[2023-03-13 19:10:15] [INFO ] Deduced a trap composed of 145 places in 178 ms of which 1 ms to minimize.
[2023-03-13 19:10:15] [INFO ] Deduced a trap composed of 142 places in 163 ms of which 0 ms to minimize.
[2023-03-13 19:10:15] [INFO ] Deduced a trap composed of 145 places in 160 ms of which 1 ms to minimize.
[2023-03-13 19:10:15] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 1 ms to minimize.
[2023-03-13 19:10:16] [INFO ] Deduced a trap composed of 139 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:10:16] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:10:16] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 1 ms to minimize.
[2023-03-13 19:10:16] [INFO ] Deduced a trap composed of 138 places in 160 ms of which 1 ms to minimize.
[2023-03-13 19:10:16] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 0 ms to minimize.
[2023-03-13 19:10:17] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 0 ms to minimize.
[2023-03-13 19:10:17] [INFO ] Deduced a trap composed of 140 places in 175 ms of which 0 ms to minimize.
[2023-03-13 19:10:17] [INFO ] Deduced a trap composed of 139 places in 180 ms of which 0 ms to minimize.
[2023-03-13 19:10:17] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 1 ms to minimize.
[2023-03-13 19:10:17] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 19:10:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 19:10:17] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 137 ms.
Support contains 123 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 642 transition count 518
Reduce places removed 57 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 71 rules applied. Total rules applied 129 place count 585 transition count 504
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 143 place count 571 transition count 504
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 143 place count 571 transition count 403
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 356 place count 459 transition count 403
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 411 place count 404 transition count 348
Iterating global reduction 3 with 55 rules applied. Total rules applied 466 place count 404 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 466 place count 404 transition count 347
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 468 place count 403 transition count 347
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 602 place count 336 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 603 place count 336 transition count 279
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 604 place count 336 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 605 place count 335 transition count 278
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 609 place count 335 transition count 278
Applied a total of 609 rules in 166 ms. Remains 335 /646 variables (removed 311) and now considering 278/576 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 335/646 places, 278/576 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 536327 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{0=1, 3=1, 4=1, 7=1}
Probabilistic random walk after 536327 steps, saw 91320 distinct states, run finished after 3002 ms. (steps per millisecond=178 ) properties seen :4
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 278 rows 335 cols
[2023-03-13 19:10:21] [INFO ] Computed 94 place invariants in 31 ms
[2023-03-13 19:10:22] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:10:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 11 ms returned sat
[2023-03-13 19:10:22] [INFO ] [Nat]Absence check using 62 positive and 32 generalized place invariants in 5 ms returned sat
[2023-03-13 19:10:22] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:10:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 19:10:22] [INFO ] After 310ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:10:23] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2023-03-13 19:10:23] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2023-03-13 19:10:23] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2023-03-13 19:10:23] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 0 ms to minimize.
[2023-03-13 19:10:23] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2023-03-13 19:10:23] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 1 ms to minimize.
[2023-03-13 19:10:24] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 0 ms to minimize.
[2023-03-13 19:10:24] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 0 ms to minimize.
[2023-03-13 19:10:24] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 1 ms to minimize.
[2023-03-13 19:10:24] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2023-03-13 19:10:24] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 1 ms to minimize.
[2023-03-13 19:10:24] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2023-03-13 19:10:24] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2023-03-13 19:10:25] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2023-03-13 19:10:25] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2099 ms
[2023-03-13 19:10:25] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2023-03-13 19:10:25] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2023-03-13 19:10:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2023-03-13 19:10:25] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 1 ms to minimize.
[2023-03-13 19:10:25] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-13 19:10:25] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2023-03-13 19:10:25] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2023-03-13 19:10:26] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 1 ms to minimize.
[2023-03-13 19:10:26] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 0 ms to minimize.
[2023-03-13 19:10:26] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-03-13 19:10:26] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2023-03-13 19:10:26] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2023-03-13 19:10:26] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 1 ms to minimize.
[2023-03-13 19:10:27] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 13 ms to minimize.
[2023-03-13 19:10:27] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 7 ms to minimize.
[2023-03-13 19:10:27] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 0 ms to minimize.
[2023-03-13 19:10:27] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2023-03-13 19:10:27] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2023-03-13 19:10:27] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 1 ms to minimize.
[2023-03-13 19:10:28] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 5 ms to minimize.
[2023-03-13 19:10:28] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 1 ms to minimize.
[2023-03-13 19:10:28] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 1 ms to minimize.
[2023-03-13 19:10:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 3277 ms
[2023-03-13 19:10:28] [INFO ] After 6120ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-13 19:10:28] [INFO ] After 6854ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 64 out of 335 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 335/335 places, 278/278 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 335 transition count 270
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 327 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 326 transition count 269
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 18 place count 326 transition count 257
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 44 place count 312 transition count 257
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 52 place count 304 transition count 249
Iterating global reduction 3 with 8 rules applied. Total rules applied 60 place count 304 transition count 249
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 14 ms
Ensure Unique test removed 2 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 142 place count 262 transition count 209
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 262 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 261 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 260 transition count 208
Applied a total of 145 rules in 81 ms. Remains 260 /335 variables (removed 75) and now considering 208/278 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 260/335 places, 208/278 transitions.
Incomplete random walk after 10000 steps, including 257 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 899518 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 899518 steps, saw 141623 distinct states, run finished after 3002 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 208 rows 260 cols
[2023-03-13 19:10:32] [INFO ] Computed 89 place invariants in 7 ms
[2023-03-13 19:10:32] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:10:32] [INFO ] [Nat]Absence check using 58 positive place invariants in 8 ms returned sat
[2023-03-13 19:10:32] [INFO ] [Nat]Absence check using 58 positive and 31 generalized place invariants in 5 ms returned sat
[2023-03-13 19:10:32] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:10:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 19:10:32] [INFO ] After 78ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:10:32] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-13 19:10:32] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 0 ms to minimize.
[2023-03-13 19:10:33] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2023-03-13 19:10:33] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2023-03-13 19:10:33] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-13 19:10:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 595 ms
[2023-03-13 19:10:33] [INFO ] After 813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-13 19:10:33] [INFO ] After 1140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 64 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 208/208 transitions.
Applied a total of 0 rules in 15 ms. Remains 260 /260 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 260/260 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 208/208 transitions.
Applied a total of 0 rules in 13 ms. Remains 260 /260 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2023-03-13 19:10:33] [INFO ] Invariant cache hit.
[2023-03-13 19:10:33] [INFO ] Implicit Places using invariants in 264 ms returned [34, 39, 41, 43, 45, 47, 49, 51, 76, 78, 80, 82, 85, 89, 90, 91, 92, 93, 198, 210, 214]
Discarding 21 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 267 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 239/260 places, 206/208 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 237 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 237 transition count 201
Applied a total of 4 rules in 15 ms. Remains 237 /239 variables (removed 2) and now considering 201/206 (removed 5) transitions.
// Phase 1: matrix 201 rows 237 cols
[2023-03-13 19:10:33] [INFO ] Computed 70 place invariants in 2 ms
[2023-03-13 19:10:34] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-13 19:10:34] [INFO ] Invariant cache hit.
[2023-03-13 19:10:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 19:10:34] [INFO ] Implicit Places using invariants and state equation in 207 ms returned [157, 159, 161, 163]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 530 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 233/260 places, 201/208 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 232 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 231 transition count 199
Applied a total of 4 rules in 13 ms. Remains 231 /233 variables (removed 2) and now considering 199/201 (removed 2) transitions.
// Phase 1: matrix 199 rows 231 cols
[2023-03-13 19:10:34] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-13 19:10:34] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-13 19:10:34] [INFO ] Invariant cache hit.
[2023-03-13 19:10:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 19:10:34] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 231/260 places, 199/208 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1213 ms. Remains : 231/260 places, 199/208 transitions.
Incomplete random walk after 10000 steps, including 263 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 783739 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :{}
Probabilistic random walk after 783739 steps, saw 132204 distinct states, run finished after 3003 ms. (steps per millisecond=260 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 19:10:37] [INFO ] Invariant cache hit.
[2023-03-13 19:10:37] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:10:38] [INFO ] [Nat]Absence check using 48 positive place invariants in 10 ms returned sat
[2023-03-13 19:10:38] [INFO ] [Nat]Absence check using 48 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-13 19:10:38] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:10:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 19:10:38] [INFO ] After 112ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:10:38] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 1 ms to minimize.
[2023-03-13 19:10:38] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 0 ms to minimize.
[2023-03-13 19:10:38] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2023-03-13 19:10:38] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-13 19:10:38] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2023-03-13 19:10:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 588 ms
[2023-03-13 19:10:39] [INFO ] After 807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-13 19:10:39] [INFO ] After 1211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 64 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 199/199 transitions.
Applied a total of 0 rules in 16 ms. Remains 231 /231 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 231/231 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 199/199 transitions.
Applied a total of 0 rules in 10 ms. Remains 231 /231 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-13 19:10:39] [INFO ] Invariant cache hit.
[2023-03-13 19:10:39] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-13 19:10:39] [INFO ] Invariant cache hit.
[2023-03-13 19:10:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 19:10:39] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-13 19:10:39] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-13 19:10:39] [INFO ] Invariant cache hit.
[2023-03-13 19:10:39] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 231/231 places, 199/199 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 230 transition count 198
Applied a total of 2 rules in 14 ms. Remains 230 /231 variables (removed 1) and now considering 198/199 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 198 rows 230 cols
[2023-03-13 19:10:39] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-13 19:10:39] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:10:39] [INFO ] [Nat]Absence check using 48 positive place invariants in 9 ms returned sat
[2023-03-13 19:10:39] [INFO ] [Nat]Absence check using 48 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-13 19:10:40] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:10:40] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2023-03-13 19:10:40] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 0 ms to minimize.
[2023-03-13 19:10:40] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 0 ms to minimize.
[2023-03-13 19:10:40] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 0 ms to minimize.
[2023-03-13 19:10:40] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2023-03-13 19:10:40] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-13 19:10:41] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2023-03-13 19:10:41] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 0 ms to minimize.
[2023-03-13 19:10:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1035 ms
[2023-03-13 19:10:41] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2023-03-13 19:10:41] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-13 19:10:41] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-13 19:10:41] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2023-03-13 19:10:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 252 ms
[2023-03-13 19:10:41] [INFO ] After 1586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-13 19:10:41] [INFO ] After 1775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:10:41] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-13 19:10:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 231 places, 199 transitions and 815 arcs took 3 ms.
[2023-03-13 19:10:41] [INFO ] Flatten gal took : 56 ms
Total runtime 54948 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: BusinessProcesses_PT_17
(NrP: 231 NrTr: 199 NrArc: 815)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec
net check time: 0m 0.000sec
init dd package: 0m 3.163sec
RS generation: 0m28.289sec
-> reachability set: #nodes 504474 (5.0e+05) #states 3,569,589,881 (9)
starting MCC model checker
--------------------------
checking: EF [[p173<=1 & 1<=p173]]
normalized: E [true U [p173<=1 & 1<=p173]]
abstracting: (1<=p173)
states: 115,706,880 (8)
abstracting: (p173<=1)
states: 3,569,589,881 (9)
-> the formula is TRUE
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m44.076sec
checking: EF [[[[[[[[p19<=0 & 0<=p19] & [p150<=0 & 0<=p150]] | [[p154<=0 & 0<=p154] & [p106<=0 & 0<=p106]]] | [[[p9<=1 & 1<=p9] & [[p149<=1 & 1<=p149] & [p205<=1 & 1<=p205]]] | [[[[p14<=0 & 0<=p14] & [p153<=0 & 0<=p153]] & [[p109<=0 & 0<=p109] & [[p21<=1 & 1<=p21] & [p115<=1 & 1<=p115]]]] & [[[p205<=1 & 1<=p205] & [p31<=1 & 1<=p31]] & [[p183<=1 & 1<=p183] & [[p94<=0 & 0<=p94] & [[[p38<=1 & 1<=p38] & [[p99<=1 & 1<=p99] & [p216<=1 & 1<=p216]]] | [[p76<=1 & 1<=p76] & [p48<=1 & 1<=p48]]]]]]]]] & [[p140<=1 & 1<=p140] | [[p143<=1 & 1<=p143] & [p35<=1 & 1<=p35]]]] & [[[p135<=0 & 0<=p135] & [[p190<=0 & 0<=p190] | [p51<=0 & 0<=p51]]] | [[[p100<=1 & 1<=p100] & [p195<=1 & 1<=p195]] & [[p113<=0 & 0<=p113] & [[p40<=0 & 0<=p40] | [[p112<=0 & 0<=p112] | [p181<=0 & 0<=p181]]]]]]] & [[p193<=0 & 0<=p193] & [[[[p54<=1 & 1<=p54] | [p1<=0 & 0<=p1]] | [[p16<=1 & 1<=p16] | [[[p166<=0 & 0<=p166] & [[p38<=0 & 0<=p38] | [[p99<=0 & 0<=p99] | [p216<=0 & 0<=p216]]]] | [[[p39<=1 & 1<=p39] & [[p116<=1 & 1<=p116] & [p182<=1 & 1<=p182]]] & [[[p25<=0 & 0<=p25] & [p72<=0 & 0<=p72]] & [[[p66<=0 & 0<=p66] | [[p83<=0 & 0<=p83] | [p205<=0 & 0<=p205]]] & [[p188<=0 & 0<=p188] | [p44<=0 & 0<=p44]]]]]]]] & [[p177<=1 & 1<=p177] | [[[p186<=0 & 0<=p186] | [[p28<=0 & 0<=p28] | [p174<=0 & 0<=p174]]] & [[[p73<=1 & 1<=p73] | [[[p199<=1 & 1<=p199] & [p196<=1 & 1<=p196]] & [[p7<=1 & 1<=p7] & [[p86<=1 & 1<=p86] & [p169<=1 & 1<=p169]]]]] & [[p56<=1 & 1<=p56] | [[[[p36<=1 & 1<=p36] & [p116<=1 & 1<=p116]] & [[p223<=1 & 1<=p223] & [[p90<=1 & 1<=p90] | [p205<=1 & 1<=p205]]]] | [[p200<=0 & 0<=p200] & [[p222<=1 & 1<=p222] & [[p27<=0 & 0<=p27] | [[p99<=0 & 0<=p99] | [p216<=0 & 0<=p216]]]]]]]]]]]]]]
normalized: E [true U [[[[[[[[[[[[[p99<=0 & 0<=p99] | [p216<=0 & 0<=p216]] | [p27<=0 & 0<=p27]] & [p222<=1 & 1<=p222]] & [p200<=0 & 0<=p200]] | [[[[p205<=1 & 1<=p205] | [p90<=1 & 1<=p90]] & [p223<=1 & 1<=p223]] & [[p116<=1 & 1<=p116] & [p36<=1 & 1<=p36]]]] | [p56<=1 & 1<=p56]] & [[[[[p169<=1 & 1<=p169] & [p86<=1 & 1<=p86]] & [p7<=1 & 1<=p7]] & [[p196<=1 & 1<=p196] & [p199<=1 & 1<=p199]]] | [p73<=1 & 1<=p73]]] & [[[p174<=0 & 0<=p174] | [p28<=0 & 0<=p28]] | [p186<=0 & 0<=p186]]] | [p177<=1 & 1<=p177]] & [[[[[[[[p44<=0 & 0<=p44] | [p188<=0 & 0<=p188]] & [[[p205<=0 & 0<=p205] | [p83<=0 & 0<=p83]] | [p66<=0 & 0<=p66]]] & [[p72<=0 & 0<=p72] & [p25<=0 & 0<=p25]]] & [[[p182<=1 & 1<=p182] & [p116<=1 & 1<=p116]] & [p39<=1 & 1<=p39]]] | [[[[p216<=0 & 0<=p216] | [p99<=0 & 0<=p99]] | [p38<=0 & 0<=p38]] & [p166<=0 & 0<=p166]]] | [p16<=1 & 1<=p16]] | [[p1<=0 & 0<=p1] | [p54<=1 & 1<=p54]]]] & [p193<=0 & 0<=p193]] & [[[[[[[p181<=0 & 0<=p181] | [p112<=0 & 0<=p112]] | [p40<=0 & 0<=p40]] & [p113<=0 & 0<=p113]] & [[p195<=1 & 1<=p195] & [p100<=1 & 1<=p100]]] | [[[p51<=0 & 0<=p51] | [p190<=0 & 0<=p190]] & [p135<=0 & 0<=p135]]] & [[[[p35<=1 & 1<=p35] & [p143<=1 & 1<=p143]] | [p140<=1 & 1<=p140]] & [[[[[[[[[p48<=1 & 1<=p48] & [p76<=1 & 1<=p76]] | [[[p216<=1 & 1<=p216] & [p99<=1 & 1<=p99]] & [p38<=1 & 1<=p38]]] & [p94<=0 & 0<=p94]] & [p183<=1 & 1<=p183]] & [[p31<=1 & 1<=p31] & [p205<=1 & 1<=p205]]] & [[[[p115<=1 & 1<=p115] & [p21<=1 & 1<=p21]] & [p109<=0 & 0<=p109]] & [[p153<=0 & 0<=p153] & [p14<=0 & 0<=p14]]]] | [[[p205<=1 & 1<=p205] & [p149<=1 & 1<=p149]] & [p9<=1 & 1<=p9]]] | [[[p106<=0 & 0<=p106] & [p154<=0 & 0<=p154]] | [[p150<=0 & 0<=p150] & [p19<=0 & 0<=p19]]]]]]]]
abstracting: (0<=p19)
states: 3,569,589,881 (9)
abstracting: (p19<=0)
states: 3,438,745,721 (9)
abstracting: (0<=p150)
states: 3,569,589,881 (9)
abstracting: (p150<=0)
states: 2,140,133,525 (9)
abstracting: (0<=p154)
states: 3,569,589,881 (9)
abstracting: (p154<=0)
states: 2,858,004,278 (9)
abstracting: (0<=p106)
states: 3,569,589,881 (9)
abstracting: (p106<=0)
states: 2,716,734,233 (9)
abstracting: (1<=p9)
states: 1,783,508,438 (9)
abstracting: (p9<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p149)
states: 2,667,736 (6)
abstracting: (p149<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p205)
states: 396,928,196 (8)
abstracting: (p205<=1)
states: 3,569,589,881 (9)
abstracting: (0<=p14)
states: 3,569,589,881 (9)
abstracting: (p14<=0)
states: 2,501,524,674 (9)
abstracting: (0<=p153)
states: 3,569,589,881 (9)
abstracting: (p153<=0)
states: 2,142,376,595 (9)
abstracting: (0<=p109)
states: 3,569,589,881 (9)
abstracting: (p109<=0)
states: 2,716,734,233 (9)
abstracting: (1<=p21)
states: 2,886,750,131 (9)
abstracting: (p21<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p115)
states: 429,857,280 (8)
abstracting: (p115<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p205)
states: 396,928,196 (8)
abstracting: (p205<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p31)
states: 41,057,280 (7)
abstracting: (p31<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p183)
states: 41,057,280 (7)
abstracting: (p183<=1)
states: 3,569,589,881 (9)
abstracting: (0<=p94)
states: 3,569,589,881 (9)
abstracting: (p94<=0)
states: 2,384,458,073 (9)
abstracting: (1<=p38)
states: 47,900,160 (7)
abstracting: (p38<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p99)
states: 1,415,050,992 (9)
abstracting: (p99<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p216)
states: 47,900,160 (7)
abstracting: (p216<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p76)
states: 846
abstracting: (p76<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p48)
states: 1,060,750,080 (9)
abstracting: (p48<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p140)
states: 23,026,047 (7)
abstracting: (p140<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p143)
states: 1,767,599,280 (9)
abstracting: (p143<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p35)
states: 682,499,520 (8)
abstracting: (p35<=1)
states: 3,569,589,881 (9)
abstracting: (0<=p135)
states: 3,569,589,881 (9)
abstracting: (p135<=0)
states: 3,546,565,899 (9)
abstracting: (0<=p190)
states: 3,569,589,881 (9)
abstracting: (p190<=0)
states: 3,558,755,321 (9)
abstracting: (0<=p51)
states: 3,569,589,881 (9)
abstracting: (p51<=0)
states: 2,424,703,481 (9)
abstracting: (1<=p100)
states: 1,250,644,320 (9)
abstracting: (p100<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p195)
states: 10,834,560 (7)
abstracting: (p195<=1)
states: 3,569,589,881 (9)
abstracting: (0<=p113)
states: 3,569,589,881 (9)
abstracting: (p113<=0)
states: 2,897,328,273 (9)
abstracting: (0<=p40)
states: 3,569,589,881 (9)
abstracting: (p40<=0)
states: 3,521,689,721 (9)
abstracting: (0<=p112)
states: 3,569,589,881 (9)
abstracting: (p112<=0)
states: 2,029,280,189 (9)
abstracting: (0<=p181)
states: 3,569,589,881 (9)
abstracting: (p181<=0)
states: 3,549,061,241 (9)
abstracting: (0<=p193)
states: 3,569,589,881 (9)
abstracting: (p193<=0)
states: 3,558,755,321 (9)
abstracting: (1<=p54)
states: 1,140,480 (6)
abstracting: (p54<=1)
states: 3,569,589,881 (9)
abstracting: (0<=p1)
states: 3,569,589,881 (9)
abstracting: (p1<=0)
states: 3,568,828,471 (9)
abstracting: (1<=p16)
states: 181,555,015 (8)
abstracting: (p16<=1)
states: 3,569,589,881 (9)
abstracting: (0<=p166)
states: 3,569,589,881 (9)
abstracting: (p166<=0)
states: 3,568,449,401 (9)
abstracting: (0<=p38)
states: 3,569,589,881 (9)
abstracting: (p38<=0)
states: 3,521,689,721 (9)
abstracting: (0<=p99)
states: 3,569,589,881 (9)
abstracting: (p99<=0)
states: 2,154,538,889 (9)
abstracting: (0<=p216)
states: 3,569,589,881 (9)
abstracting: (p216<=0)
states: 3,521,689,721 (9)
abstracting: (1<=p39)
states: 51,321,600 (7)
abstracting: (p39<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p116)
states: 1,233,727,688 (9)
abstracting: (p116<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p182)
states: 20,528,640 (7)
abstracting: (p182<=1)
states: 3,569,589,881 (9)
abstracting: (0<=p25)
states: 3,569,589,881 (9)
abstracting: (p25<=0)
states: 3,528,532,601 (9)
abstracting: (0<=p72)
states: 3,569,589,881 (9)
abstracting: (p72<=0)
states: 3,568,538,861 (9)
abstracting: (0<=p66)
states: 3,569,589,881 (9)
abstracting: (p66<=0)
states: 1,770,761,540 (9)
abstracting: (0<=p83)
states: 3,569,589,881 (9)
abstracting: (p83<=0)
states: 3,558,163,481 (9)
abstracting: (0<=p205)
states: 3,569,589,881 (9)
abstracting: (p205<=0)
states: 3,172,661,685 (9)
abstracting: (0<=p188)
states: 3,569,589,881 (9)
abstracting: (p188<=0)
states: 3,561,036,281 (9)
abstracting: (0<=p44)
states: 3,569,589,881 (9)
abstracting: (p44<=0)
states: 3,559,325,561 (9)
abstracting: (1<=p177)
states: 5,132,160 (6)
abstracting: (p177<=1)
states: 3,569,589,881 (9)
abstracting: (0<=p186)
states: 3,569,589,881 (9)
abstracting: (p186<=0)
states: 3,559,325,561 (9)
abstracting: (0<=p28)
states: 3,569,589,881 (9)
abstracting: (p28<=0)
states: 3,237,865,721 (9)
abstracting: (0<=p174)
states: 3,569,589,881 (9)
abstracting: (p174<=0)
states: 3,494,940,281 (9)
abstracting: (1<=p73)
states: 1,051,020 (6)
abstracting: (p73<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p199)
states: 1,576,530 (6)
abstracting: (p199<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p196)
states: 1,615,680 (6)
abstracting: (p196<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p7)
states: 2,280,960 (6)
abstracting: (p7<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p86)
states: 1,783,153,872 (9)
abstracting: (p86<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p169)
states: 2,280,960 (6)
abstracting: (p169<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p56)
states: 1,680,164,640 (9)
abstracting: (p56<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p36)
states: 61,585,920 (7)
abstracting: (p36<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p116)
states: 1,233,727,688 (9)
abstracting: (p116<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p223)
states: 61,585,920 (7)
abstracting: (p223<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p90)
states: 1,139,142,528 (9)
abstracting: (p90<=1)
states: 3,569,589,881 (9)
abstracting: (1<=p205)
states: 396,928,196 (8)
abstracting: (p205<=1)
states: 3,569,589,881 (9)
abstracting: (0<=p200)
states: 3,569,589,881 (9)
abstracting: (p200<=0)
states: 3,569,019,641 (9)
abstracting: (1<=p222)
states: 13,685,760 (7)
abstracting: (p222<=1)
states: 3,569,589,881 (9)
abstracting: (0<=p27)
states: 3,569,589,881 (9)
abstracting: (p27<=0)
states: 3,549,061,241 (9)
abstracting: (0<=p216)
states: 3,569,589,881 (9)
abstracting: (p216<=0)
states: 3,521,689,721 (9)
abstracting: (0<=p99)
states: 3,569,589,881 (9)
abstracting: (p99<=0)
states: 2,154,538,889 (9)
-> the formula is FALSE
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m23.404sec
totally nodes used: 16582398 (1.7e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 22407602 138360348 160767950
used/not used/entry size/cache size: 59601095 7507769 16 1024MB
basic ops cache: hits/miss/sum: 4915148 36909753 41824901
used/not used/entry size/cache size: 16191082 586134 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 749769 5321954 6071723
used/not used/entry size/cache size: 3947949 4440659 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 54060220
1 10237908
2 2214130
3 489067
4 91146
5 14209
6 1918
7 237
8 28
9 1
>= 10 0
Total processing time: 1m44.255sec
BK_STOP 1678734746409
--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:24069 (120), effective:661 (3)
initing FirstDep: 0m 0.000sec
iterations count:9840 (49), effective:259 (1)
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-17"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BusinessProcesses-PT-17, 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 r042-tajo-167813696000583"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 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 '
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 ;