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.r112-smll-174867016500383.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 HealthRecord-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-smll-174867016500383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K 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 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 69K 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 1748771547019

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:52:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:52:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:52:29] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2025-06-01 09:52:29] [INFO ] Transformed 158 places.
[2025-06-01 09:52:29] [INFO ] Transformed 333 transitions.
[2025-06-01 09:52:29] [INFO ] Found NUPN structural information;
[2025-06-01 09:52:29] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 522 ms.
Graph (trivial) has 270 edges and 158 vertex of which 10 / 158 are part of one of the 5 SCC in 7 ms
Free SCC test removed 5 places
Structural test allowed to assert that 32 places are NOT stable. Took 44 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3112 resets) in 3605 ms. (11 steps per ms) remains 47/126 properties
BEST_FIRST walk for 4004 steps (35 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (32 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (33 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (36 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (36 resets) in 23 ms. (166 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4003 steps (32 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (33 resets) in 25 ms. (154 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (35 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (34 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (35 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (35 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (35 resets) in 27 ms. (143 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (35 resets) in 34 ms. (114 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (37 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (35 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (32 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (36 resets) in 10 ms. (363 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (34 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (35 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (36 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (37 resets) in 21 ms. (182 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (35 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (37 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (35 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (33 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (36 resets) in 10 ms. (363 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (35 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (34 resets) in 10 ms. (363 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (37 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (32 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (37 resets) in 9 ms. (400 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 45/45 properties
[2025-06-01 09:52:31] [INFO ] Flow matrix only has 284 transitions (discarded 17 similar events)
// Phase 1: matrix 284 rows 153 cols
[2025-06-01 09:52:31] [INFO ] Computed 18 invariants in 14 ms
[2025-06-01 09:52:31] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 54/99 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 54/153 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 54/171 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 283/436 variables, 153/324 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 1/437 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/437 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 325 constraints, problems are : Problem set: 0 solved, 45 unsolved in 3269 ms.
Refiners :[Domain max(s): 153/153 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 153/153 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 54/99 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2025-06-01 09:52:35] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 31 ms to minimize.
[2025-06-01 09:52:35] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 3 ms to minimize.
[2025-06-01 09:52:35] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2025-06-01 09:52:36] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2025-06-01 09:52:36] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2025-06-01 09:52:36] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2025-06-01 09:52:36] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:52:36] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2025-06-01 09:52:36] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 3 ms to minimize.
[2025-06-01 09:52:36] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:52:36] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:52:37] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2025-06-01 09:52:37] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2025-06-01 09:52:37] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 3 ms to minimize.
[2025-06-01 09:52:37] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 3 ms to minimize.
[2025-06-01 09:52:37] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 3 ms to minimize.
[2025-06-01 09:52:37] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2025-06-01 09:52:38] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 1 ms to minimize.
[2025-06-01 09:52:38] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2025-06-01 09:52:38] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2025-06-01 09:52:38] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2025-06-01 09:52:38] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2025-06-01 09:52:38] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2025-06-01 09:52:38] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2025-06-01 09:52:39] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2025-06-01 09:52:39] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2025-06-01 09:52:39] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2025-06-01 09:52:39] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s14 1)
(s20 0)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s39 0)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s52 1)
(s53 1)
(s57 0)
(s61 0)
(s65 0)
(s72 0)
(s79 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 99/437 variables, and 137 constraints, problems are : Problem set: 0 solved, 45 unsolved in 5021 ms.
Refiners :[Domain max(s): 99/153 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/153 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/45 constraints, Known Traps: 28/28 constraints]
After SMT, in 8397ms problems are : Problem set: 0 solved, 45 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 301/301 transitions.
Graph (complete) has 664 edges and 153 vertex of which 144 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 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 0 with 12 rules applied. Total rules applied 13 place count 144 transition count 280
Reduce places removed 3 places and 0 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 1 with 7 rules applied. Total rules applied 20 place count 141 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 140 transition count 276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 140 transition count 274
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 137 transition count 274
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 72 place count 91 transition count 182
Iterating global reduction 3 with 46 rules applied. Total rules applied 118 place count 91 transition count 182
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 123 place count 86 transition count 172
Iterating global reduction 3 with 5 rules applied. Total rules applied 128 place count 86 transition count 172
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 136 place count 86 transition count 164
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 148 place count 80 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 153 place count 80 transition count 184
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 168 place count 80 transition count 184
Applied a total of 168 rules in 114 ms. Remains 80 /153 variables (removed 73) and now considering 184/301 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 80/153 places, 184/301 transitions.
RANDOM walk for 4000000 steps (250722 resets) in 17391 ms. (229 steps per ms) remains 3/45 properties
BEST_FIRST walk for 4000003 steps (47490 resets) in 2802 ms. (1427 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (47427 resets) in 2766 ms. (1445 steps per ms) remains 3/3 properties
BEST_FIRST walk for 3945233 steps (46758 resets) in 3101 ms. (1271 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 128 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 18875 ms.
ITS solved all properties within timeout

BK_STOP 1748771568334

--------------------
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="HealthRecord-PT-10"
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 HealthRecord-PT-10, 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 r112-smll-174867016500383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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