fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r224-tall-174902010000292
Last Updated
June 24, 2025

About the Execution of 2024-gold for SieveSingleMsgMbox-PT-d2m18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15681.280 208165.00 367899.00 517.40 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.r224-tall-174902010000292.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 SieveSingleMsgMbox-PT-d2m18, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902010000292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749107441092

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 07:10:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 07:10:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:10:42] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2025-06-05 07:10:42] [INFO ] Transformed 2398 places.
[2025-06-05 07:10:42] [INFO ] Transformed 1954 transitions.
[2025-06-05 07:10:42] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 270 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2398/2398 places, 1954/1954 transitions.
Reduce places removed 2009 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 2837 rules applied. Total rules applied 2837 place count 389 transition count 1126
Applied a total of 2837 rules in 61 ms. Remains 389 /2398 variables (removed 2009) and now considering 1126/1954 (removed 828) transitions.
// Phase 1: matrix 1126 rows 389 cols
[2025-06-05 07:10:42] [INFO ] Computed 5 invariants in 45 ms
[2025-06-05 07:10:43] [INFO ] Implicit Places using invariants in 730 ms returned []
[2025-06-05 07:10:43] [INFO ] Invariant cache hit.
[2025-06-05 07:10:43] [INFO ] State equation strengthened by 846 read => feed constraints.
[2025-06-05 07:10:47] [INFO ] Implicit Places using invariants and state equation in 3650 ms returned []
Implicit Place search using SMT with State Equation took 4408 ms to find 0 implicit places.
Running 1125 sub problems to find dead transitions.
[2025-06-05 07:10:47] [INFO ] Invariant cache hit.
[2025-06-05 07:10:47] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
At refinement iteration 3 (OVERLAPS) 1/389 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1125 unsolved
[2025-06-05 07:11:19] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 24 ms to minimize.
[2025-06-05 07:11:19] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 3 ms to minimize.
[2025-06-05 07:11:20] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 3 ms to minimize.
[2025-06-05 07:11:20] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 4 ms to minimize.
[2025-06-05 07:11:20] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 8 ms to minimize.
[2025-06-05 07:11:20] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 3 ms to minimize.
[2025-06-05 07:11:20] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2025-06-05 07:11:20] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2025-06-05 07:11:21] [INFO ] Deduced a trap composed of 109 places in 97 ms of which 2 ms to minimize.
[2025-06-05 07:11:21] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2025-06-05 07:11:21] [INFO ] Deduced a trap composed of 110 places in 98 ms of which 2 ms to minimize.
[2025-06-05 07:11:21] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 2 ms to minimize.
[2025-06-05 07:11:21] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 2 ms to minimize.
[2025-06-05 07:11:21] [INFO ] Deduced a trap composed of 117 places in 109 ms of which 2 ms to minimize.
[2025-06-05 07:11:21] [INFO ] Deduced a trap composed of 117 places in 94 ms of which 2 ms to minimize.
[2025-06-05 07:11:22] [INFO ] Deduced a trap composed of 117 places in 103 ms of which 2 ms to minimize.
SMT process timed out in 34869ms, After SMT, problems are : Problem set: 0 solved, 1125 unsolved
Search for dead transitions found 0 dead transitions in 34899ms
Starting structural reductions in LIVENESS mode, iteration 1 : 389/2398 places, 1126/1954 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 39406 ms. Remains : 389/2398 places, 1126/1954 transitions.
Discarding 748 transitions out of 1126. Remains 378
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8808 resets) in 5553 ms. (7 steps per ms) remains 353/377 properties
BEST_FIRST walk for 404 steps (18 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (17 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (19 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (15 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (14 resets) in 18 ms. (21 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (24 resets) in 13 ms. (28 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (17 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (21 resets) in 13 ms. (28 steps per ms) remains 353/353 properties
BEST_FIRST walk for 401 steps (14 resets) in 14 ms. (26 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (15 resets) in 7 ms. (50 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (18 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (19 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (15 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 401 steps (19 resets) in 13 ms. (28 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (18 resets) in 12 ms. (31 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (19 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (21 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (20 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 401 steps (17 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (16 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (20 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (14 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (18 resets) in 6 ms. (57 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (23 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (18 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (16 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (11 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (18 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (16 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (14 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (19 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (12 resets) in 27 ms. (14 steps per ms) remains 353/353 properties
BEST_FIRST walk for 401 steps (18 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (21 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (21 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (16 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (15 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (17 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (18 resets) in 6 ms. (57 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (17 resets) in 10 ms. (36 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (19 resets) in 11 ms. (33 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (17 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (15 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (20 resets) in 7 ms. (50 steps per ms) remains 353/353 properties
BEST_FIRST walk for 402 steps (16 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (12 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (14 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 403 steps (22 resets) in 9 ms. (40 steps per ms) remains 353/353 properties
BEST_FIRST walk for 400 steps (24 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
BEST_FIRST walk for 404 steps (16 resets) in 8 ms. (44 steps per ms) remains 353/353 properties
Probabilistic random walk after 100000 steps, saw 46412 distinct states, run finished after 1846 ms. (steps per millisecond=54 ) properties seen :152
[2025-06-05 07:11:25] [INFO ] Invariant cache hit.
[2025-06-05 07:11:25] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 103/315 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 40/355 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2025-06-05 07:11:31] [INFO ] Deduced a trap composed of 206 places in 115 ms of which 2 ms to minimize.
SMT process timed out in 5621ms, After SMT, problems are : Problem set: 0 solved, 201 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 212 out of 389 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 1126/1126 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 359 transition count 958
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 359 transition count 958
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 93 place count 359 transition count 925
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 107 place count 345 transition count 911
Iterating global reduction 1 with 14 rules applied. Total rules applied 121 place count 345 transition count 911
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 345 transition count 910
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 127 place count 340 transition count 903
Iterating global reduction 2 with 5 rules applied. Total rules applied 132 place count 340 transition count 903
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 340 transition count 901
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 339 transition count 900
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 339 transition count 900
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 338 transition count 899
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 338 transition count 899
Applied a total of 138 rules in 184 ms. Remains 338 /389 variables (removed 51) and now considering 899/1126 (removed 227) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 338/389 places, 899/1126 transitions.
RANDOM walk for 4000000 steps (897687 resets) in 58034 ms. (68 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 204 ms. (195 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 193 ms. (206 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1858 resets) in 192 ms. (207 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1857 resets) in 196 ms. (203 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40001 steps (1893 resets) in 192 ms. (207 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1895 resets) in 193 ms. (206 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1940 resets) in 202 ms. (197 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1952 resets) in 198 ms. (201 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1840 resets) in 189 ms. (210 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40001 steps (1901 resets) in 195 ms. (204 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 208 ms. (191 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1860 resets) in 210 ms. (189 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1853 resets) in 201 ms. (198 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1842 resets) in 200 ms. (199 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1892 resets) in 195 ms. (204 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 196 ms. (203 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40001 steps (1906 resets) in 199 ms. (200 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 194 ms. (205 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1850 resets) in 193 ms. (206 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1889 resets) in 199 ms. (200 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1874 resets) in 196 ms. (203 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1914 resets) in 195 ms. (204 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1870 resets) in 243 ms. (163 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1884 resets) in 299 ms. (133 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1912 resets) in 306 ms. (130 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1892 resets) in 301 ms. (132 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1884 resets) in 316 ms. (126 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1932 resets) in 334 ms. (119 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1833 resets) in 295 ms. (135 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1873 resets) in 237 ms. (168 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40000 steps (1857 resets) in 239 ms. (166 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1938 resets) in 312 ms. (127 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1823 resets) in 238 ms. (167 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1899 resets) in 303 ms. (131 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1930 resets) in 295 ms. (135 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1903 resets) in 308 ms. (129 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 257 ms. (155 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1842 resets) in 258 ms. (154 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1926 resets) in 300 ms. (132 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1978 resets) in 312 ms. (127 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1890 resets) in 286 ms. (139 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1926 resets) in 295 ms. (135 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 299 ms. (133 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1931 resets) in 261 ms. (152 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40002 steps (1950 resets) in 252 ms. (158 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1874 resets) in 341 ms. (116 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1923 resets) in 265 ms. (150 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40001 steps (1879 resets) in 389 ms. (102 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40003 steps (1864 resets) in 250 ms. (159 steps per ms) remains 201/201 properties
BEST_FIRST walk for 40004 steps (1906 resets) in 321 ms. (124 steps per ms) remains 201/201 properties
Interrupted probabilistic random walk after 4524647 steps, run timeout after 60001 ms. (steps per millisecond=75 ) properties seen :31 out of 201
Probabilistic random walk after 4524647 steps, saw 2080748 distinct states, run finished after 60010 ms. (steps per millisecond=75 ) properties seen :31
// Phase 1: matrix 899 rows 338 cols
[2025-06-05 07:12:51] [INFO ] Computed 5 invariants in 12 ms
[2025-06-05 07:12:51] [INFO ] State equation strengthened by 644 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 79/259 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 39/298 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-06-05 07:12:55] [INFO ] Deduced a trap composed of 189 places in 97 ms of which 2 ms to minimize.
[2025-06-05 07:12:55] [INFO ] Deduced a trap composed of 189 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 621/919 variables, 298/305 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/919 variables, 366/671 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 170 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 318/1237 variables, 40/711 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1237 variables, 278/989 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1237 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (OVERLAPS) 0/1237 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1237/1237 variables, and 989 constraints, problems are : Problem set: 0 solved, 170 unsolved in 41461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 338/338 constraints, ReadFeed: 644/644 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 79/259 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 39/298 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 621/919 variables, 298/305 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/919 variables, 366/671 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 64/735 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-06-05 07:13:43] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/919 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/919 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Problem qltransition_227 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 70894ms, After SMT, problems are : Problem set: 0 solved, 170 unsolved
Fused 170 Parikh solutions to 165 different solutions.
Parikh walk visited 0 properties in 6233 ms.
Support contains 180 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 899/899 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 321 transition count 642
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 321 transition count 642
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 304 transition count 625
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 304 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 74 place count 304 transition count 619
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 298 transition count 607
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 298 transition count 607
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 90 place count 298 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 297 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 297 transition count 602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 296 transition count 601
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 296 transition count 601
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 295 transition count 600
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 295 transition count 600
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 109 place count 295 transition count 587
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 294 transition count 586
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 294 transition count 586
Applied a total of 111 rules in 74 ms. Remains 294 /338 variables (removed 44) and now considering 586/899 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 294/338 places, 586/899 transitions.
Total runtime 206532 ms.
ITS solved all properties within timeout

BK_STOP 1749107649257

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m18"
export BK_EXAMINATION="QuasiLiveness"
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 SieveSingleMsgMbox-PT-d2m18, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-174902010000292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m18.tgz
mv SieveSingleMsgMbox-PT-d2m18 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;