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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K 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.3K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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.8K 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 157K 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-15-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620547164135

Running Version 0
[2021-05-09 07:59:25] [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:59:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:59:25] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-09 07:59:25] [INFO ] Transformed 630 places.
[2021-05-09 07:59:25] [INFO ] Transformed 566 transitions.
[2021-05-09 07:59:25] [INFO ] Found NUPN structural information;
[2021-05-09 07:59:25] [INFO ] Parsed PT model containing 630 places and 566 transitions in 112 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 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 69 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :2
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 562 rows 626 cols
[2021-05-09 07:59:26] [INFO ] Computed 102 place invariants in 37 ms
[2021-05-09 07:59:26] [INFO ] [Real]Absence check using 61 positive place invariants in 29 ms returned sat
[2021-05-09 07:59:26] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 19 ms returned sat
[2021-05-09 07:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:26] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2021-05-09 07:59:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:27] [INFO ] [Real]Absence check using 61 positive place invariants in 33 ms returned sat
[2021-05-09 07:59:27] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 34 ms returned sat
[2021-05-09 07:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:27] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2021-05-09 07:59:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:27] [INFO ] [Real]Absence check using 61 positive place invariants in 19 ms returned sat
[2021-05-09 07:59:27] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2021-05-09 07:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:27] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2021-05-09 07:59:28] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2021-05-09 07:59:28] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2021-05-09 07:59:28] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2021-05-09 07:59:28] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2021-05-09 07:59:28] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:59:28] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:59:28] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 3 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 1 ms to minimize.
[2021-05-09 07:59:29] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:59:30] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 1 ms to minimize.
[2021-05-09 07:59:30] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:59:30] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:59:30] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2560 ms
[2021-05-09 07:59:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:30] [INFO ] [Nat]Absence check using 61 positive place invariants in 28 ms returned sat
[2021-05-09 07:59:30] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-09 07:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:30] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:59:31] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:59:32] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:59:32] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:59:32] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:59:32] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:59:32] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:59:32] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:59:32] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2021-05-09 07:59:32] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:59:33] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2119 ms
[2021-05-09 07:59:33] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 65 ms.
[2021-05-09 07:59:35] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 6 ms to minimize.
[2021-05-09 07:59:35] [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 2
[2021-05-09 07:59:35] [INFO ] [Real]Absence check using 61 positive place invariants in 40 ms returned sat
[2021-05-09 07:59:35] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 25 ms returned sat
[2021-05-09 07:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:36] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2021-05-09 07:59:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:36] [INFO ] [Nat]Absence check using 61 positive place invariants in 73 ms returned sat
[2021-05-09 07:59:36] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 26 ms returned sat
[2021-05-09 07:59:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:36] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2021-05-09 07:59:36] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 139 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 0 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2021-05-09 07:59:37] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 1 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 0 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 0 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 1 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 1 ms to minimize.
[2021-05-09 07:59:38] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:59:39] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 1 ms to minimize.
[2021-05-09 07:59:39] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 1 ms to minimize.
[2021-05-09 07:59:39] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 1 ms to minimize.
[2021-05-09 07:59:39] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 0 ms to minimize.
[2021-05-09 07:59:39] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 1 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 1 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 1 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:59:40] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 1 ms to minimize.
[2021-05-09 07:59:41] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:59:41] [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:59:41] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2021-05-09 07:59:41] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 19 ms returned sat
[2021-05-09 07:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:41] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2021-05-09 07:59:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:41] [INFO ] [Nat]Absence check using 61 positive place invariants in 29 ms returned sat
[2021-05-09 07:59:41] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2021-05-09 07:59:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:42] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2021-05-09 07:59:42] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2021-05-09 07:59:42] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2021-05-09 07:59:42] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 1 ms to minimize.
[2021-05-09 07:59:42] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2021-05-09 07:59:43] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 0 ms to minimize.
[2021-05-09 07:59:43] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 1 ms to minimize.
[2021-05-09 07:59:43] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 2 ms to minimize.
[2021-05-09 07:59:43] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 1 ms to minimize.
[2021-05-09 07:59:43] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 0 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 142 places in 144 ms of which 0 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 0 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 144 places in 169 ms of which 1 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 1 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:59:44] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 1 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 149 places in 161 ms of which 0 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 155 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 146 places in 161 ms of which 0 ms to minimize.
[2021-05-09 07:59:45] [INFO ] Deduced a trap composed of 142 places in 148 ms of which 1 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 140 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 144 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 145 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:59:46] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2021-05-09 07:59:46] [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 4
[2021-05-09 07:59:47] [INFO ] [Real]Absence check using 61 positive place invariants in 29 ms returned sat
[2021-05-09 07:59:47] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 21 ms returned sat
[2021-05-09 07:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:47] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2021-05-09 07:59:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:47] [INFO ] [Nat]Absence check using 61 positive place invariants in 51 ms returned sat
[2021-05-09 07:59:47] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 34 ms returned sat
[2021-05-09 07:59:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:48] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2021-05-09 07:59:48] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:59:48] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 2 ms to minimize.
[2021-05-09 07:59:48] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 0 ms to minimize.
[2021-05-09 07:59:48] [INFO ] Deduced a trap composed of 147 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:59:48] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:59:49] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:59:49] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 0 ms to minimize.
[2021-05-09 07:59:49] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:59:49] [INFO ] Deduced a trap composed of 147 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:59:49] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 1 ms to minimize.
[2021-05-09 07:59:49] [INFO ] Deduced a trap composed of 150 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:59:49] [INFO ] Deduced a trap composed of 153 places in 117 ms of which 0 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 160 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 157 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 160 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 147 places in 158 ms of which 1 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 152 places in 133 ms of which 0 ms to minimize.
[2021-05-09 07:59:50] [INFO ] Deduced a trap composed of 152 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 152 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 152 places in 94 ms of which 1 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 158 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 156 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 152 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:59:51] [INFO ] Deduced a trap composed of 148 places in 103 ms of which 0 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 150 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 150 places in 126 ms of which 13 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 152 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 154 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:59:52] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2021-05-09 07:59:52] [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:59:52] [INFO ] [Real]Absence check using 61 positive place invariants in 17 ms returned sat
[2021-05-09 07:59:52] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:53] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-09 07:59:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:53] [INFO ] [Nat]Absence check using 61 positive place invariants in 17 ms returned sat
[2021-05-09 07:59:53] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:53] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:59:53] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:59:54] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:59:55] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1754 ms
[2021-05-09 07:59:55] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 47 ms.
[2021-05-09 07:59:57] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:59:57] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:59:57] [INFO ] Deduced a trap composed of 142 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:59:57] [INFO ] Deduced a trap composed of 140 places in 156 ms of which 0 ms to minimize.
[2021-05-09 07:59:58] [INFO ] Deduced a trap composed of 159 places in 135 ms of which 0 ms to minimize.
[2021-05-09 07:59: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 6
[2021-05-09 07:59:58] [INFO ] [Real]Absence check using 61 positive place invariants in 21 ms returned sat
[2021-05-09 07:59:58] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 24 ms returned sat
[2021-05-09 07:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:58] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2021-05-09 07:59:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:58] [INFO ] [Nat]Absence check using 61 positive place invariants in 29 ms returned sat
[2021-05-09 07:59:58] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-09 07:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:58] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 0 ms to minimize.
[2021-05-09 07:59:59] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 142 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 147 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 149 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 141 places in 114 ms of which 0 ms to minimize.
[2021-05-09 08:00:00] [INFO ] Deduced a trap composed of 156 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 148 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 35 places in 18 ms of which 1 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Deduced a trap composed of 32 places in 18 ms of which 1 ms to minimize.
[2021-05-09 08:00:01] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2186 ms
[2021-05-09 08:00:01] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 27 ms.
[2021-05-09 08:00:03] [INFO ] Added : 390 causal constraints over 78 iterations in 2103 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-09 08:00:03] [INFO ] [Real]Absence check using 61 positive place invariants in 17 ms returned sat
[2021-05-09 08:00:03] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 08:00:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:03] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-09 08:00:03] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:00:03] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2021-05-09 08:00:03] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2021-05-09 08:00:03] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 150 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:00:04] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 136 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 0 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:00:05] [INFO ] Deduced a trap composed of 145 places in 118 ms of which 24 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 148 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 139 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 148 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:00:06] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:00:07] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:00:07] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:00:07] [INFO ] Deduced a trap composed of 146 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:00:07] [INFO ] Deduced a trap composed of 145 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:00:07] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:00:07] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:00:08] [INFO ] Deduced a trap composed of 154 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:00:08] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:00:08] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:00:08] [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 08:00:08] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2021-05-09 08:00:08] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-09 08:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:08] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2021-05-09 08:00:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:00:08] [INFO ] [Nat]Absence check using 61 positive place invariants in 26 ms returned sat
[2021-05-09 08:00:08] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 27 ms returned sat
[2021-05-09 08:00:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:00:09] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2021-05-09 08:00:09] [INFO ] Deduced a trap composed of 136 places in 187 ms of which 1 ms to minimize.
[2021-05-09 08:00:09] [INFO ] Deduced a trap composed of 140 places in 200 ms of which 0 ms to minimize.
[2021-05-09 08:00:09] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:00:10] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:00:10] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:00:10] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:00:10] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:00:10] [INFO ] Deduced a trap composed of 144 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:00:10] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:00:11] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 0 ms to minimize.
[2021-05-09 08:00:11] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 1 ms to minimize.
[2021-05-09 08:00:11] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 0 ms to minimize.
[2021-05-09 08:00:11] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:00:11] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 0 ms to minimize.
[2021-05-09 08:00:12] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 0 ms to minimize.
[2021-05-09 08:00:12] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:00:12] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:00:12] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:00:12] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:00:13] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:00:13] [INFO ] Deduced a trap composed of 99 places in 169 ms of which 1 ms to minimize.
[2021-05-09 08:00:13] [INFO ] Deduced a trap composed of 99 places in 183 ms of which 1 ms to minimize.
[2021-05-09 08:00:13] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:00:13] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:00:13] [INFO ] Deduced a trap composed of 143 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:00:13] [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 9
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 43900 steps, including 329 resets, run finished after 113 ms. (steps per millisecond=388 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 27 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 331 edges and 626 vertex of which 7 / 626 are part of one of the 1 SCC in 16 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1267 edges and 620 vertex of which 617 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 617 transition count 432
Reduce places removed 121 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 129 rules applied. Total rules applied 252 place count 496 transition count 424
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 260 place count 488 transition count 424
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 260 place count 488 transition count 334
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 457 place count 381 transition count 334
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 530 place count 308 transition count 261
Iterating global reduction 3 with 73 rules applied. Total rules applied 603 place count 308 transition count 261
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 603 place count 308 transition count 253
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 621 place count 298 transition count 253
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 799 place count 208 transition count 165
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 801 place count 207 transition count 169
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 803 place count 207 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 805 place count 205 transition count 167
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 809 place count 205 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 810 place count 204 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 811 place count 203 transition count 166
Applied a total of 811 rules in 163 ms. Remains 203 /626 variables (removed 423) and now considering 166/562 (removed 396) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/626 places, 166/562 transitions.
[2021-05-09 08:00:14] [INFO ] Flatten gal took : 53 ms
[2021-05-09 08:00:14] [INFO ] Flatten gal took : 20 ms
[2021-05-09 08:00:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10883985887405590217.gal : 10 ms
[2021-05-09 08:00:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4633116587450235356.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/ReachabilityCardinality10883985887405590217.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4633116587450235356.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/ReachabilityCardinality10883985887405590217.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4633116587450235356.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4633116587450235356.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :9 after 27
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :70 after 111
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :111 after 300
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :300 after 725
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1415 after 2351
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-15 does not hold.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :2351 after 3179
Reachability property BusinessProcesses-PT-15-ReachabilityCardinality-14 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3179 after 6983
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-13 does not hold.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-09 does not hold.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-08 does not hold.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :6983 after 10119
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :10119 after 22239
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-12 does not hold.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-15-ReachabilityCardinality-07 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :22239 after 37179
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :37179 after 259903
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,457863,1.84392,63728,2,16360,27,198497,7,0,989,124495,0
Total reachable state count : 457863

Verifying 8 reachability properties.
Reachability property BusinessProcesses-PT-15-ReachabilityCardinality-07 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-15-ReachabilityCardinality-07,96,1.85056,63728,2,288,27,198497,8,0,992,124495,0
Invariant property BusinessProcesses-PT-15-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-15-ReachabilityCardinality-08,144,1.85344,63728,2,378,27,198497,9,0,1003,124495,0
Invariant property BusinessProcesses-PT-15-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-15-ReachabilityCardinality-09,1,1.85694,63728,2,204,27,198497,10,0,1008,124495,0
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-11 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-11 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-15-ReachabilityCardinality-11,0,1.87371,63728,1,0,27,198497,10,0,1018,124495,0
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-12 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-15-ReachabilityCardinality-12,288,1.87737,63728,2,407,27,198497,11,0,1023,124495,0
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-13 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-15-ReachabilityCardinality-13,1,1.8802,63728,2,204,27,198497,12,0,1028,124495,0
Reachability property BusinessProcesses-PT-15-ReachabilityCardinality-14 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-15-ReachabilityCardinality-14,4,1.88281,63728,2,216,27,198497,13,0,1030,124495,0
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-15 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-15-ReachabilityCardinality-15,16,1.88767,63728,2,278,27,198497,14,0,1044,124495,0
All properties solved without resorting to model-checking.

BK_STOP 1620547216885

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

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