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.r140-smll-174876533400082.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is MedleyA-PT-05, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-smll-174876533400082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 75K 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 booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748927959920

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 05:19:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-03 05:19:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:19:22] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2025-06-03 05:19:22] [INFO ] Transformed 115 places.
[2025-06-03 05:19:22] [INFO ] Transformed 257 transitions.
[2025-06-03 05:19:22] [INFO ] Found NUPN structural information;
[2025-06-03 05:19:22] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 362 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 115/115 places, 257/257 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 115 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 114 transition count 253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 112 transition count 251
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 67 place count 83 transition count 311
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 83 transition count 307
Applied a total of 71 rules in 94 ms. Remains 83 /115 variables (removed 32) and now considering 307/257 (removed -50) transitions.
[2025-06-03 05:19:22] [INFO ] Flow matrix only has 306 transitions (discarded 1 similar events)
// Phase 1: matrix 306 rows 83 cols
[2025-06-03 05:19:22] [INFO ] Computed 20 invariants in 26 ms
[2025-06-03 05:19:23] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-06-03 05:19:23] [INFO ] Flow matrix only has 306 transitions (discarded 1 similar events)
[2025-06-03 05:19:23] [INFO ] Invariant cache hit.
[2025-06-03 05:19:23] [INFO ] State equation strengthened by 162 read => feed constraints.
[2025-06-03 05:19:23] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2025-06-03 05:19:23] [INFO ] Flow matrix only has 306 transitions (discarded 1 similar events)
[2025-06-03 05:19:23] [INFO ] Invariant cache hit.
[2025-06-03 05:19:23] [INFO ] State equation strengthened by 162 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 15/102 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2025-06-03 05:19:28] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 305/388 variables, 83/187 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 161/348 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 10 (OVERLAPS) 1/389 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 12 (OVERLAPS) 0/389 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 349 constraints, problems are : Problem set: 0 solved, 299 unsolved in 22961 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 15/102 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 305/388 variables, 83/187 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 161/348 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 299/647 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 11 (OVERLAPS) 1/389 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 13 (OVERLAPS) 0/389 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 648 constraints, problems are : Problem set: 0 solved, 299 unsolved in 26905 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 1/1 constraints]
After SMT, in 50800ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 50844ms
Starting structural reductions in LIVENESS mode, iteration 1 : 83/115 places, 307/257 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 51892 ms. Remains : 83/115 places, 307/257 transitions.
Discarding 242 transitions out of 307. Remains 65
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4623 resets) in 3778 ms. (10 steps per ms) remains 21/64 properties
BEST_FIRST walk for 4003 steps (58 resets) in 52 ms. (75 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (62 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (65 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (58 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (51 resets) in 49 ms. (80 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (52 resets) in 53 ms. (74 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (62 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (57 resets) in 47 ms. (83 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (54 resets) in 51 ms. (76 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (54 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (55 resets) in 39 ms. (100 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4004 steps (55 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (28 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (58 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (51 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (33 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (36 resets) in 18 ms. (210 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (58 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (56 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
[2025-06-03 05:20:15] [INFO ] Flow matrix only has 306 transitions (discarded 1 similar events)
[2025-06-03 05:20:15] [INFO ] Invariant cache hit.
[2025-06-03 05:20:15] [INFO ] State equation strengthened by 162 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/62 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 8/70 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-03 05:20:16] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 12/82 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 305/387 variables, 82/185 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 161/346 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 1/388 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/388 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 1/389 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 0/389 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 349 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1855 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/62 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 8/70 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 12/82 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 305/387 variables, 82/185 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 161/346 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 6/352 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 1/388 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/388 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/388 variables, 11/365 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/388 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 1/389 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/389 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 0/389 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 366 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2323 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
After SMT, in 4235ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 14 properties in 3673 ms.
Support contains 7 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 307/307 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 1 with 46 rules applied. Total rules applied 48 place count 83 transition count 259
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 63 place count 83 transition count 321
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 99 place count 68 transition count 300
Applied a total of 99 rules in 103 ms. Remains 68 /83 variables (removed 15) and now considering 300/307 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 68/83 places, 300/307 transitions.
RANDOM walk for 736339 steps (95491 resets) in 6122 ms. (120 steps per ms) remains 0/3 properties
Able to resolve query QuasiLiveness after proving 65 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 65185 ms.
ITS solved all properties within timeout

BK_STOP 1748928027341

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-05"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is MedleyA-PT-05, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-smll-174876533400082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-05.tgz
mv MedleyA-PT-05 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;