Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716333938993

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 23:25:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:25:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:25:40] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-21 23:25:40] [INFO ] Transformed 376 places.
[2024-05-21 23:25:40] [INFO ] Transformed 297 transitions.
[2024-05-21 23:25:40] [INFO ] Found NUPN structural information;
[2024-05-21 23:25:40] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 296 rows 375 cols
[2024-05-21 23:25:40] [INFO ] Computed 81 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (105 resets) in 40 ms. (243 steps per ms)
FORMULA BusinessProcesses-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (70 resets) in 44 ms. (888 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-21 23:25:40] [INFO ] Invariant cache hit.
[2024-05-21 23:25:41] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned sat
[2024-05-21 23:25:41] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 11 ms returned sat
[2024-05-21 23:25:41] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 9 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:25:41] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2024-05-21 23:25:41] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 11 ms returned sat
[2024-05-21 23:25:41] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:25:41] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:25:42] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 725 ms
[2024-05-21 23:25:42] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 25 ms.
[2024-05-21 23:25:43] [INFO ] Added : 242 causal constraints over 49 iterations in 999 ms. Result :sat
Minimization took 259 ms.
[2024-05-21 23:25:43] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned sat
[2024-05-21 23:25:43] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 18 ms returned sat
[2024-05-21 23:25:43] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:25:44] [INFO ] [Nat]Absence check using 42 positive place invariants in 16 ms returned sat
[2024-05-21 23:25:44] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 15 ms returned sat
[2024-05-21 23:25:44] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 4 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 6 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:25:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1003 ms
[2024-05-21 23:25:45] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 25 ms.
[2024-05-21 23:25:46] [INFO ] Added : 234 causal constraints over 48 iterations in 949 ms. Result :sat
Minimization took 156 ms.
[2024-05-21 23:25:46] [INFO ] [Real]Absence check using 42 positive place invariants in 11 ms returned sat
[2024-05-21 23:25:46] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 16 ms returned sat
[2024-05-21 23:25:46] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-21 23:25:46] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:25:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:25:46] [INFO ] [Nat]Absence check using 42 positive place invariants in 15 ms returned sat
[2024-05-21 23:25:46] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 11 ms returned sat
[2024-05-21 23:25:46] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-21 23:25:46] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 5 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:25:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 856 ms
[2024-05-21 23:25:47] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 26 ms.
[2024-05-21 23:25:48] [INFO ] Added : 246 causal constraints over 50 iterations in 1098 ms. Result :sat
Minimization took 176 ms.
[2024-05-21 23:25:49] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned sat
[2024-05-21 23:25:49] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 14 ms returned sat
[2024-05-21 23:25:49] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:25:49] [INFO ] [Nat]Absence check using 42 positive place invariants in 16 ms returned sat
[2024-05-21 23:25:49] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 12 ms returned sat
[2024-05-21 23:25:49] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:25:49] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:25:50] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 4 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:25:52] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2348 ms
[2024-05-21 23:25:52] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 21 ms.
[2024-05-21 23:25:53] [INFO ] Added : 234 causal constraints over 47 iterations in 1150 ms. Result :sat
Minimization took 259 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA BusinessProcesses-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 194 edges and 375 vertex of which 7 / 375 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 684 edges and 369 vertex of which 366 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 366 transition count 221
Reduce places removed 65 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 301 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 299 transition count 219
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 137 place count 299 transition count 154
Deduced a syphon composed of 65 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 276 place count 225 transition count 154
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 315 place count 186 transition count 115
Iterating global reduction 3 with 39 rules applied. Total rules applied 354 place count 186 transition count 115
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 496 place count 111 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 497 place count 111 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 498 place count 110 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 499 place count 110 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 500 place count 109 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 501 place count 108 transition count 46
Applied a total of 501 rules in 143 ms. Remains 108 /375 variables (removed 267) and now considering 46/296 (removed 250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 108/375 places, 46/296 transitions.
// Phase 1: matrix 46 rows 108 cols
[2024-05-21 23:25:54] [INFO ] Computed 62 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (21739 resets) in 2354 ms. (424 steps per ms)
FORMULA BusinessProcesses-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (6030 resets) in 1261 ms. (792 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-21 23:25:57] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:25:57] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:25:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2403896691333541805.gal : 10 ms
[2024-05-21 23:25:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8505458046493444567.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2403896691333541805.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8505458046493444567.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :
ITS tools runner thread asked to quit. Dying gracefully.

java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 17589 ms.

BK_STOP 1716333958015

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-06.tgz
mv BusinessProcesses-PT-06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;