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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 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.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 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 192K 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-20-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678365868922

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-20
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-09 12:44:30] [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 12:44:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:44:30] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2023-03-09 12:44:30] [INFO ] Transformed 782 places.
[2023-03-09 12:44:30] [INFO ] Transformed 697 transitions.
[2023-03-09 12:44:30] [INFO ] Found NUPN structural information;
[2023-03-09 12:44:30] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 285 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 63 places in 11 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 12:44:31] [INFO ] Flatten gal took : 104 ms
[2023-03-09 12:44:31] [INFO ] Flatten gal took : 51 ms
Incomplete random walk after 10000 steps, including 48 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 9) seen :4
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-09 12:44:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10246504263055447193.gal : 22 ms
[2023-03-09 12:44:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1275662953909317172.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/ReachabilityCardinality10246504263055447193.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1275662953909317172.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0

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 ...329
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Loading property file /tmp/ReachabilityCardinality1275662953909317172.prop.
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 638 rows 719 cols
[2023-03-09 12:44:31] [INFO ] Computed 121 place invariants in 20 ms
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :11 after 41
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :41 after 81
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :81 after 248
Reachability property BusinessProcesses-PT-20-ReachabilityCardinality-00 is true.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :248 after 456
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :456 after 551
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :551 after 1128
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1128 after 382911
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :3.61047e+06 after 5.53518e+06
[2023-03-09 12:44:31] [INFO ] [Real]Absence check using 78 positive place invariants in 26 ms returned sat
[2023-03-09 12:44:31] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2023-03-09 12:44:32] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 12:44:32] [INFO ] [Nat]Absence check using 78 positive place invariants in 20 ms returned sat
[2023-03-09 12:44:32] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.17848e+08 after 1.91214e+08
[2023-03-09 12:44:32] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 12:44:32] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 5 ms to minimize.
[2023-03-09 12:44:32] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2023-03-09 12:44:33] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2023-03-09 12:44:33] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2023-03-09 12:44:33] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 1 ms to minimize.
[2023-03-09 12:44:33] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 1 ms to minimize.
[2023-03-09 12:44:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 838 ms
[2023-03-09 12:44:33] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1.91214e+08 after 7.89926e+08
[2023-03-09 12:44:33] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 0 ms to minimize.
[2023-03-09 12:44:33] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2023-03-09 12:44:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 357 ms
[2023-03-09 12:44:34] [INFO ] Deduced a trap composed of 160 places in 152 ms of which 1 ms to minimize.
[2023-03-09 12:44:34] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2023-03-09 12:44:34] [INFO ] Deduced a trap composed of 157 places in 178 ms of which 1 ms to minimize.
[2023-03-09 12:44:34] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 1 ms to minimize.
[2023-03-09 12:44:34] [INFO ] Deduced a trap composed of 170 places in 141 ms of which 1 ms to minimize.
[2023-03-09 12:44:34] [INFO ] Deduced a trap composed of 165 places in 138 ms of which 1 ms to minimize.
[2023-03-09 12:44:35] [INFO ] Deduced a trap composed of 154 places in 149 ms of which 1 ms to minimize.
[2023-03-09 12:44:35] [INFO ] Deduced a trap composed of 160 places in 150 ms of which 1 ms to minimize.
[2023-03-09 12:44:35] [INFO ] Deduced a trap composed of 167 places in 142 ms of which 1 ms to minimize.
[2023-03-09 12:44:35] [INFO ] Deduced a trap composed of 165 places in 124 ms of which 1 ms to minimize.
[2023-03-09 12:44:35] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2023-03-09 12:44:36] [INFO ] Deduced a trap composed of 155 places in 151 ms of which 0 ms to minimize.
[2023-03-09 12:44:36] [INFO ] Deduced a trap composed of 173 places in 146 ms of which 0 ms to minimize.
[2023-03-09 12:44:36] [INFO ] Deduced a trap composed of 145 places in 144 ms of which 3 ms to minimize.
[2023-03-09 12:44:36] [INFO ] Deduced a trap composed of 149 places in 141 ms of which 1 ms to minimize.
[2023-03-09 12:44:36] [INFO ] Deduced a trap composed of 157 places in 138 ms of which 1 ms to minimize.
[2023-03-09 12:44:36] [INFO ] Deduced a trap composed of 173 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:44:36] [INFO ] Deduced a trap composed of 164 places in 124 ms of which 0 ms to minimize.
[2023-03-09 12:44:37] [INFO ] Deduced a trap composed of 165 places in 111 ms of which 1 ms to minimize.
[2023-03-09 12:44:37] [INFO ] Deduced a trap composed of 162 places in 107 ms of which 0 ms to minimize.
[2023-03-09 12:44:37] [INFO ] Deduced a trap composed of 156 places in 108 ms of which 0 ms to minimize.
[2023-03-09 12:44:37] [INFO ] Deduced a trap composed of 164 places in 133 ms of which 0 ms to minimize.
[2023-03-09 12:44:37] [INFO ] Deduced a trap composed of 156 places in 130 ms of which 0 ms to minimize.
[2023-03-09 12:44:37] [INFO ] Deduced a trap composed of 159 places in 131 ms of which 0 ms to minimize.
[2023-03-09 12:44:37] [INFO ] Deduced a trap composed of 147 places in 137 ms of which 4 ms to minimize.
[2023-03-09 12:44:38] [INFO ] Deduced a trap composed of 150 places in 132 ms of which 1 ms to minimize.
[2023-03-09 12:44:38] [INFO ] Deduced a trap composed of 164 places in 131 ms of which 1 ms to minimize.
[2023-03-09 12:44:38] [INFO ] Deduced a trap composed of 154 places in 135 ms of which 0 ms to minimize.
[2023-03-09 12:44:38] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 0 ms to minimize.
[2023-03-09 12:44:38] [INFO ] Deduced a trap composed of 167 places in 136 ms of which 0 ms to minimize.
[2023-03-09 12:44:38] [INFO ] Deduced a trap composed of 157 places in 145 ms of which 1 ms to minimize.
[2023-03-09 12:44:39] [INFO ] Deduced a trap composed of 154 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:44:39] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 0 ms to minimize.
[2023-03-09 12:44:39] [INFO ] Deduced a trap composed of 155 places in 130 ms of which 1 ms to minimize.
[2023-03-09 12:44:39] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
[2023-03-09 12:44:39] [INFO ] Deduced a trap composed of 160 places in 128 ms of which 0 ms to minimize.
[2023-03-09 12:44:40] [INFO ] Deduced a trap composed of 164 places in 145 ms of which 0 ms to minimize.
[2023-03-09 12:44:40] [INFO ] Deduced a trap composed of 163 places in 127 ms of which 0 ms to minimize.
[2023-03-09 12:44:40] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 0 ms to minimize.
[2023-03-09 12:44:40] [INFO ] Deduced a trap composed of 153 places in 132 ms of which 0 ms to minimize.
[2023-03-09 12:44:40] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2023-03-09 12:44:40] [INFO ] Deduced a trap composed of 152 places in 142 ms of which 1 ms to minimize.
[2023-03-09 12:44:41] [INFO ] Deduced a trap composed of 149 places in 162 ms of which 0 ms to minimize.
[2023-03-09 12:44:41] [INFO ] Deduced a trap composed of 145 places in 127 ms of which 1 ms to minimize.
[2023-03-09 12:44:41] [INFO ] Deduced a trap composed of 141 places in 201 ms of which 0 ms to minimize.
[2023-03-09 12:44:41] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 1 ms to minimize.
[2023-03-09 12:44:42] [INFO ] Deduced a trap composed of 144 places in 201 ms of which 11 ms to minimize.
[2023-03-09 12:44:42] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 1 ms to minimize.
[2023-03-09 12:44:42] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 0 ms to minimize.
[2023-03-09 12:44:42] [INFO ] Deduced a trap composed of 146 places in 172 ms of which 1 ms to minimize.
[2023-03-09 12:44:42] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 1 ms to minimize.
[2023-03-09 12:44:43] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 1 ms to minimize.
[2023-03-09 12:44:43] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 1 ms to minimize.
[2023-03-09 12:44:43] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 1 ms to minimize.
[2023-03-09 12:44:43] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 1 ms to minimize.
[2023-03-09 12:44:43] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 0 ms to minimize.
[2023-03-09 12:44:44] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 0 ms to minimize.
[2023-03-09 12:44:44] [INFO ] Deduced a trap composed of 148 places in 156 ms of which 1 ms to minimize.
[2023-03-09 12:44:44] [INFO ] Deduced a trap composed of 150 places in 164 ms of which 1 ms to minimize.
[2023-03-09 12:44:44] [INFO ] Deduced a trap composed of 148 places in 164 ms of which 4 ms to minimize.
[2023-03-09 12:44:44] [INFO ] Deduced a trap composed of 151 places in 183 ms of which 1 ms to minimize.
[2023-03-09 12:44:45] [INFO ] Deduced a trap composed of 147 places in 155 ms of which 0 ms to minimize.
[2023-03-09 12:44:45] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 1 ms to minimize.
[2023-03-09 12:44:45] [INFO ] Deduced a trap composed of 145 places in 186 ms of which 1 ms to minimize.
[2023-03-09 12:44:45] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 1 ms to minimize.
[2023-03-09 12:44:45] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 0 ms to minimize.
[2023-03-09 12:44:45] [INFO ] Deduced a trap composed of 140 places in 190 ms of which 1 ms to minimize.
[2023-03-09 12:44:46] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 0 ms to minimize.
[2023-03-09 12:44:46] [INFO ] Deduced a trap composed of 141 places in 148 ms of which 0 ms to minimize.
[2023-03-09 12:44:46] [INFO ] Deduced a trap composed of 146 places in 135 ms of which 0 ms to minimize.
[2023-03-09 12:44:46] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 1 ms to minimize.
[2023-03-09 12:44:46] [INFO ] Deduced a trap composed of 144 places in 168 ms of which 1 ms to minimize.
[2023-03-09 12:44:47] [INFO ] Deduced a trap composed of 151 places in 171 ms of which 0 ms to minimize.
[2023-03-09 12:44:47] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 1 ms to minimize.
[2023-03-09 12:44:47] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 0 ms to minimize.
[2023-03-09 12:44:47] [INFO ] Deduced a trap composed of 141 places in 140 ms of which 1 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 32768
[2023-03-09 12:44:47] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 0 ms to minimize.
SDD size :7.89926e+08 after 1.17582e+10
[2023-03-09 12:44:48] [INFO ] Deduced a trap composed of 145 places in 136 ms of which 0 ms to minimize.
[2023-03-09 12:44:48] [INFO ] Deduced a trap composed of 154 places in 162 ms of which 0 ms to minimize.
[2023-03-09 12:44:48] [INFO ] Deduced a trap composed of 155 places in 188 ms of which 1 ms to minimize.
[2023-03-09 12:44:48] [INFO ] Deduced a trap composed of 149 places in 186 ms of which 1 ms to minimize.
[2023-03-09 12:44:48] [INFO ] Deduced a trap composed of 148 places in 197 ms of which 0 ms to minimize.
[2023-03-09 12:44:49] [INFO ] Deduced a trap composed of 142 places in 175 ms of which 1 ms to minimize.
[2023-03-09 12:44:49] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 1 ms to minimize.
[2023-03-09 12:44:49] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 1 ms to minimize.
[2023-03-09 12:44:49] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 1 ms to minimize.
[2023-03-09 12:44:49] [INFO ] Deduced a trap composed of 147 places in 135 ms of which 0 ms to minimize.
[2023-03-09 12:44:50] [INFO ] Deduced a trap composed of 151 places in 194 ms of which 1 ms to minimize.
[2023-03-09 12:44:50] [INFO ] Deduced a trap composed of 146 places in 125 ms of which 0 ms to minimize.
[2023-03-09 12:44:50] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 0 ms to minimize.
[2023-03-09 12:44:50] [INFO ] Deduced a trap composed of 146 places in 164 ms of which 1 ms to minimize.
[2023-03-09 12:44:50] [INFO ] Deduced a trap composed of 154 places in 154 ms of which 1 ms to minimize.
[2023-03-09 12:44:51] [INFO ] Deduced a trap composed of 152 places in 182 ms of which 1 ms to minimize.
[2023-03-09 12:44:51] [INFO ] Deduced a trap composed of 148 places in 172 ms of which 0 ms to minimize.
[2023-03-09 12:44:51] [INFO ] Deduced a trap composed of 155 places in 171 ms of which 0 ms to minimize.
[2023-03-09 12:44:51] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2023-03-09 12:44:51] [INFO ] Deduced a trap composed of 166 places in 155 ms of which 0 ms to minimize.
[2023-03-09 12:44:52] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 0 ms to minimize.
[2023-03-09 12:44:52] [INFO ] Deduced a trap composed of 157 places in 153 ms of which 1 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :1.17582e+10 after 1.36933e+10
[2023-03-09 12:44:52] [INFO ] Deduced a trap composed of 153 places in 191 ms of which 1 ms to minimize.
[2023-03-09 12:44:52] [INFO ] Deduced a trap composed of 163 places in 157 ms of which 1 ms to minimize.
[2023-03-09 12:44:52] [INFO ] Deduced a trap composed of 160 places in 159 ms of which 1 ms to minimize.
[2023-03-09 12:44:53] [INFO ] Deduced a trap composed of 173 places in 144 ms of which 1 ms to minimize.
[2023-03-09 12:44:53] [INFO ] Deduced a trap composed of 160 places in 156 ms of which 0 ms to minimize.
[2023-03-09 12:44:53] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 0 ms to minimize.
[2023-03-09 12:44:53] [INFO ] Deduced a trap composed of 151 places in 157 ms of which 0 ms to minimize.
[2023-03-09 12:44:53] [INFO ] Deduced a trap composed of 144 places in 174 ms of which 0 ms to minimize.
[2023-03-09 12:44:53] [INFO ] Deduced a trap composed of 155 places in 140 ms of which 0 ms to minimize.
[2023-03-09 12:44:54] [INFO ] Deduced a trap composed of 161 places in 153 ms of which 0 ms to minimize.
[2023-03-09 12:44:54] [INFO ] Deduced a trap composed of 159 places in 194 ms of which 1 ms to minimize.
[2023-03-09 12:44:54] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 1 ms to minimize.
[2023-03-09 12:44:54] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 1 ms to minimize.
[2023-03-09 12:44:54] [INFO ] Deduced a trap composed of 159 places in 164 ms of which 0 ms to minimize.
[2023-03-09 12:44:55] [INFO ] Deduced a trap composed of 149 places in 147 ms of which 1 ms to minimize.
[2023-03-09 12:44:55] [INFO ] Deduced a trap composed of 148 places in 178 ms of which 1 ms to minimize.
[2023-03-09 12:44:55] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 0 ms to minimize.
[2023-03-09 12:44:55] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 1 ms to minimize.
[2023-03-09 12:44:55] [INFO ] Deduced a trap composed of 168 places in 159 ms of which 0 ms to minimize.
[2023-03-09 12:44:56] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 0 ms to minimize.
[2023-03-09 12:44:56] [INFO ] Deduced a trap composed of 146 places in 191 ms of which 0 ms to minimize.
[2023-03-09 12:44:56] [INFO ] Deduced a trap composed of 157 places in 157 ms of which 0 ms to minimize.
[2023-03-09 12:44:56] [INFO ] Deduced a trap composed of 153 places in 146 ms of which 0 ms to minimize.
[2023-03-09 12:44:56] [INFO ] Deduced a trap composed of 154 places in 152 ms of which 0 ms to minimize.
[2023-03-09 12:44:57] [INFO ] Deduced a trap composed of 152 places in 147 ms of which 0 ms to minimize.
[2023-03-09 12:44:57] [INFO ] Deduced a trap composed of 162 places in 179 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-09 12:44:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 12:44:57] [INFO ] After 25174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 39 ms.
Support contains 16 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 395 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 691 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 157 place count 691 transition count 466
Reduce places removed 155 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 163 rules applied. Total rules applied 320 place count 536 transition count 458
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 328 place count 528 transition count 458
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 328 place count 528 transition count 356
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 554 place count 404 transition count 356
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 635 place count 323 transition count 275
Iterating global reduction 3 with 81 rules applied. Total rules applied 716 place count 323 transition count 275
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 716 place count 323 transition count 267
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 733 place count 314 transition count 267
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 949 place count 205 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 953 place count 203 transition count 167
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 955 place count 203 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 957 place count 201 transition count 165
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 958 place count 201 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 959 place count 200 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 960 place count 199 transition count 164
Applied a total of 960 rules in 162 ms. Remains 199 /719 variables (removed 520) and now considering 164/638 (removed 474) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 199/719 places, 164/638 transitions.
Incomplete random walk after 10000 steps, including 343 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 12:44:57] [INFO ] Flow matrix only has 163 transitions (discarded 1 similar events)
// Phase 1: matrix 163 rows 199 cols
[2023-03-09 12:44:57] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-09 12:44:57] [INFO ] [Real]Absence check using 65 positive place invariants in 7 ms returned sat
[2023-03-09 12:44:57] [INFO ] [Real]Absence check using 65 positive and 17 generalized place invariants in 2 ms returned sat
[2023-03-09 12:44:57] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-09 12:44:57] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-09 12:44:57] [INFO ] After 21ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 12:44:57] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 12:44:57] [INFO ] [Nat]Absence check using 65 positive place invariants in 6 ms returned sat
[2023-03-09 12:44:57] [INFO ] [Nat]Absence check using 65 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-09 12:44:57] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 12:44:57] [INFO ] After 29ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 12:44:58] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2023-03-09 12:44:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-09 12:44:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-09 12:44:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2023-03-09 12:44:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2023-03-09 12:44:58] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 12:44:58] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 14 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 164/164 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 197 transition count 162
Applied a total of 4 rules in 10 ms. Remains 197 /199 variables (removed 2) and now considering 162/164 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 197/199 places, 162/164 transitions.
Incomplete random walk after 10000 steps, including 350 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 8176 steps, including 60 resets, run visited all 1 properties in 13 ms. (steps per millisecond=628 )
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-15 TRUE 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 27794 ms.

BK_STOP 1678365898784

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-20"
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-20, 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-167813690600606"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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