About the Execution of ITS-Tools for BusinessProcesses-PT-19
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2379.075 | 165606.00 | 198610.00 | 138.40 | 7.1571E+0033 ? 1 84 | normal |
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-171620399800600.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-19, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800600
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 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 189K 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 1716337774161
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-22 00:29:35] [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-22 00:29:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:29:36] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-05-22 00:29:36] [INFO ] Transformed 772 places.
[2024-05-22 00:29:36] [INFO ] Transformed 685 transitions.
[2024-05-22 00:29:36] [INFO ] Found NUPN structural information;
[2024-05-22 00:29:36] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 409 ms.
Deduced a syphon composed of 15 places in 20 ms
Reduce places removed 15 places and 15 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 757/757 places, 670/670 transitions.
[2024-05-22 00:29:36] [INFO ] Redundant transitions in 36 ms returned []
Running 669 sub problems to find dead transitions.
// Phase 1: matrix 670 rows 757 cols
[2024-05-22 00:29:36] [INFO ] Computed 125 invariants in 38 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 748/748 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 44/792 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (OVERLAPS) 9/757 variables, 78/870 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/757 variables, 9/879 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/757 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 23 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 193 places in 369 ms of which 6 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 173 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 201 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 179 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 187 places in 360 ms of which 4 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 202 places in 261 ms of which 19 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 173 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 197 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 3 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 149 places in 207 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 146 places in 257 ms of which 4 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 143 places in 209 ms of which 4 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 140 places in 255 ms of which 5 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 161 places in 254 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 151 places in 359 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 133 places in 204 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 153 places in 191 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 20/902 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 757/1427 variables, and 902 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30043 ms.
Refiners :[Domain max(s): 757/757 constraints, Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/757 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 669 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 748/748 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 44/792 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (OVERLAPS) 9/757 variables, 78/870 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/757 variables, 9/879 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/757 variables, 3/882 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 20/902 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 181 places in 237 ms of which 5 ms to minimize.
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 179 places in 188 ms of which 5 ms to minimize.
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 191 places in 215 ms of which 3 ms to minimize.
[2024-05-22 00:30:19] [INFO ] Deduced a trap composed of 203 places in 270 ms of which 3 ms to minimize.
[2024-05-22 00:30:19] [INFO ] Deduced a trap composed of 147 places in 252 ms of which 4 ms to minimize.
[2024-05-22 00:30:19] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 3 ms to minimize.
[2024-05-22 00:30:19] [INFO ] Deduced a trap composed of 195 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 148 places in 203 ms of which 4 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 195 places in 184 ms of which 4 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 165 places in 217 ms of which 4 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 176 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:30:21] [INFO ] Deduced a trap composed of 195 places in 194 ms of which 4 ms to minimize.
[2024-05-22 00:30:21] [INFO ] Deduced a trap composed of 176 places in 223 ms of which 4 ms to minimize.
[2024-05-22 00:30:21] [INFO ] Deduced a trap composed of 178 places in 191 ms of which 5 ms to minimize.
[2024-05-22 00:30:21] [INFO ] Deduced a trap composed of 163 places in 214 ms of which 4 ms to minimize.
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 171 places in 200 ms of which 4 ms to minimize.
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 203 places in 214 ms of which 4 ms to minimize.
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 175 places in 230 ms of which 4 ms to minimize.
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 184 places in 202 ms of which 4 ms to minimize.
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 186 places in 199 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 20/922 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-05-22 00:30:24] [INFO ] Deduced a trap composed of 193 places in 234 ms of which 5 ms to minimize.
[2024-05-22 00:30:24] [INFO ] Deduced a trap composed of 185 places in 228 ms of which 4 ms to minimize.
[2024-05-22 00:30:24] [INFO ] Deduced a trap composed of 184 places in 270 ms of which 5 ms to minimize.
[2024-05-22 00:30:24] [INFO ] Deduced a trap composed of 152 places in 276 ms of which 6 ms to minimize.
[2024-05-22 00:30:25] [INFO ] Deduced a trap composed of 157 places in 309 ms of which 5 ms to minimize.
[2024-05-22 00:30:25] [INFO ] Deduced a trap composed of 195 places in 198 ms of which 4 ms to minimize.
[2024-05-22 00:30:25] [INFO ] Deduced a trap composed of 157 places in 198 ms of which 4 ms to minimize.
[2024-05-22 00:30:25] [INFO ] Deduced a trap composed of 185 places in 294 ms of which 31 ms to minimize.
[2024-05-22 00:30:26] [INFO ] Deduced a trap composed of 192 places in 219 ms of which 4 ms to minimize.
[2024-05-22 00:30:26] [INFO ] Deduced a trap composed of 174 places in 197 ms of which 4 ms to minimize.
[2024-05-22 00:30:26] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 6 ms to minimize.
[2024-05-22 00:30:27] [INFO ] Deduced a trap composed of 190 places in 288 ms of which 31 ms to minimize.
[2024-05-22 00:30:27] [INFO ] Deduced a trap composed of 156 places in 295 ms of which 30 ms to minimize.
[2024-05-22 00:30:27] [INFO ] Deduced a trap composed of 144 places in 208 ms of which 4 ms to minimize.
[2024-05-22 00:30:27] [INFO ] Deduced a trap composed of 154 places in 295 ms of which 30 ms to minimize.
[2024-05-22 00:30:28] [INFO ] Deduced a trap composed of 188 places in 264 ms of which 8 ms to minimize.
[2024-05-22 00:30:28] [INFO ] Deduced a trap composed of 156 places in 269 ms of which 6 ms to minimize.
[2024-05-22 00:30:28] [INFO ] Deduced a trap composed of 186 places in 249 ms of which 4 ms to minimize.
[2024-05-22 00:30:29] [INFO ] Deduced a trap composed of 166 places in 241 ms of which 4 ms to minimize.
[2024-05-22 00:30:29] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/757 variables, 20/942 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-05-22 00:30:30] [INFO ] Deduced a trap composed of 180 places in 219 ms of which 4 ms to minimize.
[2024-05-22 00:30:30] [INFO ] Deduced a trap composed of 169 places in 199 ms of which 4 ms to minimize.
[2024-05-22 00:30:30] [INFO ] Deduced a trap composed of 171 places in 214 ms of which 4 ms to minimize.
[2024-05-22 00:30:31] [INFO ] Deduced a trap composed of 186 places in 214 ms of which 5 ms to minimize.
[2024-05-22 00:30:31] [INFO ] Deduced a trap composed of 193 places in 257 ms of which 9 ms to minimize.
[2024-05-22 00:30:31] [INFO ] Deduced a trap composed of 192 places in 218 ms of which 4 ms to minimize.
[2024-05-22 00:30:31] [INFO ] Deduced a trap composed of 193 places in 210 ms of which 4 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 177 places in 212 ms of which 5 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 194 places in 213 ms of which 4 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 177 places in 265 ms of which 4 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 196 places in 200 ms of which 4 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 173 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 187 places in 270 ms of which 5 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 149 places in 214 ms of which 4 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 175 places in 269 ms of which 3 ms to minimize.
[2024-05-22 00:30:34] [INFO ] Deduced a trap composed of 157 places in 284 ms of which 18 ms to minimize.
[2024-05-22 00:30:34] [INFO ] Deduced a trap composed of 148 places in 302 ms of which 8 ms to minimize.
[2024-05-22 00:30:34] [INFO ] Deduced a trap composed of 149 places in 264 ms of which 7 ms to minimize.
[2024-05-22 00:30:35] [INFO ] Deduced a trap composed of 187 places in 283 ms of which 7 ms to minimize.
[2024-05-22 00:30:35] [INFO ] Deduced a trap composed of 181 places in 262 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/757 variables, 20/962 constraints. Problems are: Problem set: 0 solved, 669 unsolved
[2024-05-22 00:30:37] [INFO ] Deduced a trap composed of 174 places in 275 ms of which 4 ms to minimize.
SMT process timed out in 60406ms, After SMT, problems are : Problem set: 0 solved, 669 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 60626 ms. Remains : 757/757 places, 670/670 transitions.
Final net has 757 places and 670 transitions.
[2024-05-22 00:30:37] [INFO ] Flatten gal took : 227 ms
[2024-05-22 00:30:37] [INFO ] Applying decomposition
[2024-05-22 00:30:37] [INFO ] Flatten gal took : 90 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/graph16194000313900883367.txt' '-o' '/tmp/graph16194000313900883367.bin' '-w' '/tmp/graph16194000313900883367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16194000313900883367.bin' '-l' '-1' '-v' '-w' '/tmp/graph16194000313900883367.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:30:38] [INFO ] Decomposing Gal with order
[2024-05-22 00:30:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:30:38] [INFO ] Removed a total of 293 redundant transitions.
[2024-05-22 00:30:38] [INFO ] Flatten gal took : 179 ms
[2024-05-22 00:30:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 26 ms.
[2024-05-22 00:30:38] [INFO ] Time to serialize gal into /tmp/StateSpace15535561023783048141.gal : 30 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/StateSpace15535561023783048141.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,7.15711e+33,100.472,1842404,15777,71,2.09442e+06,751,1579,1.05841e+07,70,2113,0
Total reachable state count : 7157109122888014326953749140996096
Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 84
STATE_SPACE MAX_TOKEN_PER_MARKING 84 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 7157109122888014326661611003347285
STATE_SPACE STATES 7157109122888014326661611003347285 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 163745 ms.
BK_STOP 1716337939767
--------------------
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="BusinessProcesses-PT-19"
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 BusinessProcesses-PT-19, 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 r048-tajo-171620399800600"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 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 '
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 ;