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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 145K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K 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 1.5M 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 1748647703594

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-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 23:28:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-30 23:28:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:28:26] [INFO ] Load time of PNML (sax parser for PT used): 406 ms
[2025-05-30 23:28:26] [INFO ] Transformed 250 places.
[2025-05-30 23:28:26] [INFO ] Transformed 2600 transitions.
[2025-05-30 23:28:26] [INFO ] Found NUPN structural information;
[2025-05-30 23:28:26] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 607 ms.
Built sparse matrix representations for Structural reductions in 20 ms.24177KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 250/250 places, 2600/2600 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 376 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 400 ms. Remains : 250/250 places, 2600/2600 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 250/250 places, 2600/2600 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 148 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 23:28:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2025-05-30 23:28:27] [INFO ] Computed 150 invariants in 28 ms
[2025-05-30 23:28:27] [INFO ] Implicit Places using invariants in 417 ms returned []
[2025-05-30 23:28:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 23:28:27] [INFO ] Invariant cache hit.
[2025-05-30 23:28:28] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-05-30 23:28:28] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2025-05-30 23:28:28] [INFO ] Redundant transitions in 188 ms returned []
Running 2550 sub problems to find dead transitions.
[2025-05-30 23:28:28] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 23:28:28] [INFO ] Invariant cache hit.
[2025-05-30 23:28:28] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 11 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2025-05-30 23:28:49] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2025-05-30 23:28:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2025-05-30 23:28:50] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2025-05-30 23:28:50] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2025-05-30 23:28:50] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2025-05-30 23:28:50] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-05-30 23:28:50] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 200/450 variables, and 320 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30165 ms.
Refiners :[Domain max(s): 200/250 constraints, Positive P Invariants (semi-flows): 50/100 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 0/250 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 2550/2550 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 50/250 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2025-05-30 23:29:08] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
[2025-05-30 23:29:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2025-05-30 23:29:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2025-05-30 23:29:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:29:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:29:08] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2025-05-30 23:29:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2025-05-30 23:29:11] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-05-30 23:29:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2025-05-30 23:29:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2025-05-30 23:29:11] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:11] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:29:11] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:29:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2025-05-30 23:29:11] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:15] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:29:16] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:16] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:16] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2025-05-30 23:29:18] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:18] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:18] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2025-05-30 23:29:18] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:18] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:18] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2025-05-30 23:29:18] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 4 ms to minimize.
[2025-05-30 23:29:18] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
[2025-05-30 23:29:18] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2025-05-30 23:29:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
[2025-05-30 23:29:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:19] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-05-30 23:29:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2025-05-30 23:29:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:19] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:19] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2025-05-30 23:29:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2025-05-30 23:29:22] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:29:22] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:22] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:22] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2025-05-30 23:29:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2025-05-30 23:29:22] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2025-05-30 23:29:22] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:22] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:23] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:23] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:29:23] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:29:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:23] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2025-05-30 23:29:26] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2025-05-30 23:29:26] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:26] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:26] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:26] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:26] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2025-05-30 23:29:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 2550 unsolved
[2025-05-30 23:29:30] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-05-30 23:29:30] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
[2025-05-30 23:29:30] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/450 variables, and 443 constraints, problems are : Problem set: 0 solved, 2550 unsolved in 30065 ms.
Refiners :[Domain max(s): 200/250 constraints, Positive P Invariants (semi-flows): 50/100 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 0/250 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 0/2550 constraints, Known Traps: 143/143 constraints]
After SMT, in 63818ms problems are : Problem set: 0 solved, 2550 unsolved
Search for dead transitions found 0 dead transitions in 63905ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 65184 ms. Remains : 250/250 places, 2600/2600 transitions.
Random walk for 1250000 steps, including 0 resets, run took 16556 ms (no deadlock found). (steps per millisecond=75 )
Random directed walk for 1250030 steps, including 0 resets, run took 17872 ms (no deadlock found). (steps per millisecond=69 )
[2025-05-30 23:30:06] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 23:30:06] [INFO ] Invariant cache hit.
[2025-05-30 23:30:07] [INFO ] [Real]Absence check using 100 positive place invariants in 63 ms returned sat
[2025-05-30 23:30:07] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 3 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 28 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 23:30:07] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 23:30:07] [INFO ] Invariant cache hit.
[2025-05-30 23:30:09] [INFO ] Implicit Places using invariants in 2313 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 214, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 2322 ms to find 50 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 200/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 15 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2368 ms. Remains : 200/250 places, 2600/2600 transitions.
Discarding 50 transitions out of 2600. Remains 2550
RANDOM walk for 40000 steps (8 resets) in 3372 ms. (11 steps per ms) remains 88/2550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 86/88 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 85/86 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 84/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 83/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 81/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 80/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 79/80 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 78/79 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 76/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 74/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 73/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 72/73 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 70/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 69/70 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 64/66 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 55/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 52/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 50/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 44/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 9/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 4/6 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 2/4 properties
BEST_FIRST walk for 2922 steps (6 resets) in 23 ms. (121 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 2550 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 45 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2025-05-30 23:30:12] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 23:30:12] [INFO ] Invariant cache hit.
[2025-05-30 23:30:14] [INFO ] Implicit Places using invariants in 1821 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 214, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1828 ms to find 50 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 200/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 21 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1898 ms. Remains : 200/250 places, 2600/2600 transitions.
Discarding 50 transitions out of 2600. Remains 2550
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 :2550 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 2550 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 108891 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-050

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 250
TRANSITIONS: 2600
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 20100
NUPN UNITS: 102
LOADING TIME: 7.829

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.179
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 8.985
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: 1002
MODEL NAME: /home/mcc/execution/model
250 places, 2600 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.
Building monolithic NSF...
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1748648234999

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-050"
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-050, 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-174854076300124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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