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.r251-tall-174915604900014.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 Szymanski-PT-a08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-tall-174915604900014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K 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:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 101K May 29 14:33 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 Szymanski-PT-a08-UpperBounds-00
FORMULA_NAME Szymanski-PT-a08-UpperBounds-01
FORMULA_NAME Szymanski-PT-a08-UpperBounds-02
FORMULA_NAME Szymanski-PT-a08-UpperBounds-03
FORMULA_NAME Szymanski-PT-a08-UpperBounds-04
FORMULA_NAME Szymanski-PT-a08-UpperBounds-05
FORMULA_NAME Szymanski-PT-a08-UpperBounds-06
FORMULA_NAME Szymanski-PT-a08-UpperBounds-07
FORMULA_NAME Szymanski-PT-a08-UpperBounds-08
FORMULA_NAME Szymanski-PT-a08-UpperBounds-09
FORMULA_NAME Szymanski-PT-a08-UpperBounds-10
FORMULA_NAME Szymanski-PT-a08-UpperBounds-11
FORMULA_NAME Szymanski-PT-a08-UpperBounds-12
FORMULA_NAME Szymanski-PT-a08-UpperBounds-13
FORMULA_NAME Szymanski-PT-a08-UpperBounds-14
FORMULA_NAME Szymanski-PT-a08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749196447191

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-06 07:54:08] [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-06 07:54:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 07:54:08] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2025-06-06 07:54:08] [INFO ] Transformed 61 places.
[2025-06-06 07:54:08] [INFO ] Transformed 224 transitions.
[2025-06-06 07:54:08] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 8, 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]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 8, 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]
[2025-06-06 07:54:08] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2025-06-06 07:54:08] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 8, 1, 17, 17, 17, 17, 17, 8, 17, 17, 1, 17]
FORMULA Szymanski-PT-a08-UpperBounds-02 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (14 resets) in 24 ms. (400 steps per ms)
FORMULA Szymanski-PT-a08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-a08-UpperBounds-10 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-a08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-a08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (25 resets) in 75 ms. (1052 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 7, 8, 8, 8, 8, 8, 8] Max Struct:[17, 17, 17, 17, 17, 17, 17, 17]
[2025-06-06 07:54:08] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2025-06-06 07:54:08] [INFO ] Invariant cache hit.
[2025-06-06 07:54:08] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:08] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using state equation in 37 ms returned unsat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-06 07:54:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-06 07:54:09] [INFO ] [Real]Added 9 Read/Feed constraints in 4 ms returned sat
[2025-06-06 07:54:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2025-06-06 07:54:09] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 8 ms to minimize.
[2025-06-06 07:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2025-06-06 07:54:09] [INFO ] Computed and/alt/rep : 21/107/21 causal constraints (skipped 56 transitions) in 20 ms.
[2025-06-06 07:54:09] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
[2025-06-06 07:54:09] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2025-06-06 07:54:09] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2025-06-06 07:54:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2025-06-06 07:54:09] [INFO ] Added : 8 causal constraints over 2 iterations in 211 ms. Result :sat
Minimization took 17 ms.
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Added 9 Read/Feed constraints in 10 ms returned sat
[2025-06-06 07:54:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2025-06-06 07:54:09] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2025-06-06 07:54:09] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2025-06-06 07:54:09] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2025-06-06 07:54:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 145 ms
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 16 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-06 07:54:09] [INFO ] [Real]Added 9 Read/Feed constraints in 1 ms returned sat
[2025-06-06 07:54:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-06 07:54:10] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:10] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-06 07:54:10] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2025-06-06 07:54:10] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2025-06-06 07:54:10] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2025-06-06 07:54:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 81 ms
[2025-06-06 07:54:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-06 07:54:10] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:10] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-06 07:54:10] [INFO ] [Real]Added 9 Read/Feed constraints in 2 ms returned sat
[2025-06-06 07:54:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-06 07:54:10] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-06 07:54:10] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2025-06-06 07:54:10] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2025-06-06 07:54:10] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2025-06-06 07:54:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 83 ms
Current structural bounds on expressions (after SMT) : Max Seen:[8, 7, 8, 8, 8, 8, 8, 8] Max Struct:[8, 17, 8, 8, 8, 8, 8, 8]
FORMULA Szymanski-PT-a08-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a08-UpperBounds-12 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a08-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a08-UpperBounds-09 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a08-UpperBounds-07 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a08-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a08-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[17]
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 251 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 47 transition count 212
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 42 transition count 192
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 42 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 31 place count 42 transition count 176
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 40 transition count 168
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 40 transition count 168
Applied a total of 35 rules in 129 ms. Remains 40 /49 variables (removed 9) and now considering 168/216 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 40/49 places, 168/216 transitions.
[2025-06-06 07:54:10] [INFO ] Flow matrix only has 64 transitions (discarded 104 similar events)
// Phase 1: matrix 64 rows 40 cols
[2025-06-06 07:54:10] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[9]
RANDOM walk for 1000004 steps (2 resets) in 232 ms. (4291 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 313 ms. (3184 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[9]
[2025-06-06 07:54:11] [INFO ] Flow matrix only has 64 transitions (discarded 104 similar events)
[2025-06-06 07:54:11] [INFO ] Invariant cache hit.
[2025-06-06 07:54:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 07:54:11] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-06 07:54:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-06 07:54:11] [INFO ] [Real]Added 9 Read/Feed constraints in 2 ms returned sat
[2025-06-06 07:54:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 07:54:11] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-06 07:54:11] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2025-06-06 07:54:11] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2025-06-06 07:54:11] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2025-06-06 07:54:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 83 ms
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[8]
FORMULA Szymanski-PT-a08-UpperBounds-05 8 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-06 07:54:11] [INFO ] Flatten gal took : 38 ms
[2025-06-06 07:54:11] [INFO ] Flatten gal took : 13 ms
[2025-06-06 07:54:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16505637070303693092.gal : 7 ms
[2025-06-06 07:54:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11711141833730804691.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16505637070303693092.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11711141833730804691.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :
ITS tools runner thread asked to quit. Dying gracefully.

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 3070 ms.

BK_STOP 1749196451564

--------------------
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="Szymanski-PT-a08"
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 Szymanski-PT-a08, 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 r251-tall-174915604900014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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