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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K 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.8K 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 304K 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 1748786093073

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-0100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 13:54:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-01 13:54:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:54:54] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2025-06-01 13:54:54] [INFO ] Transformed 501 places.
[2025-06-01 13:54:54] [INFO ] Transformed 801 transitions.
[2025-06-01 13:54:54] [INFO ] Parsed PT model containing 501 places and 801 transitions and 2302 arcs in 218 ms.
Discarding 400 transitions out of 801. Remains 401
Reduce places removed 1 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 6 ms.21746KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 500/500 places, 801/801 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 76 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
// Phase 1: matrix 801 rows 500 cols
[2025-06-01 13:54:54] [INFO ] Computed 100 invariants in 23 ms
[2025-06-01 13:54:54] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20285ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20315ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 20431 ms. Remains : 500/500 places, 801/801 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 500/500 places, 801/801 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 20 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2025-06-01 13:55:15] [INFO ] Invariant cache hit.
[2025-06-01 13:55:15] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-01 13:55:15] [INFO ] Invariant cache hit.
[2025-06-01 13:55:15] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-01 13:55:15] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2025-06-01 13:55:15] [INFO ] Redundant transitions in 37 ms returned []
Running 600 sub problems to find dead transitions.
[2025-06-01 13:55:15] [INFO ] Invariant cache hit.
[2025-06-01 13:55:15] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2025-06-01 13:55:59] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 18 ms to minimize.
[2025-06-01 13:55:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 13:55:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 13:55:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 13:56:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 13:56:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 60636 ms. Remains : 500/500 places, 801/801 transitions.
Random walk for 1250007 steps, including 0 resets, run took 10366 ms (no deadlock found). (steps per millisecond=120 )
Random directed walk for 1250158 steps, including 0 resets, run took 23108 ms (no deadlock found). (steps per millisecond=54 )
[2025-06-01 13:56:49] [INFO ] Invariant cache hit.
[2025-06-01 13:56:49] [INFO ] [Real]Absence check using 100 positive place invariants in 8 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 501/501 places, 801/801 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 801
Applied a total of 1 rules in 11 ms. Remains 500 /501 variables (removed 1) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-01 13:56:49] [INFO ] Invariant cache hit.
[2025-06-01 13:56:49] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20132ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20138ms
[2025-06-01 13:57:09] [INFO ] Invariant cache hit.
[2025-06-01 13:57:09] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-01 13:57:09] [INFO ] Invariant cache hit.
[2025-06-01 13:57:09] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-01 13:57:09] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-01 13:57:09] [INFO ] Invariant cache hit.
[2025-06-01 13:57:09] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2025-06-01 13:57:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 13:57:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 13:57:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 13:57:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 13:57:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 13:57:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 13:58:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2025-06-01 13:58:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 13:58:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 13:58:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
SMT process timed out in 60136ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LIVENESS mode, iteration 1 : 500/501 places, 801/801 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 80662 ms. Remains : 500/501 places, 801/801 transitions.
Discarding 400 transitions out of 801. Remains 401
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40187 steps (8 resets) in 592 ms. (67 steps per ms) remains 52/400 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
[2025-06-01 13:58:10] [INFO ] Invariant cache hit.
[2025-06-01 13:58:10] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 161/210 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-01 13:58:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 336/546 variables, 210/264 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 42/306 constraints. Problems are: Problem set: 0 solved, 49 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/546 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/1301 variables, and 306 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2091 ms.
Refiners :[Positive P Invariants (semi-flows): 42/100 constraints, State Equation: 210/500 constraints, ReadFeed: 42/100 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 161/210 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-06-01 13:58:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-06-01 13:58:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2025-06-01 13:58:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-06-01 13:58:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 13:58:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 13:58:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-01 13:58:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
[2025-06-01 13:58:13] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2025-06-01 13:58:13] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2025-06-01 13:58:13] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 336/546 variables, 210/274 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 42/316 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 49/365 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/1301 variables, and 365 constraints, problems are : Problem set: 0 solved, 49 unsolved in 3211 ms.
Refiners :[Positive P Invariants (semi-flows): 42/100 constraints, State Equation: 210/500 constraints, ReadFeed: 42/100 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 22/22 constraints]
After SMT, in 5319ms problems are : Problem set: 0 solved, 49 unsolved
Fused 49 Parikh solutions to 18 different solutions.
Finished Parikh walk after 96483 steps, including 28 resets, run visited all 2 properties in 1097 ms. (steps per millisecond=87 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 49 properties in 1690 ms.
Able to resolve query QuasiLiveness after proving 401 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 501/501 places, 801/801 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 801
Applied a total of 1 rules in 8 ms. Remains 500 /501 variables (removed 1) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2025-06-01 13:58:17] [INFO ] Invariant cache hit.
[2025-06-01 13:58:17] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20083ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20088ms
[2025-06-01 13:58:38] [INFO ] Invariant cache hit.
[2025-06-01 13:58:38] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-01 13:58:38] [INFO ] Invariant cache hit.
[2025-06-01 13:58:38] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-01 13:58:38] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2025-06-01 13:58:38] [INFO ] Invariant cache hit.
[2025-06-01 13:58:38] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2025-06-01 13:59:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2025-06-01 13:59:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 13:59:21] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2025-06-01 13:59:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2025-06-01 13:59:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 13:59:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2025-06-01 13:59:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-06-01 13:59:37] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2025-06-01 13:59:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-06-01 13:59:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1310 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 10/10 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in LIVENESS mode, iteration 1 : 500/501 places, 801/801 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 80558 ms. Remains : 500/501 places, 801/801 transitions.
Discarding 400 transitions out of 801. Remains 401
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 :401 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 401 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 284174 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running JoinFreeModules-PT-0100

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: 501
TRANSITIONS: 801
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.001s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 727
MODEL NAME: /home/mcc/execution/model
501 places, 801 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-0100"
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-0100, 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-174876436400279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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