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

About the Execution of 2024-gold for ShieldRVt-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15691.210 60171.00 173473.00 155.20 T 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-174902009800192.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 ShieldRVt-PT-040A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009800192
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 109K 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 1749106736052

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 06:58:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 06:58:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:58:57] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-06-05 06:58:57] [INFO ] Transformed 323 places.
[2025-06-05 06:58:57] [INFO ] Transformed 323 transitions.
[2025-06-05 06:58:57] [INFO ] Found NUPN structural information;
[2025-06-05 06:58:57] [INFO ] Parsed PT model containing 323 places and 323 transitions and 1366 arcs in 192 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 323/323 places, 323/323 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 322 transition count 321
Applied a total of 3 rules in 54 ms. Remains 322 /323 variables (removed 1) and now considering 321/323 (removed 2) transitions.
// Phase 1: matrix 321 rows 322 cols
[2025-06-05 06:58:57] [INFO ] Computed 161 invariants in 20 ms
[2025-06-05 06:58:58] [INFO ] Implicit Places using invariants in 476 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 509 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 321/323 places, 321/323 transitions.
Applied a total of 0 rules in 9 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 594 ms. Remains : 321/323 places, 321/323 transitions.
Discarding 159 transitions out of 321. Remains 162
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 2564 ms. (15 steps per ms) remains 110/161 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 110/110 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 110/110 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 110/110 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 110/110 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 110/110 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 110/110 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 110/110 properties
// Phase 1: matrix 321 rows 321 cols
[2025-06-05 06:58:59] [INFO ] Computed 160 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 4/227 variables, 113/336 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 94/321 variables, 47/387 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 94/481 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/642 variables, and 802 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5014 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 4/227 variables, 113/336 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 94/321 variables, 47/387 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 94/481 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/642 variables, 110/912 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/642 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 912 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5015 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 10123ms problems are : Problem set: 0 solved, 110 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 223 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 321/321 transitions.
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 321 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 321 transition count 308
Applied a total of 26 rules in 49 ms. Remains 321 /321 variables (removed 0) and now considering 308/321 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 321/321 places, 308/321 transitions.
RANDOM walk for 4000000 steps (8 resets) in 36979 ms. (108 steps per ms) remains 44/110 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1632 ms. (244 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1212 ms. (329 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1746 ms. (228 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1259 ms. (317 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1185 ms. (337 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1185 ms. (337 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1217 ms. (328 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1203 ms. (332 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1183 ms. (337 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1192 ms. (335 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1229 ms. (325 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1191 ms. (335 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1197 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1210 ms. (330 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1232 ms. (324 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1246 ms. (320 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1248 ms. (320 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1247 ms. (320 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1239 ms. (322 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1235 ms. (323 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1212 ms. (329 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1194 ms. (334 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1222 ms. (327 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1221 ms. (327 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1677 ms. (238 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1191 ms. (335 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1199 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1174 ms. (340 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1186 ms. (336 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1197 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1180 ms. (338 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1164 ms. (343 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1181 ms. (338 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1164 ms. (343 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1171 ms. (341 steps per ms) remains 39/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1183 ms. (337 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1170 ms. (341 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1162 ms. (343 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1164 ms. (343 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1149 ms. (347 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1168 ms. (342 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1168 ms. (342 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1172 ms. (341 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1171 ms. (341 steps per ms) remains 39/39 properties
// Phase 1: matrix 308 rows 321 cols
[2025-06-05 06:59:34] [INFO ] Computed 160 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 5/87 variables, 43/125 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 234/321 variables, 117/247 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 234/481 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 308/629 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/629 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 802 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1908 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 5/87 variables, 43/125 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 234/321 variables, 117/247 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 234/481 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 308/629 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 39/841 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/629 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 841 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2389 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 4318ms problems are : Problem set: 0 solved, 39 unsolved
Parikh walk visited 0 properties in 5250 ms.
Support contains 82 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 308/308 transitions.
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 321 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 321 transition count 290
Applied a total of 36 rules in 47 ms. Remains 321 /321 variables (removed 0) and now considering 290/308 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 321/321 places, 290/308 transitions.
RANDOM walk for 4000000 steps (8 resets) in 34556 ms. (115 steps per ms) remains 0/39 properties
Able to resolve query QuasiLiveness after proving 162 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 58801 ms.
ITS solved all properties within timeout

BK_STOP 1749106796223

--------------------
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="ShieldRVt-PT-040A"
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 ShieldRVt-PT-040A, 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-174902009800192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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