fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r070-smll-174854076400183
Last Updated
June 24, 2025

About the Execution of 2024-gold for DES-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15690.300 73725.00 197599.00 366.00 F normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 79K 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 1748652096042

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-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 00:41:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 00:41:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:41:39] [INFO ] Load time of PNML (sax parser for PT used): 453 ms
[2025-05-31 00:41:39] [INFO ] Transformed 320 places.
[2025-05-31 00:41:39] [INFO ] Transformed 271 transitions.
[2025-05-31 00:41:39] [INFO ] Found NUPN structural information;
[2025-05-31 00:41:39] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 647 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 14 ms.
RANDOM walk for 40000 steps (340 resets) in 4459 ms. (8 steps per ms) remains 29/233 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 29/29 properties
// Phase 1: matrix 271 rows 320 cols
[2025-05-31 00:41:41] [INFO ] Computed 65 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 20/49 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 199/248 variables, 35/88 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 199/287 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 71/319 variables, 25/312 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 71/383 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 1/320 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 271/591 variables, 320/705 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (OVERLAPS) 0/591 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 705 constraints, problems are : Problem set: 0 solved, 29 unsolved in 3289 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 20/49 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 199/248 variables, 35/88 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 199/287 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-31 00:41:45] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 50 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 71/319 variables, 25/313 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 71/384 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-31 00:41:46] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-31 00:41:46] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2025-05-31 00:41:46] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 3 ms to minimize.
[2025-05-31 00:41:47] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 3 ms to minimize.
[2025-05-31 00:41:47] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-31 00:41:47] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 3 ms to minimize.
[2025-05-31 00:41:47] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 3 ms to minimize.
[2025-05-31 00:41:47] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 4 ms to minimize.
[2025-05-31 00:41:48] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 6 ms to minimize.
[2025-05-31 00:41:48] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 3 ms to minimize.
[2025-05-31 00:41:48] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 3 ms to minimize.
[2025-05-31 00:41:48] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2025-05-31 00:41:48] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2025-05-31 00:41:48] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2025-05-31 00:41:48] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 3 ms to minimize.
[2025-05-31 00:41:48] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2025-05-31 00:41:48] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 3 ms to minimize.
[2025-05-31 00:41:49] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2025-05-31 00:41:49] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2025-05-31 00:41:49] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2025-05-31 00:41:49] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 16/405 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-31 00:41:49] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 3 ms to minimize.
[2025-05-31 00:41:49] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 4 ms to minimize.
SMT process timed out in 8546ms, After SMT, problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 314 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 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 314 transition count 244
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 293 transition count 244
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 293 transition count 235
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 284 transition count 235
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 265 transition count 216
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 265 transition count 216
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 265 transition count 215
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 264 transition count 215
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 249 transition count 200
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 249 transition count 200
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 249 transition count 185
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 247 transition count 184
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 247 transition count 181
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 244 transition count 181
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 167 transition count 104
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 165 transition count 106
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 165 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 164 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 163 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 162 transition count 104
Applied a total of 319 rules in 249 ms. Remains 162 /320 variables (removed 158) and now considering 104/271 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 162/320 places, 104/271 transitions.
RANDOM walk for 4000000 steps (191200 resets) in 36275 ms. (110 steps per ms) remains 23/29 properties
BEST_FIRST walk for 400003 steps (3640 resets) in 1326 ms. (301 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (3643 resets) in 1213 ms. (329 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (3702 resets) in 1317 ms. (303 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (3602 resets) in 1287 ms. (310 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (3669 resets) in 1369 ms. (291 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (3622 resets) in 1633 ms. (244 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (3700 resets) in 1551 ms. (257 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (3634 resets) in 1666 ms. (239 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (3557 resets) in 1575 ms. (253 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (3673 resets) in 1629 ms. (245 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (3550 resets) in 1618 ms. (247 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (3616 resets) in 1607 ms. (248 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (3672 resets) in 1566 ms. (255 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (3572 resets) in 1650 ms. (242 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (3576 resets) in 1546 ms. (258 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (3621 resets) in 1601 ms. (249 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (3680 resets) in 1534 ms. (260 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (3722 resets) in 1624 ms. (246 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (3613 resets) in 1582 ms. (252 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (3695 resets) in 1641 ms. (243 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (3717 resets) in 1560 ms. (256 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (3655 resets) in 1559 ms. (256 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (3623 resets) in 1321 ms. (302 steps per ms) remains 23/23 properties
// Phase 1: matrix 104 rows 162 cols
[2025-05-31 00:42:16] [INFO ] Computed 64 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 22/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 38/83 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 35/118 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 25/143 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 7/150 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 100/250 variables, 150/209 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 14/264 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (OVERLAPS) 2/266 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/266 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (OVERLAPS) 0/266 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 226 constraints, problems are : Problem set: 0 solved, 23 unsolved in 2436 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 22/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 38/83 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 35/118 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 25/143 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 7/150 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 100/250 variables, 150/209 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 19/228 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2025-05-31 00:42:19] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2025-05-31 00:42:19] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-05-31 00:42:19] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 14/264 variables, 10/241 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2025-05-31 00:42:20] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/264 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/264 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (OVERLAPS) 2/266 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/266 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2025-05-31 00:42:21] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/266 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/266 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (OVERLAPS) 0/266 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 254 constraints, problems are : Problem set: 0 solved, 23 unsolved in 3478 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 5/5 constraints]
After SMT, in 5964ms problems are : Problem set: 0 solved, 23 unsolved
Parikh walk visited 4 properties in 4243 ms.
Support contains 19 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 104/104 transitions.
Applied a total of 0 rules in 21 ms. Remains 162 /162 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 162/162 places, 104/104 transitions.
RANDOM walk for 4000000 steps (191276 resets) in 42441 ms. (94 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (3626 resets) in 1171 ms. (341 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (3629 resets) in 1203 ms. (332 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (3583 resets) in 1160 ms. (344 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (3607 resets) in 1163 ms. (343 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (3624 resets) in 1111 ms. (359 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (3641 resets) in 1153 ms. (346 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (3589 resets) in 1072 ms. (372 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (3685 resets) in 1120 ms. (356 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (3624 resets) in 997 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (3623 resets) in 1204 ms. (331 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (3641 resets) in 1096 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (3597 resets) in 681 ms. (586 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (3583 resets) in 868 ms. (460 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (3678 resets) in 1079 ms. (370 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (3675 resets) in 703 ms. (568 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (3674 resets) in 672 ms. (594 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (3648 resets) in 660 ms. (605 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (3598 resets) in 863 ms. (462 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (3642 resets) in 743 ms. (537 steps per ms) remains 19/19 properties
Finished probabilistic random walk after 180623 steps, run visited all 19 properties in 1478 ms. (steps per millisecond=122 )
Probabilistic random walk after 180623 steps, saw 46776 distinct states, run finished after 1486 ms. (steps per millisecond=121 ) properties seen :19
Able to resolve query StableMarking after proving 234 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 71260 ms.
ITS solved all properties within timeout

BK_STOP 1748652169767

--------------------
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="DES-PT-10b"
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-10b, 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-174854076400183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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