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

About the Execution of GreatSPN+red for ViralEpidemic-PT-S04D1C1A06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8194.863 750822.00 1165108.00 1774.30 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/mcc2024-input.r452-smll-171701118300232.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 ViralEpidemic-PT-S04D1C1A06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r452-smll-171701118300232
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 07:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 07:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 06:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 11 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 20M 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 1717160714192

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ViralEpidemic-PT-S04D1C1A06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-31 13:05:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 13:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 13:05:18] [INFO ] Load time of PNML (sax parser for PT used): 2350 ms
[2024-05-31 13:05:18] [INFO ] Transformed 32767 places.
[2024-05-31 13:05:18] [INFO ] Transformed 49149 transitions.
[2024-05-31 13:05:18] [INFO ] Found NUPN structural information;
[2024-05-31 13:05:18] [INFO ] Parsed PT model containing 32767 places and 49149 transitions and 114681 arcs in 2845 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 699 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 13:05:47] [INFO ] Invariants computation overflowed in 28045 ms
[2024-05-31 13:06:25] [INFO ] Performed 7620/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 13:06:55] [INFO ] Performed 17467/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 13:07:25] [INFO ] Performed 27672/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 13:07:41] [INFO ] Implicit Places using invariants in 141654 ms returned []
Implicit Place search using SMT only with invariants took 141720 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 13:07:58] [INFO ] Invariants computation overflowed in 15798 ms
SMT process timed out in 277105ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 278001ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 420792 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Discarding 5460 transitions out of 49149. Remains 43689
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (56 resets) in 19670 ms. (2 steps per ms) remains 23949/43688 properties
BEST_FIRST walk for 120 steps (8 resets) in 106 ms. (1 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 145 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 184 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 191 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 160 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 168 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 171 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 165 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 175 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 176 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 148 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 148 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 149 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 153 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 149 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 145 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 149 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 149 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 149 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 148 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 146 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 148 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 139 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 137 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 147 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 167 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 152 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 163 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 154 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 133 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 148 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 132 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 132 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 130 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 124 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 125 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 126 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 126 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 125 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 129 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 121 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 122 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 128 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 126 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 122 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 123 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 123 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 126 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 126 ms. (0 steps per ms) remains 23949/23949 properties
BEST_FIRST walk for 120 steps (8 resets) in 121 ms. (0 steps per ms) remains 23949/23949 properties
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 13:12:45] [INFO ] Invariants computation overflowed in 16418 ms
SMT process timed out in 135101ms, After SMT, problems are : Problem set: 0 solved, 23949 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22018 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 25299 are kept as prefixes of interest. Removing 7468 places using SCC suffix rule.94 ms
Discarding 7468 places :
Also discarding 9164 output transitions
Drop transitions (Output transitions of discarded places.) removed 9164 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4132 transitions
Reduce isomorphic transitions removed 4132 transitions.
Iterating post reduction 0 with 4132 rules applied. Total rules applied 4133 place count 25299 transition count 35853
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 4133 place count 25299 transition count 35833
Deduced a syphon composed of 20 places in 27 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 40 rules applied. Total rules applied 4173 place count 25279 transition count 35833
Discarding 275 places :
Symmetric choice reduction at 1 with 275 rule applications. Total rules 4448 place count 25004 transition count 35357
Iterating global reduction 1 with 275 rules applied. Total rules applied 4723 place count 25004 transition count 35357
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 8 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 1 with 682 rules applied. Total rules applied 5405 place count 24663 transition count 35016
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5408 place count 24663 transition count 35013
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5411 place count 24660 transition count 35013
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5412 place count 24659 transition count 35012
Applied a total of 5412 rules in 5218 ms. Remains 24659 /32767 variables (removed 8108) and now considering 35012/49149 (removed 14137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5220 ms. Remains : 24659/32767 places, 35012/49149 transitions.
RANDOM walk for 249828 steps (36 resets) in 120004 ms. (2 steps per ms) remains 15/23949 properties
BEST_FIRST walk for 87463 steps (0 resets) in 20147 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 97989 steps (0 resets) in 20507 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 101009 steps (0 resets) in 20253 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 101559 steps (0 resets) in 20262 ms. (5 steps per ms) remains 15/15 properties
BEST_FIRST walk for 99996 steps (0 resets) in 20198 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 101546 steps (0 resets) in 20365 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 101779 steps (0 resets) in 20356 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 96516 steps (0 resets) in 20213 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 100325 steps (0 resets) in 20282 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 102742 steps (0 resets) in 20330 ms. (5 steps per ms) remains 15/15 properties
BEST_FIRST walk for 101250 steps (0 resets) in 20304 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 101925 steps (0 resets) in 20494 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 101140 steps (0 resets) in 20440 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 99477 steps (0 resets) in 20380 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 100234 steps (0 resets) in 20399 ms. (4 steps per ms) remains 15/15 properties
// Phase 1: matrix 35012 rows 24659 cols
[2024-05-31 13:16:47] [INFO ] Computed 961 invariants in 11120 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 31/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 176/287 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 59/346 variables, 25/138 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 134/480 variables, 46/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 306/786 variables, 108/292 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/786 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 138/924 variables, 10/302 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/924 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 476/1400 variables, 250/552 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1400 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 66/1466 variables, 8/560 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1466 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 675/2141 variables, 276/836 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2141 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 113/2254 variables, 10/846 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2254 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 641/2895 variables, 306/1152 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2895 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 66/2961 variables, 8/1160 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2961 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (OVERLAPS) 1053/4014 variables, 420/1580 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4014 variables, 0/1580 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (OVERLAPS) 156/4170 variables, 156/1736 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4170 variables, 0/1736 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (OVERLAPS) 0/4170 variables, 0/1736 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4170/59671 variables, and 1736 constraints, problems are : Problem set: 0 solved, 15 unsolved in 11810 ms.
Refiners :[Generalized P Invariants (flows): 38/961 constraints, State Equation: 1698/24659 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 31/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 176/287 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 59/346 variables, 25/147 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 134/480 variables, 46/199 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 306/786 variables, 108/307 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/786 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 138/924 variables, 10/317 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/924 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 476/1400 variables, 250/567 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1400 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 66/1466 variables, 8/575 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1466 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 675/2141 variables, 276/851 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2141 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 23 (OVERLAPS) 113/2254 variables, 10/861 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2254 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 25 (OVERLAPS) 641/2895 variables, 306/1167 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2895 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 27 (OVERLAPS) 66/2961 variables, 8/1175 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2961 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 29 (OVERLAPS) 1053/4014 variables, 420/1595 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4014 variables, 0/1595 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 31 (OVERLAPS) 156/4170 variables, 156/1751 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4170 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4170/59671 variables, and 1751 constraints, problems are : Problem set: 0 solved, 15 unsolved in 45159 ms.
Refiners :[Generalized P Invariants (flows): 38/961 constraints, State Equation: 1698/24659 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 68380ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 24659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24659/24659 places, 35012/35012 transitions.
Graph (complete) has 16053 edges and 24659 vertex of which 65 are kept as prefixes of interest. Removing 24594 places using SCC suffix rule.9 ms
Discarding 24594 places :
Also discarding 34898 output transitions
Drop transitions (Output transitions of discarded places.) removed 34898 transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 65 transition count 59
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 63 place count 58 transition count 59
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 63 place count 58 transition count 52
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 77 place count 51 transition count 52
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 85 place count 43 transition count 44
Iterating global reduction 2 with 8 rules applied. Total rules applied 93 place count 43 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 42 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 40 transition count 41
Applied a total of 97 rules in 116 ms. Remains 40 /24659 variables (removed 24619) and now considering 41/35012 (removed 34971) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 40/24659 places, 41/35012 transitions.
RANDOM walk for 61 steps (0 resets) in 7 ms. (7 steps per ms) remains 0/15 properties
Able to resolve query QuasiLiveness after proving 43689 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 748777 ms.
ITS solved all properties within timeout

BK_STOP 1717161465014

--------------------
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="ViralEpidemic-PT-S04D1C1A06"
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 ViralEpidemic-PT-S04D1C1A06, 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 r452-smll-171701118300232"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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