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.r013-tall-174853743000038.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 ASLink-PT-02a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K 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.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 126K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 279K 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 ASLink-PT-02a-UpperBounds-00
FORMULA_NAME ASLink-PT-02a-UpperBounds-01
FORMULA_NAME ASLink-PT-02a-UpperBounds-02
FORMULA_NAME ASLink-PT-02a-UpperBounds-03
FORMULA_NAME ASLink-PT-02a-UpperBounds-04
FORMULA_NAME ASLink-PT-02a-UpperBounds-05
FORMULA_NAME ASLink-PT-02a-UpperBounds-06
FORMULA_NAME ASLink-PT-02a-UpperBounds-07
FORMULA_NAME ASLink-PT-02a-UpperBounds-08
FORMULA_NAME ASLink-PT-02a-UpperBounds-09
FORMULA_NAME ASLink-PT-02a-UpperBounds-10
FORMULA_NAME ASLink-PT-02a-UpperBounds-11
FORMULA_NAME ASLink-PT-02a-UpperBounds-12
FORMULA_NAME ASLink-PT-02a-UpperBounds-13
FORMULA_NAME ASLink-PT-02a-UpperBounds-14
FORMULA_NAME ASLink-PT-02a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540233161

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:37: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-05-29 17:37:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:37:14] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2025-05-29 17:37:14] [INFO ] Transformed 626 places.
[2025-05-29 17:37:14] [INFO ] Transformed 1008 transitions.
[2025-05-29 17:37:14] [INFO ] Found NUPN structural information;
[2025-05-29 17:37:14] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 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 998 rows 626 cols
[2025-05-29 17:37:14] [INFO ] Computed 118 invariants in 42 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 (126 resets) in 67 ms. (147 steps per ms)
FORMULA ASLink-PT-02a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (49 resets) in 38 ms. (512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-29 17:37:14] [INFO ] Invariant cache hit.
[2025-05-29 17:37:15] [INFO ] [Real]Absence check using 28 positive place invariants in 15 ms returned sat
[2025-05-29 17:37:15] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 22 ms returned sat
[2025-05-29 17:37:15] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2025-05-29 17:37:15] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 89 ms.
[2025-05-29 17:37:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:16] [INFO ] [Nat]Absence check using 28 positive place invariants in 19 ms returned sat
[2025-05-29 17:37:16] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 24 ms returned sat
[2025-05-29 17:37:16] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2025-05-29 17:37:16] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 74 ms.
[2025-05-29 17:37:20] [INFO ] Deduced a trap composed of 75 places in 224 ms of which 43 ms to minimize.
[2025-05-29 17:37:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2025-05-29 17:37:20] [INFO ] Added : 310 causal constraints over 62 iterations in 4550 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p151) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 997/997 transitions.
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 613 transition count 944
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 117 place count 561 transition count 944
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 117 place count 561 transition count 896
Deduced a syphon composed of 48 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 115 rules applied. Total rules applied 232 place count 494 transition count 896
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 494 transition count 895
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 493 transition count 895
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 239 place count 488 transition count 872
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 245 place count 487 transition count 872
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 6 rules applied. Total rules applied 251 place count 486 transition count 867
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 254 place count 483 transition count 867
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 255 place count 482 transition count 859
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 482 transition count 859
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 257 place count 481 transition count 851
Iterating global reduction 6 with 1 rules applied. Total rules applied 258 place count 481 transition count 851
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 259 place count 480 transition count 843
Iterating global reduction 6 with 1 rules applied. Total rules applied 260 place count 480 transition count 843
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 261 place count 479 transition count 835
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 479 transition count 835
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 263 place count 478 transition count 827
Iterating global reduction 6 with 1 rules applied. Total rules applied 264 place count 478 transition count 827
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 265 place count 477 transition count 819
Iterating global reduction 6 with 1 rules applied. Total rules applied 266 place count 477 transition count 819
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 267 place count 476 transition count 811
Iterating global reduction 6 with 1 rules applied. Total rules applied 268 place count 476 transition count 811
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 269 place count 475 transition count 803
Iterating global reduction 6 with 1 rules applied. Total rules applied 270 place count 475 transition count 803
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 271 place count 474 transition count 795
Iterating global reduction 6 with 1 rules applied. Total rules applied 272 place count 474 transition count 795
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 273 place count 473 transition count 787
Iterating global reduction 6 with 1 rules applied. Total rules applied 274 place count 473 transition count 787
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 275 place count 472 transition count 779
Iterating global reduction 6 with 1 rules applied. Total rules applied 276 place count 472 transition count 779
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 277 place count 471 transition count 771
Iterating global reduction 6 with 1 rules applied. Total rules applied 278 place count 471 transition count 771
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 279 place count 470 transition count 763
Iterating global reduction 6 with 1 rules applied. Total rules applied 280 place count 470 transition count 763
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 281 place count 469 transition count 755
Iterating global reduction 6 with 1 rules applied. Total rules applied 282 place count 469 transition count 755
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 468 transition count 747
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 468 transition count 747
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 285 place count 467 transition count 739
Iterating global reduction 6 with 1 rules applied. Total rules applied 286 place count 467 transition count 739
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 312 place count 454 transition count 726
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 313 place count 454 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 314 place count 453 transition count 725
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 317 place count 453 transition count 725
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 318 place count 452 transition count 724
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 322 place count 448 transition count 724
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 322 place count 448 transition count 716
Deduced a syphon composed of 8 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 339 place count 439 transition count 716
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 342 place count 436 transition count 716
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 342 place count 436 transition count 715
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 344 place count 435 transition count 715
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 350 place count 432 transition count 712
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 352 place count 430 transition count 710
Iterating global reduction 9 with 2 rules applied. Total rules applied 354 place count 430 transition count 710
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 356 place count 430 transition count 708
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 358 place count 428 transition count 708
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 360 place count 428 transition count 708
Applied a total of 360 rules in 524 ms. Remains 428 /626 variables (removed 198) and now considering 708/997 (removed 289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 534 ms. Remains : 428/626 places, 708/997 transitions.
// Phase 1: matrix 708 rows 428 cols
[2025-05-29 17:37:22] [INFO ] Computed 77 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ASLink-PT-02a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (16315 resets) in 1519 ms. (657 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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-05-29 17:37:24] [INFO ] Flatten gal took : 118 ms
[2025-05-29 17:37:24] [INFO ] Flatten gal took : 76 ms
[2025-05-29 17:37:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12330438706431326455.gal : 24 ms
[2025-05-29 17:37:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality897957385895562307.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/ReachabilityCardinality12330438706431326455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality897957385895562307.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 ...328
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 10145 ms.

BK_STOP 1748540244552

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

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