fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r092-tall-171624189400496
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DBSingleClientW-PT-d1m04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2331.672 68590.00 93858.00 251.50 219181 ? 4 5 normal

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.r092-tall-171624189400496.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 DBSingleClientW-PT-d1m04, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189400496
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K 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 1716319658082

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-21 19:27:39] [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-21 19:27:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:27:39] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-21 19:27:39] [INFO ] Transformed 1440 places.
[2024-05-21 19:27:39] [INFO ] Transformed 672 transitions.
[2024-05-21 19:27:39] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 210 ms.
Deduced a syphon composed of 1093 places in 11 ms
Reduce places removed 1093 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 347/347 places, 672/672 transitions.
[2024-05-21 19:27:39] [INFO ] Redundant transitions in 30 ms returned []
Running 671 sub problems to find dead transitions.
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 19:27:39] [INFO ] Computed 6 invariants in 39 ms
[2024-05-21 19:27:39] [INFO ] State equation strengthened by 418 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (OVERLAPS) 8/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:27:49] [INFO ] Deduced a trap composed of 160 places in 115 ms of which 21 ms to minimize.
[2024-05-21 19:27:52] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-05-21 19:27:53] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-05-21 19:27:53] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-21 19:27:53] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:27:53] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:27:53] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:27:53] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-21 19:27:53] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-21 19:27:54] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-05-21 19:27:54] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-21 19:27:54] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2024-05-21 19:27:54] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-05-21 19:27:54] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:27:54] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:27:54] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:27:55] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-05-21 19:27:55] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:27:55] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-05-21 19:27:55] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:28:02] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:28:03] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-21 19:28:04] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:28:04] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:28:04] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 6 ms to minimize.
[2024-05-21 19:28:04] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:28:04] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-21 19:28:04] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:28:04] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2024-05-21 19:28:05] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:28:09] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-05-21 19:28:10] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-21 19:28:10] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-21 19:28:10] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-21 19:28:10] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-21 19:28:10] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-21 19:28:10] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:28:10] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-21 19:28:10] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2024-05-21 19:28:11] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-21 19:28:11] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-21 19:28:11] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-05-21 19:28:11] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 1 ms to minimize.
[2024-05-21 19:28:11] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/1019 variables, and 65 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/347 constraints, ReadFeed: 0/418 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (OVERLAPS) 8/333 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:28:19] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:28:19] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:28:20] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-21 19:28:20] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-21 19:28:20] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-21 19:28:20] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-21 19:28:20] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-05-21 19:28:20] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 2 ms to minimize.
[2024-05-21 19:28:20] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
[2024-05-21 19:28:21] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-05-21 19:28:21] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 2 ms to minimize.
[2024-05-21 19:28:21] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 2 ms to minimize.
[2024-05-21 19:28:21] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2024-05-21 19:28:22] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 2 ms to minimize.
[2024-05-21 19:28:22] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2024-05-21 19:28:22] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2024-05-21 19:28:22] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 9 ms to minimize.
[2024-05-21 19:28:22] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 2 ms to minimize.
[2024-05-21 19:28:22] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2024-05-21 19:28:22] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:28:26] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-21 19:28:27] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:28:27] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:28:27] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-21 19:28:27] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-21 19:28:27] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 3 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
[2024-05-21 19:28:28] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2024-05-21 19:28:29] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 5 ms to minimize.
[2024-05-21 19:28:29] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-05-21 19:28:29] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 3 ms to minimize.
[2024-05-21 19:28:29] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-21 19:28:29] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-05-21 19:28:29] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-05-21 19:28:30] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 19:28:34] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-21 19:28:35] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-21 19:28:35] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:28:35] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:28:35] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:28:35] [INFO ] Deduced a trap composed of 106 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:28:35] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:28:35] [INFO ] Deduced a trap composed of 106 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:28:35] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
[2024-05-21 19:28:35] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-21 19:28:36] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-21 19:28:36] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-05-21 19:28:36] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
[2024-05-21 19:28:36] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2024-05-21 19:28:36] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
[2024-05-21 19:28:36] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-21 19:28:36] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-05-21 19:28:37] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-21 19:28:37] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 3 ms to minimize.
[2024-05-21 19:28:37] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/1019 variables, and 125 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/347 constraints, ReadFeed: 0/418 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 120/120 constraints]
After SMT, in 62328ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 62355ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 62546 ms. Remains : 347/347 places, 672/672 transitions.
Final net has 347 places and 672 transitions.
[2024-05-21 19:28:42] [INFO ] Flatten gal took : 75 ms
[2024-05-21 19:28:42] [INFO ] Applying decomposition
[2024-05-21 19:28:42] [INFO ] Flatten gal took : 35 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/graph12520903373648527430.txt' '-o' '/tmp/graph12520903373648527430.bin' '-w' '/tmp/graph12520903373648527430.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12520903373648527430.bin' '-l' '-1' '-v' '-w' '/tmp/graph12520903373648527430.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:28:42] [INFO ] Decomposing Gal with order
[2024-05-21 19:28:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:28:42] [INFO ] Removed a total of 581 redundant transitions.
[2024-05-21 19:28:42] [INFO ] Flatten gal took : 196 ms
[2024-05-21 19:28:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 683 labels/synchronizations in 30 ms.
[2024-05-21 19:28:42] [INFO ] Time to serialize gal into /tmp/StateSpace4161234039811251382.gal : 10 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/StateSpace4161234039811251382.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 ...219
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,219181,3.7517,120984,2225,4819,35412,112061,972,191317,768,1.53025e+06,0
Total reachable state count : 219181

Max variable value : 4
STATE_SPACE MAX_TOKEN_IN_PLACE 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 5
STATE_SPACE MAX_TOKEN_PER_MARKING 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 219181
STATE_SPACE STATES 219181 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 67387 ms.

BK_STOP 1716319726672

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DBSingleClientW-PT-d1m04"
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 DBSingleClientW-PT-d1m04, 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 r092-tall-171624189400496"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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