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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15688.180 88590.00 243702.00 350.10 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-174854076400193.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-20b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076400193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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 60K 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.7K 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 142K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 91K 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 1748654007946

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-20b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 01:13:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 01:13:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 01:13:31] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2025-05-31 01:13:31] [INFO ] Transformed 360 places.
[2025-05-31 01:13:31] [INFO ] Transformed 311 transitions.
[2025-05-31 01:13:31] [INFO ] Found NUPN structural information;
[2025-05-31 01:13:31] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 608 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 17 ms.
RANDOM walk for 40000 steps (345 resets) in 3492 ms. (11 steps per ms) remains 69/273 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 69/69 properties
// Phase 1: matrix 311 rows 360 cols
[2025-05-31 01:13:32] [INFO ] Computed 65 invariants in 32 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 20/89 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 199/288 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 199/327 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 71/359 variables, 25/352 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 71/423 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 1/360 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 14 (OVERLAPS) 311/671 variables, 360/785 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/671 variables, and 785 constraints, problems are : Problem set: 0 solved, 69 unsolved in 5067 ms.
Refiners :[Domain max(s): 360/360 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 20/89 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 199/288 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 199/327 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2025-05-31 01:13:39] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 31 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 71/359 variables, 25/353 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 71/424 constraints. Problems are: Problem set: 0 solved, 69 unsolved
[2025-05-31 01:13:41] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 4 ms to minimize.
[2025-05-31 01:13:41] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/671 variables, and 426 constraints, problems are : Problem set: 0 solved, 69 unsolved in 5016 ms.
Refiners :[Domain max(s): 359/360 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 0/69 constraints, Known Traps: 3/3 constraints]
After SMT, in 10211ms problems are : Problem set: 0 solved, 69 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 354 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 354 transition count 284
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 333 transition count 284
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 333 transition count 275
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 324 transition count 275
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 305 transition count 256
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 305 transition count 256
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 305 transition count 255
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 304 transition count 255
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 289 transition count 240
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 289 transition count 240
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 289 transition count 225
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 287 transition count 224
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 287 transition count 221
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 284 transition count 221
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 207 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 205 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 205 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 204 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 203 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 202 transition count 144
Applied a total of 319 rules in 276 ms. Remains 202 /360 variables (removed 158) and now considering 144/311 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 202/360 places, 144/311 transitions.
RANDOM walk for 4000000 steps (191085 resets) in 37408 ms. (106 steps per ms) remains 62/69 properties
BEST_FIRST walk for 400002 steps (3710 resets) in 859 ms. (465 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3623 resets) in 979 ms. (408 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3633 resets) in 1023 ms. (390 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3657 resets) in 857 ms. (466 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3588 resets) in 981 ms. (407 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3674 resets) in 864 ms. (462 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3760 resets) in 865 ms. (461 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3714 resets) in 865 ms. (461 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3648 resets) in 878 ms. (455 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3666 resets) in 883 ms. (452 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3664 resets) in 849 ms. (470 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3678 resets) in 855 ms. (467 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3621 resets) in 858 ms. (465 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3636 resets) in 912 ms. (438 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3701 resets) in 865 ms. (461 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3648 resets) in 899 ms. (444 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3575 resets) in 851 ms. (469 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3667 resets) in 858 ms. (465 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3704 resets) in 850 ms. (470 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3624 resets) in 868 ms. (460 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3582 resets) in 893 ms. (447 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3612 resets) in 881 ms. (453 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3685 resets) in 862 ms. (463 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3641 resets) in 871 ms. (458 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3649 resets) in 857 ms. (466 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400001 steps (3731 resets) in 862 ms. (463 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3596 resets) in 859 ms. (465 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3645 resets) in 853 ms. (468 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3627 resets) in 854 ms. (467 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3608 resets) in 851 ms. (469 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3692 resets) in 848 ms. (471 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3635 resets) in 848 ms. (471 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3713 resets) in 854 ms. (467 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3658 resets) in 869 ms. (459 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3666 resets) in 877 ms. (455 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3678 resets) in 867 ms. (460 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3570 resets) in 860 ms. (464 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3725 resets) in 860 ms. (464 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3649 resets) in 864 ms. (462 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3648 resets) in 862 ms. (463 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3676 resets) in 856 ms. (466 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3679 resets) in 860 ms. (464 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3652 resets) in 860 ms. (464 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3653 resets) in 869 ms. (459 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3683 resets) in 860 ms. (464 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3702 resets) in 860 ms. (464 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3584 resets) in 860 ms. (464 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (3704 resets) in 863 ms. (462 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (3617 resets) in 859 ms. (465 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (3658 resets) in 868 ms. (460 steps per ms) remains 62/62 properties
// Phase 1: matrix 144 rows 202 cols
[2025-05-31 01:14:05] [INFO ] Computed 64 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 23/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 38/123 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 35/158 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 25/183 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 7/190 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 140/330 variables, 190/249 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (OVERLAPS) 14/344 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (OVERLAPS) 2/346 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 19 (OVERLAPS) 0/346 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 266 constraints, problems are : Problem set: 0 solved, 62 unsolved in 6384 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 23/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 38/123 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 35/158 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-05-31 01:14:13] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 4 ms to minimize.
[2025-05-31 01:14:13] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 25/183 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 7/190 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 140/330 variables, 190/251 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 48/299 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (OVERLAPS) 14/344 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/344 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/344 variables, 14/327 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-05-31 01:14:16] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/344 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-05-31 01:14:17] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 3 ms to minimize.
[2025-05-31 01:14:17] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/344 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/344 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 21 (OVERLAPS) 2/346 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/346 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/346 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 24 (OVERLAPS) 0/346 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 333 constraints, problems are : Problem set: 0 solved, 62 unsolved in 10759 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 5/5 constraints]
After SMT, in 17180ms problems are : Problem set: 0 solved, 62 unsolved
Fused 62 Parikh solutions to 61 different solutions.
Parikh walk visited 2 properties in 10100 ms.
Support contains 60 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 144/144 transitions.
Applied a total of 0 rules in 9 ms. Remains 202 /202 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 202/202 places, 144/144 transitions.
RANDOM walk for 4000000 steps (191540 resets) in 32875 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3680 resets) in 855 ms. (467 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3621 resets) in 851 ms. (469 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3622 resets) in 840 ms. (475 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3585 resets) in 841 ms. (475 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3621 resets) in 857 ms. (466 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3682 resets) in 841 ms. (475 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3585 resets) in 849 ms. (470 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3596 resets) in 838 ms. (476 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3624 resets) in 845 ms. (472 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3580 resets) in 855 ms. (467 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3604 resets) in 845 ms. (472 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3660 resets) in 841 ms. (475 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3715 resets) in 854 ms. (467 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3664 resets) in 841 ms. (475 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3646 resets) in 845 ms. (472 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3654 resets) in 848 ms. (471 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3622 resets) in 919 ms. (434 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3660 resets) in 1056 ms. (378 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3590 resets) in 845 ms. (472 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400001 steps (3726 resets) in 845 ms. (472 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3577 resets) in 844 ms. (473 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3655 resets) in 841 ms. (475 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400001 steps (3674 resets) in 840 ms. (475 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3608 resets) in 847 ms. (471 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3595 resets) in 841 ms. (475 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3674 resets) in 839 ms. (476 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3647 resets) in 841 ms. (475 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3608 resets) in 856 ms. (466 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3568 resets) in 847 ms. (471 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3682 resets) in 860 ms. (464 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3634 resets) in 844 ms. (473 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3692 resets) in 848 ms. (471 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3661 resets) in 846 ms. (472 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3636 resets) in 843 ms. (473 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3593 resets) in 840 ms. (475 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3699 resets) in 837 ms. (477 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3620 resets) in 843 ms. (473 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3641 resets) in 848 ms. (471 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3614 resets) in 844 ms. (473 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3622 resets) in 844 ms. (473 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3650 resets) in 846 ms. (472 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3630 resets) in 844 ms. (473 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3692 resets) in 848 ms. (471 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3667 resets) in 847 ms. (471 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3702 resets) in 848 ms. (471 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3657 resets) in 855 ms. (467 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3673 resets) in 845 ms. (472 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (3670 resets) in 847 ms. (471 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400002 steps (3684 resets) in 848 ms. (471 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (3606 resets) in 846 ms. (472 steps per ms) remains 60/60 properties
Finished probabilistic random walk after 370523 steps, run visited all 60 properties in 3705 ms. (steps per millisecond=100 )
Probabilistic random walk after 370523 steps, saw 94386 distinct states, run finished after 3717 ms. (steps per millisecond=99 ) properties seen :60
Able to resolve query StableMarking after proving 274 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 85924 ms.
ITS solved all properties within timeout

BK_STOP 1748654096536

--------------------
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-20b"
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-20b, 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-174854076400193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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