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.r070-smll-174854076400213.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 DES-PT-40b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076400213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.6K 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.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 115K 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 1748658073748

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-40b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 02:21:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 02:21:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 02:21:16] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-05-31 02:21:16] [INFO ] Transformed 439 places.
[2025-05-31 02:21:16] [INFO ] Transformed 390 transitions.
[2025-05-31 02:21:16] [INFO ] Found NUPN structural information;
[2025-05-31 02:21:16] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 345 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 24 ms.
RANDOM walk for 40000 steps (339 resets) in 5879 ms. (6 steps per ms) remains 147/352 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 19 ms. (20 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 19 ms. (20 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 18 ms. (21 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 147/147 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 147/147 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 147/147 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 147/147 properties
// Phase 1: matrix 390 rows 439 cols
[2025-05-31 02:21:19] [INFO ] Computed 65 invariants in 54 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 21/168 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 21/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 (/ 1.0 76.0))
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 (/ 1.0 76.0))
(s7 (/ 1.0 76.0))
(s8 (/ 1.0 76.0))
(s9 (/ 1.0 76.0))
(s10 (/ 1.0 76.0))
(s11 (/ 1.0 76.0))
(s12 (/ 1.0 76.0))
(s13 (/ 1.0 76.0))
(s14 (/ 1.0 76.0))
(s15 (/ 1.0 76.0))
(s16 (/ 1.0 76.0))
(s17 (/ 1.0 76.0))
(s18 (/ 1.0 76.0))
(s19 (/ 1.0 76.0))
(s20 (/ 1.0 76.0))
(s21 (/ 1.0 76.0))
(s22 (/ 1.0 76.0))
(s23 (/ 1.0 76.0))
(s24 (/ 1.0 76.0))
(s25 (/ 1.0 76.0))
(s26 (/ 1.0 76.0))
(s27 (/ 1.0 76.0))
(s28 (/ 1.0 76.0))
(s29 (/ 1.0 76.0))
(s30 (/ 1.0 76.0))
(s31 (/ 1.0 76.0))
(s32 (/ 1.0 76.0))
(s33 (/ 1.0 2.0))
(s34 (/ 1.0 76.0))
(s35 (/ 1.0 76.0))
(s36 (/ 1.0 76.0))
(s37 (/ 1.0 76.0))
(s38 (/ 1.0 76.0))
(s39 (/ 1.0 76.0))
(s40 (/ 1.0 76.0))
(s41 (/ 1.0 76.0))
(s42 (/ 1.0 76.0))
(s43 (/ 1.0 76.0))
(s44 0.0)
(s45 0.0)
(s46 (/ 1.0 76.0))
(s47 (/ 1.0 76.0))
(s48 (/ 1.0 76.0))
(s49 (/ 1.0 76.0))
(s50 (/ 1.0 76.0))
(s51 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 168/829 variables, and 172 constraints, problems are : Problem set: 0 solved, 147 unsolved in 5099 ms.
Refiners :[Domain max(s): 168/439 constraints, Positive P Invariants (semi-flows): 4/39 constraints, Generalized P Invariants (flows): 0/26 constraints, State Equation: 0/439 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 21/168 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 21/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 199/367 variables, 35/207 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 199/406 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 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 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(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 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 1)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 1)
(s281 1)
(s282 0)
(s283 0)
(s284 0)
(s285 1)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 1)
(s342 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 367/829 variables, and 406 constraints, problems are : Problem set: 0 solved, 147 unsolved in 5022 ms.
Refiners :[Domain max(s): 367/439 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 0/26 constraints, State Equation: 0/439 constraints, PredecessorRefiner: 0/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 10361ms problems are : Problem set: 0 solved, 147 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 147 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 433 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 433 transition count 363
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 412 transition count 363
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 412 transition count 354
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 403 transition count 354
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 384 transition count 335
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 384 transition count 335
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 384 transition count 334
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 383 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 368 transition count 319
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 368 transition count 319
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 368 transition count 304
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 366 transition count 303
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 366 transition count 300
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 363 transition count 300
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 286 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 284 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 284 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 283 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 282 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 281 transition count 223
Applied a total of 319 rules in 324 ms. Remains 281 /439 variables (removed 158) and now considering 223/390 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 347 ms. Remains : 281/439 places, 223/390 transitions.
RANDOM walk for 4000000 steps (191208 resets) in 55914 ms. (71 steps per ms) remains 141/147 properties
BEST_FIRST walk for 40002 steps (347 resets) in 142 ms. (279 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (369 resets) in 134 ms. (296 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (374 resets) in 129 ms. (307 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (336 resets) in 127 ms. (312 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (354 resets) in 125 ms. (317 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (353 resets) in 126 ms. (314 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (366 resets) in 135 ms. (294 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (340 resets) in 125 ms. (317 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (380 resets) in 127 ms. (312 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (391 resets) in 157 ms. (253 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (350 resets) in 171 ms. (232 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (336 resets) in 172 ms. (231 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (354 resets) in 169 ms. (235 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (383 resets) in 174 ms. (228 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (374 resets) in 173 ms. (229 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (369 resets) in 168 ms. (236 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (358 resets) in 135 ms. (294 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (374 resets) in 126 ms. (314 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (351 resets) in 127 ms. (312 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (364 resets) in 127 ms. (312 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (354 resets) in 128 ms. (310 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (344 resets) in 135 ms. (294 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (372 resets) in 126 ms. (314 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (345 resets) in 127 ms. (312 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (367 resets) in 128 ms. (310 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (373 resets) in 127 ms. (312 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (336 resets) in 140 ms. (283 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (374 resets) in 124 ms. (320 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (383 resets) in 129 ms. (307 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (360 resets) in 127 ms. (312 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (377 resets) in 129 ms. (307 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (336 resets) in 185 ms. (215 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (333 resets) in 220 ms. (181 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (364 resets) in 191 ms. (208 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (375 resets) in 192 ms. (207 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (372 resets) in 193 ms. (206 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (366 resets) in 199 ms. (200 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (360 resets) in 194 ms. (205 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (329 resets) in 190 ms. (209 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (379 resets) in 188 ms. (211 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (381 resets) in 184 ms. (216 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (392 resets) in 136 ms. (292 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (365 resets) in 127 ms. (312 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (354 resets) in 128 ms. (310 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (359 resets) in 128 ms. (310 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (344 resets) in 131 ms. (303 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (382 resets) in 132 ms. (300 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (354 resets) in 127 ms. (312 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (375 resets) in 128 ms. (310 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (377 resets) in 129 ms. (307 steps per ms) remains 141/141 properties
Finished probabilistic random walk after 740561 steps, run visited all 141 properties in 8635 ms. (steps per millisecond=85 )
Probabilistic random walk after 740561 steps, saw 186859 distinct states, run finished after 8643 ms. (steps per millisecond=85 ) properties seen :141
Able to resolve query StableMarking after proving 353 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 39374 ms.
ITS solved all properties within timeout

BK_STOP 1748658115571

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DES-PT-40b"
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 DES-PT-40b, 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 r070-smll-174854076400213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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