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.r014-tall-174853743700303.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 AutoFlight-PT-03b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743700303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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.7K 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 70K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1748549239072

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 20:07:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 20:07:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:07:20] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2025-05-29 20:07:20] [INFO ] Transformed 298 places.
[2025-05-29 20:07:20] [INFO ] Transformed 296 transitions.
[2025-05-29 20:07:20] [INFO ] Found NUPN structural information;
[2025-05-29 20:07:20] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 172 ms.
Structural test allowed to assert that 176 places are NOT stable. Took 8 ms.
RANDOM walk for 40000 steps (251 resets) in 1847 ms. (21 steps per ms) remains 34/122 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
// Phase 1: matrix 296 rows 298 cols
[2025-05-29 20:07:21] [INFO ] Computed 22 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 142/176 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 142/183 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 118/294 variables, 14/197 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 118/315 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 4/298 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 296/594 variables, 298/618 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/594 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 0/594 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 618 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1653 ms.
Refiners :[Domain max(s): 298/298 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 142/176 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 142/183 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 118/294 variables, 14/197 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 118/315 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 4/298 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-29 20:07:24] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 22 ms to minimize.
[2025-05-29 20:07:24] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2025-05-29 20:07:24] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
[2025-05-29 20:07:24] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2025-05-29 20:07:24] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2025-05-29 20:07:24] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2025-05-29 20:07:24] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2025-05-29 20:07:24] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2025-05-29 20:07:24] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2025-05-29 20:07:24] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2025-05-29 20:07:25] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 2 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 2 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 2 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 2 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 2 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 4 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2025-05-29 20:07:26] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 2 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2025-05-29 20:07:27] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 10/370 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 2 ms to minimize.
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
SMT process timed out in 6781ms, After SMT, problems are : Problem set: 0 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 296/296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 298 transition count 196
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 119 rules applied. Total rules applied 219 place count 198 transition count 177
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 225 place count 192 transition count 177
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 225 place count 192 transition count 144
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 291 place count 159 transition count 144
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 309 place count 141 transition count 126
Iterating global reduction 3 with 18 rules applied. Total rules applied 327 place count 141 transition count 126
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 327 place count 141 transition count 117
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 345 place count 132 transition count 117
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 405 place count 102 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 407 place count 102 transition count 85
Free-agglomeration rule applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 419 place count 102 transition count 73
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 431 place count 90 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 432 place count 89 transition count 72
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 10 rules applied. Total rules applied 442 place count 82 transition count 69
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 445 place count 79 transition count 69
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 445 place count 79 transition count 61
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 461 place count 71 transition count 61
Applied a total of 461 rules in 68 ms. Remains 71 /298 variables (removed 227) and now considering 61/296 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 71/298 places, 61/296 transitions.
RANDOM walk for 460 steps (0 resets) in 17 ms. (25 steps per ms) remains 0/34 properties
Able to resolve query StableMarking after proving 123 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 8063 ms.
ITS solved all properties within timeout

BK_STOP 1748549248360

--------------------
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 StableMarking -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="AutoFlight-PT-03b"
export BK_EXAMINATION="StableMarking"
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 AutoFlight-PT-03b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r014-tall-174853743700303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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