Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654455200283.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-PT-S05J30, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455200283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 23K Apr 12 09:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 09:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 12 09:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 193K Apr 12 09:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K Apr 12 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 12 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118K Apr 12 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 512K Apr 12 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 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 1717104812724

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-PT-S05J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:33:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-30 21:33:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:33:34] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-05-30 21:33:34] [INFO ] Transformed 489 places.
[2024-05-30 21:33:34] [INFO ] Transformed 1400 transitions.
[2024-05-30 21:33:34] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 253 ms.
Structural test allowed to assert that 2 places are NOT stable. Took 9 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2812 resets) in 1995 ms. (20 steps per ms) remains 28/487 properties
BEST_FIRST walk for 4003 steps (65 resets) in 20 ms. (190 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (55 resets) in 40 ms. (97 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (68 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (78 resets) in 118 ms. (33 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (66 resets) in 108 ms. (36 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (35 resets) in 92 ms. (43 steps per ms) remains 24/27 properties
BEST_FIRST walk for 4002 steps (67 resets) in 39 ms. (100 steps per ms) remains 21/24 properties
BEST_FIRST walk for 4003 steps (81 resets) in 34 ms. (114 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4002 steps (67 resets) in 18 ms. (210 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (69 resets) in 26 ms. (148 steps per ms) remains 14/17 properties
BEST_FIRST walk for 4002 steps (66 resets) in 30 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (56 resets) in 20 ms. (190 steps per ms) remains 11/14 properties
BEST_FIRST walk for 4004 steps (54 resets) in 20 ms. (190 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4002 steps (70 resets) in 26 ms. (148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (75 resets) in 23 ms. (166 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4002 steps (40 resets) in 20 ms. (190 steps per ms) remains 8/11 properties
BEST_FIRST walk for 4004 steps (71 resets) in 17 ms. (222 steps per ms) remains 8/8 properties
[2024-05-30 21:33:35] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2024-05-30 21:33:35] [INFO ] Computed 82 invariants in 78 ms
[2024-05-30 21:33:35] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 98/118 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 138/256 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 115/371 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 110/481 variables, 24/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 7/488 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 741/1229 variables, 488/570 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1229 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1229 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1/1230 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1230 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/1230 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1230/1230 variables, and 572 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1893 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 489/489 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 98/118 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 138/256 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 115/371 variables, 23/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 110/481 variables, 24/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 21:33:38] [INFO ] Deduced a trap composed of 112 places in 329 ms of which 33 ms to minimize.
[2024-05-30 21:33:38] [INFO ] Deduced a trap composed of 26 places in 456 ms of which 8 ms to minimize.
[2024-05-30 21:33:39] [INFO ] Deduced a trap composed of 24 places in 386 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 7/488 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 741/1229 variables, 488/573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1229 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1229 variables, 7/581 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1229 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 1/1230 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1230 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1230 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 21:33:41] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 2 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/1230 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1230/1230 variables, and 584 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 489/489 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 7044ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 484 transition count 712
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 71 place count 451 transition count 712
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 71 place count 451 transition count 679
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 137 place count 418 transition count 679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 417 transition count 678
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 417 transition count 678
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 143 place count 415 transition count 676
Applied a total of 143 rules in 174 ms. Remains 415 /489 variables (removed 74) and now considering 676/745 (removed 69) transitions.
Running 670 sub problems to find dead transitions.
[2024-05-30 21:33:42] [INFO ] Flow matrix only has 672 transitions (discarded 4 similar events)
// Phase 1: matrix 672 rows 415 cols
[2024-05-30 21:33:42] [INFO ] Computed 77 invariants in 30 ms
[2024-05-30 21:33:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/415 variables, 5/77 constraints. Problems are: Problem set: 95 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/77 constraints. Problems are: Problem set: 95 solved, 575 unsolved
At refinement iteration 5 (OVERLAPS) 672/1087 variables, 415/492 constraints. Problems are: Problem set: 95 solved, 575 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1087 variables, 1/493 constraints. Problems are: Problem set: 95 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1087/1087 variables, and 493 constraints, problems are : Problem set: 95 solved, 575 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 415/415 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 59/59 constraints. Problems are: Problem set: 95 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 13/72 constraints. Problems are: Problem set: 95 solved, 575 unsolved
[2024-05-30 21:34:06] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 1/73 constraints. Problems are: Problem set: 95 solved, 575 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 0/73 constraints. Problems are: Problem set: 95 solved, 575 unsolved
At refinement iteration 4 (OVERLAPS) 5/415 variables, 5/78 constraints. Problems are: Problem set: 95 solved, 575 unsolved
[2024-05-30 21:34:16] [INFO ] Deduced a trap composed of 92 places in 248 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 1/79 constraints. Problems are: Problem set: 95 solved, 575 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/79 constraints. Problems are: Problem set: 95 solved, 575 unsolved
SMT process timed out in 41470ms, After SMT, problems are : Problem set: 95 solved, 575 unsolved
Search for dead transitions found 95 dead transitions in 41485ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 415/489 places, 581/745 transitions.
Applied a total of 0 rules in 49 ms. Remains 415 /415 variables (removed 0) and now considering 581/581 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41731 ms. Remains : 415/489 places, 581/745 transitions.
RANDOM walk for 2961 steps (150 resets) in 71 ms. (41 steps per ms) remains 0/8 properties
Able to resolve query StableMarking after proving 488 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 50144 ms.
ITS solved all properties within timeout

BK_STOP 1717104864171

--------------------
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="PolyORBNT-PT-S05J30"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-PT-S05J30, 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 r298-tajo-171654455200283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J30.tgz
mv PolyORBNT-PT-S05J30 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;