fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r125-tall-174876435800090
Last Updated
June 24, 2025

About the Execution of 2024-gold for LeafsetExtension-PT-S08C3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15685.940 9534.00 15958.00 90.40 1 3 1 1 1 1 3 1 3 1 1 1 1 1 3 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/mcc2025-input.r125-tall-174876435800090.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 LeafsetExtension-PT-S08C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435800090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 254K 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 LeafsetExtension-PT-S08C3-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748776114179

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 11:08:35] [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-01 11:08:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:08:35] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2025-06-01 11:08:35] [INFO ] Transformed 462 places.
[2025-06-01 11:08:35] [INFO ] Transformed 409 transitions.
[2025-06-01 11:08:35] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 409 rows 462 cols
[2025-06-01 11:08:35] [INFO ] Computed 53 invariants in 45 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:[+inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, 1, 1, +inf, 1]
RANDOM walk for 10000 steps (379 resets) in 47 ms. (208 steps per ms)
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110009 steps (705 resets) in 111 ms. (982 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 11:08:35] [INFO ] Invariant cache hit.
[2025-06-01 11:08:36] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2025-06-01 11:08:36] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 16 ms returned unsat
[2025-06-01 11:08:36] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-01 11:08:36] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned sat
[2025-06-01 11:08:36] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-06-01 11:08:36] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 31 ms.
[2025-06-01 11:08:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:08:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-06-01 11:08:36] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned sat
[2025-06-01 11:08:36] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-06-01 11:08:36] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 23 ms.
[2025-06-01 11:08:37] [INFO ] Added : 11 causal constraints over 3 iterations in 156 ms. Result :sat
Minimization took 161 ms.
[2025-06-01 11:08:37] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-01 11:08:37] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned unsat
[2025-06-01 11:08:37] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-01 11:08:37] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 13 ms returned unsat
[2025-06-01 11:08:37] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-01 11:08:37] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 2 ms returned unsat
[2025-06-01 11:08:37] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-01 11:08:37] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 17 ms returned sat
[2025-06-01 11:08:37] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2025-06-01 11:08:37] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 46 ms.
[2025-06-01 11:08:37] [INFO ] Added : 9 causal constraints over 2 iterations in 138 ms. Result :sat
Minimization took 191 ms.
[2025-06-01 11:08:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:08:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-01 11:08:38] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 14 ms returned sat
[2025-06-01 11:08:38] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-06-01 11:08:38] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 36 ms.
[2025-06-01 11:08:38] [INFO ] Added : 9 causal constraints over 2 iterations in 110 ms. Result :sat
Minimization took 149 ms.
[2025-06-01 11:08:38] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-01 11:08:38] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned unsat
[2025-06-01 11:08:38] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-01 11:08:38] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned sat
[2025-06-01 11:08:38] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2025-06-01 11:08:38] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 32 ms.
[2025-06-01 11:08:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:08:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-01 11:08:38] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned sat
[2025-06-01 11:08:39] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-06-01 11:08:39] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 23 ms.
[2025-06-01 11:08:39] [INFO ] Added : 11 causal constraints over 3 iterations in 131 ms. Result :sat
Minimization took 160 ms.
[2025-06-01 11:08:39] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-01 11:08:39] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 7 ms returned unsat
[2025-06-01 11:08:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-01 11:08:39] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 13 ms returned unsat
[2025-06-01 11:08:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-01 11:08:39] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned sat
[2025-06-01 11:08:39] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-06-01 11:08:39] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 23 ms.
[2025-06-01 11:08:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 11:08:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-01 11:08:39] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned sat
[2025-06-01 11:08:40] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2025-06-01 11:08:40] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 20 ms.
[2025-06-01 11:08:40] [INFO ] Added : 14 causal constraints over 3 iterations in 127 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2] Max Struct:[1, +inf, 1, 1, 1, +inf, 1, +inf, 1, 1, +inf]
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3, 3, 3] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 409/409 transitions.
Graph (complete) has 849 edges and 462 vertex of which 85 are kept as prefixes of interest. Removing 377 places using SCC suffix rule.1 ms
Discarding 377 places :
Also discarding 205 output transitions
Drop transitions (Output transitions of discarded places.) removed 205 transitions
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 83 transition count 120
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 101 place count 69 transition count 120
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 101 place count 69 transition count 117
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 66 transition count 117
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 119 place count 54 transition count 105
Iterating global reduction 2 with 12 rules applied. Total rules applied 131 place count 54 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 52 transition count 103
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 138 place count 52 transition count 100
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 141 place count 49 transition count 100
Applied a total of 141 rules in 51 ms. Remains 49 /462 variables (removed 413) and now considering 100/409 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 49/462 places, 100/409 transitions.
[2025-06-01 11:08:40] [INFO ] Flow matrix only has 53 transitions (discarded 47 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2025-06-01 11:08:40] [INFO ] Flow matrix only has 53 transitions (discarded 47 similar events)
// Phase 1: matrix 53 rows 49 cols
[2025-06-01 11:08:40] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3, 3, 3] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (96945 resets) in 1156 ms. (864 steps per ms)
BEST_FIRST walk for 4000004 steps (63418 resets) in 1607 ms. (2487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 3, 3] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 11:08:43] [INFO ] Flow matrix only has 53 transitions (discarded 47 similar events)
[2025-06-01 11:08:43] [INFO ] Invariant cache hit.
[2025-06-01 11:08:43] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-01 11:08:43] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2025-06-01 11:08:43] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-01 11:08:43] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2025-06-01 11:08:43] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-01 11:08:43] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2025-06-01 11:08:43] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-01 11:08:43] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 3, 3] Max Struct:[3, 3, 3, 3]
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 )
[2025-06-01 11:08:43] [INFO ] Flatten gal took : 32 ms
[2025-06-01 11:08:43] [INFO ] Flatten gal took : 11 ms
[2025-06-01 11:08:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8688859913833259128.gal : 7 ms
[2025-06-01 11:08:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1802469334589322920.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/ReachabilityCardinality8688859913833259128.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1802469334589322920.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 8257 ms.

BK_STOP 1748776123713

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="LeafsetExtension-PT-S08C3"
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 LeafsetExtension-PT-S08C3, 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 r125-tall-174876435800090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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