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.r154-tall-174876825300224.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 ParamProductionCell-PT-0, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825300224
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 149K 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 1748841947137

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-0
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 05:25:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-02 05:25:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:25:48] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2025-06-02 05:25:48] [INFO ] Transformed 198 places.
[2025-06-02 05:25:48] [INFO ] Transformed 176 transitions.
[2025-06-02 05:25:48] [INFO ] Found NUPN structural information;
[2025-06-02 05:25:48] [INFO ] Parsed PT model containing 198 places and 176 transitions and 730 arcs in 178 ms.
Built sparse matrix representations for Structural reductions in 5 ms.18282KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 198/198 places, 176/176 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 23 ms. Remains 198 /198 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 36 ms. Remains : 198/198 places, 176/176 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 198/198 places, 176/176 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 17 ms. Remains 198 /198 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 198 cols
[2025-06-02 05:25:48] [INFO ] Computed 49 invariants in 20 ms
[2025-06-02 05:25:49] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-06-02 05:25:49] [INFO ] Invariant cache hit.
[2025-06-02 05:25:49] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 05:25:49] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2025-06-02 05:25:49] [INFO ] Redundant transitions in 5 ms returned []
Running 175 sub problems to find dead transitions.
[2025-06-02 05:25:49] [INFO ] Invariant cache hit.
[2025-06-02 05:25:49] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 30/226 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 17/243 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 17 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 2 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2025-06-02 05:25:50] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2025-06-02 05:25:51] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 2 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2025-06-02 05:25:52] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:25:53] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 20/283 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2025-06-02 05:25:54] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 7/290 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2025-06-02 05:25:55] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2025-06-02 05:25:57] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 2/198 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 176/374 variables, 198/494 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 59/553 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/374 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 553 constraints, problems are : Problem set: 0 solved, 175 unsolved in 28283 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 198/198 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 30/226 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 17/243 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 49/292 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 2/198 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2025-06-02 05:26:19] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 176/374 variables, 198/495 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 59/554 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 175/729 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 729 constraints, problems are : Problem set: 0 solved, 175 unsolved in 19816 ms.
Refiners :[Domain max(s): 198/198 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 198/198 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 50/50 constraints]
After SMT, in 48193ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 48207ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 48806 ms. Remains : 198/198 places, 176/176 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1594 ms (no deadlock found). (steps per millisecond=784 )
Random directed walk for 1250002 steps, including 0 resets, run took 1268 ms (no deadlock found). (steps per millisecond=985 )
[2025-06-02 05:26:40] [INFO ] Invariant cache hit.
[2025-06-02 05:26:40] [INFO ] [Real]Absence check using 32 positive place invariants in 26 ms returned sat
[2025-06-02 05:26:40] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 42 ms returned sat
[2025-06-02 05:26:40] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2025-06-02 05:26:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:26:41] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned sat
[2025-06-02 05:26:41] [INFO ] [Nat]Absence check using 32 positive and 17 generalized place invariants in 16 ms returned sat
[2025-06-02 05:26:41] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2025-06-02 05:26:41] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-02 05:26:41] [INFO ] [Nat]Added 59 Read/Feed constraints in 25 ms returned sat
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 8 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2025-06-02 05:26:41] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:26:42] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:26:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 31 trap constraints in 2405 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 198/198 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 198 transition count 164
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 164
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 62 place count 166 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 62 place count 166 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 164 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 162 transition count 144
Applied a total of 68 rules in 25 ms. Remains 162 /198 variables (removed 36) and now considering 144/176 (removed 32) transitions.
// Phase 1: matrix 144 rows 162 cols
[2025-06-02 05:26:43] [INFO ] Computed 45 invariants in 5 ms
[2025-06-02 05:26:43] [INFO ] Implicit Places using invariants in 191 ms returned [11, 12, 13, 14, 18, 24, 27, 28, 31, 32, 36, 37, 47, 50, 51, 57, 60, 61, 73, 74, 76, 89, 90, 92, 94, 95, 133, 134, 136, 138, 139]
[2025-06-02 05:26:43] [INFO ] Actually due to overlaps returned [76, 74, 73, 31, 36, 50, 60, 89, 90, 92, 133, 134, 136, 13, 14, 18, 24, 32, 37, 51, 61, 94, 95, 138, 139]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 194 ms to find 25 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 137/198 places, 144/176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 137 transition count 131
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 124 transition count 131
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 26 place count 124 transition count 127
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 120 transition count 127
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 120 place count 77 transition count 84
Applied a total of 120 rules in 8 ms. Remains 77 /137 variables (removed 60) and now considering 84/144 (removed 60) transitions.
// Phase 1: matrix 84 rows 77 cols
[2025-06-02 05:26:43] [INFO ] Computed 20 invariants in 0 ms
[2025-06-02 05:26:44] [INFO ] Implicit Places using invariants in 64 ms returned [11, 12, 19, 20, 29, 34]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 65 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 71/198 places, 84/176 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 65 transition count 78
Applied a total of 12 rules in 4 ms. Remains 65 /71 variables (removed 6) and now considering 78/84 (removed 6) transitions.
// Phase 1: matrix 78 rows 65 cols
[2025-06-02 05:26:44] [INFO ] Computed 14 invariants in 2 ms
[2025-06-02 05:26:44] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-02 05:26:44] [INFO ] Invariant cache hit.
[2025-06-02 05:26:44] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 05:26:44] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 65/198 places, 78/176 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 446 ms. Remains : 65/198 places, 78/176 transitions.
Initial state reduction rules removed 1 formulas.
RANDOM walk for 5970 steps (0 resets) in 445 ms. (13 steps per ms) remains 0/77 properties
Able to resolve query QuasiLiveness after proving 78 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 198/198 places, 176/176 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 198 transition count 164
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 164
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 62 place count 166 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 62 place count 166 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 164 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 162 transition count 144
Applied a total of 68 rules in 8 ms. Remains 162 /198 variables (removed 36) and now considering 144/176 (removed 32) transitions.
// Phase 1: matrix 144 rows 162 cols
[2025-06-02 05:26:44] [INFO ] Computed 45 invariants in 3 ms
[2025-06-02 05:26:44] [INFO ] Implicit Places using invariants in 156 ms returned [11, 12, 13, 14, 18, 24, 27, 28, 31, 32, 36, 37, 47, 50, 51, 57, 60, 61, 73, 74, 76, 89, 90, 92, 94, 95, 133, 134, 136, 138, 139]
[2025-06-02 05:26:44] [INFO ] Actually due to overlaps returned [76, 74, 73, 31, 36, 50, 60, 89, 90, 92, 133, 134, 136, 13, 14, 18, 24, 32, 37, 51, 61, 94, 95, 138, 139]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 157 ms to find 25 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 137/198 places, 144/176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 137 transition count 131
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 124 transition count 131
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 26 place count 124 transition count 127
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 120 transition count 127
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 120 place count 77 transition count 84
Applied a total of 120 rules in 5 ms. Remains 77 /137 variables (removed 60) and now considering 84/144 (removed 60) transitions.
// Phase 1: matrix 84 rows 77 cols
[2025-06-02 05:26:44] [INFO ] Computed 20 invariants in 0 ms
[2025-06-02 05:26:44] [INFO ] Implicit Places using invariants in 53 ms returned [11, 12, 19, 20, 29, 34]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 55 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 71/198 places, 84/176 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 66 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 65 transition count 78
Applied a total of 12 rules in 2 ms. Remains 65 /71 variables (removed 6) and now considering 78/84 (removed 6) transitions.
// Phase 1: matrix 78 rows 65 cols
[2025-06-02 05:26:44] [INFO ] Computed 14 invariants in 1 ms
[2025-06-02 05:26:44] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-02 05:26:44] [INFO ] Invariant cache hit.
[2025-06-02 05:26:44] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 05:26:44] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 65/198 places, 78/176 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 378 ms. Remains : 65/198 places, 78/176 transitions.
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 :78 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 78 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 56425 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ParamProductionCell-PT-0

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 198
TRANSITIONS: 176
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 730
NUPN UNITS: 34
LOADING TIME: 0.344

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.022
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.554
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: 831
MODEL NAME: /home/mcc/execution/model
198 places, 176 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 1748843074191

--------------------
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="ParamProductionCell-PT-0"
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 ParamProductionCell-PT-0, 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 r154-tall-174876825300224"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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