Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r139-smll-174876533100029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is MedleyA-PT-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533100029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 175K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748896092481

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:28:14] [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]
[2025-06-02 20:28:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:28:14] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2025-06-02 20:28:14] [INFO ] Transformed 248 places.
[2025-06-02 20:28:14] [INFO ] Transformed 591 transitions.
[2025-06-02 20:28:14] [INFO ] Found NUPN structural information;
[2025-06-02 20:28:14] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 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 589 rows 248 cols
[2025-06-02 20:28:15] [INFO ] Computed 7 invariants in 32 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 (344 resets) in 69 ms. (142 steps per ms)
FORMULA MedleyA-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130008 steps (973 resets) in 207 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[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]
[2025-06-02 20:28:15] [INFO ] Invariant cache hit.
[2025-06-02 20:28:15] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-02 20:28:16] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-06-02 20:28:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:28:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:28:16] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2025-06-02 20:28:17] [INFO ] Deduced a trap composed of 28 places in 296 ms of which 36 ms to minimize.
[2025-06-02 20:28:17] [INFO ] Deduced a trap composed of 48 places in 239 ms of which 3 ms to minimize.
[2025-06-02 20:28:17] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 2 ms to minimize.
[2025-06-02 20:28:17] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:28:17] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2025-06-02 20:28:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1276 ms
[2025-06-02 20:28:18] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 108 ms.
[2025-06-02 20:28:19] [INFO ] Added : 124 causal constraints over 25 iterations in 1392 ms. Result :sat
Minimization took 394 ms.
[2025-06-02 20:28:19] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:28:20] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2025-06-02 20:28:20] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 5 ms to minimize.
[2025-06-02 20:28:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:28:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:28:20] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2025-06-02 20:28:21] [INFO ] Deduced a trap composed of 41 places in 303 ms of which 5 ms to minimize.
[2025-06-02 20:28:21] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 4 ms to minimize.
[2025-06-02 20:28:21] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 2 ms to minimize.
[2025-06-02 20:28:22] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:28:22] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 4 ms to minimize.
[2025-06-02 20:28:22] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 4 ms to minimize.
[2025-06-02 20:28:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1761 ms
[2025-06-02 20:28:22] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 78 ms.
[2025-06-02 20:28:24] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 4 ms to minimize.
[2025-06-02 20:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2025-06-02 20:28:24] [INFO ] Added : 130 causal constraints over 26 iterations in 1752 ms. Result :sat
Minimization took 393 ms.
[2025-06-02 20:28:25] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:28:25] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2025-06-02 20:28:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:28:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:28:25] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2025-06-02 20:28:25] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 3 ms to minimize.
[2025-06-02 20:28:26] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 2 ms to minimize.
[2025-06-02 20:28:26] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 3 ms to minimize.
[2025-06-02 20:28:26] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 3 ms to minimize.
[2025-06-02 20:28:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 840 ms
[2025-06-02 20:28:26] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 56 ms.
[2025-06-02 20:28:27] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 3 ms to minimize.
[2025-06-02 20:28:28] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 3 ms to minimize.
[2025-06-02 20:28:28] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 3 ms to minimize.
[2025-06-02 20:28:28] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 3 ms to minimize.
[2025-06-02 20:28:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1070 ms
[2025-06-02 20:28:28] [INFO ] Added : 130 causal constraints over 27 iterations in 2294 ms. Result :sat
Minimization took 409 ms.
[2025-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2025-06-02 20:28:29] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 4 ms to minimize.
[2025-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:28:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:28:30] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2025-06-02 20:28:30] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 3 ms to minimize.
[2025-06-02 20:28:30] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 2 ms to minimize.
[2025-06-02 20:28:31] [INFO ] Deduced a trap composed of 28 places in 298 ms of which 4 ms to minimize.
[2025-06-02 20:28:31] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 3 ms to minimize.
[2025-06-02 20:28:31] [INFO ] Deduced a trap composed of 33 places in 240 ms of which 2 ms to minimize.
[2025-06-02 20:28:31] [INFO ] Deduced a trap composed of 52 places in 282 ms of which 4 ms to minimize.
[2025-06-02 20:28:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1707 ms
[2025-06-02 20:28:32] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 53 ms.
[2025-06-02 20:28:33] [INFO ] Added : 125 causal constraints over 25 iterations in 1342 ms. Result :sat
Minimization took 376 ms.
[2025-06-02 20:28:33] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:28:34] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-06-02 20:28:34] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 5 ms to minimize.
[2025-06-02 20:28:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:28:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:28:34] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2025-06-02 20:28:34] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 3 ms to minimize.
[2025-06-02 20:28:35] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 3 ms to minimize.
[2025-06-02 20:28:35] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 4 ms to minimize.
[2025-06-02 20:28:35] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 3 ms to minimize.
[2025-06-02 20:28:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1228 ms
[2025-06-02 20:28:35] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 63 ms.
[2025-06-02 20:28:37] [INFO ] Deduced a trap composed of 48 places in 280 ms of which 3 ms to minimize.
[2025-06-02 20:28:37] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 5 ms to minimize.
[2025-06-02 20:28:38] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 3 ms to minimize.
[2025-06-02 20:28:38] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 3 ms to minimize.
[2025-06-02 20:28:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1136 ms
[2025-06-02 20:28:38] [INFO ] Added : 138 causal constraints over 28 iterations in 2607 ms. Result :sat
Minimization took 273 ms.
[2025-06-02 20:28:38] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2025-06-02 20:28:39] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2025-06-02 20:28:39] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 4 ms to minimize.
[2025-06-02 20:28:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:28:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:28:39] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2025-06-02 20:28:39] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:28:40] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2025-06-02 20:28:40] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 2 ms to minimize.
[2025-06-02 20:28:40] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 2 ms to minimize.
[2025-06-02 20:28:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 858 ms
[2025-06-02 20:28:40] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 75 ms.
[2025-06-02 20:28:42] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 3 ms to minimize.
[2025-06-02 20:28:42] [INFO ] Deduced a trap composed of 48 places in 250 ms of which 3 ms to minimize.
[2025-06-02 20:28:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 592 ms
[2025-06-02 20:28:42] [INFO ] Added : 165 causal constraints over 33 iterations in 2348 ms. Result :sat
Minimization took 444 ms.
[2025-06-02 20:28:43] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:28:43] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2025-06-02 20:28:44] [INFO ] Deduced a trap composed of 41 places in 249 ms of which 4 ms to minimize.
[2025-06-02 20:28:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:28:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:28:44] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2025-06-02 20:28:44] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 3 ms to minimize.
[2025-06-02 20:28:45] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 2 ms to minimize.
[2025-06-02 20:28:45] [INFO ] Deduced a trap composed of 51 places in 236 ms of which 2 ms to minimize.
[2025-06-02 20:28:45] [INFO ] Deduced a trap composed of 29 places in 275 ms of which 4 ms to minimize.
[2025-06-02 20:28:45] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 4 ms to minimize.
[2025-06-02 20:28:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1421 ms
[2025-06-02 20:28:45] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 56 ms.
[2025-06-02 20:28:47] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 3 ms to minimize.
[2025-06-02 20:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2025-06-02 20:28:47] [INFO ] Added : 127 causal constraints over 26 iterations in 1612 ms. Result :sat
Minimization took 409 ms.
[2025-06-02 20:28:48] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:28:48] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-06-02 20:28:48] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 2 ms to minimize.
[2025-06-02 20:28:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:28:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:28:48] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2025-06-02 20:28:49] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 3 ms to minimize.
[2025-06-02 20:28:49] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2025-06-02 20:28:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2025-06-02 20:28:49] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 70 ms.
[2025-06-02 20:28:51] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 2 ms to minimize.
[2025-06-02 20:28:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
[2025-06-02 20:28:51] [INFO ] Added : 125 causal constraints over 26 iterations in 2106 ms. Result :sat
Minimization took 432 ms.
[2025-06-02 20:28:52] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:28:52] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2025-06-02 20:28:52] [INFO ] Deduced a trap composed of 29 places in 373 ms of which 6 ms to minimize.
[2025-06-02 20:28:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:28:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:28:53] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2025-06-02 20:28:53] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 4 ms to minimize.
[2025-06-02 20:28:53] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 3 ms to minimize.
[2025-06-02 20:28:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 663 ms
[2025-06-02 20:28:53] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 49 ms.
[2025-06-02 20:28:55] [INFO ] Added : 150 causal constraints over 30 iterations in 1522 ms. Result :sat
Minimization took 443 ms.
[2025-06-02 20:28:55] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:28:56] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2025-06-02 20:28:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:28:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:28:56] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2025-06-02 20:28:56] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 2 ms to minimize.
[2025-06-02 20:28:57] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 3 ms to minimize.
[2025-06-02 20:28:57] [INFO ] Deduced a trap composed of 19 places in 234 ms of which 3 ms to minimize.
[2025-06-02 20:28:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 766 ms
[2025-06-02 20:28:57] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 53 ms.
[2025-06-02 20:28:58] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 2 ms to minimize.
[2025-06-02 20:28:59] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 4 ms to minimize.
[2025-06-02 20:28:59] [INFO ] Deduced a trap composed of 37 places in 307 ms of which 4 ms to minimize.
[2025-06-02 20:28:59] [INFO ] Deduced a trap composed of 49 places in 288 ms of which 4 ms to minimize.
[2025-06-02 20:29:00] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 4 ms to minimize.
[2025-06-02 20:29:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1622 ms
[2025-06-02 20:29:00] [INFO ] Added : 163 causal constraints over 34 iterations in 3178 ms. Result :sat
Minimization took 401 ms.
[2025-06-02 20:29:01] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:29:01] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2025-06-02 20:29:01] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 3 ms to minimize.
[2025-06-02 20:29:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:29:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:29:01] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2025-06-02 20:29:02] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 3 ms to minimize.
[2025-06-02 20:29:02] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 4 ms to minimize.
[2025-06-02 20:29:02] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 3 ms to minimize.
[2025-06-02 20:29:02] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2025-06-02 20:29:03] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 4 ms to minimize.
[2025-06-02 20:29:03] [INFO ] Deduced a trap composed of 29 places in 280 ms of which 4 ms to minimize.
[2025-06-02 20:29:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1568 ms
[2025-06-02 20:29:03] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 65 ms.
[2025-06-02 20:29:05] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2025-06-02 20:29:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2025-06-02 20:29:05] [INFO ] Added : 168 causal constraints over 34 iterations in 2300 ms. Result :sat
Minimization took 457 ms.
[2025-06-02 20:29:06] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2025-06-02 20:29:06] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2025-06-02 20:29:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:29:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-02 20:29:06] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2025-06-02 20:29:07] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 4 ms to minimize.
[2025-06-02 20:29:07] [INFO ] Deduced a trap composed of 28 places in 296 ms of which 4 ms to minimize.
[2025-06-02 20:29:07] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 5 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 2 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 4 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 3 ms to minimize.
[2025-06-02 20:29:08] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2025-06-02 20:29:09] [INFO ] Deduced a trap composed of 17 places in 351 ms of which 4 ms to minimize.
[2025-06-02 20:29:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2460 ms
[2025-06-02 20:29:09] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 59 ms.
[2025-06-02 20:29:10] [INFO ] Added : 134 causal constraints over 27 iterations in 1244 ms. Result :sat
Minimization took 284 ms.
[2025-06-02 20:29:11] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:29:11] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2025-06-02 20:29:11] [INFO ] Deduced a trap composed of 36 places in 253 ms of which 2 ms to minimize.
[2025-06-02 20:29:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:29:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-02 20:29:11] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2025-06-02 20:29:12] [INFO ] Deduced a trap composed of 36 places in 334 ms of which 4 ms to minimize.
[2025-06-02 20:29:12] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 3 ms to minimize.
[2025-06-02 20:29:12] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 2 ms to minimize.
[2025-06-02 20:29:13] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 2 ms to minimize.
[2025-06-02 20:29:13] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 3 ms to minimize.
[2025-06-02 20:29:13] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 2 ms to minimize.
[2025-06-02 20:29:13] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 3 ms to minimize.
[2025-06-02 20:29:14] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 2 ms to minimize.
[2025-06-02 20:29:14] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 2 ms to minimize.
[2025-06-02 20:29:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2666 ms
[2025-06-02 20:29:14] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 69 ms.
[2025-06-02 20:29:16] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 2 ms to minimize.
[2025-06-02 20:29:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2025-06-02 20:29:16] [INFO ] Added : 148 causal constraints over 30 iterations in 1961 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[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]
FORMULA MedleyA-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[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]
Support contains 12 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 589/589 transitions.
Graph (trivial) has 259 edges and 248 vertex of which 6 / 248 are part of one of the 2 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 244 transition count 555
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 216 transition count 551
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 213 transition count 551
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 64 place count 213 transition count 535
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 96 place count 197 transition count 535
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 144 place count 149 transition count 452
Iterating global reduction 3 with 48 rules applied. Total rules applied 192 place count 149 transition count 452
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 209 place count 149 transition count 435
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 209 place count 149 transition count 431
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 217 place count 145 transition count 431
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 219 place count 143 transition count 413
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 143 transition count 413
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 251 place count 128 transition count 398
Performed 23 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 297 place count 105 transition count 509
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 303 place count 105 transition count 503
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 305 place count 103 transition count 487
Iterating global reduction 5 with 2 rules applied. Total rules applied 307 place count 103 transition count 487
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 315 place count 103 transition count 479
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 6 with 27 rules applied. Total rules applied 342 place count 103 transition count 452
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 343 place count 102 transition count 451
Iterating global reduction 6 with 1 rules applied. Total rules applied 344 place count 102 transition count 451
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 352 place count 98 transition count 447
Free-agglomeration rule applied 31 times.
Iterating global reduction 6 with 31 rules applied. Total rules applied 383 place count 98 transition count 416
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 53 rules applied. Total rules applied 436 place count 67 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 7 with 40 rules applied. Total rules applied 476 place count 67 transition count 354
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 478 place count 67 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 480 place count 65 transition count 382
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 481 place count 64 transition count 381
Applied a total of 481 rules in 320 ms. Remains 64 /248 variables (removed 184) and now considering 381/589 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 64/248 places, 381/589 transitions.
[2025-06-02 20:29:18] [INFO ] Flow matrix only has 311 transitions (discarded 70 similar events)
// Phase 1: matrix 311 rows 64 cols
[2025-06-02 20:29:18] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 1000000 steps (75088 resets) in 3534 ms. (282 steps per ms)
FORMULA MedleyA-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (16176 resets) in 935 ms. (1068 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 )
[2025-06-02 20:29:22] [INFO ] Flatten gal took : 133 ms
[2025-06-02 20:29:22] [INFO ] Flatten gal took : 55 ms
[2025-06-02 20:29:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5468799051401774418.gal : 28 ms
[2025-06-02 20:29:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6444825694709122696.prop : 1 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/ReachabilityCardinality5468799051401774418.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6444825694709122696.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 68553 ms.

BK_STOP 1748896163192

--------------------
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="MedleyA-PT-17"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is MedleyA-PT-17, 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 r139-smll-174876533100029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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