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.r126-tall-174876436400274.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 JoinFreeModules-PT-0050, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tall-174876436400274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 152K 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 1748785837162

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=JoinFreeModules-PT-0050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 13:50:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-01 13:50:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:50:38] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2025-06-01 13:50:38] [INFO ] Transformed 251 places.
[2025-06-01 13:50:38] [INFO ] Transformed 401 transitions.
[2025-06-01 13:50:38] [INFO ] Parsed PT model containing 251 places and 401 transitions and 1152 arcs in 178 ms.
Discarding 200 transitions out of 401. Remains 201
Reduce places removed 1 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.16880KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 250/250 places, 401/401 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 33 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
// Phase 1: matrix 401 rows 250 cols
[2025-06-01 13:50:38] [INFO ] Computed 50 invariants in 18 ms
[2025-06-01 13:50:38] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 15040 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:50:58] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 9 ms to minimize.
[2025-06-01 13:50:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 3 ms to minimize.
[2025-06-01 13:50:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 3/653 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:51:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
[2025-06-01 13:51:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
[2025-06-01 13:51:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 13:51:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 13:51:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 658 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints]
After SMT, in 35202ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 35223ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 35299 ms. Remains : 250/250 places, 401/401 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 250/250 places, 401/401 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 14 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-06-01 13:51:13] [INFO ] Invariant cache hit.
[2025-06-01 13:51:14] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-01 13:51:14] [INFO ] Invariant cache hit.
[2025-06-01 13:51:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-01 13:51:14] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2025-06-01 13:51:14] [INFO ] Redundant transitions in 27 ms returned []
Running 300 sub problems to find dead transitions.
[2025-06-01 13:51:14] [INFO ] Invariant cache hit.
[2025-06-01 13:51:14] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14753 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:51:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 13:51:33] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2025-06-01 13:51:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 13:51:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2025-06-01 13:51:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 13:51:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:51:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
[2025-06-01 13:51:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 13:51:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:51:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44816ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44819ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 45332 ms. Remains : 250/250 places, 401/401 transitions.
Random walk for 1250003 steps, including 0 resets, run took 5665 ms (no deadlock found). (steps per millisecond=220 )
Random directed walk for 1250025 steps, including 0 resets, run took 9492 ms (no deadlock found). (steps per millisecond=131 )
[2025-06-01 13:52:14] [INFO ] Invariant cache hit.
[2025-06-01 13:52:14] [INFO ] [Real]Absence check using 50 positive place invariants in 1 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 251/251 places, 401/401 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 250 transition count 401
Applied a total of 1 rules in 12 ms. Remains 250 /251 variables (removed 1) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2025-06-01 13:52:14] [INFO ] Invariant cache hit.
[2025-06-01 13:52:14] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14168 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:52:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 13:52:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 13:52:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2025-06-01 13:52:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-01 13:52:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 13:52:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:52:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 13:52:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-01 13:52:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34239ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34242ms
[2025-06-01 13:52:48] [INFO ] Invariant cache hit.
[2025-06-01 13:52:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-01 13:52:48] [INFO ] Invariant cache hit.
[2025-06-01 13:52:49] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-01 13:52:49] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-01 13:52:49] [INFO ] Invariant cache hit.
[2025-06-01 13:52:49] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14797 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:53:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 13:53:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 13:53:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 13:53:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 13:53:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 13:53:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:53:21] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
[2025-06-01 13:53:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 8 ms to minimize.
[2025-06-01 13:53:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:53:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44855ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44858ms
Starting structural reductions in LIVENESS mode, iteration 1 : 250/251 places, 401/401 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 79314 ms. Remains : 250/251 places, 401/401 transitions.
Discarding 200 transitions out of 401. Remains 201
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40024 steps (8 resets) in 681 ms. (58 steps per ms) remains 0/200 properties
Able to resolve query QuasiLiveness after proving 201 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 251/251 places, 401/401 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 250 transition count 401
Applied a total of 1 rules in 4 ms. Remains 250 /251 variables (removed 1) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2025-06-01 13:53:34] [INFO ] Invariant cache hit.
[2025-06-01 13:53:34] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14313 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:53:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 13:53:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-01 13:53:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 13:53:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 13:53:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 13:53:56] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:54:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 13:54:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 13:54:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34368ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34371ms
[2025-06-01 13:54:08] [INFO ] Invariant cache hit.
[2025-06-01 13:54:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-01 13:54:08] [INFO ] Invariant cache hit.
[2025-06-01 13:54:08] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-01 13:54:08] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-01 13:54:08] [INFO ] Invariant cache hit.
[2025-06-01 13:54:08] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14516 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:54:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 13:54:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 13:54:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 13:54:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 13:54:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-06-01 13:54:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:54:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-06-01 13:54:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 13:54:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2025-06-01 13:54:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44576ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44579ms
Starting structural reductions in LIVENESS mode, iteration 1 : 250/251 places, 401/401 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 79161 ms. Remains : 250/251 places, 401/401 transitions.
Discarding 200 transitions out of 401. Remains 201
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :201 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 201 properties from file /home/mcc/execution/Liveness.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 254911 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running JoinFreeModules-PT-0050

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 251
TRANSITIONS: 401
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.000s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
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: 747
MODEL NAME: /home/mcc/execution/model
251 places, 401 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...

BK_TIME_CONFINEMENT_REACHED

--------------------
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="JoinFreeModules-PT-0050"
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 JoinFreeModules-PT-0050, 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 r126-tall-174876436400274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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