About the Execution of 2025-gold for ErlangenMainframeV2-PT-bP04C04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 453.827 | 25678.00 | 46098.00 | 216.70 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r351-smll-178021502100030.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is ErlangenMainframeV2-PT-bP04C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100030
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.5K May 27 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 27 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 27 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 27 10:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 27 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 27 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 222K May 26 18:17 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 ErlangenMainframeV2-PT-bP04C04-UpperBounds-00
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-01
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-02
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-03
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-04
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-05
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-06
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-07
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-08
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-09
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-10
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-11
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-12
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-13
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-14
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1780320743954
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP04C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-01 13:32:26] [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]
[2026-06-01 13:32:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 13:32:26] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2026-06-01 13:32:26] [INFO ] Transformed 239 places.
[2026-06-01 13:32:27] [INFO ] Transformed 511 transitions.
[2026-06-01 13:32:27] [INFO ] Found NUPN structural information;
[2026-06-01 13:32:27] [INFO ] Parsed PT model containing 239 places and 511 transitions and 3954 arcs in 516 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
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 511 rows 239 cols
[2026-06-01 13:32:27] [INFO ] Computed 16 invariants in 46 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 (2 resets) in 210 ms. (47 steps per ms)
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 506 ms. (78 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-06-01 13:32:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:28] [INFO ] [Real]Absence check using 11 positive place invariants in 99 ms returned sat
[2026-06-01 13:32:28] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2026-06-01 13:32:29] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:29] [INFO ] Deduced a trap composed of 31 places in 594 ms of which 86 ms to minimize.
[2026-06-01 13:32:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned sat
[2026-06-01 13:32:30] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2026-06-01 13:32:30] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2026-06-01 13:32:30] [INFO ] Computed and/alt/rep : 242/594/242 causal constraints (skipped 268 transitions) in 230 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:34] [INFO ] Deduced a trap composed of 35 places in 529 ms of which 43 ms to minimize.
[2026-06-01 13:32:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 653 ms
[2026-06-01 13:32:34] [INFO ] Added : 231 causal constraints over 48 iterations in 4103 ms. Result :sat
Minimization took 352 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:35] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2026-06-01 13:32:35] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2026-06-01 13:32:35] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:35] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 4 ms to minimize.
[2026-06-01 13:32:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2026-06-01 13:32:35] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2026-06-01 13:32:35] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:36] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 3 ms to minimize.
[2026-06-01 13:32:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2026-06-01 13:32:36] [INFO ] Computed and/alt/rep : 242/594/242 causal constraints (skipped 268 transitions) in 159 ms.
[2026-06-01 13:32:39] [INFO ] Added : 242 causal constraints over 51 iterations in 3051 ms. Result :sat
Minimization took 495 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:39] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2026-06-01 13:32:39] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2026-06-01 13:32:40] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:40] [INFO ] Deduced a trap composed of 24 places in 560 ms of which 43 ms to minimize.
[2026-06-01 13:32:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:32:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2026-06-01 13:32:40] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2026-06-01 13:32:41] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:41] [INFO ] Deduced a trap composed of 24 places in 366 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:41] [INFO ] Deduced a trap composed of 25 places in 358 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:32:42] [INFO ] Deduced a trap composed of 37 places in 396 ms of which 45 ms to minimize.
[2026-06-01 13:32:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1213 ms
[2026-06-01 13:32:42] [INFO ] Computed and/alt/rep : 242/594/242 causal constraints (skipped 268 transitions) in 87 ms.
[2026-06-01 13:32:44] [INFO ] Added : 213 causal constraints over 43 iterations in 2077 ms. Result :sat
Minimization took 503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 511/511 transitions.
Graph (trivial) has 214 edges and 239 vertex of which 12 / 239 are part of one of the 5 SCC in 10 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 232 transition count 400
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 110 rules applied. Total rules applied 209 place count 134 transition count 388
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 212 place count 131 transition count 388
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 212 place count 131 transition count 384
Deduced a syphon composed of 4 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 221 place count 126 transition count 384
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 248 place count 99 transition count 357
Iterating global reduction 3 with 27 rules applied. Total rules applied 275 place count 99 transition count 357
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 275 place count 99 transition count 352
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 285 place count 94 transition count 352
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 297 place count 82 transition count 249
Ensure Unique test removed 2 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 311 place count 80 transition count 249
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 316 place count 75 transition count 103
Iterating global reduction 3 with 5 rules applied. Total rules applied 321 place count 75 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 322 place count 74 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 74 transition count 101
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 375 place count 48 transition count 75
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 389 place count 41 transition count 93
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 399 place count 41 transition count 83
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 401 place count 39 transition count 78
Iterating global reduction 4 with 2 rules applied. Total rules applied 403 place count 39 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 407 place count 39 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 409 place count 38 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 425 place count 38 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 427 place count 37 transition count 66
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 434 place count 37 transition count 59
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 449 place count 30 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 451 place count 30 transition count 49
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 452 place count 30 transition count 55
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 455 place count 29 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 461 place count 29 transition count 47
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 462 place count 29 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 463 place count 29 transition count 46
Applied a total of 463 rules in 271 ms. Remains 29 /239 variables (removed 210) and now considering 46/511 (removed 465) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 29/239 places, 46/511 transitions.
[2026-06-01 13:32:45] [INFO ] Flow matrix only has 43 transitions (discarded 3 similar events)
// Phase 1: matrix 43 rows 29 cols
[2026-06-01 13:32:45] [INFO ] Computed 13 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0] Max Struct:[1, 1, 1]
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 2900 ms. (344 steps per ms)
FORMULA ErlangenMainframeV2-PT-bP04C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 670 ms. (1490 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-06-01 13:32:49] [INFO ] Flatten gal took : 77 ms
[2026-06-01 13:32:49] [INFO ] Flatten gal took : 27 ms
[2026-06-01 13:32:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4701881964144483693.gal : 18 ms
[2026-06-01 13:32:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16405351614957671037.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4701881964144483693.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16405351614957671037.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 23114 ms.
BK_STOP 1780320769632
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="ErlangenMainframeV2-PT-bP04C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is ErlangenMainframeV2-PT-bP04C04, 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 r351-smll-178021502100030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV2-PT-bP04C04.tgz
mv ErlangenMainframeV2-PT-bP04C04 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 '
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 ;
