Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r144-tall-171631143900337.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is DoubleExponent-PT-003, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r144-tall-171631143900337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:42 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 1716406211124

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 19:30:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 19:30:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:30:12] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-05-22 19:30:12] [INFO ] Transformed 163 places.
[2024-05-22 19:30:12] [INFO ] Transformed 148 transitions.
[2024-05-22 19:30:12] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 155 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 159 transition count 112
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 76 place count 123 transition count 112
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 76 place count 123 transition count 106
Deduced a syphon composed of 6 places in 9 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 117 transition count 106
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 150 place count 86 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 158 place count 82 transition count 75
Applied a total of 158 rules in 53 ms. Remains 82 /163 variables (removed 81) and now considering 75/148 (removed 73) transitions.
// Phase 1: matrix 75 rows 82 cols
[2024-05-22 19:30:12] [INFO ] Computed 16 invariants in 16 ms
[2024-05-22 19:30:12] [INFO ] Implicit Places using invariants in 264 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 294 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 80/163 places, 75/148 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 1 rules applied. Total rules applied 1 place count 80 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 79 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 76 transition count 71
Applied a total of 8 rules in 14 ms. Remains 76 /80 variables (removed 4) and now considering 71/75 (removed 4) transitions.
// Phase 1: matrix 71 rows 76 cols
[2024-05-22 19:30:12] [INFO ] Computed 14 invariants in 3 ms
[2024-05-22 19:30:13] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 19:30:13] [INFO ] Invariant cache hit.
[2024-05-22 19:30:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 19:30:13] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 76/163 places, 71/148 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 604 ms. Remains : 76/163 places, 71/148 transitions.
Discarding 16 transitions out of 71. Remains 55
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4839 resets) in 1687 ms. (23 steps per ms) remains 34/54 properties
BEST_FIRST walk for 4001 steps (287 resets) in 191 ms. (20 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (297 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (303 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (311 resets) in 121 ms. (32 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (302 resets) in 49 ms. (80 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (308 resets) in 54 ms. (72 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (299 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (280 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (305 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (300 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (295 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (296 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (305 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (301 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (310 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (296 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (299 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (294 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (292 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (299 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (304 resets) in 22 ms. (173 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (293 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (293 resets) in 22 ms. (173 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (292 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (299 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (302 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (300 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (300 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (316 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (308 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (303 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (301 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (303 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (311 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
[2024-05-22 19:30:14] [INFO ] Invariant cache hit.
[2024-05-22 19:30:14] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 17/71 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 1/72 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 71/143 variables, 72/86 constraints. Problems are: Problem set: 0 solved, 34 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 4/147 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-22 19:30:15] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 7 ms to minimize.
[2024-05-22 19:30:15] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-05-22 19:30:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
[2024-05-22 19:30:15] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 19:30:15] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/147 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/147 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 0/147 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 101 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1964 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 17/71 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-22 19:30:16] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1/72 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 71/143 variables, 72/87 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-22 19:30:16] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 4/147 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/147 variables, 14/132 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/147 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/147 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 18 (OVERLAPS) 0/147 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 137 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1654 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 7/7 constraints]
After SMT, in 3654ms problems are : Problem set: 0 solved, 34 unsolved
Parikh walk visited 6 properties in 5711 ms.
Support contains 43 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 71/71 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 75 transition count 70
Applied a total of 3 rules in 28 ms. Remains 75 /76 variables (removed 1) and now considering 70/71 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 75/76 places, 70/71 transitions.
RANDOM walk for 4000000 steps (499958 resets) in 17023 ms. (234 steps per ms) remains 26/28 properties
BEST_FIRST walk for 400002 steps (33415 resets) in 1661 ms. (240 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (33477 resets) in 1054 ms. (379 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (33313 resets) in 1049 ms. (380 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (33354 resets) in 1031 ms. (387 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (33304 resets) in 1251 ms. (319 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (33317 resets) in 1119 ms. (357 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (33525 resets) in 1072 ms. (372 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (33483 resets) in 1062 ms. (376 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (33375 resets) in 1082 ms. (369 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400000 steps (33232 resets) in 1071 ms. (373 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (33184 resets) in 1060 ms. (377 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (33105 resets) in 1060 ms. (377 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400000 steps (33421 resets) in 1064 ms. (375 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (33245 resets) in 1044 ms. (382 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (33382 resets) in 1035 ms. (386 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (33330 resets) in 1035 ms. (386 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (33093 resets) in 1034 ms. (386 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400000 steps (33342 resets) in 1017 ms. (392 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (33343 resets) in 1066 ms. (374 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (33388 resets) in 1075 ms. (371 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (33518 resets) in 1066 ms. (374 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (33474 resets) in 1079 ms. (370 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (33271 resets) in 1080 ms. (370 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400001 steps (33337 resets) in 1077 ms. (371 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (33066 resets) in 1061 ms. (376 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (33158 resets) in 1068 ms. (374 steps per ms) remains 26/26 properties
Probably explored full state space saw : 621094 states, properties seen :25
Probabilistic random walk after 1242213 steps, saw 621094 distinct states, run finished after 3192 ms. (steps per millisecond=389 ) properties seen :25
Finished exhaustive random walk after 2078694 steps, run visited all 1 properties in 3994 ms. (steps per millisecond=520 )
Exhaustive walk after 2078694 steps, saw 1039560 distinct states, run finished after 4003 ms. (steps per millisecond=519 ) properties seen :1
Able to resolve query QuasiLiveness after proving 55 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK EXHAUSTIVE_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 33719 ms.
ITS solved all properties within timeout

BK_STOP 1716406246115

--------------------
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="DoubleExponent-PT-003"
export BK_EXAMINATION="QuasiLiveness"
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 DoubleExponent-PT-003, 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 r144-tall-171631143900337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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