Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143900430.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 156K May 5 16:51 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-14-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620546601965

Running Version 0
[2021-05-09 07:50:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:50:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:50:03] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-09 07:50:03] [INFO ] Transformed 624 places.
[2021-05-09 07:50:03] [INFO ] Transformed 564 transitions.
[2021-05-09 07:50:03] [INFO ] Found NUPN structural information;
[2021-05-09 07:50:03] [INFO ] Parsed PT model containing 624 places and 564 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 69 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Probabilistic random walk after 10000001 steps, saw 1242649 distinct states, run finished after 29949 ms. (steps per millisecond=333 ) properties seen :{9=1}
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 11 properties.
// Phase 1: matrix 556 rows 616 cols
[2021-05-09 07:50:34] [INFO ] Computed 99 place invariants in 58 ms
[2021-05-09 07:50:34] [INFO ] [Real]Absence check using 60 positive place invariants in 22 ms returned sat
[2021-05-09 07:50:34] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:50:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:50:34] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-09 07:50:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:50:34] [INFO ] [Nat]Absence check using 60 positive place invariants in 31 ms returned sat
[2021-05-09 07:50:34] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:50:35] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-09 07:50:35] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 16 ms to minimize.
[2021-05-09 07:50:35] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:50:35] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:50:35] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2021-05-09 07:50:36] [INFO ] Deduced a trap composed of 56 places in 212 ms of which 3 ms to minimize.
[2021-05-09 07:50:36] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:50:36] [INFO ] Deduced a trap composed of 140 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:50:36] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:50:36] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:50:36] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:50:37] [INFO ] Deduced a trap composed of 139 places in 183 ms of which 1 ms to minimize.
[2021-05-09 07:50:37] [INFO ] Deduced a trap composed of 147 places in 142 ms of which 9 ms to minimize.
[2021-05-09 07:50:37] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:50:37] [INFO ] Deduced a trap composed of 139 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:50:37] [INFO ] Deduced a trap composed of 140 places in 179 ms of which 0 ms to minimize.
[2021-05-09 07:50:37] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 1 ms to minimize.
[2021-05-09 07:50:38] [INFO ] Deduced a trap composed of 138 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:50:38] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:50:38] [INFO ] Deduced a trap composed of 145 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:50:38] [INFO ] Deduced a trap composed of 133 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:50:38] [INFO ] Deduced a trap composed of 134 places in 184 ms of which 1 ms to minimize.
[2021-05-09 07:50:39] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 1 ms to minimize.
[2021-05-09 07:50:39] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:50:39] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 1 ms to minimize.
[2021-05-09 07:50:39] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 0 ms to minimize.
[2021-05-09 07:50:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-09 07:50:39] [INFO ] [Real]Absence check using 60 positive place invariants in 47 ms returned sat
[2021-05-09 07:50:40] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 25 ms returned sat
[2021-05-09 07:50:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:50:40] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-09 07:50:40] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 1 ms to minimize.
[2021-05-09 07:50:40] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2021-05-09 07:50:40] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 0 ms to minimize.
[2021-05-09 07:50:41] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 1 ms to minimize.
[2021-05-09 07:50:41] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 0 ms to minimize.
[2021-05-09 07:50:41] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 1 ms to minimize.
[2021-05-09 07:50:41] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 1 ms to minimize.
[2021-05-09 07:50:42] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 1 ms to minimize.
[2021-05-09 07:50:42] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 1 ms to minimize.
[2021-05-09 07:50:42] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 5 ms to minimize.
[2021-05-09 07:50:43] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 1 ms to minimize.
[2021-05-09 07:50:43] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 0 ms to minimize.
[2021-05-09 07:50:43] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 0 ms to minimize.
[2021-05-09 07:50:43] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 1 ms to minimize.
[2021-05-09 07:50:43] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 1 ms to minimize.
[2021-05-09 07:50:44] [INFO ] Deduced a trap composed of 70 places in 234 ms of which 1 ms to minimize.
[2021-05-09 07:50:44] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 0 ms to minimize.
[2021-05-09 07:50:44] [INFO ] Deduced a trap composed of 130 places in 193 ms of which 1 ms to minimize.
[2021-05-09 07:50:44] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:50:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-09 07:50:45] [INFO ] [Real]Absence check using 60 positive place invariants in 26 ms returned sat
[2021-05-09 07:50:45] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 15 ms returned sat
[2021-05-09 07:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:50:45] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2021-05-09 07:50:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:50:45] [INFO ] [Real]Absence check using 60 positive place invariants in 19 ms returned sat
[2021-05-09 07:50:45] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:50:45] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-09 07:50:46] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 1 ms to minimize.
[2021-05-09 07:50:46] [INFO ] Deduced a trap composed of 124 places in 264 ms of which 1 ms to minimize.
[2021-05-09 07:50:46] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 2 ms to minimize.
[2021-05-09 07:50:46] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 1 ms to minimize.
[2021-05-09 07:50:47] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 1 ms to minimize.
[2021-05-09 07:50:47] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 1 ms to minimize.
[2021-05-09 07:50:47] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 0 ms to minimize.
[2021-05-09 07:50:47] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 0 ms to minimize.
[2021-05-09 07:50:48] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 1 ms to minimize.
[2021-05-09 07:50:48] [INFO ] Deduced a trap composed of 146 places in 186 ms of which 1 ms to minimize.
[2021-05-09 07:50:48] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 1 ms to minimize.
[2021-05-09 07:50:48] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 0 ms to minimize.
[2021-05-09 07:50:48] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 0 ms to minimize.
[2021-05-09 07:50:49] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 1 ms to minimize.
[2021-05-09 07:50:49] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 1 ms to minimize.
[2021-05-09 07:50:49] [INFO ] Deduced a trap composed of 131 places in 201 ms of which 0 ms to minimize.
[2021-05-09 07:50:49] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 1 ms to minimize.
[2021-05-09 07:50:50] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 0 ms to minimize.
[2021-05-09 07:50:50] [INFO ] Deduced a trap composed of 152 places in 200 ms of which 1 ms to minimize.
[2021-05-09 07:50:50] [INFO ] Deduced a trap composed of 151 places in 193 ms of which 13 ms to minimize.
[2021-05-09 07:50:50] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:50:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-09 07:50:50] [INFO ] [Real]Absence check using 60 positive place invariants in 24 ms returned sat
[2021-05-09 07:50:50] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:50:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:50:51] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-09 07:50:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:50:51] [INFO ] [Real]Absence check using 60 positive place invariants in 24 ms returned sat
[2021-05-09 07:50:51] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:50:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:50:51] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2021-05-09 07:50:51] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2021-05-09 07:50:51] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 13 ms to minimize.
[2021-05-09 07:50:51] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2021-05-09 07:50:51] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2021-05-09 07:50:52] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2021-05-09 07:50:52] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:50:52] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:50:52] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 0 ms to minimize.
[2021-05-09 07:50:52] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:50:52] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:50:52] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:50:52] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:50:52] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:50:53] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:50:53] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2021-05-09 07:50:53] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2021-05-09 07:50:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1746 ms
[2021-05-09 07:50:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:50:53] [INFO ] [Nat]Absence check using 60 positive place invariants in 26 ms returned sat
[2021-05-09 07:50:53] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:50:53] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2021-05-09 07:50:53] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:50:53] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:50:54] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:50:54] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 25 ms to minimize.
[2021-05-09 07:50:54] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:50:54] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:50:54] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:50:54] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:50:54] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:50:54] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:50:55] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 5 ms to minimize.
[2021-05-09 07:50:55] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2021-05-09 07:50:55] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:50:55] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:50:55] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:50:55] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 0 ms to minimize.
[2021-05-09 07:50:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2091 ms
[2021-05-09 07:50:55] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 38 ms.
[2021-05-09 07:50:58] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 1 ms to minimize.
[2021-05-09 07:50:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-09 07:50:58] [INFO ] [Real]Absence check using 60 positive place invariants in 26 ms returned sat
[2021-05-09 07:50:58] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-09 07:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:50:59] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-09 07:50:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:50:59] [INFO ] [Real]Absence check using 60 positive place invariants in 24 ms returned sat
[2021-05-09 07:50:59] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:50:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:50:59] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2021-05-09 07:50:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:50:59] [INFO ] [Nat]Absence check using 60 positive place invariants in 20 ms returned sat
[2021-05-09 07:50:59] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2021-05-09 07:50:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:50:59] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-09 07:51:00] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 0 ms to minimize.
[2021-05-09 07:51:00] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 0 ms to minimize.
[2021-05-09 07:51:00] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 1 ms to minimize.
[2021-05-09 07:51:00] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 1 ms to minimize.
[2021-05-09 07:51:01] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 1 ms to minimize.
[2021-05-09 07:51:01] [INFO ] Deduced a trap composed of 147 places in 177 ms of which 0 ms to minimize.
[2021-05-09 07:51:01] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 1 ms to minimize.
[2021-05-09 07:51:01] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 1 ms to minimize.
[2021-05-09 07:51:01] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 0 ms to minimize.
[2021-05-09 07:51:02] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 2 ms to minimize.
[2021-05-09 07:51:02] [INFO ] Deduced a trap composed of 154 places in 181 ms of which 0 ms to minimize.
[2021-05-09 07:51:02] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:51:02] [INFO ] Deduced a trap composed of 20 places in 178 ms of which 1 ms to minimize.
[2021-05-09 07:51:02] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 1 ms to minimize.
[2021-05-09 07:51:03] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:51:03] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:51:03] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 0 ms to minimize.
[2021-05-09 07:51:03] [INFO ] Deduced a trap composed of 132 places in 164 ms of which 1 ms to minimize.
[2021-05-09 07:51:03] [INFO ] Deduced a trap composed of 134 places in 181 ms of which 0 ms to minimize.
[2021-05-09 07:51:04] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 1 ms to minimize.
[2021-05-09 07:51:04] [INFO ] Deduced a trap composed of 147 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:51:04] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:51:04] [INFO ] Deduced a trap composed of 146 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:51:04] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 1 ms to minimize.
[2021-05-09 07:51:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-09 07:51:04] [INFO ] [Real]Absence check using 60 positive place invariants in 23 ms returned sat
[2021-05-09 07:51:05] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2021-05-09 07:51:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:51:05] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-09 07:51:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:51:05] [INFO ] [Nat]Absence check using 60 positive place invariants in 25 ms returned sat
[2021-05-09 07:51:05] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-09 07:51:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:51:05] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-09 07:51:11] [INFO ] Deduced a trap composed of 16 places in 5369 ms of which 1 ms to minimize.
[2021-05-09 07:51:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-05-09 07:51:11] [INFO ] [Real]Absence check using 60 positive place invariants in 29 ms returned sat
[2021-05-09 07:51:11] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 15 ms returned sat
[2021-05-09 07:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:51:11] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2021-05-09 07:51:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:51:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 53 ms returned sat
[2021-05-09 07:51:11] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2021-05-09 07:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:51:12] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2021-05-09 07:51:12] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:51:12] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:51:12] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:51:12] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:51:12] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:51:12] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2021-05-09 07:51:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 772 ms
[2021-05-09 07:51:12] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 49 ms.
[2021-05-09 07:51:14] [INFO ] Added : 244 causal constraints over 50 iterations in 2061 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-09 07:51:15] [INFO ] [Real]Absence check using 60 positive place invariants in 26 ms returned sat
[2021-05-09 07:51:15] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 13 ms returned sat
[2021-05-09 07:51:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:51:15] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2021-05-09 07:51:15] [INFO ] Solution in real domain found non-integer solution.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 25400 steps, including 167 resets, run finished after 94 ms. (steps per millisecond=270 ) properties (out of 7) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 344 edges and 616 vertex of which 7 / 616 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1252 edges and 610 vertex of which 604 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 135 place count 604 transition count 414
Reduce places removed 133 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 136 rules applied. Total rules applied 271 place count 471 transition count 411
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 274 place count 468 transition count 411
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 274 place count 468 transition count 322
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 468 place count 363 transition count 322
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 544 place count 287 transition count 246
Iterating global reduction 3 with 76 rules applied. Total rules applied 620 place count 287 transition count 246
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 620 place count 287 transition count 237
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 641 place count 275 transition count 237
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 829 place count 180 transition count 144
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 831 place count 179 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 833 place count 179 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 835 place count 177 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 836 place count 177 transition count 146
Applied a total of 836 rules in 197 ms. Remains 177 /616 variables (removed 439) and now considering 146/556 (removed 410) transitions.
Finished structural reductions, in 1 iterations. Remains : 177/616 places, 146/556 transitions.
[2021-05-09 07:51:16] [INFO ] Flatten gal took : 98 ms
[2021-05-09 07:51:16] [INFO ] Flatten gal took : 26 ms
[2021-05-09 07:51:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8352575409908957816.gal : 25 ms
[2021-05-09 07:51:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11374285460648797253.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8352575409908957816.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11374285460648797253.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8352575409908957816.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11374285460648797253.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11374285460648797253.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :9 after 21
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :21 after 45
Invariant property BusinessProcesses-PT-14-ReachabilityCardinality-09 does not hold.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-14-ReachabilityCardinality-06 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :45 after 113
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :113 after 445
Invariant property BusinessProcesses-PT-14-ReachabilityCardinality-08 does not hold.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :445 after 1397
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1397 after 2165
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2165 after 4853
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4853 after 19541
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :19541 after 38933
Reachability property BusinessProcesses-PT-14-ReachabilityCardinality-01 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :38933 after 125909
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,150101,0.310373,13776,2,4991,20,25326,7,0,855,19926,0
Total reachable state count : 150101

Verifying 5 reachability properties.
Reachability property BusinessProcesses-PT-14-ReachabilityCardinality-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-14-ReachabilityCardinality-01,192,0.312229,13776,2,310,20,25326,8,0,858,19926,0
Reachability property BusinessProcesses-PT-14-ReachabilityCardinality-04 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-14-ReachabilityCardinality-04,192,0.313065,13776,2,304,20,25326,8,0,859,19926,0
Reachability property BusinessProcesses-PT-14-ReachabilityCardinality-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-14-ReachabilityCardinality-06,1,0.313709,13776,2,178,20,25326,9,0,864,19926,0
Invariant property BusinessProcesses-PT-14-ReachabilityCardinality-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-14-ReachabilityCardinality-08,6732,0.318884,13776,2,3035,20,25326,10,0,878,19926,0
Invariant property BusinessProcesses-PT-14-ReachabilityCardinality-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-14-ReachabilityCardinality-09,1,0.319551,13776,2,178,20,25326,11,0,883,19926,0
All properties solved without resorting to model-checking.

BK_STOP 1620546677148

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-14"
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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-14, 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 r026-tajo-162038143900430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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