About the Execution of GreatSPN+red for QuasiCertifProtocol-PT-28
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
12804.012 | 1800000.00 | 5565927.00 | 1635.50 | [undef] | Time out reached |
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.r320-tall-171662351900062.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 QuasiCertifProtocol-PT-28, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r320-tall-171662351900062
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 107K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 666K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K Apr 13 03:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 76K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 121K Apr 13 04:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 795K Apr 13 04:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 33K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 749K 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 1716751963158
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=QuasiCertifProtocol-PT-28
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 19:32:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-26 19:32:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 19:32:44] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-26 19:32:44] [INFO ] Transformed 2998 places.
[2024-05-26 19:32:44] [INFO ] Transformed 446 transitions.
[2024-05-26 19:32:44] [INFO ] Parsed PT model containing 2998 places and 446 transitions and 6489 arcs in 249 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2936 transition count 446
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 2934 transition count 444
Applied a total of 66 rules in 107 ms. Remains 2934 /2998 variables (removed 64) and now considering 444/446 (removed 2) transitions.
// Phase 1: matrix 444 rows 2934 cols
[2024-05-26 19:32:44] [INFO ] Computed 2492 invariants in 126 ms
[2024-05-26 19:32:49] [INFO ] Implicit Places using invariants in 4959 ms returned []
[2024-05-26 19:32:49] [INFO ] Invariant cache hit.
[2024-05-26 19:32:59] [INFO ] Implicit Places using invariants and state equation in 9529 ms returned [1967, 1968, 1970, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 14531 ms to find 29 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 2905/2998 places, 444/446 transitions.
Applied a total of 0 rules in 36 ms. Remains 2905 /2905 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 14691 ms. Remains : 2905/2998 places, 444/446 transitions.
Discarding 63 transitions out of 444. Remains 381
Initial state reduction rules removed 30 formulas.
RANDOM walk for 40000 steps (1211 resets) in 2910 ms. (13 steps per ms) remains 293/351 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 293/293 properties
// Phase 1: matrix 444 rows 2905 cols
[2024-05-26 19:33:00] [INFO ] Computed 2464 invariants in 336 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2846 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2846/3349 variables, and 2436 constraints, problems are : Problem set: 0 solved, 293 unsolved in 5040 ms.
Refiners :[Generalized P Invariants (flows): 2436/2464 constraints, State Equation: 0/2905 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2846 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2846/3349 variables, and 2436 constraints, problems are : Problem set: 0 solved, 293 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 2436/2464 constraints, State Equation: 0/2905 constraints, PredecessorRefiner: 0/293 constraints, Known Traps: 0/0 constraints]
After SMT, in 11142ms problems are : Problem set: 0 solved, 293 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2846 out of 2905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2905/2905 places, 444/444 transitions.
Applied a total of 0 rules in 43 ms. Remains 2905 /2905 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 2905/2905 places, 444/444 transitions.
RANDOM walk for 3947039 steps (119409 resets) in 98578 ms. (40 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40002 steps (61 resets) in 128 ms. (310 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 131 ms. (303 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 134 ms. (296 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (58 resets) in 116 ms. (341 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 121 ms. (327 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (56 resets) in 114 ms. (347 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (51 resets) in 108 ms. (367 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (51 resets) in 117 ms. (339 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (55 resets) in 100 ms. (396 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (59 resets) in 91 ms. (434 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (56 resets) in 86 ms. (459 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 64 ms. (615 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (59 resets) in 65 ms. (606 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (55 resets) in 65 ms. (606 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (63 resets) in 65 ms. (606 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40002 steps (59 resets) in 66 ms. (597 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 70 ms. (563 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (57 resets) in 66 ms. (597 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (55 resets) in 65 ms. (606 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 65 ms. (606 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (54 resets) in 65 ms. (606 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 67 ms. (588 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (59 resets) in 66 ms. (597 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 65 ms. (606 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (57 resets) in 67 ms. (588 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (62 resets) in 69 ms. (571 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (53 resets) in 63 ms. (625 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (61 resets) in 66 ms. (597 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (53 resets) in 66 ms. (597 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (56 resets) in 64 ms. (615 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 66 ms. (597 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (58 resets) in 65 ms. (606 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (54 resets) in 65 ms. (606 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40002 steps (57 resets) in 67 ms. (588 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (54 resets) in 68 ms. (579 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (60 resets) in 130 ms. (305 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 84 ms. (470 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (56 resets) in 85 ms. (465 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 85 ms. (465 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (60 resets) in 86 ms. (459 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (54 resets) in 85 ms. (465 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 86 ms. (459 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (58 resets) in 110 ms. (360 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (56 resets) in 118 ms. (336 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (51 resets) in 85 ms. (465 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (60 resets) in 85 ms. (465 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (52 resets) in 85 ms. (465 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (58 resets) in 85 ms. (465 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 85 ms. (465 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 85 ms. (465 steps per ms) remains 293/293 properties
Probabilistic random walk after 10000001 steps, saw 1170366 distinct states, run finished after 54957 ms. (steps per millisecond=181 ) properties seen :0
[2024-05-26 19:34:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2846 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2846 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 29/2875 variables, 28/2464 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2875 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 293 unsolved
SMT process timed out in 45612ms, After SMT, problems are : Problem set: 0 solved, 293 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2846 out of 2905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2905/2905 places, 444/444 transitions.
Applied a total of 0 rules in 32 ms. Remains 2905 /2905 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 2905/2905 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2905/2905 places, 444/444 transitions.
Applied a total of 0 rules in 26 ms. Remains 2905 /2905 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-05-26 19:35:23] [INFO ] Invariant cache hit.
[2024-05-26 19:35:24] [INFO ] Implicit Places using invariants in 805 ms returned []
[2024-05-26 19:35:24] [INFO ] Invariant cache hit.
[2024-05-26 19:35:25] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 2453 ms to find 0 implicit places.
[2024-05-26 19:35:26] [INFO ] Redundant transitions in 60 ms returned []
Running 414 sub problems to find dead transitions.
[2024-05-26 19:35:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2904 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2904/3349 variables, and 2464 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2905 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2904 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2904 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 444/3348 variables, 2904/5368 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3348 variables, 414/5782 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3348/3349 variables, and 5782 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2904/2905 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
After SMT, in 60633ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 60637ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63187 ms. Remains : 2905/2905 places, 444/444 transitions.
RANDOM walk for 4000000 steps (121011 resets) in 76389 ms. (52 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (60 resets) in 93 ms. (425 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (61 resets) in 144 ms. (275 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (58 resets) in 147 ms. (270 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (59 resets) in 103 ms. (384 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (61 resets) in 91 ms. (434 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 139 ms. (285 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 135 ms. (294 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (54 resets) in 150 ms. (264 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 105 ms. (377 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (54 resets) in 79 ms. (500 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 122 ms. (325 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 114 ms. (347 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (55 resets) in 133 ms. (298 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (55 resets) in 87 ms. (454 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (54 resets) in 117 ms. (339 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 137 ms. (289 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (49 resets) in 108 ms. (367 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 98 ms. (404 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 100 ms. (396 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 101 ms. (392 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (56 resets) in 118 ms. (336 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (56 resets) in 106 ms. (373 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 119 ms. (333 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (56 resets) in 114 ms. (347 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (60 resets) in 83 ms. (476 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (59 resets) in 123 ms. (322 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 81 ms. (487 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 136 ms. (292 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 88 ms. (449 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 109 ms. (363 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (53 resets) in 134 ms. (296 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (60 resets) in 126 ms. (314 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (59 resets) in 84 ms. (470 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (55 resets) in 96 ms. (412 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 104 ms. (380 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (55 resets) in 104 ms. (380 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 170 ms. (233 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (48 resets) in 152 ms. (261 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (55 resets) in 168 ms. (236 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (55 resets) in 142 ms. (279 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (55 resets) in 140 ms. (283 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 124 ms. (320 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 121 ms. (327 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (58 resets) in 140 ms. (283 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (55 resets) in 110 ms. (360 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (56 resets) in 138 ms. (287 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (57 resets) in 147 ms. (270 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (58 resets) in 117 ms. (339 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (63 resets) in 186 ms. (213 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (62 resets) in 115 ms. (344 steps per ms) remains 293/293 properties
Interrupted probabilistic random walk after 9368778 steps, run timeout after 63001 ms. (steps per millisecond=148 ) properties seen :0 out of 293
Probabilistic random walk after 9368778 steps, saw 1103837 distinct states, run finished after 63007 ms. (steps per millisecond=148 ) properties seen :0
[2024-05-26 19:37:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2846 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2846 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 29/2875 variables, 28/2464 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2875 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 444/3319 variables, 2875/5339 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3319/3349 variables, and 5339 constraints, problems are : Problem set: 0 solved, 293 unsolved in 75018 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2875/2905 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2846 variables, 2436/2436 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2846 variables, 0/2436 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 29/2875 variables, 28/2464 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2875 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 444/3319 variables, 2875/5339 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3319 variables, 293/5632 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3319/3349 variables, and 5632 constraints, problems are : Problem set: 0 solved, 293 unsolved in 75022 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2875/2905 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints]
After SMT, in 150474ms problems are : Problem set: 0 solved, 293 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2846 out of 2905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2905/2905 places, 444/444 transitions.
Applied a total of 0 rules in 20 ms. Remains 2905 /2905 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 2905/2905 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2905/2905 places, 444/444 transitions.
Applied a total of 0 rules in 17 ms. Remains 2905 /2905 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-05-26 19:40:22] [INFO ] Invariant cache hit.
[2024-05-26 19:40:22] [INFO ] Implicit Places using invariants in 760 ms returned []
[2024-05-26 19:40:22] [INFO ] Invariant cache hit.
[2024-05-26 19:40:24] [INFO ] Implicit Places using invariants and state equation in 1685 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
[2024-05-26 19:40:24] [INFO ] Redundant transitions in 37 ms returned []
Running 414 sub problems to find dead transitions.
[2024-05-26 19:40:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2904 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2904/3349 variables, and 2464 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 0/2905 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2904 variables, 2464/2464 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2904 variables, 0/2464 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 444/3348 variables, 2904/5368 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3348 variables, 414/5782 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3348/3349 variables, and 5782 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 2464/2464 constraints, State Equation: 2904/2905 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
After SMT, in 60519ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 60523ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63047 ms. Remains : 2905/2905 places, 444/444 transitions.
Unable to solve all queries for examination QuasiLiveness. Remains :293 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 293 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 520903 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running QuasiCertifProtocol-PT-28
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2998
TRANSITIONS: 446
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.040s, Sys 0.000s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 589
MODEL NAME: /home/mcc/execution/model
2998 places, 446 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
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
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="QuasiCertifProtocol-PT-28"
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 QuasiCertifProtocol-PT-28, 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 r320-tall-171662351900062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 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 '
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 ;