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.r037-tajo-167813690500542.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 itstools
Input is BusinessProcesses-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500542
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 146K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678362714040

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 11:51:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:51:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:51:56] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-09 11:51:56] [INFO ] Transformed 586 places.
[2023-03-09 11:51:56] [INFO ] Transformed 525 transitions.
[2023-03-09 11:51:56] [INFO ] Found NUPN structural information;
[2023-03-09 11:51:56] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 25 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 11:51:57] [INFO ] Flatten gal took : 124 ms
[2023-03-09 11:51:57] [INFO ] Flatten gal took : 49 ms
[2023-03-09 11:51:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13905013077068702441.gal : 32 ms
[2023-03-09 11:51:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14379148444338310649.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13905013077068702441.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14379148444338310649.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14379148444338310649.prop.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 732 ms. (steps per millisecond=13 ) properties (out of 13) seen :4
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 9) seen :0
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :11 after 61
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :61 after 201
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :201 after 336
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :336 after 381
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :381 after 3788
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-03 is true.
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :3788 after 39961
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :615909 after 1.12899e+06
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-04 does not hold.
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :2.8345e+06 after 1.53157e+07
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 521 rows 582 cols
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.53157e+07 after 5.59102e+07
[2023-03-09 11:51:58] [INFO ] Computed 98 place invariants in 109 ms
[2023-03-09 11:51:59] [INFO ] [Real]Absence check using 55 positive place invariants in 43 ms returned sat
[2023-03-09 11:51:59] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 30 ms returned sat
[2023-03-09 11:51:59] [INFO ] After 1022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :5.59102e+07 after 1.70663e+08
[2023-03-09 11:52:00] [INFO ] [Nat]Absence check using 55 positive place invariants in 38 ms returned sat
[2023-03-09 11:52:00] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 29 ms returned sat
[2023-03-09 11:52:01] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-01 is true.
SDD proceeding with computation,10 properties remain. new max is 8192
[2023-03-09 11:52:02] [INFO ] Deduced a trap composed of 118 places in 1123 ms of which 7 ms to minimize.
SDD size :1.70663e+08 after 6.29278e+10
[2023-03-09 11:52:02] [INFO ] Deduced a trap composed of 122 places in 327 ms of which 1 ms to minimize.
[2023-03-09 11:52:02] [INFO ] Deduced a trap composed of 137 places in 285 ms of which 1 ms to minimize.
[2023-03-09 11:52:03] [INFO ] Deduced a trap composed of 14 places in 299 ms of which 3 ms to minimize.
[2023-03-09 11:52:03] [INFO ] Deduced a trap composed of 22 places in 276 ms of which 0 ms to minimize.
[2023-03-09 11:52:03] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 1 ms to minimize.
[2023-03-09 11:52:04] [INFO ] Deduced a trap composed of 114 places in 238 ms of which 2 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :6.29278e+10 after 6.34402e+10
[2023-03-09 11:52:04] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 1 ms to minimize.
[2023-03-09 11:52:04] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 1 ms to minimize.
[2023-03-09 11:52:05] [INFO ] Deduced a trap composed of 14 places in 265 ms of which 1 ms to minimize.
[2023-03-09 11:52:05] [INFO ] Deduced a trap composed of 120 places in 421 ms of which 1 ms to minimize.
[2023-03-09 11:52:05] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :6.34402e+10 after 6.38825e+10
[2023-03-09 11:52:06] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 1 ms to minimize.
[2023-03-09 11:52:06] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 1 ms to minimize.
[2023-03-09 11:52:06] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2023-03-09 11:52:06] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 1 ms to minimize.
[2023-03-09 11:52:07] [INFO ] Deduced a trap composed of 21 places in 1081 ms of which 2 ms to minimize.
[2023-03-09 11:52:08] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 1 ms to minimize.
[2023-03-09 11:52:08] [INFO ] Deduced a trap composed of 124 places in 192 ms of which 0 ms to minimize.
[2023-03-09 11:52:08] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 1 ms to minimize.
[2023-03-09 11:52:08] [INFO ] Deduced a trap composed of 127 places in 224 ms of which 1 ms to minimize.
[2023-03-09 11:52:09] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 1 ms to minimize.
[2023-03-09 11:52:09] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 1 ms to minimize.
[2023-03-09 11:52:09] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 1 ms to minimize.
[2023-03-09 11:52:09] [INFO ] Deduced a trap composed of 29 places in 272 ms of which 1 ms to minimize.
[2023-03-09 11:52:10] [INFO ] Deduced a trap composed of 127 places in 210 ms of which 1 ms to minimize.
[2023-03-09 11:52:10] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 0 ms to minimize.
[2023-03-09 11:52:10] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 1 ms to minimize.
[2023-03-09 11:52:10] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 1 ms to minimize.
[2023-03-09 11:52:10] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 0 ms to minimize.
[2023-03-09 11:52:11] [INFO ] Deduced a trap composed of 125 places in 189 ms of which 0 ms to minimize.
[2023-03-09 11:52:11] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 0 ms to minimize.
[2023-03-09 11:52:11] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 1 ms to minimize.
[2023-03-09 11:52:11] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 4 ms to minimize.
[2023-03-09 11:52:11] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 1 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 65536
[2023-03-09 11:52:12] [INFO ] Deduced a trap composed of 82 places in 267 ms of which 2 ms to minimize.
SDD size :6.38825e+10 after 1.03354e+11
[2023-03-09 11:52:12] [INFO ] Deduced a trap composed of 136 places in 177 ms of which 0 ms to minimize.
[2023-03-09 11:52:12] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2023-03-09 11:52:12] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 1 ms to minimize.
[2023-03-09 11:52:12] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 2 ms to minimize.
[2023-03-09 11:52:13] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 1 ms to minimize.
[2023-03-09 11:52:13] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 0 ms to minimize.
[2023-03-09 11:52:13] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 12364 ms
[2023-03-09 11:52:13] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2023-03-09 11:52:13] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2023-03-09 11:52:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2023-03-09 11:52:14] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 1 ms to minimize.
[2023-03-09 11:52:14] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 0 ms to minimize.
[2023-03-09 11:52:14] [INFO ] Deduced a trap composed of 125 places in 169 ms of which 0 ms to minimize.
[2023-03-09 11:52:14] [INFO ] Deduced a trap composed of 121 places in 169 ms of which 1 ms to minimize.
[2023-03-09 11:52:14] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 0 ms to minimize.
[2023-03-09 11:52:15] [INFO ] Deduced a trap composed of 80 places in 170 ms of which 1 ms to minimize.
[2023-03-09 11:52:15] [INFO ] Deduced a trap composed of 127 places in 157 ms of which 1 ms to minimize.
[2023-03-09 11:52:15] [INFO ] Deduced a trap composed of 139 places in 185 ms of which 0 ms to minimize.
[2023-03-09 11:52:15] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 1 ms to minimize.
[2023-03-09 11:52:15] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 0 ms to minimize.
[2023-03-09 11:52:15] [INFO ] Deduced a trap composed of 122 places in 153 ms of which 1 ms to minimize.
[2023-03-09 11:52:16] [INFO ] Deduced a trap composed of 124 places in 193 ms of which 1 ms to minimize.
[2023-03-09 11:52:16] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2023-03-09 11:52:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2447 ms
[2023-03-09 11:52:16] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2023-03-09 11:52:16] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 1 ms to minimize.
[2023-03-09 11:52:16] [INFO ] Deduced a trap composed of 132 places in 215 ms of which 1 ms to minimize.
[2023-03-09 11:52:17] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 2 ms to minimize.
[2023-03-09 11:52:17] [INFO ] Deduced a trap composed of 131 places in 184 ms of which 0 ms to minimize.
[2023-03-09 11:52:17] [INFO ] Deduced a trap composed of 127 places in 161 ms of which 1 ms to minimize.
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-11 is true.
[2023-03-09 11:52:20] [INFO ] Deduced a trap composed of 131 places in 2510 ms of which 2 ms to minimize.
[2023-03-09 11:52:20] [INFO ] Deduced a trap composed of 129 places in 174 ms of which 1 ms to minimize.
[2023-03-09 11:52:20] [INFO ] Deduced a trap composed of 126 places in 158 ms of which 1 ms to minimize.
[2023-03-09 11:52:20] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 0 ms to minimize.
[2023-03-09 11:52:21] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 3 ms to minimize.
[2023-03-09 11:52:21] [INFO ] Deduced a trap composed of 142 places in 232 ms of which 27 ms to minimize.
[2023-03-09 11:52:21] [INFO ] Deduced a trap composed of 146 places in 134 ms of which 1 ms to minimize.
[2023-03-09 11:52:21] [INFO ] Deduced a trap composed of 136 places in 242 ms of which 0 ms to minimize.
[2023-03-09 11:52:21] [INFO ] Deduced a trap composed of 145 places in 151 ms of which 0 ms to minimize.
[2023-03-09 11:52:22] [INFO ] Deduced a trap composed of 123 places in 150 ms of which 1 ms to minimize.
[2023-03-09 11:52:22] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 1 ms to minimize.
[2023-03-09 11:52:22] [INFO ] Deduced a trap composed of 130 places in 148 ms of which 1 ms to minimize.
[2023-03-09 11:52:22] [INFO ] Deduced a trap composed of 126 places in 152 ms of which 0 ms to minimize.
[2023-03-09 11:52:22] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2023-03-09 11:52:23] [INFO ] Deduced a trap composed of 124 places in 170 ms of which 1 ms to minimize.
[2023-03-09 11:52:23] [INFO ] Deduced a trap composed of 143 places in 156 ms of which 0 ms to minimize.
[2023-03-09 11:52:23] [INFO ] Deduced a trap composed of 130 places in 96 ms of which 9 ms to minimize.
[2023-03-09 11:52:23] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 2 ms to minimize.
[2023-03-09 11:52:23] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7069 ms
[2023-03-09 11:52:23] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 0 ms to minimize.
[2023-03-09 11:52:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-09 11:52:23] [INFO ] After 23495ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 609 ms.
[2023-03-09 11:52:24] [INFO ] After 24670ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 46 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 282 edges and 582 vertex of which 7 / 582 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 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 572 transition count 410
Reduce places removed 102 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 112 rules applied. Total rules applied 216 place count 470 transition count 400
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 226 place count 460 transition count 400
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 226 place count 460 transition count 323
Deduced a syphon composed of 77 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 392 place count 371 transition count 323
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 450 place count 313 transition count 265
Iterating global reduction 3 with 58 rules applied. Total rules applied 508 place count 313 transition count 265
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 508 place count 313 transition count 261
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 516 place count 309 transition count 261
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 678 place count 228 transition count 180
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 680 place count 227 transition count 184
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 682 place count 227 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 684 place count 225 transition count 182
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 688 place count 225 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 689 place count 224 transition count 181
Applied a total of 689 rules in 171 ms. Remains 224 /582 variables (removed 358) and now considering 181/521 (removed 340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 224/582 places, 181/521 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 8) seen :6
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 4617 steps, including 25 resets, run visited all 1 properties in 23 ms. (steps per millisecond=200 )
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 28671 ms.

BK_STOP 1678362745787

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-12, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690500542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;