fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r386-smll-171683818500042
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for SieveSingleMsgMbox-PT-d1m18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1139.012 154689.00 307102.00 543.70 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/mcc2024-input.r386-smll-171683818500042.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is SieveSingleMsgMbox-PT-d1m18, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r386-smll-171683818500042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 19:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 19:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 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 1716891947180

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 10:25:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-28 10:25:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:25:49] [INFO ] Load time of PNML (sax parser for PT used): 337 ms
[2024-05-28 10:25:49] [INFO ] Transformed 1295 places.
[2024-05-28 10:25:49] [INFO ] Transformed 749 transitions.
[2024-05-28 10:25:49] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 697 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1295/1295 places, 749/749 transitions.
Reduce places removed 1053 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 1293 rules applied. Total rules applied 1293 place count 242 transition count 509
Applied a total of 1293 rules in 89 ms. Remains 242 /1295 variables (removed 1053) and now considering 509/749 (removed 240) transitions.
// Phase 1: matrix 509 rows 242 cols
[2024-05-28 10:25:50] [INFO ] Computed 5 invariants in 36 ms
[2024-05-28 10:25:51] [INFO ] Implicit Places using invariants in 998 ms returned []
[2024-05-28 10:25:51] [INFO ] Invariant cache hit.
[2024-05-28 10:25:51] [INFO ] State equation strengthened by 347 read => feed constraints.
[2024-05-28 10:25:54] [INFO ] Implicit Places using invariants and state equation in 2757 ms returned []
Implicit Place search using SMT with State Equation took 3973 ms to find 0 implicit places.
Running 508 sub problems to find dead transitions.
[2024-05-28 10:25:54] [INFO ] Invariant cache hit.
[2024-05-28 10:25:54] [INFO ] State equation strengthened by 347 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 1/242 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-05-28 10:26:08] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 35 ms to minimize.
[2024-05-28 10:26:08] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 4 ms to minimize.
[2024-05-28 10:26:08] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-05-28 10:26:09] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 3 ms to minimize.
[2024-05-28 10:26:09] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 2 ms to minimize.
[2024-05-28 10:26:09] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 3 ms to minimize.
[2024-05-28 10:26:09] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 3 ms to minimize.
[2024-05-28 10:26:09] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 3 ms to minimize.
[2024-05-28 10:26:09] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-05-28 10:26:09] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-28 10:26:10] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-28 10:26:10] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-05-28 10:26:13] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-28 10:26:13] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (OVERLAPS) 509/751 variables, 242/261 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 347/608 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/751 variables, and 608 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 242/242 constraints, ReadFeed: 347/347 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 508 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (OVERLAPS) 1/242 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (OVERLAPS) 509/751 variables, 242/261 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/751 variables, 347/608 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/751 variables, 508/1116 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/751 variables, and 1116 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 242/242 constraints, ReadFeed: 347/347 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 14/14 constraints]
After SMT, in 62226ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 62277ms
Starting structural reductions in LIVENESS mode, iteration 1 : 242/1295 places, 509/749 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 66423 ms. Remains : 242/1295 places, 509/749 transitions.
Discarding 275 transitions out of 509. Remains 234
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8783 resets) in 3701 ms. (10 steps per ms) remains 212/233 properties
BEST_FIRST walk for 403 steps (19 resets) in 20 ms. (19 steps per ms) remains 212/212 properties
BEST_FIRST walk for 400 steps (21 resets) in 13 ms. (28 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (15 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (20 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (18 resets) in 17 ms. (22 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (22 resets) in 16 ms. (23 steps per ms) remains 212/212 properties
BEST_FIRST walk for 401 steps (19 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 401 steps (19 resets) in 25 ms. (15 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (21 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (18 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (20 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (20 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (14 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (20 resets) in 24 ms. (16 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (23 resets) in 15 ms. (25 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (13 resets) in 27 ms. (14 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (17 resets) in 13 ms. (28 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (18 resets) in 14 ms. (26 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (20 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 401 steps (21 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 401 steps (20 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (17 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (19 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 401 steps (22 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 400 steps (16 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (17 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (17 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (17 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 401 steps (24 resets) in 11 ms. (33 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (19 resets) in 11 ms. (33 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (15 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (14 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (22 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (18 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (20 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (20 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (21 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (26 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (20 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 401 steps (18 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (17 resets) in 9 ms. (40 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (25 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 401 steps (17 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (11 resets) in 6 ms. (57 steps per ms) remains 212/212 properties
BEST_FIRST walk for 403 steps (12 resets) in 7 ms. (50 steps per ms) remains 212/212 properties
BEST_FIRST walk for 401 steps (23 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (19 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (14 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 404 steps (20 resets) in 8 ms. (44 steps per ms) remains 212/212 properties
BEST_FIRST walk for 402 steps (19 resets) in 10 ms. (36 steps per ms) remains 212/212 properties
Probabilistic random walk after 100000 steps, saw 47265 distinct states, run finished after 2083 ms. (steps per millisecond=48 ) properties seen :126
[2024-05-28 10:26:59] [INFO ] Invariant cache hit.
[2024-05-28 10:26:59] [INFO ] State equation strengthened by 347 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 85/179 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 36/215 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-28 10:27:02] [INFO ] Deduced a trap composed of 120 places in 184 ms of which 4 ms to minimize.
[2024-05-28 10:27:02] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 3 ms to minimize.
[2024-05-28 10:27:02] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-28 10:27:03] [INFO ] Deduced a trap composed of 78 places in 182 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 399/614 variables, 215/224 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 237/461 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/751 variables, and 461 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 215/242 constraints, ReadFeed: 237/347 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 85/179 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 36/215 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 399/614 variables, 215/224 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 237/461 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 26/487 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-28 10:27:09] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/751 variables, and 488 constraints, problems are : Problem set: 0 solved, 86 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 215/242 constraints, ReadFeed: 237/347 constraints, PredecessorRefiner: 26/86 constraints, Known Traps: 5/5 constraints]
After SMT, in 10242ms problems are : Problem set: 0 solved, 86 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 94 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 509/509 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 218 transition count 393
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 218 transition count 393
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 64 place count 218 transition count 377
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 77 place count 205 transition count 364
Iterating global reduction 1 with 13 rules applied. Total rules applied 90 place count 205 transition count 364
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 92 place count 205 transition count 362
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 201 transition count 357
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 201 transition count 357
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 201 transition count 355
Applied a total of 102 rules in 157 ms. Remains 201 /242 variables (removed 41) and now considering 355/509 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 201/242 places, 355/509 transitions.
RANDOM walk for 4000000 steps (896954 resets) in 43345 ms. (92 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (19209 resets) in 1458 ms. (274 steps per ms) remains 84/86 properties
BEST_FIRST walk for 400003 steps (19017 resets) in 1437 ms. (278 steps per ms) remains 83/84 properties
BEST_FIRST walk for 400004 steps (19097 resets) in 1449 ms. (275 steps per ms) remains 82/83 properties
BEST_FIRST walk for 400002 steps (19233 resets) in 1704 ms. (234 steps per ms) remains 81/82 properties
BEST_FIRST walk for 400003 steps (19155 resets) in 1395 ms. (286 steps per ms) remains 81/81 properties
BEST_FIRST walk for 400000 steps (19052 resets) in 1394 ms. (286 steps per ms) remains 78/81 properties
BEST_FIRST walk for 400003 steps (19135 resets) in 1371 ms. (291 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (18974 resets) in 1377 ms. (290 steps per ms) remains 75/78 properties
BEST_FIRST walk for 400003 steps (19165 resets) in 1363 ms. (293 steps per ms) remains 74/75 properties
BEST_FIRST walk for 400002 steps (19092 resets) in 1703 ms. (234 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (19137 resets) in 1364 ms. (293 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (18963 resets) in 1355 ms. (294 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (19163 resets) in 1351 ms. (295 steps per ms) remains 72/74 properties
BEST_FIRST walk for 400001 steps (19055 resets) in 1334 ms. (299 steps per ms) remains 70/72 properties
BEST_FIRST walk for 400002 steps (19168 resets) in 1320 ms. (302 steps per ms) remains 64/70 properties
BEST_FIRST walk for 400004 steps (19101 resets) in 1259 ms. (317 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (19046 resets) in 1254 ms. (318 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (19057 resets) in 1254 ms. (318 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (19161 resets) in 1246 ms. (320 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (19029 resets) in 1205 ms. (331 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (19062 resets) in 1262 ms. (316 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (19102 resets) in 1254 ms. (318 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (18991 resets) in 1265 ms. (315 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (18957 resets) in 1424 ms. (280 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400004 steps (19101 resets) in 1413 ms. (282 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (19205 resets) in 1260 ms. (317 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400003 steps (19165 resets) in 1263 ms. (316 steps per ms) remains 64/64 properties
BEST_FIRST walk for 400002 steps (19125 resets) in 1261 ms. (316 steps per ms) remains 62/64 properties
BEST_FIRST walk for 400003 steps (19005 resets) in 1253 ms. (318 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (19286 resets) in 1257 ms. (317 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (19213 resets) in 1239 ms. (322 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (19125 resets) in 1252 ms. (319 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (19086 resets) in 1257 ms. (317 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (19056 resets) in 1188 ms. (336 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400001 steps (18994 resets) in 1203 ms. (332 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (19047 resets) in 1217 ms. (328 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (19165 resets) in 1208 ms. (330 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (19047 resets) in 1218 ms. (328 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (19058 resets) in 1193 ms. (335 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (19283 resets) in 1204 ms. (331 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (19122 resets) in 1204 ms. (331 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41553 resets) in 1617 ms. (247 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41407 resets) in 1610 ms. (248 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (41454 resets) in 1618 ms. (247 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41484 resets) in 1608 ms. (248 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41140 resets) in 1601 ms. (249 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41263 resets) in 1632 ms. (244 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400001 steps (41365 resets) in 1608 ms. (248 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41449 resets) in 1607 ms. (248 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (41345 resets) in 1644 ms. (243 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41063 resets) in 1650 ms. (242 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41266 resets) in 1673 ms. (238 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (41087 resets) in 1678 ms. (238 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (41308 resets) in 1682 ms. (237 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41919 resets) in 1677 ms. (238 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41653 resets) in 1681 ms. (237 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400001 steps (41139 resets) in 1663 ms. (240 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (42211 resets) in 1707 ms. (234 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (41603 resets) in 1668 ms. (239 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400001 steps (41510 resets) in 1665 ms. (240 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (41431 resets) in 1621 ms. (246 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41583 resets) in 1635 ms. (244 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400001 steps (41215 resets) in 1634 ms. (244 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (41493 resets) in 1660 ms. (240 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400003 steps (41506 resets) in 1672 ms. (239 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (41263 resets) in 1675 ms. (238 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400002 steps (41364 resets) in 1674 ms. (238 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400001 steps (41425 resets) in 1685 ms. (237 steps per ms) remains 62/62 properties
// Phase 1: matrix 355 rows 201 cols
[2024-05-28 10:27:49] [INFO ] Computed 5 invariants in 6 ms
[2024-05-28 10:27:49] [INFO ] State equation strengthened by 215 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 84/153 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 30/183 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 10:27:51] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 4 ms to minimize.
[2024-05-28 10:27:51] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 4 ms to minimize.
[2024-05-28 10:27:51] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 4 ms to minimize.
[2024-05-28 10:27:52] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 3 ms to minimize.
[2024-05-28 10:27:52] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 3 ms to minimize.
[2024-05-28 10:27:52] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 338/521 variables, 183/194 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 198/392 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 62 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 35/556 variables, 18/410 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 17/427 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/556 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/556 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 427 constraints, problems are : Problem set: 0 solved, 62 unsolved in 9592 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 201/201 constraints, ReadFeed: 215/215 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 84/153 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 30/183 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 10:28:00] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-28 10:28:00] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-28 10:28:00] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-28 10:28:00] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-28 10:28:00] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 338/521 variables, 183/199 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 198/397 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 18/415 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 35/556 variables, 18/433 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/556 variables, 17/450 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/556 variables, 44/494 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 10:28:12] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
Problem qltransition_130 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK SMT_REFINEMENT BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
SMT process timed out in 22958ms, After SMT, problems are : Problem set: 0 solved, 62 unsolved
Fused 62 Parikh solutions to 39 different solutions.
Parikh walk visited 0 properties in 8820 ms.
Support contains 69 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 355/355 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 192 transition count 337
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 192 transition count 337
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 186 transition count 331
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 186 transition count 331
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 186 transition count 329
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 182 transition count 325
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 182 transition count 325
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 182 transition count 322
Applied a total of 43 rules in 61 ms. Remains 182 /201 variables (removed 19) and now considering 322/355 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 182/201 places, 322/355 transitions.
Total runtime 152344 ms.
ITS solved all properties within timeout

BK_STOP 1716892101869

--------------------
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 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-d1m18"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d1m18, 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 r386-smll-171683818500042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m18.tgz
mv SieveSingleMsgMbox-PT-d1m18 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;