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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 148K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678363047112

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-13
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 11:57:29] [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:57:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:57:30] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-09 11:57:30] [INFO ] Transformed 593 places.
[2023-03-09 11:57:30] [INFO ] Transformed 536 transitions.
[2023-03-09 11:57:30] [INFO ] Found NUPN structural information;
[2023-03-09 11:57:30] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 11:57:30] [INFO ] Flatten gal took : 102 ms
[2023-03-09 11:57:30] [INFO ] Flatten gal took : 45 ms
[2023-03-09 11:57:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5562626154023333002.gal : 26 ms
[2023-03-09 11:57:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality289294595922930664.prop : 2 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/ReachabilityCardinality5562626154023333002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality289294595922930664.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 ...327
Loading property file /tmp/ReachabilityCardinality289294595922930664.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :28 after 125
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :125 after 247
Incomplete random walk after 10000 steps, including 71 resets, run finished after 950 ms. (steps per millisecond=10 ) properties (out of 15) seen :5
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 528 rows 585 cols
[2023-03-09 11:57:32] [INFO ] Computed 95 place invariants in 33 ms
[2023-03-09 11:57:33] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 11:57:33] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2023-03-09 11:57:33] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-09 11:57:34] [INFO ] After 1257ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-09 11:57:35] [INFO ] Deduced a trap composed of 8 places in 308 ms of which 9 ms to minimize.
[2023-03-09 11:57:35] [INFO ] Deduced a trap composed of 16 places in 428 ms of which 2 ms to minimize.
[2023-03-09 11:57:36] [INFO ] Deduced a trap composed of 15 places in 376 ms of which 2 ms to minimize.
[2023-03-09 11:57:36] [INFO ] Deduced a trap composed of 11 places in 590 ms of which 2 ms to minimize.
[2023-03-09 11:57:37] [INFO ] Deduced a trap composed of 28 places in 297 ms of which 21 ms to minimize.
[2023-03-09 11:57:37] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 0 ms to minimize.
[2023-03-09 11:57:37] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 2 ms to minimize.
[2023-03-09 11:57:37] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 1 ms to minimize.
[2023-03-09 11:57:38] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2023-03-09 11:57:38] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 0 ms to minimize.
[2023-03-09 11:57:38] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2023-03-09 11:57:38] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2023-03-09 11:57:38] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 0 ms to minimize.
[2023-03-09 11:57:38] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2023-03-09 11:57:39] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2023-03-09 11:57:39] [INFO ] Deduced a trap composed of 144 places in 117 ms of which 0 ms to minimize.
[2023-03-09 11:57:39] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2023-03-09 11:57:39] [INFO ] Deduced a trap composed of 145 places in 115 ms of which 1 ms to minimize.
[2023-03-09 11:57:39] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
[2023-03-09 11:57:39] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2023-03-09 11:57:39] [INFO ] Deduced a trap composed of 141 places in 119 ms of which 0 ms to minimize.
[2023-03-09 11:57:40] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2023-03-09 11:57:40] [INFO ] Deduced a trap composed of 135 places in 134 ms of which 0 ms to minimize.
[2023-03-09 11:57:40] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2023-03-09 11:57:40] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 1 ms to minimize.
[2023-03-09 11:57:40] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 1 ms to minimize.
[2023-03-09 11:57:40] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 1 ms to minimize.
[2023-03-09 11:57:40] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 1 ms to minimize.
[2023-03-09 11:57:41] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 0 ms to minimize.
[2023-03-09 11:57:41] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 1 ms to minimize.
[2023-03-09 11:57:41] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 0 ms to minimize.
[2023-03-09 11:57:41] [INFO ] Deduced a trap composed of 146 places in 140 ms of which 1 ms to minimize.
[2023-03-09 11:57:41] [INFO ] Deduced a trap composed of 130 places in 140 ms of which 0 ms to minimize.
[2023-03-09 11:57:42] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 6 ms to minimize.
[2023-03-09 11:57:42] [INFO ] Deduced a trap composed of 145 places in 144 ms of which 1 ms to minimize.
[2023-03-09 11:57:42] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 4 ms to minimize.
[2023-03-09 11:57:42] [INFO ] Deduced a trap composed of 141 places in 143 ms of which 1 ms to minimize.
[2023-03-09 11:57:42] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 1 ms to minimize.
[2023-03-09 11:57:42] [INFO ] Deduced a trap composed of 149 places in 150 ms of which 1 ms to minimize.
[2023-03-09 11:57:43] [INFO ] Deduced a trap composed of 146 places in 215 ms of which 2 ms to minimize.
[2023-03-09 11:57:43] [INFO ] Deduced a trap composed of 147 places in 185 ms of which 1 ms to minimize.
[2023-03-09 11:57:43] [INFO ] Deduced a trap composed of 142 places in 161 ms of which 1 ms to minimize.
[2023-03-09 11:57:43] [INFO ] Deduced a trap composed of 139 places in 218 ms of which 1 ms to minimize.
[2023-03-09 11:57:44] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 1 ms to minimize.
[2023-03-09 11:57:44] [INFO ] Deduced a trap composed of 136 places in 138 ms of which 0 ms to minimize.
[2023-03-09 11:57:44] [INFO ] Deduced a trap composed of 142 places in 160 ms of which 1 ms to minimize.
[2023-03-09 11:57:44] [INFO ] Deduced a trap composed of 139 places in 218 ms of which 1 ms to minimize.
[2023-03-09 11:57:44] [INFO ] Deduced a trap composed of 155 places in 178 ms of which 0 ms to minimize.
[2023-03-09 11:57:45] [INFO ] Deduced a trap composed of 126 places in 202 ms of which 0 ms to minimize.
[2023-03-09 11:57:45] [INFO ] Deduced a trap composed of 141 places in 201 ms of which 1 ms to minimize.
[2023-03-09 11:57:45] [INFO ] Deduced a trap composed of 139 places in 209 ms of which 3 ms to minimize.
[2023-03-09 11:57:45] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2023-03-09 11:57:46] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 1 ms to minimize.
[2023-03-09 11:57:46] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 0 ms to minimize.
[2023-03-09 11:57:46] [INFO ] Deduced a trap composed of 133 places in 216 ms of which 1 ms to minimize.
[2023-03-09 11:57:46] [INFO ] Deduced a trap composed of 156 places in 235 ms of which 22 ms to minimize.
[2023-03-09 11:57:47] [INFO ] Deduced a trap composed of 154 places in 157 ms of which 0 ms to minimize.
[2023-03-09 11:57:47] [INFO ] Deduced a trap composed of 154 places in 233 ms of which 1 ms to minimize.
[2023-03-09 11:57:47] [INFO ] Deduced a trap composed of 142 places in 158 ms of which 1 ms to minimize.
[2023-03-09 11:57:47] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 1 ms to minimize.
[2023-03-09 11:57:48] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 1 ms to minimize.
[2023-03-09 11:57:48] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 1 ms to minimize.
[2023-03-09 11:57:48] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 1 ms to minimize.
[2023-03-09 11:57:48] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 3 ms to minimize.
[2023-03-09 11:57:49] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 1 ms to minimize.
[2023-03-09 11:57:49] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 1 ms to minimize.
[2023-03-09 11:57:49] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 0 ms to minimize.
[2023-03-09 11:57:49] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 4 ms to minimize.
[2023-03-09 11:57:49] [INFO ] Deduced a trap composed of 145 places in 132 ms of which 1 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Deduced a trap composed of 126 places in 165 ms of which 0 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 0 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 1 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Deduced a trap composed of 126 places in 159 ms of which 1 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 0 ms to minimize.
[2023-03-09 11:57:50] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 0 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 127 places in 148 ms of which 0 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 137 places in 191 ms of which 1 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 139 places in 150 ms of which 1 ms to minimize.
[2023-03-09 11:57:51] [INFO ] Deduced a trap composed of 149 places in 142 ms of which 2 ms to minimize.
[2023-03-09 11:57:52] [INFO ] Deduced a trap composed of 133 places in 142 ms of which 1 ms to minimize.
[2023-03-09 11:57:52] [INFO ] Deduced a trap composed of 130 places in 140 ms of which 0 ms to minimize.
[2023-03-09 11:57:52] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 1 ms to minimize.
[2023-03-09 11:57:52] [INFO ] Deduced a trap composed of 134 places in 144 ms of which 1 ms to minimize.
[2023-03-09 11:57:52] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 0 ms to minimize.
[2023-03-09 11:57:53] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 0 ms to minimize.
[2023-03-09 11:57:53] [INFO ] Deduced a trap composed of 142 places in 156 ms of which 1 ms to minimize.
[2023-03-09 11:57:53] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2023-03-09 11:57:53] [INFO ] Deduced a trap composed of 135 places in 145 ms of which 1 ms to minimize.
[2023-03-09 11:57:53] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 0 ms to minimize.
[2023-03-09 11:57:54] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 0 ms to minimize.
[2023-03-09 11:57:54] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 1 ms to minimize.
[2023-03-09 11:57:54] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 0 ms to minimize.
[2023-03-09 11:57:54] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 1 ms to minimize.
[2023-03-09 11:57:54] [INFO ] Deduced a trap composed of 130 places in 149 ms of which 0 ms to minimize.
[2023-03-09 11:57:55] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 1 ms to minimize.
[2023-03-09 11:57:55] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2023-03-09 11:57:55] [INFO ] Deduced a trap composed of 142 places in 163 ms of which 0 ms to minimize.
[2023-03-09 11:57:55] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 1 ms to minimize.
[2023-03-09 11:57:56] [INFO ] Deduced a trap composed of 145 places in 174 ms of which 1 ms to minimize.
[2023-03-09 11:57:56] [INFO ] Deduced a trap composed of 144 places in 140 ms of which 1 ms to minimize.
[2023-03-09 11:57:56] [INFO ] Deduced a trap composed of 140 places in 139 ms of which 1 ms to minimize.
[2023-03-09 11:57:56] [INFO ] Deduced a trap composed of 143 places in 131 ms of which 1 ms to minimize.
[2023-03-09 11:57:56] [INFO ] Deduced a trap composed of 148 places in 133 ms of which 1 ms to minimize.
[2023-03-09 11:57:56] [INFO ] Deduced a trap composed of 138 places in 137 ms of which 0 ms to minimize.
[2023-03-09 11:57:57] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 0 ms to minimize.
[2023-03-09 11:57:57] [INFO ] Deduced a trap composed of 139 places in 145 ms of which 0 ms to minimize.
[2023-03-09 11:57:57] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2023-03-09 11:57:57] [INFO ] Deduced a trap composed of 136 places in 140 ms of which 0 ms to minimize.
[2023-03-09 11:57:57] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2023-03-09 11:57:57] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 0 ms to minimize.
[2023-03-09 11:57:58] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 1 ms to minimize.
[2023-03-09 11:57:58] [INFO ] Deduced a trap composed of 134 places in 129 ms of which 0 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-09 11:57:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:57:58] [INFO ] After 25134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 122 ms.
Support contains 59 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 275 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 574 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 574 transition count 423
Reduce places removed 96 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 112 rules applied. Total rules applied 210 place count 478 transition count 407
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 226 place count 462 transition count 407
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 226 place count 462 transition count 339
Deduced a syphon composed of 68 places in 7 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 372 place count 384 transition count 339
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 428 place count 328 transition count 283
Iterating global reduction 3 with 56 rules applied. Total rules applied 484 place count 328 transition count 283
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 484 place count 328 transition count 280
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 491 place count 324 transition count 280
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 655 place count 242 transition count 198
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 657 place count 241 transition count 202
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 659 place count 241 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 661 place count 239 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 662 place count 238 transition count 199
Applied a total of 662 rules in 149 ms. Remains 238 /585 variables (removed 347) and now considering 199/528 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 238/585 places, 199/528 transitions.
Finished random walk after 587 steps, including 9 resets, run visited all 9 properties in 12 ms. (steps per millisecond=48 )
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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 28663 ms.

BK_STOP 1678363079066

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "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 ;