Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r224-tall-174902009600097.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is ShieldRVs-PT-050B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009600097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 625K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749106500151

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 06:55:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 06:55:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:55:01] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2025-06-05 06:55:01] [INFO ] Transformed 2003 places.
[2025-06-05 06:55:01] [INFO ] Transformed 2253 transitions.
[2025-06-05 06:55:01] [INFO ] Found NUPN structural information;
[2025-06-05 06:55:01] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 328 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2003 transition count 2052
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1802 transition count 2052
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1802 transition count 1802
Deduced a syphon composed of 250 places in 20 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1552 transition count 1802
Performed 800 Post agglomeration using F-continuation condition.Transition count delta: 800
Deduced a syphon composed of 800 places in 3 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 2502 place count 752 transition count 1002
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2502 rules in 356 ms. Remains 752 /2003 variables (removed 1251) and now considering 1002/2253 (removed 1251) transitions.
// Phase 1: matrix 1002 rows 752 cols
[2025-06-05 06:55:02] [INFO ] Computed 201 invariants in 28 ms
[2025-06-05 06:55:03] [INFO ] Implicit Places using invariants in 786 ms returned []
[2025-06-05 06:55:03] [INFO ] Invariant cache hit.
[2025-06-05 06:55:03] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
Running 1001 sub problems to find dead transitions.
[2025-06-05 06:55:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/751 variables, 751/751 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/751 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 2 (OVERLAPS) 1/752 variables, 201/952 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/752 variables, 1/953 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 752/1754 variables, and 953 constraints, problems are : Problem set: 0 solved, 1001 unsolved in 30068 ms.
Refiners :[Domain max(s): 752/752 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/752 constraints, PredecessorRefiner: 1001/1001 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1001 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/751 variables, 751/751 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/751 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 2 (OVERLAPS) 1/752 variables, 201/952 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/752 variables, 1/953 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2025-06-05 06:55:45] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 14 ms to minimize.
[2025-06-05 06:55:45] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2025-06-05 06:55:45] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2025-06-05 06:55:45] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2025-06-05 06:55:45] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2025-06-05 06:55:45] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2025-06-05 06:55:45] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2025-06-05 06:55:46] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2025-06-05 06:55:47] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 20/973 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2025-06-05 06:55:47] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2025-06-05 06:55:47] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2025-06-05 06:55:47] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 3 ms to minimize.
[2025-06-05 06:55:47] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2025-06-05 06:55:47] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2025-06-05 06:55:47] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 102 places in 75 ms of which 1 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 103 places in 58 ms of which 1 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 5 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2025-06-05 06:55:48] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2025-06-05 06:55:49] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2025-06-05 06:55:49] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2025-06-05 06:55:49] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2025-06-05 06:55:49] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 20/993 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2025-06-05 06:55:49] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2025-06-05 06:55:49] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 104 places in 80 ms of which 1 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 103 places in 76 ms of which 2 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2025-06-05 06:55:50] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Deduced a trap composed of 108 places in 76 ms of which 2 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2025-06-05 06:55:51] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 20/1013 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2025-06-05 06:55:52] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2025-06-05 06:55:52] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2025-06-05 06:55:52] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2025-06-05 06:55:52] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2025-06-05 06:55:52] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2025-06-05 06:55:52] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2025-06-05 06:55:53] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2025-06-05 06:55:53] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2025-06-05 06:55:53] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2025-06-05 06:55:53] [INFO ] Deduced a trap composed of 105 places in 73 ms of which 1 ms to minimize.
[2025-06-05 06:55:53] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-06-05 06:55:53] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2025-06-05 06:55:53] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2025-06-05 06:55:53] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2025-06-05 06:55:53] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2025-06-05 06:55:53] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2025-06-05 06:55:54] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2025-06-05 06:55:54] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2025-06-05 06:55:54] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2025-06-05 06:55:54] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 20/1033 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2025-06-05 06:55:54] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2025-06-05 06:55:54] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2025-06-05 06:55:55] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2025-06-05 06:55:55] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2025-06-05 06:55:55] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2025-06-05 06:55:55] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-06-05 06:55:55] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2025-06-05 06:55:55] [INFO ] Deduced a trap composed of 95 places in 52 ms of which 1 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 93 places in 48 ms of which 1 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2025-06-05 06:55:56] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2025-06-05 06:55:57] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2025-06-05 06:55:57] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 20/1053 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2025-06-05 06:55:57] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 94 places in 53 ms of which 1 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 0 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2025-06-05 06:55:58] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2025-06-05 06:55:59] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 1 ms to minimize.
[2025-06-05 06:55:59] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2025-06-05 06:55:59] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2025-06-05 06:55:59] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2025-06-05 06:55:59] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2025-06-05 06:55:59] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2025-06-05 06:55:59] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2025-06-05 06:55:59] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2025-06-05 06:55:59] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-06-05 06:55:59] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 20/1073 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2025-06-05 06:56:00] [INFO ] Deduced a trap composed of 97 places in 72 ms of which 1 ms to minimize.
[2025-06-05 06:56:00] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 1 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 1 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 4 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2025-06-05 06:56:01] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2025-06-05 06:56:02] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2025-06-05 06:56:02] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2025-06-05 06:56:02] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2025-06-05 06:56:02] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2025-06-05 06:56:02] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2025-06-05 06:56:02] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2025-06-05 06:56:02] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2025-06-05 06:56:03] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 20/1093 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
[2025-06-05 06:56:04] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2025-06-05 06:56:04] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2025-06-05 06:56:04] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
SMT process timed out in 60698ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 60731ms
Starting structural reductions in LIVENESS mode, iteration 1 : 752/2003 places, 1002/2253 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62723 ms. Remains : 752/2003 places, 1002/2253 transitions.
Discarding 300 transitions out of 1002. Remains 702
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (58 resets) in 2641 ms. (15 steps per ms) remains 4/701 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/3 properties
[2025-06-05 06:56:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 18/24 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 728/752 variables, 195/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 728/953 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-05 06:56:06] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2025-06-05 06:56:06] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2025-06-05 06:56:06] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 2 ms to minimize.
[2025-06-05 06:56:06] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 5 ms to minimize.
[2025-06-05 06:56:06] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2025-06-05 06:56:06] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2025-06-05 06:56:06] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 3 ms to minimize.
[2025-06-05 06:56:07] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2025-06-05 06:56:07] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
[2025-06-05 06:56:07] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2025-06-05 06:56:07] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2025-06-05 06:56:07] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2025-06-05 06:56:07] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2025-06-05 06:56:07] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2025-06-05 06:56:08] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 2 ms to minimize.
[2025-06-05 06:56:08] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2025-06-05 06:56:08] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2025-06-05 06:56:08] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2025-06-05 06:56:08] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2025-06-05 06:56:08] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 20/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-05 06:56:08] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2025-06-05 06:56:09] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 3 ms to minimize.
[2025-06-05 06:56:09] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2025-06-05 06:56:09] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2025-06-05 06:56:13] [INFO ] Deduced a trap composed of 11 places in 3763 ms of which 29 ms to minimize.
SMT process timed out in 7429ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1002/1002 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 702 transition count 952
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 702 transition count 952
Partial Free-agglomeration rule applied 101 times.
Drop transitions (Partial Free agglomeration) removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 201 place count 702 transition count 952
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 701 transition count 951
Applied a total of 202 rules in 287 ms. Remains 701 /752 variables (removed 51) and now considering 951/1002 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 701/752 places, 951/1002 transitions.
RANDOM walk for 55213 steps (92 resets) in 618 ms. (89 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 702 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 72186 ms.
ITS solved all properties within timeout

BK_STOP 1749106573772

--------------------
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="ShieldRVs-PT-050B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is ShieldRVs-PT-050B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-174902009600097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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