Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640604100760.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is HealthRecord-PT-08, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604100760
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K 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 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 20:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 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 68K May 18 16:42 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716520025138

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-24 03:07:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:07:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:07:06] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-24 03:07:06] [INFO ] Transformed 156 places.
[2024-05-24 03:07:06] [INFO ] Transformed 326 transitions.
[2024-05-24 03:07:06] [INFO ] Found NUPN structural information;
[2024-05-24 03:07:06] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 169 ms.
Ensure Unique test removed 17 transitions
Reduce redundant transitions removed 39 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 156/156 places, 287/287 transitions.
[2024-05-24 03:07:06] [INFO ] Redundant transitions in 20 ms returned []
Running 286 sub problems to find dead transitions.
// Phase 1: matrix 287 rows 156 cols
[2024-05-24 03:07:06] [INFO ] Computed 18 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 11/156 variables, 10/155 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 11/166 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-24 03:07:09] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 17 ms to minimize.
[2024-05-24 03:07:09] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:07:09] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:07:09] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:07:09] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:07:09] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:09] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:07:10] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 4 ms to minimize.
[2024-05-24 03:07:11] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:12] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:07:12] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:07:12] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:07:12] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 3 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 2 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 12 (OVERLAPS) 287/443 variables, 156/425 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 14 (OVERLAPS) 0/443 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 425 constraints, problems are : Problem set: 0 solved, 286 unsolved in 19720 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 11/156 variables, 10/155 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 11/166 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 95/269 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-24 03:07:27] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:07:27] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:27] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:27] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:07:27] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:28] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:28] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 287/443 variables, 156/432 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 286/718 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-24 03:07:31] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2024-05-24 03:07:31] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:07:32] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:07:32] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:07:32] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:07:32] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:07:32] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:32] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:07:33] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-05-24 03:07:33] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:36] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 12/730 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-24 03:07:40] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:07:41] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:07:41] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:07:41] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 4/734 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-24 03:07:49] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:07:50] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:07:50] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:07:51] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:52] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 5/739 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 739 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30019 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 123/123 constraints]
After SMT, in 49954ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 49971ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 50104 ms. Remains : 156/156 places, 287/287 transitions.
Final net has 156 places and 287 transitions.
[2024-05-24 03:07:56] [INFO ] Flatten gal took : 52 ms
[2024-05-24 03:07:56] [INFO ] Applying decomposition
[2024-05-24 03:07:56] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2884668564909304503.txt' '-o' '/tmp/graph2884668564909304503.bin' '-w' '/tmp/graph2884668564909304503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2884668564909304503.bin' '-l' '-1' '-v' '-w' '/tmp/graph2884668564909304503.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:07:56] [INFO ] Decomposing Gal with order
[2024-05-24 03:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:07:57] [INFO ] Removed a total of 84 redundant transitions.
[2024-05-24 03:07:57] [INFO ] Flatten gal took : 55 ms
[2024-05-24 03:07:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 7 ms.
[2024-05-24 03:07:57] [INFO ] Time to serialize gal into /tmp/StateSpace14255773090460916363.gal : 8 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/StateSpace14255773090460916363.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
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\_mod\_flat,8.06932e+08,2.4042,71168,1530,2124,63928,39602,458,190230,268,474933,0
Total reachable state count : 806931788

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 10
STATE_SPACE MAX_TOKEN_PER_MARKING 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 806931788
STATE_SPACE STATES 806931788 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 53289 ms.

BK_STOP 1716520079658

--------------------
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
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -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 StateSpace -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="HealthRecord-PT-08"
export BK_EXAMINATION="StateSpace"
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 HealthRecord-PT-08, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-tall-171640604100760"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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