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.r070-smll-174854076300119.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 Dekker-PT-020, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076300119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K 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.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 247K May 29 14:32 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 Liveness

=== Now, execution of the tool begins

BK_START 1748647595786

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Dekker-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 23:26:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-30 23:26:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:26:38] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2025-05-30 23:26:38] [INFO ] Transformed 100 places.
[2025-05-30 23:26:38] [INFO ] Transformed 440 transitions.
[2025-05-30 23:26:38] [INFO ] Found NUPN structural information;
[2025-05-30 23:26:38] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 482 ms.
Built sparse matrix representations for Structural reductions in 15 ms.17308KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 100/100 places, 440/440 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 98 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 125 ms. Remains : 100/100 places, 440/440 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 100/100 places, 440/440 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 28 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2025-05-30 23:26:39] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2025-05-30 23:26:39] [INFO ] Computed 60 invariants in 8 ms
[2025-05-30 23:26:39] [INFO ] Implicit Places using invariants in 339 ms returned []
[2025-05-30 23:26:39] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2025-05-30 23:26:39] [INFO ] Invariant cache hit.
[2025-05-30 23:26:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-30 23:26:40] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2025-05-30 23:26:40] [INFO ] Redundant transitions in 43 ms returned []
Running 420 sub problems to find dead transitions.
[2025-05-30 23:26:40] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2025-05-30 23:26:40] [INFO ] Invariant cache hit.
[2025-05-30 23:26:40] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 10 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-05-30 23:26:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
[2025-05-30 23:26:44] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2025-05-30 23:26:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2025-05-30 23:26:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2025-05-30 23:26:45] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 3 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2025-05-30 23:26:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 8 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2025-05-30 23:26:47] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:26:48] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-05-30 23:26:48] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:26:48] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 11 ms to minimize.
[2025-05-30 23:26:48] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:26:48] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-05-30 23:26:48] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2025-05-30 23:26:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
[2025-05-30 23:26:50] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2025-05-30 23:26:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2025-05-30 23:26:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
[2025-05-30 23:26:50] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2025-05-30 23:26:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 4 ms to minimize.
[2025-05-30 23:26:50] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2025-05-30 23:26:50] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2025-05-30 23:26:50] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2025-05-30 23:26:50] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 10/190 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 20/100 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 11 (OVERLAPS) 80/180 variables, 100/330 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 14 (OVERLAPS) 0/180 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 350 constraints, problems are : Problem set: 0 solved, 420 unsolved in 28331 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 100/100 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 70/190 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (OVERLAPS) 20/100 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 80/180 variables, 100/330 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 420/770 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 12 (OVERLAPS) 0/180 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 770 constraints, problems are : Problem set: 0 solved, 420 unsolved in 18082 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 100/100 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 70/70 constraints]
After SMT, in 47105ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 47160ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 48016 ms. Remains : 100/100 places, 440/440 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6651 ms (no deadlock found). (steps per millisecond=187 )
Random directed walk for 1250000 steps, including 0 resets, run took 6638 ms (no deadlock found). (steps per millisecond=188 )
[2025-05-30 23:27:40] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2025-05-30 23:27:40] [INFO ] Invariant cache hit.
[2025-05-30 23:27:40] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2025-05-30 23:27:40] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 3 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2025-05-30 23:27:40] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2025-05-30 23:27:40] [INFO ] Invariant cache hit.
[2025-05-30 23:27:41] [INFO ] Implicit Places using invariants in 341 ms returned [40, 43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 97]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 347 ms to find 20 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 80/100 places, 440/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 362 ms. Remains : 80/100 places, 440/440 transitions.
Discarding 20 transitions out of 440. Remains 420
RANDOM walk for 40000 steps (8 resets) in 2309 ms. (17 steps per ms) remains 23/420 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 10/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 8/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 4/6 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 1/2 properties
BEST_FIRST walk for 168 steps (0 resets) in 4 ms. (33 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 420 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2025-05-30 23:27:42] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2025-05-30 23:27:42] [INFO ] Invariant cache hit.
[2025-05-30 23:27:42] [INFO ] Implicit Places using invariants in 359 ms returned [40, 43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 97]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 363 ms to find 20 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 80/100 places, 440/440 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 373 ms. Remains : 80/100 places, 440/440 transitions.
Discarding 20 transitions out of 440. Remains 420
Net is quasi-live, checking if it is reversible to establish liveness.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :420 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 420 properties from file /home/mcc/execution/Liveness.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 64248 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-020

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 100
TRANSITIONS: 440
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 3240
NUPN UNITS: 42
LOADING TIME: 0.798

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.051
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.244
OK.
----------------------------------------------------------------------
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: 772
MODEL NAME: /home/mcc/execution/model
100 places, 440 transitions.

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.
Building monolithic NSF...
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1748647674743

--------------------
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 Liveness -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="Dekker-PT-020"
export BK_EXAMINATION="Liveness"
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 Dekker-PT-020, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-smll-174854076300119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-020.tgz
mv Dekker-PT-020 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;